Skip to content
conftrace_

Constantinos Daskalakis

44 papers · 2014–2026 · 6 venues · across top CS/AI venues

Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.

Jump to papers ↓
+10 more ↓ 🗺️ Taxonomy Completionist (60) 🌍 Conference Polyglot · Silver 🏃 Academic Marathon · Half 🌉 Interdisciplinary Bridge · Silver 🐣 Hot Topic Early Bird
🔬 Deep Specialist (11) 🏆 Grand Slam 🗃️ Keyword Collector (211) 🚀 Conference Pioneer 🔥 Unstoppable · Bronze ❓ The Questioner (2) ⚡ Prolific Year · Productive 💎 Century Club · Bronze 🌈 Renaissance Researcher (6) 📈 Trend Setter

Papers

Estimating Ising Models in Total Variation Distance COLT 2026 High-Accuracy Log-Concave Sampling with Stochastic Queries COLT 2026 Is Efficient PAC Learning Possible with an Oracle That Responds "Yes" or "No"? COLT 2024 Maximizing utility in multi-agent environments by anticipating the behavior of other learners NeurIPS 2024 Near-Optimal Learning and Planning in Separated Latent MDPs COLT 2024 On Tractable Φ-Equilibria in Non-Concave Games NeurIPS 2024 Consistent Diffusion Models: Mitigating Sampling Drift by Learning to be Consistent NeurIPS 2023 Learning and Testing Latent-Tree Ising Models Efficiently COLT 2023 Online Learning and Solving Infinite Games with an ERM Oracle COLT 2023 STay-ON-the-Ridge: Guaranteed Convergence to Local Minimax Equilibrium in Nonconvex-Nonconcave Games COLT 2023 The Complexity of Markov Equilibrium in Stochastic Games COLT 2023 EM’s Convergence in Gaussian Latent Tree Models COLT 2022 How Good Are Low-Rank Approximations in Gaussian Process Regression? AAAI 2022 Score-Guided Intermediate Level Optimization: Fast Langevin Mixing for Inverse Problems ICML 2022 A Statistical Taylor Theorem and Extrapolation of Truncated Densities COLT 2021 Efficient Methods for Structured Nonconvex-Nonconcave Min-Max Optimization AISTATS 2021 Efficient Truncated Linear Regression with Unknown Noise Variance NeurIPS 2021 GANs with Conditional Independence Graphs: On Subadditivity of Probability Divergences AISTATS 2021 Near-Optimal No-Regret Learning in General Games NeurIPS 2021 Scalable Equilibrium Computation in Multi-agent Influence Games on Networks AAAI 2021 Statistical Estimation from Dependent Data ICML 2021 A Theoretical and Practical Framework for Regression and Classification from Truncated Samples AISTATS 2020 Constant-Expansion Suffices for Compressed Sensing with Generative Priors NeurIPS 2020 Independent Policy Gradient Methods for Competitive Reinforcement Learning NeurIPS 2020 Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems COLT 2020 Logistic regression with peer-group effects via inference in higher-order Ising models AISTATS 2020 SGD Learns One-Layer Networks in WGANs ICML 2020 Tight last-iterate convergence rates for no-regret learning in multi-player games NeurIPS 2020 Truncated Linear Regression in High Dimensions NeurIPS 2020 Computationally and Statistically Efficient Truncated Regression COLT 2019 Learning from Weakly Dependent Data under Dobrushin’s Condition COLT 2019 HOGWILD!-Gibbs can be PanAccurate NeurIPS 2018 Learning and Testing Causal Models with Interventions NeurIPS 2018 Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons NeurIPS 2018 Testing Symmetric Markov Chains From a Single Trajectory COLT 2018 The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization NeurIPS 2018 Training GANs with Optimism ICLR 2018 Concentration of Multilinear Functions of the Ising Model with Applications to Network Data NeurIPS 2017 Priv’IT: Private and Sample Efficient Identity Testing ICML 2017 Square Hellinger Subadditivity for Bayesian Networks and its Applications to Identity Testing COLT 2017 Ten Steps of EM Suffice for Mixtures of Two Gaussians COLT 2017 Optimal Testing for Properties of Distributions NeurIPS 2015 Optimum Statistical Estimation with Strategic Data Sources COLT 2015 Faster and Sample Near-Optimal Algorithms for Proper Learning Mixtures of Gaussians COLT 2014