20 results for “Distributed clustering”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
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…
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.
The paper proposes two distributed methods for selecting hyperparameters in peer-to-peer networks.
This paper presents Cohort Organized Learning (CoOL), a method for clustering data without explicit distance or similarity computations.
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.
This paper derives bounds on the probability of incorrect clustering of noisy short sequences using statistically optimal rules, focusing on DNA storage decoders.
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…
This paper studies the computational limits of clustering in a mixture of isotropic distributions in high dimensions.
This paper identifies the fundamental limits of hypergraph edge partitioning and presents a near-optimal algorithm for a broad class of probabilistic hypergraph models.
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…
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.
The paper presents almost optimal distributed algorithms for finding 2-ruling sets in graphs with bounded arboricity.