Unité
Chaire de mathématiques de la science des données (SB/IC)
LaboratoirePublications associées (29)
On Speed and Advantage : Results in Information Velocity and Monitoring Problems
Information theory has allowed us to determine the fundamental limit of various communication and algorithmic problems, e.g., the channel coding problem, the compression problem, and the hypothesis testing problem. In this work, we revisit the assumptions ...
EPFL2024Equivariant Neural Architectures for Representing and Generating Graphs
Graph machine learning offers a powerful framework with natural applications in scientific fields such as chemistry, biology and material sciences. By representing data as a graph, we encode the prior knowledge that the data is composed of a set of entitie ...
EPFL2023Quantization for Distributed Processing and Learning of Structured Data
In the domains of machine learning, data science and signal processing, graph or network data, is becoming increasingly popular. It represents a large portion of the data in computer, transportation systems, energy networks, social, biological, and other s ...
EPFL2022Symmetry in design and decoding of polar-like codes
The beginning of 21st century provided us with many answers about how to reach the channel capacity. Polarization and spatial coupling are two techniques for achieving the capacity of binary memoryless symmetric channels under low-complexity decoding algor ...
EPFL2022Recursive Projection-Aggregation Decoding of Reed-Muller Codes
We propose a new class of efficient decoding algorithms for Reed-Muller (RM) codes over binary-input memoryless channels. The algorithms are based on projecting the code on its cosets, recursively decoding the projected codes (which are lower-order RM code ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020Statistical Physics Methods for Community Detection
This thesis is devoted to information-theoretic aspects of community detection. The importance of community detection is due to the massive amount of scientific data today that describes relationships between items from a network, e.g., a social network. I ...
EPFL2019Subadditivity Beyond Trees and the Chi-Squared Mutual Information
Emmanuel Abbé, Enric Boix Adsera
Evans et al. [1] proved the subadditivity of the mutual information in the broadcasting on tree model with binary vertex labels and symmetric edge channels. They raised the question of whether such subadditivity extends to loopy graphs in some appropriate ...
IEEE2019Reed-Muller codes polarize
Reed-Muller (RM) codes were introduced in 1954 and have long been conjectured to achieve Shannon's capacity on symmetric channels. The activity on this conjecture has recently been revived with the emergence of polar codes. RM codes and polar codes are gen ...
IEEE COMPUTER SOC2019High-Dimensional Inference on Dense Graphs with Applications to Coding Theory and Machine Learning
We are living in the era of "Big Data", an era characterized by a voluminous amount of available data. Such amount is mainly due to the continuing advances in the computational capabilities for capturing, storing, transmitting and processing data. However, ...
EPFL2018Coding for Communications and Secrecy
Shannon, in his landmark 1948 paper, developed a framework for characterizing the fundamental limits of information transmission. Among other results, he showed that reliable communication over a channel is possible at any rate below its capacity. In 2008, ...
EPFL2017