English
Related papers

Related papers: A concentration inequality for random combinatoria…

200 papers

In multi-task learning (MTL) with each task involving graph-dependent data, existing generalization analyses yield a \emph{sub-optimal} risk bound of $O(\frac{1}{\sqrt{n}})$, where $n$ is the number of training samples of each task.…

Machine Learning · Computer Science 2025-05-22 Xiao Shao , Guoqiang Wu

We study the clustering problem for mixtures of bounded covariance distributions, under a fine-grained separation assumption. Specifically, given samples from a $k$-component mixture distribution $D = \sum_{i =1}^k w_i P_i$, where each $w_i…

Machine Learning · Computer Science 2023-12-20 Ilias Diakonikolas , Daniel M. Kane , Jasper C. H. Lee , Thanasis Pittas

Let $\mathbf{X} \subseteq \mathbb{R}^n$ be a closed set, and consider the problem of computing the minimum $f_{\min}$ of a polynomial $f$ on $\mathbf{X}$. Given a measure $\mu$ supported on $\mathbf{X}$, Lasserre (SIAM J. Optim. 21(3),…

Optimization and Control · Mathematics 2024-08-19 Lucas Slot , Manuel Wiedmer

The likelihood function of a finite mixture model is a non-convex function with multiple local maxima and commonly used iterative algorithms such as EM will converge to different solutions depending on initial conditions. In this paper we…

Machine Learning · Computer Science 2016-08-19 Elad Mezuman , Yair Weiss

We obtain a Bernstein type Gaussian concentration inequality for martingales. Our inequality improves the Azuma-Hoeffding inequality for moderate deviations $x$. Following the work of McDiarmid (1989), Talagrand (1996) and Boucheron, Lugosi…

Probability · Mathematics 2017-10-17 Xiequan Fan

For an ergodic Brownian diffusion with invariant measure $\nu$, we consider a sequence of empirical distributions ($\nu$n) n$\ge$1 associated with an approximation scheme with decreasing time step ($\gamma$n) n$\ge$1 along an adapted…

Probability · Mathematics 2018-10-09 I Honoré

We propose a scalable divergence estimation method based on hashing. Consider two continuous random variables $X$ and $Y$ whose densities have bounded support. We consider a particular locality sensitive random hashing, and consider the…

Information Theory · Computer Science 2018-01-03 Morteza Noshad , Alfred O. Hero

We investigate the weight distribution of random binary linear codes. For $0<\lambda<1$ and $n\to\infty$ pick uniformly at random $\lambda n$ vectors in $\mathbb{F}_2^n$ and let $C \le \mathbb{F}_2^n$ be the orthogonal complement of their…

Information Theory · Computer Science 2024-07-11 Nati Linial , Jonathan Mosheiff

Following the concentration of the measure theory formalism, we consider the transformation $\Phi(Z)$ of a random variable $Z$ having a general concentration function $\alpha$. If the transformation $\Phi$ is $\lambda$-Lipschitz with…

Probability · Mathematics 2026-02-03 Cosme Louart

Let $\mu$ be a probability measure on $\mathbb{R}^d$ and $\mu_N$ its empirical measure with sample size $N$. We prove a concentration inequality for the optimal transport cost between $\mu$ and $\mu_N$ for radial cost functions with…

Statistics Theory · Mathematics 2024-01-26 Martin Larsson , Jonghwa Park , Johannes Wiesel

We study the exponential time complexity of approximate counting satisfying assignments of CNFs. We reduce the problem to deciding satisfiability of a CNF. Our reduction preserves the number of variables of the input formula and thus also…

Computational Complexity · Computer Science 2012-08-14 Patrick Traxler

We present a universal concentration bound for sums of random variables under arbitrary dependence, and we prove that it is asymptotically optimal for broad families of marginals admitting a uniform integrable tail-quantile envelope. The…

Probability · Mathematics 2026-03-05 Cosme Louart , Sicheng Tan

A line of recent work has analyzed the behavior of the Expectation-Maximization (EM) algorithm in the well-specified setting, in which the population likelihood is locally strongly concave around its maximizing argument. Examples include…

Statistics Theory · Mathematics 2020-04-30 Raaz Dwivedi , Nhat Ho , Koulik Khamaru , Michael I. Jordan , Martin J. Wainwright , Bin Yu

We prove concentration inequalities of the form $P(Y \ge t) \le \exp(-B(t))$ for a random variable $Y$ with mean zero and variance $\sigma^2$ using a coupling technique from Stein's method that is so-called approximate zero bias couplings.…

Probability · Mathematics 2025-12-24 Nathakhun Wiroonsri

We show that the quadratic transportation cost inequality $T_2$ is equivalent to both a Poincar\'e inequality and a strong form of the Gaussian concentration property. The main ingredient in the proof is a new family of inequalities, called…

Probability · Mathematics 2007-05-23 Patrick Cattiaux , Arnaud Guillin

Exponential families are widely used in machine learning, including many distributions in continuous and discrete domains (e.g., Gaussian, Dirichlet, Poisson, and categorical distributions via the softmax transformation). Distributions in…

We establish two concentration inequalities for nonlinear stochastic system under time-varying contraction conditions. The key to our approach is an energy function termed Averaged Moment Generating Function (AMGF). By combining it with…

Optimization and Control · Mathematics 2026-04-03 Zishun Liu , Liqian Ma , Hongzhe Yu , Yongxin Chen

We consider the problem of the maximum concentration in a fixed measurable subset $\Omega\subset\mathbb{R}^{2d}$ of the time-frequency space for functions $f\in L^2(\mathbb{R}^{d})$. The notion of concentration can be made mathematically…

Classical Analysis and ODEs · Mathematics 2022-10-07 Fabio Nicola , José Luis Romero , S. Ivan Trapasso

This paper deals with the \emph{integral} version of the Dirichlet homogeneous fractional Laplace equation. For this problem weighted and fractional Sobolev a priori estimates are provided in terms of the H\"older regularity of the data. By…

Numerical Analysis · Mathematics 2017-01-11 Gabriel Acosta , Juan Pablo Borthagaray

We study the stress concentration, which is the gradient of the solution, when two smooth inclusions are closely located in a possibly anisotropic medium. The governing equation may be degenerate of $p-$Laplace type, with $1<p \leq N$. We…

Analysis of PDEs · Mathematics 2018-09-25 Giulio Ciraolo , Angela Sciammetta