arXiv Machine Learning June 3, 2026 By Yufan Huang, David F. Gleich

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

Read the original on arXiv Machine Learning →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. 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 24

Query Efficient Structured Matrix Learning

arXiv:2507.19290v2 Announce Type: replace-cross Abstract: We study the problem of learning a structured approximation (low-rank, sparse, banded, etc.) to an unknown matrix $A$ given access to matrix-...

By Noah Amsel, Pratyush Avi, Tyler Chen, Feyza Duman Keles, Chinmay Hegde, Cameron Musco, Christopher Musco, David Persson

arXiv Machine Learning

Jul 28

Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization

arXiv:2607. 24518v1 Announce Type: new Abstract: Symmetric non-negative matrix factorization (SymNMF) recovers latent group structure from a dependence matrix, but its dense, quadratic-memory objective has confined prior work to moderate sizes.

By Lavinia Ghita, Dhruv Desai, Jake Goldberg, Roman Yokunda Enzmann

benchmarks

arXiv Machine Learning

Jul 1

Direction-Magnitude Decomposition for Low-Rank Matrix Optimization: Faster Convergence and Saddle-to-saddle Dynamics

arXiv:2606. 31390v1 Announce Type: cross Abstract: Low-rank matrix optimization is often carried out via the Burer-Monteiro (BM) formulation, but choosing the factorization rank $r$ is delicate and can substantially slow optimization.

By Yudong Wei, Liang Zhang, Bingcong Li, Niao He

arXiv Machine Learning

Jun 19

Spectral DPPs via NEPv: A Scalable Continuous Relaxation of Determinantal MAP for Diversity-Aware Data Selection

arXiv:2606. 19411v1 Announce Type: new Abstract: Selecting a small, diverse, high-quality subset from a massive pool of candidates is a recurring primitive in modern machine learning -- data curation and coreset selection for training and fine-tuning large models, active-learning batch acquisition, prompt and exemplar selection for in-context learning, retrieval diversification, and experimental design.

By Richard Yi Da Xu

llms rag fine-tuning benchmarks

arXiv Machine Learning

Sep 10

Accelerated Frank-Wolfe Algorithms: Complementarity Conditions and Sparsity

arXiv:2511.02821v2 Announce Type: replace-cross Abstract: We develop new accelerated first-order algorithms in the Frank-Wolfe (FW) family for minimizing smooth convex functions over compact convex s...

By Dan Garber

efficiency

One email a morning, machine-written

Related stories

Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization

Query Efficient Structured Matrix Learning

Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization

Direction-Magnitude Decomposition for Low-Rank Matrix Optimization: Faster Convergence and Saddle-to-saddle Dynamics

Spectral DPPs via NEPv: A Scalable Continuous Relaxation of Determinantal MAP for Diversity-Aware Data Selection

Accelerated Frank-Wolfe Algorithms: Complementarity Conditions and Sparsity