Learning Sparse Support under Differential Privacy: Adaptive Algorithms and Minimax Limits E2TP3AKTNV
| URI | m2://res/E2TP3AKTNV |
|---|---|
| Kind | preprint |
| Creators | Jia Gu, T. Tony Cai |
| Date | 2026-10-05 |
| MSC | 62-XX |
| Subjects | arxiv math.ST, arxiv stat.TH |
| Scope | in |
Expressions
e1: version, preprint
| Language | en |
|---|---|
| Date | 2026-10-05 |
| Ids | arXiv 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.
| Item | Kind | Where | Source |
|---|---|---|---|
| 3WSNVNNSVF | statement | theorem 5 | arxiv |
| Minimax optimality of Saturated LASSO | statement | corollary 2 | arxiv |
| 6S8X349B6V | statement | theorem 4 | arxiv |
| 858SCFQZP0 | statement | corollary 1 | arxiv |
| Privacy guarantee of Saturated PTR | statement | theorem 1 | arxiv |
| CMQHD3210J | statement | lemma 1 | arxiv |
| DADE08F8MX | statement | theorem 8 | arxiv |
| Hamming-radius support stability | statement | theorem 2 | arxiv |
| Differential Privacy | definition | definition 1 | arxiv |
| FSNKE5KFR3 | statement | theorem 9 | arxiv |
| MF9MJR7X2P | statement | theorem 6 | arxiv |
| Sub-distance | definition | definition 2 | arxiv |
| Finite-sample recovery | statement | proposition 4 | arxiv |
| TXKQW4SJDM | statement | proposition 1 | arxiv |
| Maximum of sub-distances | statement | proposition 2 | arxiv |
| Sub-distance property | statement | theorem 3 | arxiv |
| Recovery rates | statement | theorem 7 | arxiv |
| Z1TQW7YR7H | statement | proposition 3 | arxiv |
Catalogue records
- arxiv: 2610.05867 (work)
- arxiv_text: 2610.05867 (work)