arXiv Machine Learning July 7, 2026 By Shuheng Zhou

Semidefinite programming relaxations and debiasing for MAXCUT-based clustering

Read the original on arXiv Machine Learning →

arXiv:2401. 10927v3 Announce Type: replace-cross Abstract: In this paper, we consider the problem of partitioning a small data sample of size $n$ drawn from a mixture of $2$ sub-gaussian distributions in $\mathbb{R}^p$.

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 Statistics ML

Aug 25

Spectral partitioning for $k$-block averaging kernels of finite Markov chains

arXiv:2608.21466v1 Announce Type: new Abstract: We develop spectral algorithms for selecting state-space partitions that define averaging kernels for finite, ergodic and reversible Markov chains. For...

By Michael C. H. Choi, Youjia Wang

rag

arXiv Machine Learning

Sep 10

Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling

arXiv:2609.06394v1 Announce Type: cross Abstract: Massive datasets in modern machine learning have made data reduction a central challenge, particularly for clustering tasks where memory and computat...

By Diptarka Chakraborty, Satyaki Mukherjee, Gaurav Vallabhdas Revankar, Hoang-Son Tran

benchmarks

arXiv Machine Learning

Jul 14

Learning Partition Trees for Nearest Neighbor Search

arXiv:2607. 09909v1 Announce Type: cross Abstract: We study nearest neighbor search from the perspective of data-driven algorithm design: given a dataset $P \subset \mathbb{R}^d$ of size $n$ and sample access to a query distribution over $\mathbb{R}^d$, the goal is to learn a data structure optimized for queries drawn from that specific distribution.

By Sanjeev Khanna, Ashwin Padaki, Erik Waingarten

arXiv Machine Learning

Jun 2

Dimension Reduction via Sum-of-Squares and Improved Clustering Algorithms for Non-Spherical Mixtures

arXiv:2411. 12438v2 Announce Type: replace-cross Abstract: We develop a new approach for clustering non-spherical (i.

By Prashanti Anderson, Mitali Bafna, Rares-Darius Buhai, Pravesh K. Kothari, David Steurer

benchmarks

arXiv Machine Learning

Jul 17

Spectral Concentration and Recovery in Sparse High-Dimensional Random Geometric Graphs

arXiv:2607. 14304v1 Announce Type: cross Abstract: We study sparse random geometric graphs generated by connecting pairs of high-dimensional vectors whose inner product exceeds a threshold.

By Manuel Fernandez V, Yizhe Zhu

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

One email a morning, machine-written

Related stories

Spectral partitioning for $k$-block averaging kernels of finite Markov chains

Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling

Learning Partition Trees for Nearest Neighbor Search

Dimension Reduction via Sum-of-Squares and Improved Clustering Algorithms for Non-Spherical Mixtures

Spectral Concentration and Recovery in Sparse High-Dimensional Random Geometric Graphs

Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization