On the public citation graph

Reinforcement Learning, Bit by Bit

0 signed · 40 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9781118309858openalex-snapshot
Optimal Learning
inferredcites →https://doi.org/10.1007/978-3-642-27645-3_11openalex-snapshot
Bayesian Reinforcement Learning
inferredcites →https://doi.org/10.1007/bf00115009openalex-snapshot
Learning to Predict by the Methods of Temporal Differences
inferredcites →https://doi.org/10.1016/0196-8858(85)90002-8openalex-snapshot
Asymptotically efficient adaptive allocation rules
inferredcites →https://doi.org/10.1016/s0019-9958(77)90354-0openalex-snapshot
An adaptive optimal controller for discrete-time Markov environments
inferredcites →https://doi.org/10.1016/s0898-1221(00)00089-4openalex-snapshot
Some upper bounds for relative entropy and applications
inferredcites →https://doi.org/10.1023/a:1013689704352openalex-snapshot
Finite-time Analysis of the Multiarmed Bandit Problem
inferredcites →https://doi.org/10.1023/a:1017984413808openalex-snapshot
Near-Optimal Reinforcement Learning in Polynomial Time
inferredcites →https://doi.org/10.1023/a:1022624705476openalex-snapshot
Practical Issues in Temporal Difference Learning
inferredcites →https://doi.org/10.1038/nature14236openalex-snapshot
Human-level control through deep reinforcement learning
inferredcites →https://doi.org/10.1038/s41586-020-03051-4openalex-snapshot
Mastering Atari, Go, chess and shogi by planning with a learned model
inferredcites →https://doi.org/10.1093/biomet/25.3-4.285openalex-snapshot
ON THE LIKELIHOOD THAT ONE UNKNOWN PROBABILITY EXCEEDS ANOTHER IN VIEW OF THE EVIDENCE OF TWO SAMPLES
inferredcites →https://doi.org/10.1093/biomet/66.3.561openalex-snapshot
A Dynamic Allocation Index for the Discounted Multiarmed Bandit Problem
inferredcites →https://doi.org/10.1109/tsmc.1983.6313077openalex-snapshot
Neuronlike adaptive elements that can solve difficult learning control problems
inferredcites →https://doi.org/10.1109/tssc.1966.300074openalex-snapshot
Information Value Theory
inferredcites →https://doi.org/10.1162/neco.1994.6.2.215openalex-snapshot
TD-Gammon, a Self-Teaching Backgammon Program, Achieves Master-Level Play
inferredcites →https://doi.org/10.1214/aoms/1177704255openalex-snapshot
A Definition of Subjective Probability
inferredcites →https://doi.org/10.1257/aer.20181897openalex-snapshot
Quantifying Information and Uncertainty
inferredcites →https://doi.org/10.1287/moor.2014.0650openalex-snapshot
Learning to Optimize via Posterior Sampling
inferredcites →https://doi.org/10.1287/opre.1040.0145openalex-snapshot
An Adaptive Sampling Algorithm for Solving Markov Decision Processes
inferredcites →https://doi.org/10.1287/opre.1110.0999openalex-snapshot
The Knowledge Gradient Algorithm for a General Class of Online Learning Problems
inferredcites →https://doi.org/10.1287/opre.2017.1663openalex-snapshot
Learning to Optimize via Information-Directed Sampling
inferredcites →https://doi.org/10.1561/2200000049openalex-snapshot
Bayesian Reinforcement Learning: A Survey
inferredcites →https://doi.org/10.1561/2200000070openalex-snapshot
A Tutorial on Thompson Sampling
inferredcites →https://doi.org/10.1561/9781601986276openalex-snapshot
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
inferredcites →https://doi.org/10.1609/aaai.v32i1.11751openalex-snapshot
Information Directed Sampling for Stochastic Bandits With Graph Feedback
inferredcites →https://doi.org/10.2307/2371219openalex-snapshot
On the Theory of Apportionment

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/j.artint.2025.104392openalex-snapshot
Provably efficient information-directed sampling algorithms for multi-agent reinforcement learning
inferred← citeshttps://doi.org/10.1016/j.oceaneng.2025.123954openalex-snapshot
Fatigue inspection planning of offshore wind turbines: Deep reinforcement learning with information-directed exploration
inferred← citeshttps://doi.org/10.1016/j.sysconle.2024.105751openalex-snapshot
Reinforcement learning in non-Markovian environments
inferred← citeshttps://doi.org/10.1088/1741-4326/ad22f5openalex-snapshot
Automated experimental design of safe rampdowns via probabilistic machine learning
inferred← citeshttps://doi.org/10.1109/cdc56724.2024.10886046openalex-snapshot
Agent-state based policies in POMDPs: Beyond belief-state MDPs
inferred← citeshttps://doi.org/10.1109/itw62417.2025.11240440openalex-snapshot
Information-Theoretic Minimax Regret Upper Bounds for Reinforcement Learning Problems
inferred← citeshttps://doi.org/10.1137/22m1536650openalex-snapshot
Occupancy Information Ratio: Infinite-Horizon, Information-Directed, Parameterized Policy Search
inferred← citeshttps://doi.org/10.1162/opmi_a_00132openalex-snapshot
Bayesian Reinforcement Learning With Limited Cognitive Load
inferred← citeshttps://doi.org/10.1214/25-sts1001openalex-snapshot
Sample-Based Planning and Learning with Function Approximation
inferred← citeshttps://doi.org/10.14209/jcis.2023.15openalex-snapshot
Reinforcement Learning-based Wi-Fi Contention Window Optimization
inferred← citeshttps://doi.org/10.1561/2200000116openalex-snapshot
Continual Learning as Computationally Constrained Reinforcement Learning
inferred← citeshttps://doi.org/10.3390/a16120532openalex-snapshot
A Learnheuristic Algorithm for the Capacitated Dispersion Problem under Dynamic Conditions
inferred← citeshttps://doi.org/10.3390/e28010001openalex-snapshot
Decision, Inference, and Information: Formal Equivalences Under Active Inference
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.