Honest Inference for Stochastic Optimization
Kenta Takatsu, Arun Kumar Kuchibhotla

TL;DR
This paper introduces a unified method for constructing valid confidence sets in stochastic optimization, addressing challenges from irregularities and high-dimensional settings, with demonstrated adaptability and broad applicability.
Contribution
It proposes a simple, unified approach that guarantees valid inference in both regular and irregular stochastic optimization problems, including high-dimensional cases.
Findings
Method guarantees validity in irregular cases
Confidence sets adapt to unknown regularity levels
Numerical results demonstrate effectiveness across applications
Abstract
This manuscript studies a general approach to construct confidence sets for the solution of stochastic optimization, rendering empirical risk minimization as special cases. Statistical inference for stochastic optimization poses significant challenges due to the non-standard limiting behaviors of the corresponding estimator, which arise in settings with increasing dimension of parameters, non-smooth objectives, or constraints. We propose a simple and unified method that guarantees validity in both regular and irregular cases. We provide a unified treatment of validity, conservativeness, and the size of the resulting confidence sets. In particular, the presented width analysis demonstrates the adaptive behavior of the confidence set to the unknown degree of instance-specific regularity. We apply the proposed method to several high-dimensional and irregular statistical problems. Numerical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference · Control Systems and Identification
