David S. Leslie

Proceedings of the RecSys '21: Fifteenth ACM Conference on Recommender Systems, Amsterdam, The Netherlands, 27 September 2021, 2021

Decentralized Q-learning in Zero-sum Markov Games.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

Selecting multiple web adverts: A contextual multi-armed bandit with state uncertainty.

[BibT_eX]

[DOI]

James A. Edwards

J. Oper. Res. Soc., 2020

Best-response dynamics in zero-sum stochastic games.

[BibT_eX]

[DOI]

Zibo Xu

J. Econ. Theory, 2020

Adaptive policies for perimeter surveillance problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2020

BOSH: Bayesian Optimization by Sampling Hierarchically.

[BibT_eX]

[DOI]

Henry B. Moss

Paul Rayson

CoRR, 2020

MUMBO: MUlti-task Max-Value Bayesian Optimization.

[BibT_eX]

[DOI]

Henry B. Moss

Paul Rayson

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2020

BOSS: Bayesian Optimization over String Spaces.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

On Thompson Sampling for Smoother-than-Lipschitz Bandits.

[BibT_eX]

[DOI]

James A. Grant

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

Why Higher Working Memory Capacity May Help You Learn: Sampling, Search, and Degrees of Approximation.

[BibT_eX]

[DOI]

Cogn. Sci., 2019

Robust Functional Regression for Outlier Detection.

[BibT_eX]

[DOI]

Proceedings of the Advanced Analytics and Learning on Temporal Data, 2019

Adaptive Sensor Placement for Continuous Spaces.

[BibT_eX]

[DOI]

Enrique Munoz de Cote

Proceedings of the 36th International Conference on Machine Learning, 2019

FIESTA: Fast IdEntification of State-of-The-Art models using adaptive bandit algorithms.

[BibT_eX]

[DOI]

Proceedings of the 57th Conference of the Association for Computational Linguistics, 2019

2018

Bandit Learning in Concave N-Person Games.

[BibT_eX]

[DOI]

Mario Bravo

Panayotis Mertikopoulos

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Using J-K-fold Cross Validation To Reduce Variance When Tuning NLP Models.

[BibT_eX]

[DOI]

Henry B. Moss

Paul Rayson

Proceedings of the 27th International Conference on Computational Linguistics, 2018

2017

Mixed-Strategy Learning With Continuous Action Sets.

[BibT_eX]

[DOI]

Panayotis Mertikopoulos

IEEE Trans. Autom. Control., 2017

Robustness Properties in Fictitious-Play-Type Algorithms.

[BibT_eX]

[DOI]

SIAM J. Control. Optim., 2017

Multi-Rate Threshold FlipThem.

[BibT_eX]

[DOI]

Chris Sherfield

Nigel P. Smart

IACR Cryptol. ePrint Arch., 2017

Combinatorial Multi-Armed Bandits with Filtered Feedback.

[BibT_eX]

[DOI]

CoRR, 2017

Why Does Higher Working Memory Capacity Help You Learn?

[BibT_eX]

[DOI]

Proceedings of the 39th Annual Meeting of the Cognitive Science Society, 2017

2015

Threshold FlipThem: When the winner does not need to take all.

[BibT_eX]

[DOI]

Chris Sherfield

Nigel P. Smart

IACR Cryptol. ePrint Arch., 2015

Bayesian Reinforcement Learning in Markovian and non-Markovian Tasks.

[BibT_eX]

[DOI]

Adnane Ez-Zizi

Simon Farrell

Proceedings of the IEEE Symposium Series on Computational Intelligence, 2015

2014

Stochastic fictitious play with continuous action sets.

[BibT_eX]

[DOI]

J. Econ. Theory, 2014

Game-theoretical control with continuous action sets.

[BibT_eX]

[DOI]

Panayotis Mertikopoulos

CoRR, 2014

Learning in Unknown Reward Games: Application to Sensor Networks.

[BibT_eX]

[DOI]

Comput. J., 2014

2013

Convergent Learning Algorithms for Unknown Reward Games.

[BibT_eX]

[DOI]

SIAM J. Control. Optim., 2013

Coarse resistance tree methods for stochastic stability analysis.

[BibT_eX]

[DOI]

Proceedings of the 52nd IEEE Conference on Decision and Control, 2013

2012

Optimistic Bayesian Sampling in Contextual-Bandit Problems.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2012

2011

A unifying framework for iterative approximate best-response algorithms for distributed constraint optimization problems.

[BibT_eX]

[DOI]

Knowl. Eng. Rev., 2011

Adaptive Forgetting Factor Fictitious Play

[BibT_eX]

[DOI]

CoRR, 2011

Equilibrium selection in potential games with noisy rewards.

[BibT_eX]

[DOI]

Jason R. Marden

Proceedings of the 5th International Conference on NETwork Games, COntrol and OPtimization, 2011

2010

Posterior Weighted Reinforcement Learning with State Uncertainty.

[BibT_eX]

[DOI]

Neural Comput., 2010

Dynamic Opponent Modelling in Fictitious Play.

[BibT_eX]

[DOI]

Comput. J., 2010

Convergence of Probability Collectives with Adaptive Choice of Temperature Parameters.

[BibT_eX]

[DOI]

Proceedings of the Learning and Intelligent Optimization, 4th International Conference, 2010

2009

Sequentially updated Probability Collectives.

[BibT_eX]

[DOI]

Proceedings of the 48th IEEE Conference on Decision and Control, 2009

2008

On Similarities between Inference in Game Theory and Machine Learning.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2008

2007

A general approach to heteroscedastic linear regression.

[BibT_eX]

[DOI]

Robert Kohn

David J. Nott

Stat. Comput., 2007

2006

Generalised weakened fictitious play.

[BibT_eX]

[DOI]

Edmund J. Collins

Games Econ. Behav., 2006

2005

Individual Q-Learning in Normal Form Games.

[BibT_eX]

[DOI]