conftrace_

Elchanan Mossel

22 papers · 2014–2025 · 3 conferences · across top CS/AI conferences

Achievements

Jump to papers ↓
+8 more ↓ πŸƒ Academic Marathon (11) πŸŒ‰ Interdisciplinary Bridge 🧭 Keyword Pioneer 🌍 Conference Polyglot (3) 🐝 Cross-Pollinator (9)
🐝 Cross-Pollinator (9) πŸ—ΊοΈ Taxonomy Completionist (26) 🧬 Topic Evolution ⚑ Prolific Year (5) πŸ”₯ Unstoppable (8) πŸ—ƒοΈ Keyword Collector (87) πŸ’Ž Century Club (22) ❓ The Questioner (2)

Conferences

COLT (18) NIPS (3) ICML (1)

Papers

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions COLT 2025 Stochastic block models with many communities and the Kesten–Stigum bound - extended abstract COLT 2025 Polynomial low degree hardness for Broadcasting on Trees (Extended Abstract) COLT 2025 Errors are Robustly Tamed in Cumulative Knowledge Processes COLT 2024 Reconstructing the Geometry of Random Geometric Graphs (Extended Abstract) COLT 2024 Finding Super-spreaders in Network Cascades COLT 2024 The power of an adversary in Glauber dynamics COLT 2024 Low Degree Hardness for Broadcasting on Trees NIPS 2024 Sharp thresholds in inference of planted subgraphs COLT 2023 A Mathematical Model for Curriculum Learning for Parities ICML 2023 Reconstruction on Trees and Low-Degree Polynomials NIPS 2022 Learning to Sample from Censored Markov Random Fields COLT 2021 Parallels Between Phase Transitions and Circuit Complexity? COLT 2020 Is your function low dimensional? COLT 2019 Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation COLT 2019 Reasoning in Bayesian Opinion Exchange Networks Is PSPACE-Hard COLT 2019 Contextual Stochastic Block Models NIPS 2018 The Vertex Sample Complexity of Free Energy is Polynomial COLT 2018 The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity COLT 2018 Density Evolution in the Degree-correlated Stochastic Block Model COLT 2016 MCMC Learning COLT 2015 Belief propagation, robust reconstruction and optimal recovery of block models COLT 2014