arXiv Statistics ML
Information-Theoretic Bounds for Sparse Covariance Estimation in the Vertical-Split Distributed Model
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Statistics ML
Aug 25
Tensor-normal maximum likelihood estimation at the operator-norm sample threshold
arXiv:2608.10488v2 Announce Type: replace-cross Abstract: Let $X_1,\ldots,X_n$ be independent Gaussian tensors in $\mathbb{R}^{d_1}\otimes\cdots\otimes\mathbb{R}^{d_k}$ with a common covariance matri...
arXiv AI
Jun 2
Information-Theoretic Lower Bounds for Bit-Constrained Stochastic Optimization via a Reduction to Compressed Gaussian Mean Estimation
arXiv:2606. 00703v1 Announce Type: cross Abstract: Low-precision pretraining (FP8, MXFP4, NVFP4) is now standard for frontier language models, yet the literature is almost entirely achievability -- algorithms and empirical scaling laws -- with no matching characterization of what is information-theoretically possible.
arXiv Machine Learning
Sep 10
Tight Lower Bounds for State Tomography with Limited Entanglement
arXiv:2609.05718v1 Announce Type: cross Abstract: We study state tomography when each measurement acts on at most $k$ fresh copies and no quantum memory is retained between blocks. We prove a lower b...
arXiv Machine Learning
Jul 14
Demixing Sparse Signals from Nonlinear Observations using Generalized Non-convex Regularization
arXiv:2607. 10618v1 Announce Type: cross Abstract: We consider the recovery of a pair of sparse vectors from a limited number of nonlinear observations of their superposition: $y_i=g(\inner{\ba_i}{\bPhi\bw^\ast+\bPsi\bz^\ast})+e_i$, $i=1,\dots,m$, with $m\ll n$, incoherent orthonormal bases $\bPhi,\bPsi$, a scalar link $g$, and noise $e_i$ that may be heavy-tailed or contaminated.
arXiv Machine Learning
Aug 14
Minimax and Adaptive Covariance Matrix Estimation under Differential Privacy
arXiv:2603. 19703v2 Announce Type: replace-cross Abstract: Estimating covariance matrices is fundamental to a wide range of statistical applications.
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.