arXiv:2608. 12503v1 Announce Type: cross Abstract: We describe a simple rejection-sampling-based algorithm to perform length-squared sampling on an $n \times n$ positive-semidefinite (psd) matrix: that is, to sample a column with probability proportional to its squared $\ell_2$-norm.
arXiv:2602. 20376v3 Announce Type: replace-cross Abstract: We study the problem of maximizing a complex-valued quadratic form over the $K^{\text{th}}$ roots of unity.
arXiv:1312. 0925v4 Announce Type: replace Abstract: Alternating Minimization is a widely used and empirically successful heuristic for matrix completion and related low-rank optimization problems.
arXiv:2605. 17189v2 Announce Type: replace-cross Abstract: Inductive matrix completion (IMC) is a variant of low-rank matrix completion that incorporates row and column side-information.
arXiv:2606. 27298v1 Announce Type: cross Abstract: We study the fundamental problem of learning a high-dimensional Gaussian truncated to an unknown halfspace.
arXiv:2606. 24134v1 Announce Type: cross Abstract: Motivated by an application in machine learning optimization, this paper focuses on the challenges of sampling a matrix uniformly from the unit spectral norm ball.
arXiv:2406. 10407v3 Announce Type: replace-cross Abstract: Semidefinite programs (SDPs) and their solvers are powerful tools with many applications in machine learning and data science.
arXiv:2606. 23867v1 Announce Type: new Abstract: The exact computation of the Normalized Maximum Likelihood (NML) codelength for regular non-smooth estimators (e.
arXiv:2505. 10882v2 Announce Type: replace Abstract: Principal component analysis classically requires full $d$-dimensional samples, yet in various applications hardware limits acquisition to a few scalar measurements per sample.
arXiv:2602. 05869v2 Announce Type: replace-cross Abstract: We introduce Wedge Sampling, a new non-adaptive sampling scheme for low-rank tensor completion.
arXiv:2606. 15679v1 Announce Type: cross Abstract: Stochastic trace estimation is a standard tool for approximating the trace of a large-scale matrix available only through matrix-vector products.
arXiv:2605. 25303v3 Announce Type: replace-cross Abstract: The $2 \rightarrow q$ norm of a matrix $X \in \mathbb{R}^{n \times d}$ is defined as $\lVert X \rVert_{2 \rightarrow q} = \sup_{\lVert v \rVert_2 = 1} \lVert Xv \rVert_q$.
arXiv:2607. 00252v1 Announce Type: new Abstract: We present an algorithm for the group distributionally robust (GDR) least squares problem.