arXiv Machine Learning August 18, 2026 By Richard Yi Da Xu

Spectral Certificates and Projection-DPP Rounding for Determinantal MAP Selection

Read the original on arXiv Machine Learning →

arXiv:2606. 19411v3 Announce Type: replace Abstract: Selecting a fixed-size subset that maximizes the determinant of a positive semidefinite kernel is the MAP problem for a size-constrained determinantal point process and the classical maximum-entropy sampling problem.

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

Sep 10

A Subsampled Davis-Kahan Bound for Large-Scale Eigenspace Estimation

arXiv:2609.09211v1 Announce Type: new Abstract: The Davis-Kahan theorem is a fundamental tool in spectral analysis, providing quantitative control over the distance between the eigenspaces of a symme...

By Huan Qing

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

Sep 10

A Nuclear-Norm Lower Bound for Dithered Scalar Quantization of Matrix Products

arXiv:2609.05641v1 Announce Type: cross Abstract: We consider the problem of minimizing error in quantized matrix multiplication $C=AB$. Scalar quantization of the factors introduces rounding errors...

By Piyush Sao, Narasinga Miniskar, Pedro Valero-Lara, Keita Teranishi, Sudip Seal

efficiency

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

Jun 10

The hyper-scaled NLP bound for maximum-entropy remote sampling

arXiv:2601. 20970v3 Announce Type: replace-cross Abstract: The maximum-entropy remote sampling problem (MERSP) is to select a subset of $s$ random variables from a set of $n$ random variables, so as to maximize the information concerning a set of target random variables that are not directly observable.

By Gabriel Ponte, Marcia Fampa, Jon Lee

nlp benchmarks

One email a morning, machine-written

Related stories

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

A Subsampled Davis-Kahan Bound for Large-Scale Eigenspace Estimation

Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization

A Nuclear-Norm Lower Bound for Dithered Scalar Quantization of Matrix Products

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

The hyper-scaled NLP bound for maximum-entropy remote sampling