English
Related papers

Related papers: Concentration Inequalities and UQ Bounds for Hypoc…

200 papers

This work obtains sharp closed-form exponential concentration inequalities of Bernstein type for the ubiquitous beta distribution, improving upon sub-gaussian and sub-gamma bounds previously studied in this context. The proof leverages a…

Probability · Mathematics 2024-10-21 Maciej Skorski

Contraction in Wasserstein 1-distance with explicit rates is established for generalized Hamiltonian Monte Carlo with stochastic gradients under possibly nonconvex conditions. The algorithms considered include splitting schemes of kinetic…

Probability · Mathematics 2024-09-16 Martin Chak , Pierre Monmarché

A new (unadjusted) Langevin Monte Carlo (LMC) algorithm with improved rates in total variation and in Wasserstein distance is presented. All these are obtained in the context of sampling from a target distribution $\pi$ that has a density…

Statistics Theory · Mathematics 2019-10-18 Sotirios Sabanis , Ying Zhang

For a wide class of monotonic functions $f$, we develop a Chernoff-style concentration inequality for quadratic forms $Q_f \sim \sum\limits_{i=1}^n f(\eta_i) (Z_i + \delta_i)^2$, where $Z_i \sim N(0,1)$. The inequality is expressed in terms…

Statistics Theory · Mathematics 2019-11-14 Robert E. Gallagher , Louis J. M. Aslett , David Steinsaltz , Ryan R. Christ

Sampling from log-concave distributions is a well researched problem that has many applications in statistics and machine learning. We study the distributions of the form $p^{*}\propto\exp(-f(x))$, where…

Machine Learning · Computer Science 2019-09-13 Ruoqi Shen , Yin Tat Lee

Introducing inequality constraints in Gaussian process (GP) models can lead to more realistic uncertainties in learning a great variety of real-world problems. We consider the finite-dimensional Gaussian approach from Maatouk and Bay (2017)…

Machine Learning · Statistics 2021-11-04 Andrés F. López-Lopera , François Bachoc , Nicolas Durrande , Olivier Roustant

Two popular classes of methods for approximate inference are Markov chain Monte Carlo (MCMC) and variational inference. MCMC tends to be accurate if run for a long enough time, while variational inference tends to give better approximations…

Machine Learning · Computer Science 2017-06-21 Justin Domke

We establish Chernoff-type bounds for the largest eigenvalue of sums of Hermitian random matrices generated by a time-inhomogeneous Markov chain. Our primary regime assumes a compact state space and contractivity of each Markov kernel in…

Probability · Mathematics 2026-05-26 Luca Zanetti

We derive general bounds on the probability that the empirical first-passage time $\overline{\tau}_n\equiv \sum_{i=1}^n\tau_i/n$ of a reversible ergodic Markov process inferred from a sample of $n$ independent realizations deviates from the…

Statistical Mechanics · Physics 2023-12-12 Rick Bebon , Aljaž Godec

Via operator theoretic methods, we formalize the concentration phenomenon for a given observable `$r$' of a discrete time Markov chain with `$\mu_{\pi}$' as invariant ergodic measure, possibly having support on an unbounded state space. The…

Machine Learning · Computer Science 2023-06-01 Muhammad Abdullah Naeem , Miroslav Pajic

Langevin diffusions are rapidly convergent under appropriate functional inequality assumptions. Hence, it is natural to expect that with additional smoothness conditions to handle the discretization errors, their discretizations like the…

Statistics Theory · Mathematics 2023-07-21 Alireza Mousavi-Hosseini , Tyler Farghly , Ye He , Krishnakumar Balasubramanian , Murat A. Erdogdu

We propose a novel approach to concentration for non-independent random variables. The main idea is to ``pretend'' that the random variables are independent and pay a multiplicative price measuring how far they are from actually being…

Information Theory · Computer Science 2023-10-31 Amedeo Roberto Esposito , Marco Mondelli

Self-normalized processes arise naturally in many learning-related tasks. While self-normalized concentration has been extensively studied for scalar-valued processes, there are few results for multidimensional processes outside of the…

Probability · Mathematics 2025-05-02 Justin Whitehouse , Zhiwei Steven Wu , Aaditya Ramdas

We propose a new framework of variance-reduced Hamiltonian Monte Carlo (HMC) methods for sampling from an $L$-smooth and $m$-strongly log-concave distribution, based on a unified formulation of biased and unbiased variance reduction…

Machine Learning · Computer Science 2021-02-10 Zhengmian Hu , Feihu Huang , Heng Huang

Matrix concentration inequalities provide information about the probability that a random matrix is close to its expectation with respect to the $l_2$ operator norm. This paper uses semigroup methods to derive sharp nonlinear matrix…

Probability · Mathematics 2021-01-08 De Huang , Joel A. Tropp

We introduce a new probabilistic approach to quantify convergence to equilibrium for (kinetic) Langevin processes. In contrast to previous analytic approaches that focus on the associated kinetic Fokker-Planck equation, our approach is…

Probability · Mathematics 2018-07-02 Andreas Eberle , Arnaud Guillin , Raphael Zimmer

Neural network (NN) potentials promise highly accurate molecular dynamics (MD) simulations within the computational complexity of classical MD force fields. However, when applied outside their training domain, NN potential predictions can…

Chemical Physics · Physics 2023-07-28 Stephan Thaler , Gregor Doehner , Julija Zavadlav

This paper studies a class of time-inconsistent mean field control (MFC) problems in the presence of common noise under non-exponential discount and joint law dependence of both state and control. We investigate the closed-loop…

Optimization and Control · Mathematics 2025-05-06 Zongxia Liang , Xiang Yu , Keyu Zhang

We prove long-time contractivity estimates and exponential rates of convergence to equilibrium for solutions of hypoelliptic diffusion equations, which include the well-known Kolmogorov equation and similar kinetic Fokker-Planck equations…

Analysis of PDEs · Mathematics 2025-10-15 Nicolò Forcillo , Alessio Porretta

This paper introduces a Bayesian framework that combines Markov chain Monte Carlo (MCMC) sampling, dimensionality reduction, and neural density estimation to efficiently handle inverse problems that (i) must be solved multiple times, and…

Computational Engineering, Finance, and Science · Computer Science 2026-02-24 Giacomo Bottacini , Matteo Torzoni , Andrea Manzoni
‹ Prev 1 3 4 5 6 7 10 Next ›