Publications related to Why the Metric Backbone Preserves Community Structure

Related publications (13)

Which Coupled is Best Coupled? An Exploration of AIMC Tile Interfaces and Load Balancing for CNNs

David Atienza Alonso, Giovanni Ansaloni, Irem Boybat Kara, Joshua Alexander Harrison Klein

Due to stringent energy and performance constraints, edge AI computing often employs heterogeneous systems that utilize both general-purpose CPUs and accelerators. Analog in-memory computing (AIMC) is a well-known AI inference solution that overcomes compu ...

Institute of Electrical and Electronics Engineers (IEEE)2024

Robust Training and Verification of Deep Neural Networks

Fabian Ricardo Latorre Gomez

According to the proposed Artificial Intelligence Act by the European Comission (expected to pass at the end of 2023), the class of High-Risk AI Systems (Title III) comprises several important applications of Deep Learning like autonomous driving vehicles ...

EPFL2023

Graph Neural Networks With Lifting-Based Adaptive Graph Wavelets

Pascal Frossard

Spectral-based graph neural networks (SGNNs) have been attracting increasing attention in graph representation learning. However, existing SGNNs are limited in implementing graph filters with rigid transforms and cannot adapt to signals residing on graphs ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Sublinear Algorithms for Spectral Graph Clustering

Aidasadat Mousavifar

This thesis focuses on designing spectral tools for graph clustering in sublinear time. With the emergence of big data, many traditional polynomial time, and even linear time algorithms have become prohibitively expensive. Processing modern datasets requir ...

EPFL2021

Probabilistic and temporal failure detectors for solving distributed problems

Rachid Guerraoui

Failure detectors (FD)s are celebrated for their modularity in solving distributed problems. Algorithms are constructed using FD building blocks. Synchrony assumptions to implement FDs are studied separately and are typically expressed as eventual guarante ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2021

Context-Aware Image Super-Resolution Using Deep Neural Networks

Mohammad Saeed Rad

Image super-resolution is a classic ill-posed computer vision and image processing problem, addressing the question of how to reconstruct a high-resolution image from its low-resolution counterpart. Current state-of-the-art methods have improved the perfor ...

EPFL2021

Competing Adaptive Networks

Ali H. Sayed, Stefan Vlaski

Adaptive networks have the capability to pursue solutions of global stochastic optimization problems by relying only local interactions within neighborhoods. The diffusion of information through repeated interactions allows for globally optimal behavior, w ...

IEEE2021

Mask Combination of Multi-Layer Graphs for Global Structure Inference

Pascal Frossard, Ntorina Thanou, Elif Vural, Eda Bayram

Structure inference is an important task for network data processing and analysis in data science. In recent years, quite a few approaches have been developed to learn the graph structure underlying a set of observations captured in a data space. Although ...

2020

Unsupervised Stereo Matching Using Confidential Correspondence Consistency

Seungryong Kim

Stereo matching aims to perceive the 3D geometric configuration of scenes and facilitates a variety of computer vision in advanced driver assistance systems (ADAS) applications. Recently, deep convolutional neural networks (CNNs) have shown dramatic perfor ...

IEEE Institute of Electrical and Electronics Engineers2020

Local Approximation of the Maximum Cut in Regular Graphs

Etienne Michel François Bamas

This paper is devoted to the distributed complexity of finding an approximation of the maximum cut in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communication and ...

SPRINGER INTERNATIONAL PUBLISHING AG2019

Estimation of regional trip length distributions for the calibration of the aggregated network traffic models

Nikolaos Geroliminis

The calibration of trip lengths is an important challenge for multi-regional MFD-based applications, as it can influence the dynamics of regional densities (and speeds). Existing research has not paid significant attention in the topic, giving opportunitie ...

2019

Diverse M-Best Solutions by Dynamic Programming

Michaël Unser, Virginie Sophie Uhlmann

Many computer vision pipelines involve dynamic programming primitives such as finding a shortest path or the minimum energy solution in a tree-shaped probabilistic graphical model. In such cases, extracting not merely the best, but the set of M-best soluti ...

Springer2017

Exponentially long orbits in Hopfield neural networks

Wulfram Gerstner, Johanni Michael Brea, Samuel Pavio Muscinelli

We show that Hopfield neural networks with synchronous dynamics and asymmetric weights admit stable orbits that form sequences of maximal length. For N units, these sequences have length T = 2^N; that is, they cover the full state space. We present a mathe ...

Massachusetts Institute of Technology Press2017