Constantinos Daskalakis
42 papers · 2014–2024 · 6 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+13 more ↓ Show less ↑
π Conference Polyglot (6) π£ Hot Topic Early Bird π Interdisciplinary Bridge π§ Keyword Pioneer π Academic Marathon (10)
π
Conference Polyglot
(6)
π§
Keyword Pioneer
πΊοΈ
Taxonomy Completionist
(51)
π¬
Deep Specialist
(10)
π
Grand Slam
π
Keyword Champion
ποΈ
Keyword Collector
(186)
β‘
Prolific Year
(7)
π
Conference Pioneer
π
Century Club
(42)
π₯
Unstoppable
(8)
π
Trend Setter
β
The Questioner
(2)
Conferences
COLT (16)
NIPS (15)
AISTATS (4)
ICML (4)
AAAI (2)
ICLR (1)
Top co-authors
Research topics
Keywords
sample complexity
(6)
stochastic gradient descent
(5)
total variation distance
(4)
game theory
(4)
graphical model
(4)
maximum likelihood estimation
(4)
distribution testing
(3)
multi-agent system
(3)
min-max optimization
(3)
hypothesis testing
(3)
markov random field
(3)
logistic regression
(3)
online learning
(2)
equilibrium computation
(2)
statistical estimation
(2)
no-regret learning
(2)
vc dimension
(2)
compressed sensing
(2)
empirical risk minimization
(2)
expectation maximization
(2)
Papers
Maximizing utility in multi-agent environments by anticipating the behavior of other learners
NIPS 2024
Is Efficient PAC Learning Possible with an Oracle That Responds "Yes" or "No"?
COLT 2024
Near-Optimal Learning and Planning in Separated Latent MDPs
COLT 2024
On Tractable $\Phi$-Equilibria in Non-Concave Games
NIPS 2024
STay-ON-the-Ridge: Guaranteed Convergence to Local Minimax Equilibrium in Nonconvex-Nonconcave Games
COLT 2023
Consistent Diffusion Models: Mitigating Sampling Drift by Learning to be Consistent
NIPS 2023
Online Learning and Solving Infinite Games with an ERM Oracle
COLT 2023
Learning and Testing Latent-Tree Ising Models Efficiently
COLT 2023
The Complexity of Markov Equilibrium in Stochastic Games
COLT 2023
Score-Guided Intermediate Level Optimization: Fast Langevin Mixing for Inverse Problems
ICML 2022
How Good Are Low-Rank Approximations in Gaussian Process Regression?
AAAI 2022
EMβs Convergence in Gaussian Latent Tree Models
COLT 2022
Near-Optimal No-Regret Learning in General Games
NIPS 2021
Scalable Equilibrium Computation in Multi-agent Influence Games on Networks
AAAI 2021
A Statistical Taylor Theorem and Extrapolation of Truncated Densities
COLT 2021
Efficient Methods for Structured Nonconvex-Nonconcave Min-Max Optimization
AISTATS 2021
GANs with Conditional Independence Graphs: On Subadditivity of Probability Divergences
AISTATS 2021
Statistical Estimation from Dependent Data
ICML 2021
Efficient Truncated Linear Regression with Unknown Noise Variance
NIPS 2021
Tight last-iterate convergence rates for no-regret learning in multi-player games
NIPS 2020
Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems
COLT 2020
Constant-Expansion Suffices for Compressed Sensing with Generative Priors
NIPS 2020
Truncated Linear Regression in High Dimensions
NIPS 2020
Independent Policy Gradient Methods for Competitive Reinforcement Learning
NIPS 2020
SGD Learns One-Layer Networks in WGANs
ICML 2020
Logistic regression with peer-group effects via inference in higher-order Ising models
AISTATS 2020
A Theoretical and Practical Framework for Regression and Classification from Truncated Samples
AISTATS 2020
Learning from Weakly Dependent Data under Dobrushinβs Condition
COLT 2019
Computationally and Statistically Efficient Truncated Regression
COLT 2019
HOGWILD!-Gibbs can be PanAccurate
NIPS 2018
Learning and Testing Causal Models with Interventions
NIPS 2018
Training GANs with Optimism
ICLR 2018
Testing Symmetric Markov Chains From a Single Trajectory
COLT 2018
The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization
NIPS 2018
Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons
NIPS 2018
Concentration of Multilinear Functions of the Ising Model with Applications to Network Data
NIPS 2017
Ten Steps of EM Suffice for Mixtures of Two Gaussians
COLT 2017
Square Hellinger Subadditivity for Bayesian Networks and its Applications to Identity Testing
COLT 2017
PrivβIT: Private and Sample Efficient Identity Testing
ICML 2017
Optimum Statistical Estimation with Strategic Data Sources
COLT 2015
Optimal Testing for Properties of Distributions
NIPS 2015
Faster and Sample Near-Optimal Algorithms for Proper Learning Mixtures of Gaussians
COLT 2014