Research map / Learning theory and algorithms / Clustering

Convex Clustering Redefined: Robust Learning with the Median of Means Estimator

AAAI 2026 · Learning theory and algorithms › Clustering · approach: Clustering approximation algorithms · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Closest papers by meaning

• An Efficient Semismooth Newton based Algorithm for Convex Clustering (ICML 2018 · similarity 0.89)
• Uniform Concentration Bounds toward a Unified Framework for Robust Clustering (NeurIPS 2021 · similarity 0.89)
• Near-optimal Coresets for Robust Clustering (ICLR 2023 · similarity 0.88)
• Improved Learning-augmented Algorithms for k-means and k-medians Clustering (ICLR 2023 · similarity 0.88)
• Average Sensitivity of Hierarchical $k$-Median Clustering (ICML 2025 · similarity 0.87)
• Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling (NeurIPS 2026 · similarity 0.86)