English
Related papers

Related papers: Samplers and Extractors for Unbounded Functions

200 papers

The classical Kramer sampling theorem establishes general conditions that allow the reconstruction of functions by mean of orthogonal sampling formulae. One major task in sampling theory is to find concrete, non trivial realizations of this…

Spectral Theory · Mathematics 2009-11-13 Luis O. Silva , Julio H. Toloza

Gaussian random fields are popular models for spatially varying uncertainties, arising for instance in geotechnical engineering, hydrology or image processing. A Gaussian random field is fully characterised by its mean function and…

Numerical Analysis · Mathematics 2019-02-19 Jonas Latz , Marvin Eisenberger , Elisabeth Ullmann

We consider estimation of a functional of the data distribution based on i.i.d. observations. We assume the target function can be defined as the minimizer of the expectation of a loss function over a class of $d$-variate real valued cadlag…

Statistics Theory · Mathematics 2023-02-01 Mark van der Laan

In this paper, some new upper bounds for Kullback-Leibler divergence(KL-divergence) based on $L^1, L^2$ and $L^\infty$ norms of density functions are discussed. Our findings unveil that the convergence in KL-divergence sense sandwiches…

Probability · Mathematics 2024-10-31 Liuquan Yao , Songhao Liu

Generative models have achieved remarkable success across a range of applications, yet their evaluation still lacks principled uncertainty quantification. In this paper, we develop a method for comparing how close different generative…

Machine Learning · Statistics 2025-10-24 Zijun Gao , Yan Sun , Han Su

Bayesian inference has many advantages for complex models, but standard Monte Carlo methods for summarizing the posterior can be computationally demanding, and it is attractive to consider optimization-based variational methods. Our work…

Computation · Statistics 2025-10-09 Aoxiang Chen , David J. Nott , Linda S. L. Tan

We consider the problem of extracting entropy by sparse transformations, namely functions with a small number of overall input-output dependencies. In contrast to previous works, we seek extractors for essentially all the entropy without…

Computational Complexity · Computer Science 2012-07-27 Andrej Bogdanov , Siyao Guo

We provide a unified method for constructing explicit distributions which are difficult for restricted models of computation to generate. Our constructions are based on a new notion of robust extractors, which are extractors that remain…

Computational Complexity · Computer Science 2026-05-11 Farzan Byramji , Daniel M. Kane , Jackson Morris , Anthony Ostuni

We propose a shrinkage procedure for simultaneous variable selection and estimation in generalized linear models (GLMs) with an explicit predictive motivation. The procedure estimates the coefficients by minimizing the Kullback-Leibler…

Methodology · Statistics 2010-09-14 Minh-Ngoc Tran , David Nott , Chenlei Leng

Given a zero-mean Gaussian random field with a covariance function that belongs to a parametric family of covariance functions, we introduce a new notion of likelihood approximations, termed truncated-likelihood functions.…

Statistics Theory · Mathematics 2023-11-16 Reinhard Furrer , Michael Hediger

Linear inverse problems are ubiquitous. Often the measurements do not follow a Gaussian distribution. Additionally, a model matrix with a large condition number can complicate the problem further by making it ill-posed. In this case, the…

We quantify the minimax rate for a nonparametric regression model over a star-shaped function class $\mathcal{F}$ with bounded diameter. We obtain a minimax rate of ${\varepsilon^{\ast}}^2\wedge\mathrm{diam}(\mathcal{F})^2$ where…

Statistics Theory · Mathematics 2025-08-20 Akshay Prasadan , Matey Neykov

In this paper we complete our understanding of the role played by the limiting (or residue) function in the context of mod-Gaussian convergence. The question about the probabilistic interpretation of such functions was initially raised by…

Probability · Mathematics 2014-09-10 Pierre-Loïc Méliot , Ashkan Nikeghbali

We study functional regression with random subgaussian design and real-valued response. The focus is on the problems in which the regression function can be well approximated by a functional linear model with the slope function being…

Statistics Theory · Mathematics 2014-09-16 Vladimir Koltchinskii , Stanislav Minsker

Boltzmann samplers, introduced by Duchon et al. in 2001, make it possible to uniformly draw approximate size objects from any class which can be specified through the symbolic method. This, through by evaluating the associated generating…

Discrete Mathematics · Computer Science 2014-11-14 Olivier Bodini , Jérémie Lumbroso , Nicolas Rolin

A sharp, distribution free, non-asymptotic result is proved for the concentration of a random function around the mean function, when the randomization is generated by a finite sequence of independent data and the random functions satisfy…

Probability · Mathematics 2023-12-25 Thomas Anton , Sutanuka Roy , Rabee Tourky

This paper explores the use of "generated sets" $\{ \{ k \boldsymbol{\zeta} \} : k = 1, \ldots, n \}$ for function approximation in reproducing kernel Hilbert spaces which consist of multi-dimensional functions with an absolutely convergent…

Numerical Analysis · Mathematics 2025-05-02 Ronald Cools , Dirk Nuyens , Laurence Wilkes

We present a new method for proving the norm concentration inequality of sub-Gaussian variables. Our proof is based on an averaged version of the moment generating function, termed the averaged moment generating function. Our method applies…

Probability · Mathematics 2025-05-12 Zishun Liu , Sam Power , Yongxin Chen

This note provides a basic description of subgaussianity, by defining $(\sigma, \rho)$-subgaussian random variables $X$ ($\sigma>0, \rho>0$) as those satisfying $\mathbb{E}(\exp(\lambda X))\leq \rho\exp(\frac{1}{2}\sigma^2\lambda^2)$ for…

Probability · Mathematics 2024-07-11 Yang Li

Bayesian sequence prediction is a simple technique for predicting future symbols sampled from an unknown measure on infinite sequences over a countable alphabet. While strong bounds on the expected cumulative error are known, there are only…

Machine Learning · Computer Science 2013-07-02 Tor Lattimore , Marcus Hutter , Peter Sunehag