Variational Characterizations of Sibson's α-Mutual Information

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Reduced-order models (ROMs) are widely used in scientific computing to tackle high-dimensional systems. However, traditional ROM methods may only partially capture the intrinsic geometric characteristics of the data. These characteristics encompass the und ...

The growing adoption of point clouds as an imaging modality has stimulated the search for efficient solutions for compression. Learning-based algorithms have been reporting increasingly better performance and are drawing the attention from the research com ...

Due to conservative approaches in construction design and practice, infrastructure often has hidden reserve capacity. When quantified, this reserve has potential to improve decisions related to asset management. Field measurements, collected through load t ...

The likelihood function is a fundamental component in Bayesian statistics. However, evaluating the likelihood of an observation is computationally intractable in many applications. In this paper, we propose a non-parametric approximation of the likelihood ...

In this thesis, we deal with one of the facets of the statistical detection problem. We study a particular type of alternative, the mixture model. We consider testing where the null hypothesis corresponds to the absence of a signal, represented by some kno ...

We consider the problem of positioning estimation with impulse radio (IR) ultra-wideband (UWB) radio under dense multipaths and additive Gaussian noise environments. Most popular positioning algorithms first estimate certain parameters (such as time of arr ...

Cryptography often meets the problem of distinguishing distributions. In this paper we review techniques from hypothesis testing to express the advantage of the best distinguisher limited to a given number of samples. We link it with the Chernoff informati ...

We consider communication over a binary input memoryless output symmetric channel with low density generator matrix codes and optimal maximum a posteriori decoding. It is known that the problem of computing the average conditional entropy, over such code e ...

Variational Characterizations of Sibson's α-Mutual Information

Chat with Graph Search

OPTIMAL TRANSPORT-INSPIRED DEEP LEARNING FRAMEWORK FOR SLOW-DECAYING KOLMOGOROV \bfitn-WIDTH PROBLEMS: EXPLOITING SINKHORN LOSS AND WASSERSTEIN KERNEL

Latent Space Slicing for Enhanced Entropy Modeling in Learning-Based Point Cloud Geometry Compression

A Comparison of optimal measurement-system design with engineering judgement for bridge load testing

Optimistic Distributionally Robust Optimization for Nonparametric Likelihood Approximation

The detection of two-component mixture alternatives : Theory and methods

One Step Impulse Radio Ultra-WideBand Positioning Algorithm

The Complexity of Distinguishing Distributions

Proof of replica formulas in the high noise regime for communication using LDGM codes