Pith. sign in

REVIEW 1 cited by

Noisy recovery from random linear observations: Sharp minimax rates under elliptical constraints

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2303.12613 v1 pith:OXX7ZFSU submitted 2023-03-22 math.ST cs.ITmath.ITstat.TH

classification math.STcs.ITmath.ITstat.TH
keywords randomparameterellipticalestimationlinearoperatorproblemsresult
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Estimation problems with constrained parameter spaces arise in various settings. In many of these problems, the observations available to the statistician can be modelled as arising from the noisy realization of the image of a random linear operator; an important special case is random design regression. We derive sharp rates of estimation for arbitrary compact elliptical parameter sets and demonstrate how they depend on the distribution of the random linear operator. Our main result is a functional that characterizes the minimax rate of estimation in terms of the noise level, the law of the random operator, and elliptical norms that define the error metric and the parameter space. This nonasymptotic result is sharp up to an explicit universal constant, and it becomes asymptotically exact as the radius of the parameter space is allowed to grow. We demonstrate the generality of the result by applying it to both parametric and nonparametric regression problems, including those involving distribution shift or dependent covariates.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Mixed-Sample SGD: an End-to-end Analysis of Supervised Transfer Learning

    stat.ML 2025-07 reject novelty 7.0 of 10

    An adaptive mixed-sample SGD procedure is claimed to converge at 1/sqrt(T) to a solution whose target risk matches the better of source-only and target-only ERM, but the main convergence bound contains a non-vanishing...

Pith tools