Publications associées à Propagation des convictions

High-Throughput and Flexible Belief Propagation List Decoder for Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Andreas Toftegaard Kristensen, Yifei Shen, Yuqing Ren, Chuan Zhang

Due to its high parallelism, belief propagation (BP)decoding is amenable to high-throughput applications and thusrepresents a promising solution for the ultra-high peak datarate required by future communication systems. To bridge theperformance gap compare ...

Ieee-Inst Electrical Electronics Engineers Inc2024

A Generalized Adjusted Min-Sum Decoder for 5G LDPC Codes: Algorithm and Implementation

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Yifei Shen, Yuqing Ren, Hassan Harb

5G New Radio (NR) has stringent demands on both performance and complexity for the design of low-density parity-check (LDPC) decoding algorithms and corresponding VLSI implementations. Furthermore, decoders must fully support the wide range of all 5G NR bl ...

Ieee-Inst Electrical Electronics Engineers Inc2024

Graph-based approximate message passing iterations

Raphaël Jean Berthier

Approximate message passing (AMP) algorithms have become an important element of high-dimensional statistical inference, mostly due to their adaptability and concentration properties, the state evolution (SE) equations. This is demonstrated by the growing ...

OXFORD UNIV PRESS2023

Planted XY model: Thermodynamics and inference

Lenka Zdeborová, Guanhao Huang, Siyu Chen, Giovanni Piccioli

In this paper we study a fully connected planted spin glass named the planted XY model. Motivation for studying this system comes both from the spin glass field and the one of statistical inference where it models the angular synchronization problem. We de ...

2022

A Variational Inference Approach to Learning Multivariate Wold Processes

Patrick Thiran, Matthias Grossglauser, Negar Kiyavash, Seyed Jalal Etesami, William Trouleau

Temporal point-processes are often used for mathematical modeling of sequences of discrete events with asynchronous timestamps. We focus on a class of temporal point-process models called multivariate Wold processes (MWP). These processes are well suited t ...

MICROTOME PUBLISHING2021

The Stability of Low-Density Parity-Check Codes and Some of its Consequences

Rüdiger Urbanke, Wei Liu

We study the stability of low-density parity-check codes under blockwise or bitwise maximum a posteriori decoding, where transmission takes place over a binary-input memoryless output-symmetric channel. Our study stems from the consideration of constructin ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Bayesian Decision Making in Groups is Hard

Jan Hazla

We study the computations that Bayesian agents undertake when exchanging opinions over a network. The agents act repeatedly on their private information and take myopic actions that maximize their expected utility according to a fully rational posterior be ...

INFORMS2021

Learning in Volatile Environments With the Bayes Factor Surprise

Wulfram Gerstner, Johanni Michael Brea, Alireza Modirshanechi, Vasiliki Liakoni

Surprise-based learning allows agents to rapidly adapt to nonstationary stochastic environments characterized by sudden changes. We show that exact Bayesian inference in a hierarchical model gives rise to a surprise-modulated trade-off between forgetting o ...

MIT PRESS2021

Generalized approximate survey propagation for high-dimensional estimation

Yue Lu, Luca Saglietti

In generalized linear estimation (GLE) problems, we seek to estimate a signal that is observed through a linear transform followed by a component-wise, possibly nonlinear and noisy, channel. In the Bayesian optimal setting, generalized approximate message ...

IOP PUBLISHING LTD2020

On the Universality of Low-Density Parity-Check Block Codes

Rüdiger Urbanke, Wei Liu

An important class of modern channel codes is the capacity-achieving sequences of low-density parity-check block codes. Such sequences are usually designed for the binary erasure channel and are decoded by iterative message-passing algorithms. In this pape ...

IEEE2020

Mutual Information and Optimality of Approximate Message-Passing in Random Linear Estimation

Nicolas Macris, Jean François Emmanuel Barbier, Florent Gérard Krzakala, Mohamad Baker Dia

We consider the estimation of a signal from the knowledge of its noisy linear random Gaussian projections. A few examples where this problem is relevant are compressed sensing, sparse superposition codes, and code division multiple access. There has been a ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Learning Linear Non-Gaussian Causal Models in the Presence of Latent Variables

Negar Kiyavash, Saber Salehkaleybar, Kun Zhang

We consider the problem of learning causal models from observational data generated by linear non-Gaussian acyclic causal models with latent variables. Without considering the effect of latent variables, the inferred causal relationships among the observed ...

Microtome Publishing2020

Deep Unfolding for Communications Systems: A Survey and Some New Directions

Alexios Konstantinos Balatsoukas Stimming, Christoph Studer

Deep unfolding is a method of growing popularity that fuses iterative optimization algorithms with tools from neural networks to efficiently solve a range of tasks in machine learning, signal and image processing, and communication systems. This survey sum ...

IEEE2019

Conditional Gradient Methods via Stochastic Path-Integrated Differential Estimator

Volkan Cevher, Alp Yurtsever

We propose a class of novel variance-reduced stochastic conditional gradient methods. By adopting the recent stochastic path-integrated differential estimator technique (SPIDER) of Fang et al. (2018) for the classical Frank-Wolfe (FW) method, we introduce ...

2019

Electromagnetic Fields Associated With the M‐Component Mode of Charge Transfer

Marcos Rubinstein, Mohammad Azadifar, Davide Pavanello, Lixia He

In upward flashes, charge transfer to ground largely takes place during the initial continuous current (ICC) and its superimposed pulses (ICC pulses). ICC pulses can be associated with either M-component or leader/return-stroke like modes of charge transfe ...

2019

Subadditivity 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 ...

IEEE2019

Optimal errors and phase transitions in high-dimensional generalized linear models

Nicolas Macris, Jean François Emmanuel Barbier, Florent Gérard Krzakala, Lenka Zdeborová

Generalized linear models (GLMs) are used in high-dimensional machine learning, statistics, communications, and signal processing. In this paper we analyze GLMs when the data matrix is random, as relevant in problems such as compressed sensing, error-corre ...

National Academy of Sciences2019

High Dimensional Bayesian Optimization via Additive Models with Overlapping Groups

Volkan Cevher, Paul Thierry Yves Rolland, Jonathan Mark Scarlett, Ilija Bogunovic

Bayesian optimization (BO) is a popular technique for sequential black-box function optimization, with applications including parameter tuning, robotics, environmental monitoring, and more. One of the most important challenges in BO is the development of a ...

2018

A Compressed Sensing Approach for Distribution Matching

Vahid Aref, Mohamad Baker Dia

In this work, we formulate the fixed-length distribution matching as a Bayesian inference problem. Our proposed solution is inspired from the compressed sensing paradigm and the sparse superposition (SS) codes. First, we introduce sparsity in the binary so ...

IEEE2018

Inference for Generalized Linear Models via Alternating Directions and Bethe Free Energy Minimization

Ulugbek Kamilov

Generalized linear models, where a random vector x is observed through a noisy, possibly nonlinear, function of a linear transform z = A x, arise in a range of applications in nonlinear filtering and regression. Approximate message passing (AMP) methods, b ...

IEEE2017