Unité

Laboratoire de systèmes adaptatifs

Laboratoire

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Publications associées à Laboratoire de systèmes adaptatifs | EPFL Graph Search

Distributional Regression and Autoregression via Optimal Transport

Laya Ghodrati

We present a framework for performing regression when both covariate and response are probability distributions on a compact and convex subset of

\R^d

. Our regression model is based on the theory of optimal transport and links the conditional Fr'echet m ...

EPFL2023

Laboratoire de systèmes adaptatifs

Graph Chatbot

Chattez avec Graph Search

Distributional Regression and Autoregression via Optimal Transport

Near-Minimax Optimal Estimation With Shallow ReLU Neural Networks

Impact of Redundancy on Resilience in Distributed Optimization and Learning

Robust Distributed Learning: Tight Error Bounds and Breakdown Point under Data Heterogeneity

Discovering Influencers in Opinion Formation Over Social Graphs

GAP: Differentially Private Graph Neural Networks with Aggregation Perturbation

Maximum Independent Set: Self-Training through Dynamic Programming

Unsupervised Graph Representation Learning with Cluster-aware Self-training and Refining

Estimating the Topology of Preferential Attachment Graphs Under Partial Observability

Privatized graph federated learning

Discovering Influencers in Opinion Formation Over Social Graphs

Maximum Independent Set: Self-Training through Dynamic Programming

Distributional Regression and Autoregression via Optimal Transport

Impact of Redundancy on Resilience in Distributed Optimization and Learning

Robust Distributed Learning: Tight Error Bounds and Breakdown Point under Data Heterogeneity

Privatized graph federated learning

GAP: Differentially Private Graph Neural Networks with Aggregation Perturbation

Near-Minimax Optimal Estimation With Shallow ReLU Neural Networks

Unsupervised Graph Representation Learning with Cluster-aware Self-training and Refining

Estimating the Topology of Preferential Attachment Graphs Under Partial Observability