Research map / Learning theory and algorithms / Clustering
KwikBucks: Correlation Clustering with Cheap-Weak and Expensive-Strong Signals
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
- Query-Efficient Correlation Clustering with Noisy Oracle (NeurIPS 2024 · similarity 0.89)
- Metric $k$-clustering using only Weak Comparison Oracles (ICLR 2026 · similarity 0.88)
- Efficient Testing for Correlation Clustering: Improved Algorithms and Optimal Bounds (ICLR 2026 · similarity 0.88)
- Correlation Clustering with Adaptive Similarity Queries (NeurIPS 2019 · similarity 0.87)
- Relative Error Fair Clustering in the Weak-Strong Oracle Model (ICML 2025 · similarity 0.85)
- Learning-Augmented Streaming Algorithms for Correlation Clustering (NeurIPS 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.