For an arbitrary isotropic log-concave distribution $P$ on $\mathbb{R}^d$, we prove that the polynomial $(Cm)^m\|v\|_2^m - \mathbb{E}_{X\sim P}\langle X,v\rangle^m$ is a sum of squares for every even $m\ge2$, where $C>0$ is a universal constant. This removes the dependence on the Poincaré constant in the theorem of Kothari and Steinhardt (arXiv:1711.
arXiv:2608. 09870v1 Announce Type: cross Abstract: Uniform stability is a classical tool for controlling the generalization error of a learning algorithm.
By Thanh Nguyen-Cung, Binh T. Nguyen
arXiv:2607. 25492v2 Announce Type: replace Abstract: We study stochastic optimization with heavy-tailed gradient noise.
By Bin Luo, Chengchang Liu, Jonathan Allcock, Shengyu Zhang, John C. S. Lui
We study learning a discrete distribution under person-level differential privacy in the batched setting. Given $n$ users, each contributing $m$ i.
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...
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.
By M. J. Wainwright
arXiv:2610.27022v1 Announce Type: cross
Abstract: We study Gaussian kernel approximation and regularized logistic classification on a connected compact smooth embedded manifold $X\subset\mathbb R^d$...
By Guanhang Lei, Lei Shi, Xiaoming Yuan
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...
By Steve Hanneke, Amirreza Shaeiri
The paper introduces SPLICE, a differentially private synthetic data algorithm that uses noisy sliced Chebyshev polynomial moments to fit a distribution. SPLICE achieves a Sliced Wasserstein-1 distance of ∼O(1/√n) from the target distribution, a bound that does not depend on the data dimension. The authors also prove a new moment‑matching result and provide a practical implementation that outperforms existing DP synthetic data methods on a large benchmark.
By Lucas Rosenblatt, R. Teal Witter, Christopher Musco
arXiv:2609. 27860v1 Announce Type: new Abstract: A pointwise-unbiased one-bit compressor reconstructs every real input in expectation while transmitting one bit.
By Tao Jiang, Minbo Gao, Shaowei Cai
arXiv:2610. 31612v1 Announce Type: new Abstract: We study learning a discrete distribution under person-level differential privacy in the batched setting.
By Gautam Kamath, Mahbod Majid, Ankur Moitra, Argyris Mouzakis, Jonathan Ullman
The paper investigates how well two-stage structured Hadamard rotations approximate uniform random rotations in high-dimensional spaces. It establishes nonasymptotic upper bounds of order √{log d/d} for one-dimensional marginals, while showing a persistent Wasserstein-1 discrepancy for the full vector that does not vanish as dimension grows. These results highlight a separation between marginal and joint approximation quality, though they do not directly translate into algorithmic performance guarantees.
By Tomer Zilca, Gal Mendelson