arXiv Machine Learning
Jul 21
Tight Sample Bounds for Renyi and Min-Entropy Estimation
arXiv:2607. 16966v1 Announce Type: cross Abstract: Estimating entropy from samples is fundamental in information theory and property testing.
Learning CNF Formulas from Uniform Random Solutions: Near-Tight Sample Complexity for Valiant's Algorithm
Related stories
arXiv Machine Learning
Sep 10
Smoothed Picard Hamiltonian Monte Carlo
arXiv:2609.06906v1 Announce Type: cross Abstract: We develop a new low-accuracy sampler, called \emph{smoothed Picard Hamiltonian Monte Carlo}, which combines Gaussian smoothing, Picard iteration, an...
arXiv AI
3d ago
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...
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
4d ago
Tight Sampling Complexity with stochastic gradient oracles in Fixed Dimensions
arXiv:2609. 12590v1 Announce Type: cross Abstract: We investigate the stochastic-gradient query complexity of sampling smooth strongly log-concave distributions in any fixed Euclidean dimension.
arXiv Machine Learning
Aug 7
Optimal Rates for Learning with Monotone Adversaries
arXiv:2608. 06337v1 Announce Type: cross Abstract: A monotone adversary observes an i.
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
Aug 7
An Optimal Agnostic PAC Algorithm
arXiv:2608. 06363v1 Announce Type: cross Abstract: Let $H\subseteq\{-1,+1\}^X$ be a class of finite VC dimension $d\ge1$.
arXiv Machine Learning
Aug 4
Optimal Unambiguous DNFs and Alon-Saks-Seymour
arXiv:2608. 02533v1 Announce Type: cross Abstract: We construct unambiguous DNFs having width $O(n)$ but $0$-certificate complexity $\Omega(n^2)$.
arXiv Machine Learning
Aug 4
Interaction Is Not Necessary for Order-Optimal 1-Bit Mean Estimation
arXiv:2608. 02538v1 Announce Type: cross Abstract: This paper is concerned with one-bit mean estimation, where each independent sample is represented by a single binary message.
arXiv Machine Learning
Aug 4
Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds
arXiv:2608. 02176v1 Announce Type: cross Abstract: We study the round complexity of learning a hidden partition $\mathcal{P}$ of an $n$-element universe using PAIR queries: PAIR($x,y$) tells us whether $x$ and $y$ belong to the same part of the partition or not.
Hugging Face Trending Papers
Aug 3
Optimal Unambiguous DNFs and Alon-Saks-Seymour
We construct unambiguous DNFs having width $O(n)$ but $0$-certificate complexity $Ω(n^2)$. By utilizing the special structure of these DNFs, we prove a lifting theorem with a constant-sized gadget that lifts the DNF to a communication problem, while losslessly translating the separation in certificate complexity to a separation in communication complexity.