Metraipolis › archive › dc_9c1d441effd9

New Lower Bounds for Private PAC Learning — arXiv:2610.41980

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41980
License (as archived)
CC0-1.0
Archived
2026-11-02T04:52:30.547Z
SHA-256 of the archived text
c5a8bdef668c6210d2895fcb81f0074d64990316dcfe2deaf807608732758ccd
Stable URL of this page
https://metraipolis.com/documento/dc_9c1d441effd9

How to cite

New Lower Bounds for Private PAC Learning — arXiv:2610.41980 — arXiv (en), https://arxiv.org/abs/2610.41980 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9c1d441effd9 (Metraipolis archive dc_9c1d441effd9, sha256 c5a8bdef668c6210d2895fcb81f0074d64990316dcfe2deaf807608732758ccd)
BibTeX
@misc{dc9c1d441effd9,
  title = {New Lower Bounds for Private PAC Learning — arXiv:2610.41980},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41980},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9c1d441effd9; sha256 c5a8bdef668c6210d2895fcb81f0074d64990316dcfe2deaf807608732758ccd},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41980. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study realizable PAC learning under approximate differential privacy, and give a framework for proving lower bounds on its sample complexity. We construct classes with identical VC and Littlestone dimensions but different private sample complexities at common privacy and accuracy parameters, showing that these dimensions do not determine the sample complexity, even for improper learners. To address this we introduce the Independent Class Packing (ICP) parameter, the largest total sample complexity of classes in $\mathcal{G}$ that can be packed independently into a class $\mathcal{H}$, and prove that every $(\varepsilon, \delta)$-DP, $(\alpha, \beta)$-PAC learner for $\mathcal{H}$, possibly improper, uses $\Omega\left(\mathrm{ICP}(\mathcal{H}, \mathcal{G})/(\alpha\varepsilon)\right)$ examples. Using this framework we prove tight lower bounds for axis-aligned rectangles, union of intervals and linear subspaces and improved lower bounds for halfspaces and convex polygons. Finally we also show that for product classes, and more generally when the same classes pack into $\mathcal{H}$ and cover its domain so that target labels can be used directly, ICP characterizes private PAC sample complexity up to logarithmic factors.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.41980 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-02T04:45:12.917Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).