English
Related papers

Related papers: Compressive Classification

200 papers

In the context of finite mixture models one considers the problem of classifying as many observations as possible in the classes of interest while controlling the classification error rate in these same classes. Similar to what is done in…

Machine Learning · Computer Science 2021-09-30 Tristan Mary-Huard , Vittorio Perduca , Gilles Blanchard , Martin-Magniette Marie-Laure

Many information systems employ lossy compression as a crucial intermediate stage among other processing components. While the important distortion is defined by the system's input and output signals, the compression usually ignores the…

Information Theory · Computer Science 2018-05-14 Yehuda Dar , Michael Elad , Alfred M. Bruckstein

Understanding generalization in modern machine learning settings has been one of the major challenges in statistical learning theory. In this context, recent years have witnessed the development of various generalization bounds suggesting…

Machine Learning · Statistics 2022-07-01 Milad Sefidgaran , Amin Gohari , Gaël Richard , Umut Şimşekli

Learning distribution families over $\mathbb{R}^d$ is a fundamental problem in unsupervised learning and statistics. A central question in this setting is whether a given family of distributions possesses sufficient structure to be (at…

Machine Learning · Statistics 2025-06-10 Arefe Boushehrian , Amir Najafi

Deep neural networks generalize well despite being exceedingly overparameterized and being trained without explicit regularization. This curious phenomenon has inspired extensive research activity in establishing its statistical principles:…

Machine Learning · Statistics 2021-09-16 Ke Wang , Christos Thrampoulidis

One of the main open problems in the theory of multi-category margin classification is the form of the optimal dependency of a guaranteed risk on the number C of categories, the sample size m and the margin parameter gamma. From a practical…

Statistics Theory · Mathematics 2018-12-04 Khadija Musayeva , Fabien Lauer , Yann Guermeur

We give a new algorithm for learning mixtures of $k$ Gaussians (with identity covariance in $\mathbb{R}^n$) to TV error $\varepsilon$, with quasi-polynomial ($O(n^{\text{poly\,log}\left(\frac{n+k}{\varepsilon}\right)})$) time and sample…

Machine Learning · Computer Science 2025-03-05 Khashayar Gatmiry , Jonathan Kelner , Holden Lee

We study the problem of lossy joint source-channel coding in a single-user energy harvesting communication system with causal energy arrivals and the energy storage unit may have leakage. In particular, we investigate the achievable…

Information Theory · Computer Science 2015-08-20 Meysam Shahrbaf Motlagh , Masoud Badiei Khuzani , Patrick Mitran

The marginal maximum a posteriori probability (MAP) estimation problem, which calculates the mode of the marginal posterior distribution of a subset of variables with the remaining variables marginalized, is an important inference problem…

Machine Learning · Statistics 2013-07-19 Qiang Liu , Alexander Ihler

We study the amplitude-constrained additive white Gaussian noise channel. It is well known that the capacity-achieving input distribution for this channel is discrete and supported on finitely many points. The best known bounds show that…

Information Theory · Computer Science 2026-03-26 Haiyang Wang , Luca Barletta , Alex Dytso

We study a new class of codes for Gaussian multi-terminal source and channel coding. These codes are designed using the statistical framework of high-dimensional linear regression and are called Sparse Superposition or Sparse Regression…

Information Theory · Computer Science 2012-12-11 Ramji Venkataramanan , Sekhar Tatikonda

In this paper we consider a channel model that is often used to describe the mobile wireless scenario: multiple-antenna additive white Gaussian noise channels subject to random (fading) gain with full channel state information at the…

Information Theory · Computer Science 2018-06-28 Austin Collins , Yury Polyanskiy

We consider the transmission of a memoryless bivariate Gaussian source over an average-power-constrained one-to-two Gaussian broadcast channel. The transmitter observes the source and describes it to the two receivers by means of an…

Information Theory · Computer Science 2009-03-20 Shraga Bross , Amos Lapidoth , Stephan Tinguely

In this work, we present the misspecified Gaussian Cram\'er-Rao lower bound for the parameters of a harmonic signal, or pitch, when signal measurements are collected from an almost, but not quite, harmonic model. For the asymptotic case of…

Signal Processing · Electrical Eng. & Systems 2019-10-29 Filip Elvander , Jie Ding , Andreas Jakobsson

Randomized (dithered) quantization is a method capable of achieving white reconstruction error independent of the source. Dithered quantizers have traditionally been considered within their natural setting of uniform quantization. In this…

Information Theory · Computer Science 2017-04-26 Emrah Akyol , Kenneth Rose

This work explores multi-modal inference in a high-dimensional simplified model, analytically quantifying the performance gain of multi-modal inference over that of analyzing modalities in isolation. We present the Bayes-optimal performance…

Machine Learning · Statistics 2025-09-30 Christian Keup , Lenka Zdeborová

Confirmation bias, the tendency to interpret information in a way that aligns with one's preconceptions, can profoundly impact scientific research, leading to conclusions that reflect the researcher's hypotheses even when the observational…

Machine Learning · Statistics 2025-09-09 Amnon Balanov , Tamir Bendory , Wasim Huleihel

Being able to reliably assess not only the \emph{accuracy} but also the \emph{uncertainty} of models' predictions is an important endeavour in modern machine learning. Even if the model generating the data and labels is known, computing the…

Machine Learning · Computer Science 2023-09-12 Lucas Clarté , Bruno Loureiro , Florent Krzakala , Lenka Zdeborová

The problem of variable-rate lossless data compression is considered, for codes with and without prefix constraints. Sharp bounds are derived for the best achievable compression rate of memoryless sources, when the excess-rate probability…

Information Theory · Computer Science 2025-11-13 Andreas Theocharous , Lampros Gavalakis , Ioannis Kontoyiannis

We study the support recovery problem for a high-dimensional signal observed with additive noise. With suitable parametrization of the signal sparsity and magnitude of its non-zero components, we characterize a phase-transition phenomenon…

Statistics Theory · Mathematics 2019-04-16 Zheng Gao , Stilian Stoev