arXiv Machine Learning September 21, 2026 By Saumya Goyal, Barnab\'as P\'oczos

Sparse Priors for Efficient Distribution Learning

Read the original on arXiv Machine Learning →

arXiv:2609. 20883v1 Announce Type: new Abstract: Despite the widespread use and success of generative AI techniques today, theoretical guarantees on learning a distribution supported in $d$ dimensions from $n$ samples degrade as $O(n^{-1/\Theta(d)})$, though shown to be minimax optimal.

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.

efficiency

arXiv Machine Learning

Jun 24

Separating Oblivious and Adaptive Models of Variable Selection

arXiv:2602. 16568v2 Announce Type: replace-cross Abstract: Sparse recovery is among the most well-studied problems in learning theory and high-dimensional statistics.

By Ziyun Chen, Jerry Li, Kevin Tian, Yusong Zhu

arXiv Machine Learning

Jun 16

Can Neural Networks Achieve Optimal Computational-statistical Tradeoff? An Analysis on Single-Index Model

arXiv:2606. 15219v1 Announce Type: new Abstract: In this work, we tackle the following question: Can neural networks trained with gradient-based methods achieve the optimal computational-statistical tradeoff in learning Gaussian single-index models?

By Siyu Chen, Beining Wu, Miao Lu, Zhuoran Yang, Tianhao Wang

efficiency

Hugging Face Trending Papers

Sep 21

Adversarially Robust PAC Learning with Optimal VC Rates

We study the problem of \emph{adversarially robust} PAC learning. In this framework, the learner observes independent samples from an unknown distribution over $\mathcal{X} \times \{0,1\}$, as in clas...

safety

arXiv Machine Learning

Jul 28

Efficient Learning of Truncated Boolean Product Distributions: Influence to the Rescue

arXiv:2607. 22889v1 Announce Type: new Abstract: Learning the natural parameters $z \in \mathbb{R}^n$ of discrete distributions $\mu_z$ from independent samples constrained to a subset $S \subseteq \{0,1\}^n$ is a foundational challenge in high-dimensional statistics.

By Rohan Chauhan, Ioannis Panageas

arXiv AI

Jun 9

How Deep Are Deep GPs, Really? A Sharp Threshold and a Non-Gaussian Limit for Compositional GPs

arXiv:2606. 08218v1 Announce Type: cross Abstract: Compositional priors describe the generic properties of layered functions in deep Bayesian models, where deep neural networks with random weights are a canonical example.

By Mark Kozdoba, Shie Mannor

multimodal

arXiv Machine Learning

Jul 28

Learning Distributions from Multiple Data Providers

arXiv:2607. 24732v1 Announce Type: cross Abstract: Motivated by learning from heterogeneous and overlapping data providers, we study a stylized model of distribution learning from restricted conditional samples.

By Jon Kleinberg, Amin Saberi, Xizhi Tan, Grigoris Velegkas

One email a morning, machine-written

Related stories

Separating Oblivious and Adaptive Models of Variable Selection

Can Neural Networks Achieve Optimal Computational-statistical Tradeoff? An Analysis on Single-Index Model

Adversarially Robust PAC Learning with Optimal VC Rates

Efficient Learning of Truncated Boolean Product Distributions: Influence to the Rescue

How Deep Are Deep GPs, Really? A Sharp Threshold and a Non-Gaussian Limit for Compositional GPs

Learning Distributions from Multiple Data Providers