conftrace_

Moses Charikar

21 papers · 2014–2026 · 5 conferences · across top CS/AI conferences

Achievements

Jump to papers ↓
+9 more ↓ πŸƒ Academic Marathon (11) 🧭 Keyword Pioneer πŸŒ‰ Interdisciplinary Bridge 🌍 Conference Polyglot (4) 🐝 Cross-Pollinator (14)
🐝 Cross-Pollinator (14) 🌈 Renaissance Researcher (5) πŸ—ΊοΈ Taxonomy Completionist (37) πŸ† Keyword Champion (2) πŸ—ƒοΈ Keyword Collector (82) πŸ’Ž Century Club (20) πŸ“ˆ Trend Setter ❓ The Questioner πŸ”₯ Unstoppable (12)

Conferences

COLT (7) NIPS (6) ICML (4) AISTATS (3) ALT (1)

Papers

Pareto-optimal Non-uniform Language Generation ALT 2026 Correlation Clustering Beyond the Pivot Algorithm ICML 2025 Exploring Facets of Language Generation in the Limit COLT 2025 Quantifying the Gain in Weak-to-Strong Generalization NIPS 2024 Fast Algorithms for a New Relaxation of Optimal Transport COLT 2023 Simple, Scalable and Effective Clustering via One-Dimensional Projections NIPS 2023 On the Efficient Implementation of High Accuracy Optimality of Profile Maximum Likelihood NIPS 2022 The Bethe and Sinkhorn Permanents of Low Rank Matrices and Implications for Profile Maximum Likelihood COLT 2021 Approximation Algorithms for Orthogonal Non-negative Matrix Factorization AISTATS 2021 Instance Based Approximations to Profile Maximum Likelihood NIPS 2020 Recovery Guarantees For Quadratic Tensors With Sparse Observations AISTATS 2019 Hierarchical Clustering for Euclidean Data AISTATS 2019 Rehashing Kernel Evaluation in High Dimensions ICML 2019 A General Framework for Symmetric Property Estimation NIPS 2019 Hierarchical Clustering with Structural Constraints ICML 2018 Local Density Estimation in High Dimensions ICML 2018 A Hitting Time Analysis of Stochastic Gradient Langevin Dynamics COLT 2017 Avoiding Imposters and Delinquents: Adversarial Crowdsourcing and Peer Prediction NIPS 2016 Label optimal regret bounds for online local learning COLT 2015 Uniqueness of Tensor Decompositions with Applications to Polynomial Identifiability COLT 2014 Open Problem: Tensor Decompositions: Algorithms up to the Uniqueness Threshold? COLT 2014