arXiv Machine Learning August 14, 2026 By Rajarshi Bhattacharjee, Ethan N. Epperly, Cameron Musco, Aaron Tian

Fast Length-Squared Sampling for Positive-Semidefinite Matrices

Read the original on arXiv Machine Learning →

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.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jul 21

Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization

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.

By Ria Stevens, Fangshuo Liao, Barbara Su, Thanasis Hadjidimoulas, Jianqiang Li, Anastasios Kyrillidis

benchmarks

arXiv Machine Learning

Aug 11

Understanding Alternating Minimization for Matrix Completion

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.

By Moritz Hardt

arXiv Machine Learning

Jun 10

Sample-efficient inductive matrix completion with noise and inexact side-information

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.

By Yuepeng Yang, Cong Ma

arXiv Machine Learning

Jun 26

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity

arXiv:2606. 27298v1 Announce Type: cross Abstract: We study the fundamental problem of learning a high-dimensional Gaussian truncated to an unknown halfspace.

By Haitong Liu, Deepak Narayanan Sridharan, David Steurer, Manuel Wiedmer

arXiv Machine Learning

Jun 24

Uniform Sampling from High-dimensional Spectral Norm Balls

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.

By Michael R. Metel

llms

arXiv Machine Learning

Jun 3

Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+

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.

By Yufan Huang, David F. Gleich

Related stories

Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization

Understanding Alternating Minimization for Matrix Completion

Sample-efficient inductive matrix completion with noise and inexact side-information

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity

Uniform Sampling from High-dimensional Spectral Norm Balls

Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+