arXiv Machine Learning
Hypothesis Selection via Weighted Medians
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jun 18
How fast can you find a good hypothesis?
arXiv:2509. 03734v3 Announce Type: replace-cross Abstract: In the hypothesis selection problem, we are given sample and query access to finite set of candidate distributions (hypotheses), $\mathcal{H} = \{H_1, \ldots, H_n\}$, and samples from an unknown distribution $P$, both over a domain $\mathcal{X}$.
arXiv Machine Learning
Aug 24
On Finite-sample Concentration of Median of Incomplete U-Statistics
arXiv:2606.00661v2 Announce Type: replace-cross Abstract: Median-of-means (MoM) is a powerful technique that theoretically enables near sub-Gaussian finite-sample rate for parameter estimation when t...
arXiv Machine Learning
Oct 23
Efficient and Optimal Learning of Discrete Distributions with Person-Level Privacy
arXiv:2610. 31612v1 Announce Type: new Abstract: We study learning a discrete distribution under person-level differential privacy in the batched setting.
arXiv Machine Learning
Sep 22
Adversarially Robust PAC Learning with Optimal VC Rates
arXiv:2609.24260v1 Announce Type: cross Abstract: We study the problem of \emph{adversarially robust} PAC learning. In this framework, the learner observes independent samples from an unknown distrib...
arXiv Machine Learning
Jul 2
Fast Score-Based Sampling via Log-Concave Reductions
arXiv:2512. 24152v2 Announce Type: replace-cross Abstract: Sampling based on score diffusions has led to striking empirical results, and has attracted considerable attention from various research communities.
arXiv AI
Sep 15
Gap Entropy and Almost Instance-Wise Optimal Best-Arm Identification
arXiv:2609.13703v1 Announce Type: cross Abstract: In the best-arm identification problem, we are given $n$ stochastic arms with unknown means and wish to identify the arm with the largest mean with p...