arXiv Machine Learning October 3, 2026 By Andrea Pietracaprina, Geppino Pucci, Stefano Zanon

Streaming algorithms for robust max-min diversification

Read the original on arXiv Machine Learning →

arXiv:2610. 01456v1 Announce Type: new Abstract: Given a set of $n$ points $X$ in a metric space and an integer $k$, max-min diversification aims to select $k$ points of $X$ maximizing their minimum pairwise distance.

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

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

Sep 15

Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation

arXiv:2510.23039v2 Announce Type: replace Abstract: Approximate Nearest Neighbor (ANN) search and Approximate Kernel Density Estimation (A-KDE) are fundamental problems at the core of modern machine...

By Ved Danait, Srijan Das, Sujoy Bhore

arXiv Machine Learning

Jun 25

Robust Linear Predictions: Analyses of Uniform Concentration, Fast Rates and Model Misspecification

arXiv:2201. 01973v3 Announce Type: replace-cross Abstract: The problem of linear predictions has been extensively studied for the past century under pretty generalized frameworks.

By Saptarshi Chakraborty, Debolina Paul, Swagatam Das

arXiv Machine Learning

6d ago

Consistent Submodular Maximization with Full Foresight

The paper studies online algorithms for monotone submodular maximization with full knowledge of the future and unlimited computation. It establishes optimal approximation thresholds of 3/4 for deterministic algorithms and approximately 0.7942 for randomized algorithms, while allowing a constant number of changes per step. The authors provide matching impossibility results and achieve these bounds by balancing preparation for future arrivals with protection of the current solution, using techniques such as interval-selection analysis for randomized algorithms and certificate-based rounding for deterministic ones.

By Eric Balkanski, Paul D\"utting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson, Morteza Zadimoghaddam

arXiv Machine Learning

Jul 31

First-order Constrained Trilevel Optimization Over Distributed Networks for Robust Coreset Selection

arXiv:2607. 27632v1 Announce Type: new Abstract: With the rapid advancement of the Internet of Things (IoT), massive amounts of data are generated across distributed edge networks.

By Yang Jiao (Richard), Kaixuan Jiao (Richard), Kai Yang (Richard), Nadjib Aitsaadi (Richard), Ilhem Fajjari (Richard), Renwei (Richard), Li

safety

arXiv Machine Learning

Jun 2

Dimensionality Reduction for Robust Federated Learning: A Theoretical Analysis and Convergence Guarantee

arXiv:2605. 28335v2 Announce Type: replace Abstract: Federated Learning (FL) enables multiple clients to collaboratively train models without sharing raw data, but it is highly vulnerable to Byzantine attacks.

By Shiyuan Zuo, Jiashuo Li, Rongfei Fan, Han Hu, Jie Xu

rag benchmarks

One email a morning, machine-written

Related stories

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

Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation

Robust Linear Predictions: Analyses of Uniform Concentration, Fast Rates and Model Misspecification

Consistent Submodular Maximization with Full Foresight

First-order Constrained Trilevel Optimization Over Distributed Networks for Robust Coreset Selection

Dimensionality Reduction for Robust Federated Learning: A Theoretical Analysis and Convergence Guarantee