default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNathaniel Korda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i8]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:
Fully autonomous tuning of a spin qubit. CoRR abs/2402.03931 (2024)- 2023
- [i7]Madeleine Kotzagiannidis, Jonas Schuff, Nathan Korda:
The Automated Bias Triangle Feature Extraction Framework. CoRR abs/2312.03110 (2023) - 2021
- [j2]Prashanth L. A.
, Nathaniel Korda, Rémi Munos:
Concentration bounds for temporal difference learning with linear function approximation: the case of batch data and uniform sampling. Mach. Learn. 110(3): 559-618 (2021)
2010 – 2019
- 2016
- [c7]Nathan Korda, Balázs Szörényi, Shuai Li:
Distributed Clustering of Linear Bandits in Peer to Peer Networks. ICML 2016: 1301-1309 - [i6]Nathan Korda, Balázs Szörényi, Shuai Li:
Distributed Clustering of Linear Bandits in Peer to Peer Networks. CoRR abs/1604.07706 (2016) - 2015
- [c6]Nathaniel Korda, Prashanth L. A., Rémi Munos:
Fast Gradient Descent for Drifting Least Squares Regression, with Application to Bandits. AAAI 2015: 2708-2714 - [c5]Nathaniel Korda, Prashanth L. A.:
On TD(0) with function approximation: Concentration bounds and a centered variant with exponential convergence. ICML 2015: 626-634 - 2014
- [c4]Prashanth L. A., Nathaniel Korda, Rémi Munos:
Fast LSTD Using Stochastic Approximation: Finite Time Analysis and Application to Traffic Control. ECML/PKDD (2) 2014: 66-81 - [i5]Nathaniel Korda, Prashanth L. A.:
On TD(0) with function approximation: Concentration bounds and a centered variant with exponential convergence. CoRR abs/1411.3224 (2014) - 2013
- [c3]Nathaniel Korda, Emilie Kaufmann, Rémi Munos:
Thompson Sampling for 1-Dimensional Exponential Family Bandits. NIPS 2013: 1448-1456 - [c2]Michal Valko, Nathaniel Korda, Rémi Munos, Ilias N. Flaounas, Nello Cristianini:
Finite-Time Analysis of Kernelised Contextual Bandits. UAI 2013 - [i4]Prashanth L. A., Nathaniel Korda, Rémi Munos:
Analysis of stochastic approximation for efficient least squares regression and LSTD. CoRR abs/1306.2557 (2013) - [i3]Nathaniel Korda, Prashanth L. A., Rémi Munos:
Online gradient descent for least squares regression: Non-asymptotic bounds and application to bandits. CoRR abs/1307.3176 (2013) - [i2]Michal Valko, Nathaniel Korda, Rémi Munos, Ilias N. Flaounas, Nello Cristianini:
Finite-Time Analysis of Kernelised Contextual Bandits. CoRR abs/1309.6869 (2013) - 2012
- [j1]Benedict C. May, Nathan Korda, Anthony Lee, David S. Leslie:
Optimistic Bayesian Sampling in Contextual-Bandit Problems. J. Mach. Learn. Res. 13: 2069-2106 (2012) - [c1]Emilie Kaufmann, Nathaniel Korda, Rémi Munos:
Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis. ALT 2012: 199-213 - [i1]Emilie Kaufmann, Nathaniel Korda, Rémi Munos:
Thompson Sampling: An Optimal Finite Time Analysis. CoRR abs/1205.4217 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
