Math 2.0

Resources / preprint

Learning Sparse Support under Differential Privacy: Adaptive Algorithms and Minimax Limits E2TP3AKTNV

URIm2://res/E2TP3AKTNV
Kindpreprint
CreatorsJia Gu, T. Tony Cai
Date2026-10-05
MSC62-XX
Subjectsarxiv math.ST, arxiv stat.TH
Scopein

Expressions

e1: version, preprint

Languageen
Date2026-10-05
IdsarXiv 2610.05867

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
3WSNVNNSVFstatementtheorem 5arxiv
Minimax optimality of Saturated LASSOstatementcorollary 2arxiv
6S8X349B6Vstatementtheorem 4arxiv
858SCFQZP0statementcorollary 1arxiv
Privacy guarantee of Saturated PTRstatementtheorem 1arxiv
CMQHD3210Jstatementlemma 1arxiv
DADE08F8MXstatementtheorem 8arxiv
Hamming-radius support stabilitystatementtheorem 2arxiv
Differential Privacydefinitiondefinition 1arxiv
FSNKE5KFR3statementtheorem 9arxiv
MF9MJR7X2Pstatementtheorem 6arxiv
Sub-distancedefinitiondefinition 2arxiv
Finite-sample recoverystatementproposition 4arxiv
TXKQW4SJDMstatementproposition 1arxiv
Maximum of sub-distancesstatementproposition 2arxiv
Sub-distance propertystatementtheorem 3arxiv
Recovery ratesstatementtheorem 7arxiv
Z1TQW7YR7Hstatementproposition 3arxiv

Catalogue records