Demo Data from EDBT 2026 / reviewers in the wild / expert
Suvrojit Ghosh
dblp:369/6006
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Mathematical optimization · 87% Information theory · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization › statistical estimation › regression
high-dimensional linear models |
0.7 | 1 | 2023 | Statistical Limits of Adaptive Linear Models: Low-Dimensional Estimation and Inference · NeurIPS 2023 |
Mathematical optimization
statistical estimation |
0.7 | 1 | 2023 | Statistical Limits of Adaptive Linear Models: Low-Dimensional Estimation and Inference · NeurIPS 2023 |
Information theory › statistical inference › asymptotic theory
asymptotic normality |
0.2 | 1 | 2023 | Statistical Limits of Adaptive Linear Models: Low-Dimensional Estimation and Inference · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
two-stage adaptive linear estimating equation · 0.7ordinary least squares · 0.7minimax lower bounds · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Statistical Limits of Adaptive Linear Models: Low-Dimensional Estimation and InferenceabstractEstimation 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. Licong Lin, Mufang Ying, Suvrojit Ghosh, Koulik Khamaru, Cun-Hui Zhang |
NeurIPS | 3 |