arXiv Machine Learning By Gunjan Kumar, Yash Pote, Jonathan Scarlett

Asymmetric Likelihood-Free Hypothesis Testing

Read the original on arXiv Machine Learning →

arXiv:2610. 29798v1 Announce Type: new Abstract: In likelihood-free hypothesis testing (LFHT), given samples from two unknown distributions $P,Q$ on $[n]$ with $\mathrm{d_{TV}}(P,Q)\geq\varepsilon$, and from a third distribution $D\in\{P,Q\}$, the goal is to identify whether $D=P$ or $D=Q$.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

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}$.

By Anders Aamand, Maryam Aliakbarpour, Justin Y. Chen, Sandeep Silwal
arXiv Statistics ML
5d ago

Low-degree polynomials lower bounds for clustering in small dimension

arXiv:2610. 37272v1 Announce Type: new Abstract: We study the computational limits of clustering $n$ observations drawn from a mixture of $K$ isotropic distributions in $\mathbb R^d$, in the regime where the number $K$ of groups is much larger than the dimension $d$.

By Alexandra Carpentier (MISTEA), Nicolas Verzelen (MISTEA)
arXiv Machine Learning
Jul 13

A Fourier analytique approach to Gaussian mixture learning

arXiv:2004. 05813v3 Announce Type: replace-cross Abstract: Suppose that we are given independent, identically distributed random samples $x_1,\cdots,x_n$ from a mixture at most $k$ many $d$-dimensional spherical Gaussian distributions $\mu_1,\cdots,\mu_{k_0}$ of identical and known variance $\sigma^2$ in each coordinate, such that the minimum $\ell^2$ distance between two distinct centers $y_l$ and $y_j$ is greater than $2\Delta\sigma \min\{\sqrt{d},\sqrt k\}$, where $\Delta>C_0$, and $C_0$ is a sufficiently large universal constant.

By Somnath Chakraborty, Hariharan Narayanan
arXiv Machine Learning
Jun 30

Clustering with Non-adaptive Subset Queries

arXiv:2409. 10908v3 Announce Type: replace-cross Abstract: Recovering the underlying $k$-clustering of a set $U$ of $n$ points by asking pair-wise same-cluster queries has garnered significant interest in the past few years.

By Hadley Black, Euiwoong Lee, Arya Mazumdar, Barna Saha