Daniel Russo
19 papers · 2013–2025 · 8 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 ↓+5 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (49) π Conference Polyglot Β· Silver π£ Hot Topic Early Bird π Interdisciplinary Bridge Β· Bronze π Academic Marathon Β· Half
π§
Keyword Pioneer
π
Trend Setter
π
Renaissance Researcher
(5)
π
Century Club Β· Bronze
ποΈ
Keyword Collector
(85)
Top co-authors
Research topics
Machine Learning
(16)
Optimization & Theory
(13)
Learning Types
(12)
Artificial Intelligence
(7)
Mathematics & Optimization
(6)
Core AI
(6)
Reinforcement Learning
(5)
Methods
(5)
Optimization
(5)
Natural Language Processing
(4)
Generation
(3)
Mathematics
(3)
Resources & Methods
(3)
Applications
(2)
Bayesian & Probabilistic
(2)
Keywords
regret bound
(6)
multi-armed bandit
(4)
markov decision process
(4)
thompson sampling
(4)
temporal difference learning
(3)
value function
(2)
reinforcement learning
(2)
information theory
(2)
counterspeech generation
(2)
best arm identification
(2)
mutual information
(2)
online optimization
(2)
regret minimization
(2)
bayesian optimization
(2)
large language model
(2)
gaussian process
(1)
feature selection
(1)
synthetic data generation
(1)
policy gradient
(1)
posterior sampling
(1)
Papers
EuroVerdict: A Multilingual Dataset for Verdict Generation Against Misinformation
ACL 2025
First-AID: the first Annotation Interface for grounded Dialogues
ACL 2025
NLP for Counterspeech against Hate and Misinformation (CSHAM)
ACL 2025
TrenTeam at Multilingual Counterspeech Generation: Multilingual Passage Re-Ranking Approaches for Knowledge-Driven Counterspeech Generation Against Hate
COLING 2025
An Information-Theoretic Analysis of Nonstationary Bandit Learning
ICML 2023
Countering Misinformation via Emotional Response Generation
EMNLP 2023
On the Statistical Benefits of Temporal Difference Learning
ICML 2023
Temporally-Consistent Survival Analysis
NeurIPS 2022
Learning to Stop with Surprisingly Few Samples
COLT 2021
On the Linear Convergence of Policy Gradient Methods for Finite MDPs
AISTATS 2021
Worst-Case Regret Bounds for Exploration via Randomized Value Functions
NeurIPS 2019
A Finite Time Analysis of Temporal Difference Learning With Linear Function Approximation
COLT 2018
Improving the Expected Improvement Algorithm
NeurIPS 2017
An Information-Theoretic Analysis of Thompson Sampling
JMLR 2016
Controlling Bias in Adaptive Data Analysis Using Information Theory
AISTATS 2016
Simple Bayesian Algorithms for Best Arm Identification
COLT 2016
Learning to Optimize via Information-Directed Sampling
NeurIPS 2014
Eluder Dimension and the Sample Complexity of Optimistic Exploration
NeurIPS 2013
(More) Efficient Reinforcement Learning via Posterior Sampling
NeurIPS 2013