Tim Roughgarden
16 papers · 2013–2024 · 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.
Achievements
Jump to papers ↓+6 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (25) π Academic Marathon Β· Half π Conference Polyglot Β· Silver π Interdisciplinary Bridge Β· Silver π£ Hot Topic Early Bird
π
Keyword Champion
π§
Keyword Pioneer
ποΈ
Keyword Collector
(83)
π
Century Club Β· Bronze
π₯
Unstoppable Β· Bronze
β
The Questioner
Top co-authors
Research topics
Machine Learning
(15)
Optimization & Theory
(14)
Mathematics & Optimization
(11)
Optimization
(11)
Artificial Intelligence
(6)
Core AI
(4)
Learning Types
(3)
Bayesian & Probabilistic Β· Artificial Intelligence
(2)
Core Methods
(2)
Computer Science
(1)
Security & Privacy
(1)
Application Areas
(1)
Bayesian & Probabilistic Β· Machine Learning
(1)
Differential Privacy
(1)
Foundations
(1)
Keywords
online learning
(4)
submodular maximization
(3)
regret bound
(3)
mechanism design
(2)
approximation algorithm
(2)
coordinate-wise concavity
(2)
zero-sum game
(2)
continuous optimization
(2)
incentive compatibility
(2)
proper scoring rule
(2)
inference algorithm
(2)
revenue optimization
(2)
computational complexity
(1)
sample complexity
(1)
probabilistic inference
(1)
statistical learning theory
(1)
adversarial learning
(1)
statistical learning
(1)
structured prediction
(1)
probabilistic prediction
(1)
Papers
Online Stackelberg Optimization via Nonlinear Control
COLT 2024
Formalizing Preferences Over Runtime Distributions
ICML 2023
No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling
NeurIPS 2023
Utilitarian Algorithm Configuration
NeurIPS 2023
Strictly Proper Contract Functions Can Be Arbitrage-Free
AAAI 2022
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization
JMLR 2020
Smoothed Analysis of Online and Differentially Private Learning
NeurIPS 2020
On the Computational Power of Online Gradient Descent
COLT 2019
An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization
COLT 2018
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization
NeurIPS 2018
Online Prediction with Selfish Experts
NeurIPS 2017
Learning Simple Auctions
COLT 2016
Why Prices Need Algorithms
IJCAI 2016
How Hard is Inference for Structured Prediction?
ICML 2015
On the Pseudo-Dimension of Nearly Optimal Auctions
NeurIPS 2015
Marginals-to-Models Reducibility
NeurIPS 2013