arXiv Machine Learning

Spectrum Is Not Enough: A Random-Matrix Account of Data-Free Preconditioning for Differentially Private Learning

arXiv:2610. 21312v1 Announce Type: new Abstract: Data-free preconditioning builds the Kronecker factors of KFAC from synthetic probes instead of private data.

arXiv Machine Learning
Oct 5

Trade-off Functions for DP-SGD with Subsampling based on Random Allocation: Tight Upper and Lower Bounds

arXiv:2605. 06259v3 Announce Type: replace Abstract: Within the $f$-DP framework, we derive a tight analysis of the trade-off function for Differentially Private Stochastic Gradient Descent (DP-SGD) with subsampling based on random allocation in which each sample is independently assigned to exactly one of $M$ minibatches per epoch, each minibatch corresponding to one of the $M$ SGD rounds within a single epoch.

By Marten van Dijk, Murat Bilgehan Ertan
arXiv AI
Jul 7

Hidden-State Privacy Has an Empty Middle

arXiv:2605. 24042v3 Announce Type: replace-cross Abstract: Of $1{,}536$ Gaussian release covariances we tested for single-layer hidden-state privacy, zero achieve both moderate utility and moderate privacy against an adaptive retrieval attacker.

By Alexander Okezue Bell
Hugging Face Trending Papers
Oct 29

The Precision Wall: An Optimizer-Dependent Boundary for Optimization under Power-Law Measurement Spectra

In low-rank matrix sensing of a rank-$D$ factor $U^\ast \in \mathbb{R}^{V \times D}$, replacing isotropic Gaussian designs with power-law measurement covariance $Σ= \mathrm{diag}(j^{-s})_{j=1}^V$ leaves the Burer--Monteiro landscape free of spurious local minima, yet division-normalised first-order optimizers stall above a critical exponent $s^\ast$. We trace this failure to a numerical precision wall.

arXiv Machine Learning
Sep 7

Privacy Failure in Split-LLM Training, The Returned Gradient Nullifies the Decoys

The paper reports a privacy breach in a two-node split‑LLM training system where the returned gradient reveals which data rows were real, despite the system passing standard privacy checks. By exploiting the fact that decoy rows produce zero gradients, an attacker can identify real rows with 100% accuracy across multiple runs. The authors demonstrate that adding gradient clipping and noise can mitigate the leak, but the system remains vulnerable to several untested attack vectors.

By Georgios Politis, Evangelos Pappas
arXiv Machine Learning
Jul 31

Kohn-Sham Spectral Embedding on Sparse Graphs at the Nishimori Temperature for Image Classification

arXiv:2607. 28428v1 Announce Type: new Abstract: We introduce Kohn--Sham Spectral Embedding (KSSE), a physics-inspired energy-based model replacing dense CNN classifiers with a sparse-graph spectral embedding evaluated at the Nishimori temperature of an associated Random-Bond Ising Model.

By V. S. Usatyuk, D. A. Sapozhnikov, S. I. Egorov