paper-with-me

홈 › Papers

Statistical Limits of Adaptive Linear Models: Low-Dimensional Estimation and Inference

2023-10-01 · NeurIPS 2023 11 · Licong Lin, Mufang Ying, Suvrojit Ghosh, Koulik Khamaru, Cun-Hui Zhang

Estimation and inference in statistics pose significant challenges when data are collected adaptively. Even in linear models, the Ordinary Least Squares (OLS) estimator may fail to exhibit asymptotic normality for single coordinate estimation and have inflated error. This issue is highlighted by a recent minimax lower bound, which shows that the error of estimating a single coordinate can be enlarged by a multiple of $\sqrt{d}$ when data are allowed to be arbitrarily adaptive, compared with the case when they are i.i.d. Our work explores this striking difference in estimation performance between utilizing i.i.d. and adaptive data. We investigate how the degree of adaptivity in data collection impacts the performance of estimating a low-dimensional parameter component in high-dimensional linear models. We identify conditions on the data collection mechanism under which the estimation error for a low-dimensional parameter component matches its counterpart in the i.i.d. setting, up to a factor that depends on the degree of adaptivity. We show that OLS or OLS on centered data can achieve this matching error. In addition, we propose a novel estimator for single coordinate inference via solving a Two-stage Adaptive Linear Estimating equation (TALE). Under a weaker form of adaptivity in data collection, we establish an asymptotic normality property of the proposed estimator.

📄 PDF Abstract BibTeX arXiv:2310.00532

Code (1)

licong-lin/low-dim-debias 공식 구현

Similar Papers 제목 키워드 기반

Optimal Multiscale Learning of Linear Operators

2026-06-15 · Jiaheng Chen, Daniel Sanz-Alonso arxiv

We study the statistical and computational limits of learning bounded linear operators between Sobolev spaces from noisy input-output data. In wavelet coordinates, the problem is recast as an infinite-dimensional matrix …

Statistical Limits of Convex Relaxations

2015-03-04 · Zhaoran Wang, Quanquan Gu, Han Liu

Many high dimensional sparse learning problems are formulated as nonconvex optimization. A popular approach to solve these nonconvex optimization problems is through convex relaxations such as linear and semidefinite pro…

Sparse LearningStochastic Block Model

Rigorous Dynamics and Consistent Estimation in Arbitrarily Conditioned Linear Systems

2017-06-19 · NeurIPS 2017 12 · Alyson K. Fletcher, Mojtaba Sahraee-Ardakan, Philip Schniter, Sundeep Rangan

The problem of estimating a random vector x from noisy linear measurements y = A x + w with unknown parameters on the distributions of x and w, which must also be learned, arises in a wide range of statistical learning a…

0-1 phase transitions in sparse spiked matrix estimation

2019-11-12 · Jean Barbier, Nicolas Macris

We consider statistical models of estimation of a rank-one matrix (the spike) corrupted by an additive gaussian noise matrix in the sparse limit. In this limit the underlying hidden vector (that constructs the rank-one m…

Image RestorationObject CountingSemantic SegmentationWord Sense Disambiguation

What's the score? Automated Denoising Score Matching for Nonlinear Diffusions

2024-07-10 · Raghav Singhal, Mark Goldstein, Rajesh Ranganath

Reversing a diffusion process by learning its score forms the heart of diffusion-based generative modeling and for estimating properties of scientific systems. The diffusion processes that are tractable center on linear …

Denoising