English
Related papers

Related papers: Samplers and Extractors for Unbounded Functions

200 papers

Elicitable functionals and (strictly) consistent scoring functions are of interest due to their utility of determining (uniquely) optimal forecasts, and thus the ability to effectively backtest predictions. However, in practice, assuming…

Methodology · Statistics 2026-03-18 Kathleen E. Miao , Silvana M. Pesenti

In a variety of applications it is important to extract information from a probability measure $\mu$ on an infinite dimensional space. Examples include the Bayesian approach to inverse problems and possibly conditioned) continuous time…

Probability · Mathematics 2016-06-02 Frank Pinski , Gideon Simpson , Andrew Stuart , Hendrik Weber

Data collection is a critical step in statistical inference and data science, and the goal of statistical experimental design (ED) is to find the data collection setup that can provide most information for the inference. In this work we…

Computation · Statistics 2020-07-01 Ziqiao Ao , Jinglai Li

We establish a regular sampling theory in the range of the analysis operator of a continuous frame having a unitary structure. The unitary structure is related with a unitary representation of a locally compact abelian group on a separable…

Functional Analysis · Mathematics 2020-11-11 Antonio G. García

Kullback-Leibler (KL) divergence is a fundamental concept in information theory that quantifies the discrepancy between two probability distributions. In the context of Variational Autoencoders (VAEs), it serves as a central regularization…

Machine Learning · Computer Science 2026-04-14 Andrés Muñoz , Rodrigo Ramele

Downsampling or under-sampling is a technique that is utilized in the context of large and highly imbalanced classification models. We study optimal downsampling for imbalanced classification using generalized linear models (GLMs). We…

Machine Learning · Statistics 2025-05-20 Yan Chen , Jose Blanchet , Krzysztof Dembczynski , Laura Fee Nern , Aaron Flores

Estimating the Kullback-Leibler (KL) divergence between two distributions given samples from them is well-studied in machine learning and information theory. Motivated by considerations of multi-group fairness, we seek KL divergence…

Machine Learning · Computer Science 2022-03-01 Parikshit Gopalan , Nina Narodytska , Omer Reingold , Vatsal Sharan , Udi Wieder

We prove new explicit upper bounds on the leverage scores of Fourier sparse functions under both the Gaussian and Laplace measures. In particular, we study $s$-sparse functions of the form $f(x) = \sum_{j=1}^s a_j e^{i \lambda_j x}$ for…

Data Structures and Algorithms · Computer Science 2021-07-09 Tamás Erdélyi , Cameron Musco , Christopher Musco

Kullback-Leibler (KL) divergence is one of the most important divergence measures between probability distributions. In this paper, we prove several properties of KL divergence between multivariate Gaussian distributions. First, for any two…

Information Theory · Computer Science 2023-01-24 Yufeng Zhang , Wanwei Liu , Zhenbang Chen , Ji Wang , Kenli Li

This paper proposes two linear projection methods for supervised dimension reduction using only the first and second-order statistics. The methods, each catering to a different parameter regime, are derived under the general Gaussian model…

Information Theory · Computer Science 2024-08-13 Biao Chen , Joshua Kortje

Data processing inequalities for $f$-divergences can be sharpened using constants called "contraction coefficients" to produce strong data processing inequalities. For any discrete source-channel pair, the contraction coefficients for…

Information Theory · Computer Science 2018-07-17 Anuran Makur , Lizhong Zheng

This article introduces trimmed estimators for the mean and covariance function of general functional data. The estimators are based on a new measure of outlyingness or data depth that is well defined on any metric space, although this…

Methodology · Statistics 2012-12-03 Daniel Gervini

We construct optimal low-rank approximations for the Gaussian posterior distribution in linear Gaussian inverse problems with possibly infinite-dimensional separable Hilbert parameter spaces and finite-dimensional data spaces. We first…

Statistics Theory · Mathematics 2026-04-09 Giuseppe Carere , Han Cheng Lie

We study the approximation of arbitrary distributions $P$ on $d$-dimensional space by distributions with log-concave density. Approximation means minimizing a Kullback--Leibler-type functional. We show that such an approximation exists if…

Statistics Theory · Mathematics 2011-10-17 Lutz Duembgen , Richard Samworth , Dominic Schuhmacher

A class of distortions termed functional Bregman divergences is defined, which includes squared error and relative entropy. A functional Bregman divergence acts on functions or distributions, and generalizes the standard Bregman divergence…

Information Theory · Computer Science 2007-07-13 B. A. Frigyik , S. Srivastava , M. R. Gupta

In this article, we investigate posterior convergence in nonparametric regression models where the unknown regression function is modeled by some appropriate stochastic process. In this regard, we consider two setups. The first setup is…

Statistics Theory · Mathematics 2020-05-04 Debashis Chatterjee , Sourabh Bhattacharya

This paper addresses the problem of regression to reconstruct functions, which are observed with superimposed errors at random locations. We address the problem in reproducing kernel Hilbert spaces. It is demonstrated that the estimator,…

Statistics Theory · Mathematics 2021-08-17 Paul Dommel , Alois Pichler

Estimating the Kullback-Leibler (KL) divergence between random variables is a fundamental problem in statistical analysis. For continuous random variables, traditional information-theoretic estimators scale poorly with dimension and/or…

Machine Learning · Computer Science 2025-10-08 Mikil Foss , Andrew Lamperski

Discrete normal distributions are defined as the distributions with prescribed means and covariance matrices which maximize entropy on the integer lattice support. The set of discrete normal distributions form an exponential family with…

Information Theory · Computer Science 2022-01-25 Frank Nielsen

For every natural number k we prove a decomposition theorem for bounded measurable functions on compact abelian groups into a structured part, a quasi random part and a small error term. In this theorem quasi randomness is measured with the…

Combinatorics · Mathematics 2010-11-04 Balazs Szegedy