General framework for projection structures
Eduard Belitser, Nurzhan Nurushev

TL;DR
This paper develops a comprehensive framework for projection structures, enabling uncertainty quantification and inference in high-dimensional models, with broad applications and optimality guarantees.
Contribution
It introduces a unified, distribution-free approach for inference in diverse high-dimensional models using data-dependent measures and oracle rates.
Findings
Establishes local confidence optimality under the EBR condition.
Derives new minimax results for various models like density estimation and covariance matrices.
Improves existing results and provides adaptive minimax bounds.
Abstract
In the first part, we develop a general framework for projection structures and study several inference problems within this framework. We propose procedures based on data dependent measures (DDM) and make connections with empirical Bayes and penalization methods. The main inference problem is the uncertainty quantification (UQ), but on the way we solve the estimation, DDM-contraction problems, and a weak version of the structure recovery problem. The approach is local in that the quality of the inference procedures is measured by the local quantity, the oracle rate, which is the best trade-off between the approximation error by a projection structure and the complexity of that approximating projection structure. Like in statistical learning settings, we develop distribution-free theory as no particular model is imposed, we only assume certain mild condition on the stochastic part of…
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
TopicsAdvanced Optimization Algorithms Research · Statistical and numerical algorithms
