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.

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

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

arXiv Machine Learning

2d ago

High-dimensional nonparametric changepoint detection via low-rank degree-two density projection

arXiv:2608. 13922v1 Announce Type: new Abstract: Detecting distributional changes in high dimension is difficult when neither the pre-change nor post-change density is parametrically specified.

By Guoqing Zhang, Zhaixin Chen

efficiency benchmarks

arXiv Machine Learning

Jun 24

Exact Schur-Sylvester Dimensionality Reductions for Non-Smooth Stochastic Complexity and Manifold Sampling

arXiv:2606. 23867v1 Announce Type: new Abstract: The exact computation of the Normalized Maximum Likelihood (NML) codelength for regular non-smooth estimators (e.

By Trenton Lau, Gary P. T. Choi

benchmarks

arXiv Machine Learning

Jul 22

Contraction-Gauge Preconditioning for Quantized Matrix Multiplication

arXiv:2607. 18745v1 Announce Type: new Abstract: We study low-precision computation of C=AB with both factors quantized.

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

efficiency

Related stories

Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization

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

High-dimensional nonparametric changepoint detection via low-rank degree-two density projection

Exact Schur-Sylvester Dimensionality Reductions for Non-Smooth Stochastic Complexity and Manifold Sampling

Contraction-Gauge Preconditioning for Quantized Matrix Multiplication