Publications associées à Invariant de graphe

Scalable Computation of Dynamic Flow Problems via Multimarginal Graph-Structured Optimal Transport

Isabel Haasler, Axel Ringh, Yiqiang Chen

In this work, we develop a new framework for dynamic network flow pro-blems based on optimal transport theory. We show that the dynamic multicommodity minimum-cost network flow problem can be formulated as a multimarginal optimal transport problem, where t ...

2023

Enforcing Privacy in Distributed Learning With Performance Guarantees

Ali H. Sayed, Stefan Vlaski, Elsa Rizk

We study the privatization of distributed learning and optimization strategies. We focus on differential privacy schemes and study their effect on performance. We show that the popular additive random perturbation scheme degrades performance because it is ...

Piscataway2023

GAP: Differentially Private Graph Neural Networks with Aggregation Perturbation

Daniel Gatica-Perez, Sina Sajadmanesh

In this paper, we study the problem of learning Graph Neural Networks (GNNs) with Differential Privacy (DP). We propose a novel differentially private GNN based on Aggregation Perturbation (GAP), which adds stochastic noise to the GNN's aggregation functio ...

Berkeley2023

A Versatile Mapping Approach for Technology Mapping and Graph Optimization

Giovanni De Micheli, Alessandro Tempia Calvino, Heinz Riener, Shubham Rai, Akash Kumar

This paper proposes a versatile mapping approach that has three objectives: i) it can map from one technology-independent graph representation to another; ii) it can map to a cell library; iii) it supports logic rewriting. The method is cut-based, mitigate ...

IEEE2022

Deep MinCut: Learning Node Embeddings by Detecting Communities

Quoc Viet Hung Nguyen, Thành Tâm Nguyên, Chi Thang Duong, Trung-Dung Hoang

We present Deep MinCut (DMC), an unsupervised approach to learn node embeddings for graph -structured data. It derives node representations based on their membership in communities. As such, the embeddings directly provide insights into the graph structure ...

ELSEVIER SCI LTD2022

Computational tools and resources for designing new pathways to small molecules

Vassily Hatzimanikatis, Anastasia Sveshnikova

The metabolic engineering community relies on computational methods for pathway design to produce important small molecules in microbial hosts. Metabolic network databases are continuously curated and updated with known and novel reactions that expand the ...

CURRENT BIOLOGY LTD2022

Nature vs. Nurture: Feature vs. Structure for Graph Neural Networks

Karl Aberer, Thành Tâm Nguyên, Chi Thang Duong

Graph neural networks take node features and graph structure as input to build representations for nodes and graphs. While there are a lot of focus on GNN models, understanding the impact of node features and graph structure to GNN performance has received ...

ELSEVIER2022

Distributed Graph Learning With Smooth Data Priors

Pascal Frossard, Mireille El Gheche, Isabela Cunha Maia Nobre

Graph learning is often a necessary step in processing or representing structured data, when the underlying graph is not given explicitly. Graph learning is generally performed centrally with a full knowledge of the graph signals, namely the data that live ...

IEEE2022

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.

Invariant de graphe

Scalable Computation of Dynamic Flow Problems via Multimarginal Graph-Structured Optimal Transport

Enforcing Privacy in Distributed Learning With Performance Guarantees

GRAMM: Fast CGRA Application Mapping Based on A Heuristic for Finding Graph Minors

GAP: Differentially Private Graph Neural Networks with Aggregation Perturbation

A Versatile Mapping Approach for Technology Mapping and Graph Optimization

Relative, local and global dimension in complex networks

Deep MinCut: Learning Node Embeddings by Detecting Communities

Computational tools and resources for designing new pathways to small molecules

Nature vs. Nurture: Feature vs. Structure for Graph Neural Networks

Distributed Graph Learning With Smooth Data Priors

Graph Chatbot

Chattez avec Graph Search

GRAMM: Fast CGRA Application Mapping Based on A Heuristic for Finding Graph Minors

Relative, local and global dimension in complex networks

Scalable Computation of Dynamic Flow Problems via Multimarginal Graph-Structured Optimal Transport

Enforcing Privacy in Distributed Learning With Performance Guarantees

GAP: Differentially Private Graph Neural Networks with Aggregation Perturbation

A Versatile Mapping Approach for Technology Mapping and Graph Optimization

Distributed Graph Learning With Smooth Data Priors

Nature vs. Nurture: Feature vs. Structure for Graph Neural Networks

Deep MinCut: Learning Node Embeddings by Detecting Communities

Computational tools and resources for designing new pathways to small molecules