Metraipolis › archive › dc_8e7396ebfd74

Hypothesis Selection via Weighted Medians — arXiv:2610.20375

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.20375
License (as archived)
CC0-1.0
Archived
2026-10-15T14:23:50.669Z
SHA-256 of the archived text
d4058b3f27833bfee6fe3e5b1c1ffd3a8dc9c26509f4d9acf5a8ad9998a7db1b
Stable URL of this page
https://metraipolis.com/documento/dc_8e7396ebfd74

How to cite

Hypothesis Selection via Weighted Medians — arXiv:2610.20375 — arXiv (en), https://arxiv.org/abs/2610.20375 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8e7396ebfd74 (Metraipolis archive dc_8e7396ebfd74, sha256 d4058b3f27833bfee6fe3e5b1c1ffd3a8dc9c26509f4d9acf5a8ad9998a7db1b)
BibTeX
@misc{dc8e7396ebfd74,
  title = {Hypothesis Selection via Weighted Medians — arXiv:2610.20375},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.20375},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8e7396ebfd74; sha256 d4058b3f27833bfee6fe3e5b1c1ffd3a8dc9c26509f4d9acf5a8ad9998a7db1b},
  year = {2026}
}

Archived text

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

Given $n$ distributions (hypotheses) $\mathcal H=\{H_1,\ldots,H_n\}$ and samples from an unknown target distribution $P$, proper hypothesis selection seeks a distribution whose total variation distance to $P$ is close to the best achievable within the known distributions. We give an algorithm that, using $O(\varepsilon^{-2}\log(n/\delta))$ target samples, running in $O(n\varepsilon^{-2}\log(n/\delta))$ time, with probability at least $1-\delta$, returns $H_{\hat i}$ satisfying $d_\mathrm{TV}(P,H_{\hat i})\leq 3\min_{i\in[n]}d_\mathrm{TV}(P,H_i)+\varepsilon.$ The algorithm achieves the optimal approximation factor and sample complexity. The running time improves the dependence on the failure probability from polynomial to logarithmic in the state-of-the-art bound $\tilde{O}(n\varepsilon^{-2}\delta^{-1})$ of Aamand, Aliakbarpour, Chen, and Silwal (COLT 2026), thereby answering their Question~2.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.20375 — 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-10-15T13:53:35.962Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).