ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Distributed clustering”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.DSTheoreticalRecentJun 15, 2026

Approximation Preserving Coresets

Milind Prabhu, Chris Schwiegelshohn, Sudarshan Shyam

This paper introduces approximation-preserving coresets, which provide weaker guarantees than strong coresets but stronger guarantees than weak coresets for preserving the costs of good solutions in b…

View →
cs.LGstat.MLEmpiricalRecentJul 22, 2026

Efficient Clustering with Provable Guardrails for LLM Inference at Scale

Longshaokan Wang, Wai Tsang Keung, Punit Ghodasara, Roman Wang +2 more

This paper proposes a two-stage clustering algorithm to ensure per-sample guardrails in LLM-based applications, reducing inference cost and latency.

View →
math.OCcs.MAEmpiricalRecentOct 30, 2026

Distributed Grid Search for Hyperparameter Tuning

Constança De Herdeiro Cachim, Andrea Martin, Nicola Bastianello

The paper proposes two distributed methods for selecting hyperparameters in peer-to-peer networks.

View →
cs.MAcs.AIEmpiricalRecentJun 19, 2026

Cohort Organized Learning: Clustering Through Agreement

Finn Henry O'Shea, Maria Elena Monzani

This paper presents Cohort Organized Learning (CoOL), a method for clustering data without explicit distance or similarity computations.

View →
cs.IREmpiricalRecentJun 11, 2026

The Clustering Strikes Back: Building Cost-Effective and High-Performance ANNS at Scale with Helmsman

Yuchen Huang, Baiteng Ma, Yiping Sun, Yang Shi +6 more

The authors present HELMSMAN, a high-performance and cost-effective clustering-based ANNS system for large-scale social networks.

View →
cs.ITTheoreticalRecentJun 19, 2026

Error Exponent Bounds for Optimal Short-Read Clustering

Yoav Chachamovitz, Nir Weinberger

This paper derives bounds on the probability of incorrect clustering of noisy short sequences using statistically optimal rules, focusing on DNA storage decoders.

View →
cs.CLRecentMay 31, 2026

Agentic Clustering: Controllable Text Taxonomies via Multi-Agent Refinement

Simon Löwe, Emily Silcock

The paper introduces an agentic framework for text clustering that dynamically adapts the taxonomy generation process using specialized LLM agents, achieving state-of-the-art performance on multiple b…

View →
stat.MLcs.LGTheoreticalRecentOct 27, 2026

Low-degree polynomials lower bounds for clustering in small dimension

Alexandra Carpentier, Nicolas Verzelen

This paper studies the computational limits of clustering in a mixture of isotropic distributions in high dimensions.

View →
cs.ITTheoreticalRecentJun 11, 2026

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling

Javad Maheri, K. K. Krishnan Namboodiri, Petros Elia

This paper identifies the fundamental limits of hypergraph edge partitioning and presents a near-optimal algorithm for a broad class of probabilistic hypergraph models.

View →
cs.CRcs.LGeess.SPMar 27, 2026

On the Optimal Number of Grids for Differentially Private Non-Interactive $K$-Means Clustering

Gokularam Muthukrishnan, Anshoo Tandon

This paper proposes a principled, theoretically derived rule for selecting the optimal grid size in differentially private non-interactive K-Means clustering, improving accuracy over existing empirica…

View →
cs.LGcs.DBcs.IREmpiricalRecentJun 9, 2026

Flash-GMM: A Memory-Efficient Kernel for Scalable Soft Clustering

Gal Bloch, Ariel Gera, Matan Orbach, Ohad Eytan +1 more

This paper presents Flash-GMM, a new kernel for efficient computation of Gaussian Mixture Models on large-scale data.

View →
cs.DScs.DCTheoreticalRecentJun 10, 2026

Near-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity

Malte Baumecker, Rustam Latypov, Yannic Maus, Jara Uitto

The paper presents almost optimal distributed algorithms for finding 2-ruling sets in graphs with bounded arboricity.

View →