Michael Bowling
44 papers · 2006–2026 · 8 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+14 more ↓ Show less ↑
π£ Hot Topic Early Bird π Interdisciplinary Bridge π§ Keyword Pioneer πΊοΈ Taxonomy Completionist (22) π Conference Polyglot (7)
πΊοΈ
Taxonomy Completionist
(22)
π
Conference Polyglot
(7)
π
Renaissance Researcher
(6)
π
Keyword Trendsetter Combo
(3)
π
Keyword Champion
π¬
Deep Specialist
(16)
π§¬
Topic Evolution
π
Grand Slam
π
Century Club
(43)
π
Conference Pioneer
π
Trend Setter
ποΈ
Keyword Collector
(78)
β‘
Prolific Year
(5)
π₯
Unstoppable
(11)
Conferences
NIPS (16)
IJCAI (9)
ICML (8)
AAAI (6)
JMLR (2)
AISTATS (1)
EACL (1)
ICLR (1)
Top co-authors
Keywords
reinforcement learning
(11)
game theory
(8)
counterfactual regret minimization
(6)
variance reduction
(5)
extensive-form game
(5)
nash equilibrium
(4)
function approximation
(4)
partial observability
(3)
extensive games
(3)
multi-agent learning
(3)
regret minimization
(3)
multi-agent system
(3)
multi-agent reinforcement learning
(3)
bayesian inference
(2)
representation learning
(2)
zero-sum game
(2)
worst-case performance
(2)
deep reinforcement learning
(2)
imperfect information
(2)
importance sampling
(2)
Papers
KETCHUP: K-Step Return Estimation for Sequential Knowledge Distillation
EACL 2026
Model-Based Exploration in Monitored Markov Decision Processes
ICML 2025
A Method for Evaluating Hyperparameter Sensitivity in Reinforcement Learning
NIPS 2024
Learning Not to Regret
AAAI 2024
Proper Laplacian Representation Learning
ICLR 2024
Real-Time Recurrent Learning using Trace Units in Reinforcement Learning
NIPS 2024
Beyond Optimism: Exploration With Partially Observable Rewards
NIPS 2024
Rethinking Formal Models of Partially Observable Multiagent Decision Making (Extended Abstract)
IJCAI 2023
Temporal Abstraction in Reinforcement Learning with the Successor Representation
JMLR 2023
Settling the Reward Hypothesis
ICML 2023
Approximate Exploitability: Learning a Best Response
IJCAI 2022
Learning Curricula for Humans: An Empirical Study with Puzzles from The Witness
IJCAI 2022
Solving Common-Payoff Games with Approximate Policy Iteration
AAAI 2021
Efficient Deviation Types and Learning for Hindsight Rationality in Extensive-Form Games
ICML 2021
Hindsight and Sequential Rationality of Correlated Play
AAAI 2021
Low-Variance and Zero-Variance Baselines for Extensive-Form Games
ICML 2020
Count-Based Exploration with the Successor Representation
AAAI 2020
Marginal Utility for Planning in Continuous or Large Discrete Action Spaces
NIPS 2020
Variance Reduction in Monte Carlo Counterfactual Regret Minimization (VR-MCCFR) for Extensive Form Games Using Baselines
AAAI 2019
Ease-of-Teaching and Language Structure from Emergent Communication
NIPS 2019
Solving Large Extensive-Form Games with Strategy Constraints
AAAI 2019
Bayesian Action Decoder for Deep Multi-Agent Reinforcement Learning
ICML 2019
Actor-Critic Policy Optimization in Partially Observable Multiagent Environments
NIPS 2018
Revisiting the Arcade Learning Environment: Evaluation Protocols and Open Problems for General Agents (Extended Abstract)
IJCAI 2018
A Laplacian Framework for Option Discovery in Reinforcement Learning
ICML 2017
The Forget-me-not Process
NIPS 2016
Monte Carlo Tree Search in Continuous Action Spaces with Execution Uncertainty
IJCAI 2016
Action Selection for Hammer Shots in Curling
IJCAI 2016
Variance Reduction via Antithetic Markov Chains
AISTATS 2015
Solving Heads-Up Limit Texas Hold'em
IJCAI 2015
The Arcade Learning Environment: An Evaluation Platform for General Agents (Extended Abstract)
IJCAI 2015
Bayesian Learning of Recursively Factored Environments
ICML 2013
Subset Selection of Search Heuristics
IJCAI 2013
A Randomized Mirror Descent Algorithm for Large Scale Multiple Kernel Learning
ICML 2013
Sketch-Based Linear Value Function Approximation
NIPS 2012
Linear Fitted-Q Iteration with Multiple Reward Functions
JMLR 2012
Tractable Objectives for Robust Policy Optimization
NIPS 2012
Variance Reduction in Monte-Carlo Tree Search
NIPS 2011
Strategy Grafting in Extensive Games
NIPS 2009
Monte Carlo Sampling for Regret Minimization in Extensive Games
NIPS 2009
Computing Robust Counter-Strategies
NIPS 2007
Regret Minimization in Games with Incomplete Information
NIPS 2007
Stable Dual Dynamic Programming
NIPS 2007
iLSTD: Eligibility Traces and Convergence Analysis
NIPS 2006