A note on L^1-Convergence of the Empiric Minimizer for unbounded functions with fast growth

03/08/2023
by   Pierre Bras, et al.
0

For V : ℝ^d →ℝ coercive, we study the convergence rate for the L^1-distance of the empiric minimizer, which is the true minimum of the function V sampled with noise with a finite number n of samples, to the minimum of V. We show that in general, for unbounded functions with fast growth, the convergence rate is bounded above by a_n n^-1/q, where q is the dimension of the latent random variable and where a_n = o(n^ε) for every ε > 0. We then present applications to optimization problems arising in Machine Learning and in Monte Carlo simulation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/22/2018

On the rate of convergence of empirical measure in ∞-Wasserstein distance for unbounded density function

We consider a sequence of identically independently distributed random s...
research
10/13/2022

Condition-number-independent Convergence Rate of Riemannian Hamiltonian Monte Carlo with Numerical Integrators

We study the convergence rate of discretized Riemannian Hamiltonian Mont...
research
05/10/2023

Speeding up Monte Carlo Integration: Control Neighbors for Optimal Convergence

A novel linear integration rule called control neighbors is proposed in ...
research
11/20/2018

Convergence rate of optimal quantization grids and application to empirical measure

We study the convergence rate of optimal quantization for a probability ...
research
04/01/2017

Faster Subgradient Methods for Functions with Hölderian Growth

The purpose of this manuscript is to derive new convergence results for ...
research
07/13/2022

Noise level free regularisation of general linear inverse problems under unconstrained white noise

In this note we solve a general statistical inverse problem under absenc...
research
10/12/2018

Granularity of wagers in games and the (im)possibility of savings

In a casino where arbitrarily small bets are admissible, any betting str...

Please sign up or login with your details

Forgot password? Click here to reset