arXiv (OAI Expanded)
open access
Minimax and adaptive estimation of general linear functionals under sparsity
We study nonasymptotic minimax estimation of the linear functional $L(θ)=η^\top θ$ for a high-dimensional $s$-sparse mean vector with an arbitrary loading vector $η$. For symmetric noise with exponentially decaying tails, we derive the sharp minimax rate, explicit in $s$, $η$, the tail parameter, an
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Minimax and adaptive estimation of general linear functionals under sparsity#793489
- Near-optimal estimates for the $\ell^p$-Lipschitz constants of deep random ReLU neural networks#997975
- Next-token functional estimation#1014122
- Towards Weaker Variance Assumptions for Stochastic Optimization#1116095
- Boundedness of Multilinear Hilbert Transforms Along Moment Curves#984430
Record · ID 789485
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive