596 total citations 6 papers, 57 citations indexed
About
Nathaniel Korda is a scholar working on Management Science and Operations Research, Artificial Intelligence and Computer Networks and Communications.
According to data from OpenAlex, Nathaniel Korda has authored 6 papers receiving a total of 57 indexed citations (citations by other indexed papers that have themselves been cited), including 6 papers in Management Science and Operations Research, 5 papers in Artificial Intelligence and 1 paper in Computer Networks and Communications. Recurrent topics in Nathaniel Korda's work include Advanced Bandit Algorithms Research (6 papers), Reinforcement Learning in Robotics (3 papers) and Stochastic Gradient Optimization Techniques (2 papers). Nathaniel Korda is often cited by papers focused on Advanced Bandit Algorithms Research (6 papers), Reinforcement Learning in Robotics (3 papers) and Stochastic Gradient Optimization Techniques (2 papers). Nathaniel Korda collaborates with scholars based in France, United Kingdom and India. Nathaniel Korda's co-authors include Emilie Kaufmann, Rémi Munos, L. A. Prashanth, Rémi Munos and Ilias Flaounas and has published in prestigious journals such as Machine Learning, arXiv (Cornell University) and International Conference on Machine Learning.
Citations per year, relative to Nathaniel Korda Nathaniel Korda (= 1×)
peers
Pierre Ménard
Countries citing papers authored by Nathaniel Korda
Since
Specialization
Citations
This map shows the geographic impact of Nathaniel Korda's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Nathaniel Korda with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nathaniel Korda more than expected).
This network shows the impact of papers produced by Nathaniel Korda. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Nathaniel Korda. The network helps show where Nathaniel Korda may publish in the future.
Co-authorship network of co-authors of Nathaniel Korda
This figure shows the co-authorship network connecting the top 25 collaborators of Nathaniel Korda.
A scholar is included among the top collaborators of Nathaniel Korda based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Nathaniel Korda. Nathaniel Korda is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Korda, Nathaniel & L. A. Prashanth. (2015). On TD(0) with function approximation: Concentration bounds and a centered variant with exponential convergence. International Conference on Machine Learning. 626–634.9 indexed citations
3.
Korda, Nathaniel, L. A. Prashanth, & Rémi Munos. (2013). Online gradient descent for least squares regression: Non-asymptotic bounds and application to bandits.. arXiv (Cornell University).1 indexed citations
4.
Korda, Nathaniel, et al.. (2013). Finite-Time Analysis of Kernelised Contextual Bandits. LillOA (Université de Lille (University Of Lille)).2 indexed citations
Kaufmann, Emilie, Nathaniel Korda, & Rémi Munos. (2012). Thompson Sampling: An Optimal Finite Time Analysis.10 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.