A Proof of the Convergence a Lipschitz Upper Confidence Bound
Gregory Keslin
Abstract
This document presents a proof of the estimation of a lipschitz parameter by constructing a consistent lower confidence bound through hypothesis test inversion. We prove that as the number of design points grows to infinity, the test correctly identifies any underestimated Lipschitz constant with asymptotic probability 1. The convergence proofs rely on a Uniform Law of Large Numbers and analyze discrepancy metrics under both bounded and unbounded replication sampling.
Create a lesson
Related papers
Minimax optimality for sequential gradient-free minimization of smooth functions and their derivatives
Théo Paquier, Alexandre B Tsybakov, François Portier et al.
Randomization Inference with Concentration Inequalities
Tobias Freidling
On the continuity of the Tukey depth function for fuzzy data
Luis González-De La Fuente, Alicia Nieto-Reyes, Pedro Terán
Recursive-Head Geometry and Order-Free Efficient Inference in Finite-State Nested Markov Models
Haoyu Wei
Finite-Sample Hausdorff Bounds and Hadamard Sensitivity for Regressions with MNAR Covariates
Hugo Dunias
Semiparametric Efficient Inference under Non-Informative Complex Survey Designs
Hiroki Chiba, Kosuke Morikawa