English
Related papers

Related papers: Risk Bounds for Infinitely Divisible Distribution

200 papers

We present a novel approach to estimating discrete distributions with (potentially) infinite support in the total variation metric. In a departure from the established paradigm, we make no structural assumptions whatsoever on the sampling…

Statistics Theory · Mathematics 2020-10-16 Doron Cohen , Aryeh Kontorovich , Geoffrey Wolfer

In this article, we establish a general covariance identity for infinitely divisible distributions (IDD). Using this result, we derive Cacoullos type variance bounds for the IDD. Applications to some important distributions are discussed,…

Probability · Mathematics 2024-08-05 Kalyan Barman , Neelesh S Upadhye , Palaniappan Vellaisamy

We present a series of new and more favorable margin-based learning guarantees that depend on the empirical margin loss of a predictor. We give two types of learning bounds, both distribution-dependent and valid for general families, in…

Machine Learning · Computer Science 2020-10-30 Corinna Cortes , Mehryar Mohri , Ananda Theertha Suresh

Continuing the study reported in Satheesh (2001),(math.PR/0304499 dated 01 May 2003) and Satheesh (2002)(math.PR/0305030 dated 02May 2003), here we study generalizations of infinitely divisible (ID) and max-infinitely divisible (MID) laws.…

Probability · Mathematics 2007-06-13 S. Satheesh , E. Sandhya

This paper addresses the statistical problem of estimating the infinite-norm deviation from the empirical mean to the distribution mean for high-dimensional distributions on $\{0,1\}^d$, potentially with $d=\infty$. Unlike traditional…

Statistics Theory · Mathematics 2024-02-21 Moïse Blanchard , Václav Voráček

The MDL two-part coding $ \textit{index of resolvability} $ provides a finite-sample upper bound on the statistical risk of penalized likelihood estimators over countable models. However, the bound does not apply to unpenalized maximum…

Statistics Theory · Mathematics 2018-01-01 W. D. Brinda , Jason M. Klusowski

As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a stochastic maximal inequality derived by using the Taylor expansion, is…

Probability · Mathematics 2020-08-03 Yoichi Nishiyama

We present deviation bounds for self-normalized averages and applications to estimation with a random number of observations. The results rely on a peeling argument in exponential martingale techniques that represents an alternative to the…

Statistics Theory · Mathematics 2016-11-17 Aurélien Garivier

We address the problem of producing a lower bound for the mean of a discrete probability distribution, with known support over a finite set of real numbers, from an iid sample of that distribution. Up to a constant, this is equivalent to…

Statistics Theory · Mathematics 2025-02-25 Erik Learned-Miller

We study the problem of estimating a distribution over a finite alphabet from an i.i.d. sample, with accuracy measured in relative entropy (Kullback-Leibler divergence). While optimal bounds on the expected risk are known, high-probability…

Statistics Theory · Mathematics 2026-02-27 Jaouad Mourtada

We derive two related novel bounds on single-variable marginal probability distributions in factor graphs with discrete variables. The first method propagates bounds over a subtree of the factor graph rooted in the variable, and the second…

Probability · Mathematics 2008-01-25 Joris M. Mooij , Hilbert J. Kappen

Uniform deviation bounds limit the difference between a model's expected loss and its loss on an empirical sample uniformly for all models in a learning problem. As such, they are a critical component to empirical risk minimization. In this…

Machine Learning · Statistics 2017-02-28 Olivier Bachem , Mario Lucic , S. Hamed Hassani , Andreas Krause

A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution, is presented. No knowledge beyond the support of the…

Information Theory · Computer Science 2007-07-13 Joseph DeStefano , Erik Learned-Miller

Quantile aggregation with dependence uncertainty has a long history in probability theory with wide applications in finance, risk management, statistics, and operations research. Using a recent result on inf-convolution of quantile-based…

Risk Management · Quantitative Finance 2024-09-09 Jose Blanchet , Henry Lam , Yang Liu , Ruodu Wang

We study the excess minimum risk in statistical inference, defined as the difference between the minimum expected loss in estimating a random variable from an observed feature vector and the minimum expected loss in estimating the same…

Information Theory · Computer Science 2023-09-29 László Györfi , Tamás Linder , Harro Walk

The statistics and machine learning communities have recently seen a growing interest in classification-based approaches to two-sample testing. The outcome of a classification-based two-sample test remains a rejection decision, which is not…

Statistics Theory · Mathematics 2022-11-15 Loris Michel , Jeffrey Näf , Nicolai Meinshausen

We prove that the distribution of the product of two correlated normal random variables with arbitrary means and arbitrary variances is infinitely divisible. We also obtain exact formulas for the probability density function of the sum of…

Probability · Mathematics 2025-06-10 Robert E. Gaunt , Saralees Nadarajah , Tibor K. Pogány

We consider the problem of estimating the Optimized Certainty Equivalent (OCE) risk from independent and identically distributed (i.i.d.) samples. For the classic sample average approximation (SAA) of OCE, we derive mean-squared error as…

Machine Learning · Computer Science 2024-06-03 Ayon Ghosh , L. A. Prashanth , Krishna Jagannathan

We consider the problem of estimating a spectral risk measure (SRM) from i.i.d. samples, and propose a novel method that is based on numerical integration. We show that our SRM estimate concentrates exponentially, when the underlying…

Machine Learning · Computer Science 2019-12-24 Ajay Kumar Pandey , Prashanth L. A. , Sanjay P. Bhat

The martingale method is used to establish concentration inequalities for a class of dependent random sequences on a countable state space, with the constants in the inequalities expressed in terms of certain mixing coefficients. Along the…

Probability · Mathematics 2009-01-22 Leonid , Kontorovich , Kavita Ramanan
‹ Prev 1 2 3 10 Next ›