Nathaniel Korda

According to our database, Nathaniel Korda authored at least 14 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Fully autonomous tuning of a spin qubit.

Jonas Schuff, Miguel J. Carballido, Madeleine Kotzagiannidis, Juan Carlos Calvo, Marco Caselli, Jacob Rawling, David L. Craig, Barnaby van Straaten, Brandon Severin, Federico Fedele, Simon Svab, Pierre Chevalier Kwon, Rafael S. Eggli, Taras Patlatiuk, Nathan Korda, Dominik M. Zumbühl, Natalia Ares

CoRR, 2024

2023

The Automated Bias Triangle Feature Extraction Framework.

Madeleine Kotzagiannidis, Jonas Schuff, Nathan Korda

CoRR, 2023

2021

Concentration bounds for temporal difference learning with linear function approximation: the case of batch data and uniform sampling.

Prashanth L. A., Nathaniel Korda, Rémi Munos

Mach. Learn., 2021

2016

Distributed Clustering of Linear Bandits in Peer to Peer Networks.

Nathan Korda, Balázs Szörényi, Shuai Li

Proceedings of the 33nd International Conference on Machine Learning, 2016

2015

On TD(0) with function approximation: Concentration bounds and a centered variant with exponential convergence.

Nathaniel Korda, Prashanth L. A.

Proceedings of the 32nd International Conference on Machine Learning, 2015

Fast Gradient Descent for Drifting Least Squares Regression, with Application to Bandits.

Nathaniel Korda, Prashanth L. A., Rémi Munos

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Fast LSTD Using Stochastic Approximation: Finite Time Analysis and Application to Traffic Control.

Prashanth L. A., Nathaniel Korda, Rémi Munos

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

2013

Analysis of stochastic approximation for efficient least squares regression and LSTD.

Prashanth L. A., Nathaniel Korda, Rémi Munos

CoRR, 2013

Online gradient descent for least squares regression: Non-asymptotic bounds and application to bandits.

Nathaniel Korda, Prashanth L. A., Rémi Munos

CoRR, 2013

Finite-Time Analysis of Kernelised Contextual Bandits.

Michal Valko, Nathaniel Korda, Rémi Munos, Ilias N. Flaounas, Nello Cristianini

Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, 2013

Thompson Sampling for 1-Dimensional Exponential Family Bandits.

Nathaniel Korda, Emilie Kaufmann, Rémi Munos

Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

2012

Optimistic Bayesian Sampling in Contextual-Bandit Problems.

Benedict C. May, Nathan Korda, Anthony Lee, David S. Leslie

J. Mach. Learn. Res., 2012

Thompson Sampling: An Optimal Finite Time Analysis

Emilie Kaufmann, Nathaniel Korda, Rémi Munos

CoRR, 2012

Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis.

Emilie Kaufmann, Nathaniel Korda, Rémi Munos

Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012