On the public citation graph
An Upper Bound on the Loss from Approximate Optimal-Value Functions
0 signed · 104 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00115009openalex-snapshot
Learning to Predict by the Methods of Temporal Differences
inferredcites →https://doi.org/10.1007/bf00992697openalex-snapshot
Practical issues in temporal difference learning
inferredcites →https://doi.org/10.1016/b978-1-55860-141-3.50030-4openalex-snapshot
Integrated Architectures for Learning, Planning, and Reacting Based on Approximating Dynamic Programming
inferredcites →https://doi.org/10.1023/a:1022624705476openalex-snapshot
Practical Issues in Temporal Difference Learning
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/tsmc.1987.289329openalex-snapshot
Building and Understanding Adaptive Systems: A Statistical/Numerical Approach to Factory Automation and Brain Research
inferredcites →https://doi.org/10.1287/mnsc.18.1.7openalex-snapshot
Some Bounds for Discounted Sequential Decision Processes
inferredcites →https://doi.org/10.1287/mnsc.19.4.p7openalex-snapshot
Information Requirements for Urban Systems: A View into the Possible Future?
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0714openalex-snapshot
Reinforcement Learning Algorithms for MDPs
inferred← citeshttps://doi.org/10.1007/978-0-585-33656-5_9openalex-snapshot
The Loss from Imperfect Value Functions in Expectation-Based and Minimax-Based Tasks
inferred← citeshttps://doi.org/10.1007/978-3-031-01551-9openalex-snapshot
Algorithms for Reinforcement Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-74958-5_41openalex-snapshot
Planning and Learning in Environments with Delayed Feedback
inferred← citeshttps://doi.org/10.1007/bf00114728openalex-snapshot
The loss from imperfect value functions in expectation-based and minimax-based tasks
inferred← citeshttps://doi.org/10.1007/bf02743935openalex-snapshot
A tutorial survey of reinforcement learning
inferred← citeshttps://doi.org/10.1007/s10107-026-02345-1openalex-snapshot
Stochastic Halpern iteration in normed spaces and applications to reinforcement learning
inferred← citeshttps://doi.org/10.1007/s10458-008-9056-7openalex-snapshot
Learning and planning in environments with delayed feedback
inferred← citeshttps://doi.org/10.1007/s10994-010-5225-4openalex-snapshot
Knows what it knows: a framework for self-aware learning
inferred← citeshttps://doi.org/10.1007/s10994-013-5368-1openalex-snapshot
Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model
inferred← citeshttps://doi.org/10.1016/0004-3702(94)00011-oopenalex-snapshot
Learning to act using real-time dynamic programming
inferred← citeshttps://doi.org/10.1016/b978-1-55860-377-6.50040-2openalex-snapshot
Stable Function Approximation in Dynamic Programming
inferred← citeshttps://doi.org/10.1016/j.artint.2007.08.001openalex-snapshot
Restricted gradient-descent algorithm for value-function approximation in reinforcement learning
inferred← citeshttps://doi.org/10.1016/j.ins.2013.08.037openalex-snapshot
Reinforcement learning algorithms with function approximation: Recent advances and applications
inferred← citeshttps://doi.org/10.1016/j.knosys.2023.111036openalex-snapshot
Value function optimistic initialization with uncertainty and confidence awareness in lifelong reinforcement learning
inferred← citeshttps://doi.org/10.1016/j.procs.2015.12.179openalex-snapshot
Modeling Biological Agents Beyond the Reinforcement-learning Paradigm
inferred← citeshttps://doi.org/10.1016/j.robot.2023.104385openalex-snapshot
Efficient reinforcement learning with least-squares soft Bellman residual for robotic grasping
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00377-6openalex-snapshot
Solving factored MDPs using non-homogeneous partitions
inferred← citeshttps://doi.org/10.1023/a:1007678930559openalex-snapshot
Convergence Results for Single-Step On-Policy Reinforcement-Learning Algorithms
inferred← citeshttps://doi.org/10.1023/a:1017932429737openalex-snapshot
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
inferred← citeshttps://doi.org/10.1023/a:1018016523433openalex-snapshot
The Loss from Imperfect Value Functions in Expectation-Based and Minimax-Based Tasks
inferred← citeshttps://doi.org/10.1109/adprl.2011.5967379openalex-snapshot
On learning with imperfect representations
inferred← citeshttps://doi.org/10.1109/adprl.2014.7010627openalex-snapshot
Near-optimality bounds for greedy periodic policies with application to grid-level storage
inferred← citeshttps://doi.org/10.1109/cdc.2012.6426504openalex-snapshot
Loss bounds for uncertain transition probabilities in Markov decision processes
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9030056openalex-snapshot
Stability guarantees for nonlinear discrete-time systems controlled by approximate value iteration
inferred← citeshttps://doi.org/10.1109/cdc45484.2021.9683162openalex-snapshot
Sample Complexity of Model-Based Robust Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/eespe63401.2025.10987471openalex-snapshot
Decision-Making Optimization Model Construction Based on Intelligent Algorithms
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00097openalex-snapshot
Settling the Horizon-Dependence of Sample Complexity in Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/ictai59109.2023.00049openalex-snapshot
Deep Reinforcement Learning Based Efficient and Robust Navigation Method For Autonomous Applications
inferred← citeshttps://doi.org/10.1109/ijcnn.2013.6706982openalex-snapshot
On the convergence of techniques that improve value iteration
inferred← citeshttps://doi.org/10.1109/ijcnn.2018.8489739openalex-snapshot
Kernelized Q-Learning for Large-Scale, Potentially Continuous, Markov Decision Processes
inferred← citeshttps://doi.org/10.1109/jas.2014.7004680openalex-snapshot
Off-policy reinforcement learning with Gaussian processes
inferred← citeshttps://doi.org/10.1109/jsen.2022.3146307openalex-snapshot
Learning Automated Driving in Complex Intersection Scenarios Based on Camera Sensors: A Deep Reinforcement Learning Approach
inferred← citeshttps://doi.org/10.1109/rtss.2008.48openalex-snapshot
Scheduling Design and Verification for Open Soft Real-Time Systems
inferred← citeshttps://doi.org/10.1109/tac.2003.812782openalex-snapshot
Multitime scale Markov decision processes
inferred← citeshttps://doi.org/10.1109/tac.2010.2052697openalex-snapshot
On State Aggregation to Approximate Complex Value Functions in Large-Scale Markov Decision Processes
inferred← citeshttps://doi.org/10.1109/tac.2018.2790260openalex-snapshot
Stability Analysis of Optimal Adaptive Control Using Value Iteration With Approximation Errors
inferred← citeshttps://doi.org/10.1109/tnet.2008.2011644openalex-snapshot
Optimal Stochastic Policies for Distributed Data Aggregation in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tnnls.2023.3296642openalex-snapshot
Sample Efficient Deep Reinforcement Learning With Online State Abstraction and Causal Transformer Model Prediction
inferred← citeshttps://doi.org/10.1134/s0965542524702191openalex-snapshot
Optimal Approximation of Average Reward Markov Decision Processes
inferred← citeshttps://doi.org/10.1145/1273496.1273572openalex-snapshot
Automatic shaping and decomposition of reward functions
inferred← citeshttps://doi.org/10.1145/1275808.1276386openalex-snapshot
Near-optimal character animation with continuous control
inferred← citeshttps://doi.org/10.1145/1276377.1276386openalex-snapshot
Near-optimal character animation with continuous control
inferred← citeshttps://doi.org/10.1145/1390156.1390187openalex-snapshot
An object-oriented representation for efficient reinforcement learning
inferred← citeshttps://doi.org/10.1145/3589334.3645495openalex-snapshot
User Response in Ad Auctions: An MDP Formulation of Long-term Revenue Optimization
inferred← citeshttps://doi.org/10.1145/3589973openalex-snapshot
Overcoming the Long Horizon Barrier for Sample-Efficient Reinforcement Learning with Latent Low-Rank Structure
inferred← citeshttps://doi.org/10.1287/ijoc.1080.0305openalex-snapshot
Reinforcement Learning: A Tutorial Survey and Recent Advances
inferred← citeshttps://doi.org/10.1287/moor.1060.0188openalex-snapshot
Performance Loss Bounds for Approximate Value Iteration with State Aggregation
inferred← citeshttps://doi.org/10.1287/moor.2021.0167openalex-snapshot
Fast Rates for the Regret of Offline Reinforcement Learning
inferred← citeshttps://doi.org/10.1287/msom.5.4.348.24884openalex-snapshot
Price-Directed Replenishment of Subsets: Methodology and Its Application to Inventory Routing
inferred← citeshttps://doi.org/10.14279/depositonce-2661openalex-snapshot
Local Evaluation of Policies for Discounted Markov Decision Problems
inferred← citeshttps://doi.org/10.1504/ijaacs.2009.026786openalex-snapshot
Scheduling policy design for autonomic systems
inferred← citeshttps://doi.org/10.1504/ijaisc.2010.032511openalex-snapshot
Fuzzy decision tree function approximation in reinforcement learning
inferred← citeshttps://doi.org/10.1527/tjsai.21.537openalex-snapshot
Experimental Analysis of Reward Design for Continuing Task in Multiagent Domains -- RoboCup Soccer Keepaway --
inferred← citeshttps://doi.org/10.1613/jair.1.14525openalex-snapshot
Optimality Guarantees for Particle Belief Approximation of POMDPs
inferred← citeshttps://doi.org/10.1631/jzus.c1300246openalex-snapshot
Greedy feature replacement for online value function approximation
inferred← citeshttps://doi.org/10.23919/acc.2017.7963780openalex-snapshot
Theoretical analysis of stabilizing value iteration with approximation errors
inferred← citeshttps://doi.org/10.24963/ijcai.2020/572openalex-snapshot
Sparse Tree Search Optimality Guarantees in POMDPs with Continuous Observation Spaces
inferred← citeshttps://doi.org/10.24963/ijcai.2021/279openalex-snapshot
Efficient PAC Reinforcement Learning in Regular Decision Processes
inferred← citeshttps://doi.org/10.2514/1.g001154openalex-snapshot
Theoretical and Numerical Analysis of Approximate Dynamic Programming with Approximation Errors
inferred← citeshttps://doi.org/10.4213/rm10328openalex-snapshot
Mathematical methods of reinforcement learning
inferred← citeshttps://doi.org/10.48550/arxiv.1112.4722openalex-snapshot
Modeling transition dynamics in MDPs with RKHS embeddings of conditional distributions
inferred← citeshttps://doi.org/10.48550/arxiv.1203.3481openalex-snapshot
Real-Time Scheduling via Reinforcement Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1206.4655openalex-snapshot
Modelling transition dynamics in MDPs with RKHS embeddings
inferred← citeshttps://doi.org/10.48550/arxiv.1207.1388openalex-snapshot
Planning in POMDPs Using Multiplicity Automata
inferred← citeshttps://doi.org/10.48550/arxiv.1412.5675openalex-snapshot
Stabilizing Value Iteration with and without Approximation Errors
inferred← citeshttps://doi.org/10.48550/arxiv.1602.06346openalex-snapshot
Policy Error Bounds for Model-Based Reinforcement Learning with Factored Linear Models
inferred← citeshttps://doi.org/10.48550/arxiv.1805.09045openalex-snapshot
When Simple Exploration is Sample Efficient: Identifying Sufficient Conditions for Random Exploration to Yield PAC RL Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1905.00360openalex-snapshot
Information-Theoretic Considerations in Batch Reinforcement Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1906.00423openalex-snapshot
Feature-Based Q-Learning for Two-Player Stochastic Games
inferred← citeshttps://doi.org/10.48550/arxiv.1906.03804openalex-snapshot
Model-Based Reinforcement Learning with a Generative Model is Minimax Optimal
inferred← citeshttps://doi.org/10.48550/arxiv.1908.11071openalex-snapshot
Solving Discounted Stochastic Two-Player Games with Near-Optimal Time and Sample Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1911.07676openalex-snapshot
Learning with Good Feature Representations in Bandits and in RL with a Generative Model
inferred← citeshttps://doi.org/10.48550/arxiv.2005.00527openalex-snapshot
Is Long Horizon Reinforcement Learning More Difficult Than Short Horizon Reinforcement Learning?
inferred← citeshttps://doi.org/10.48550/arxiv.2007.12933openalex-snapshot
Simulation Based Algorithms for Markov Decision Processes and Multi-Action Restless Bandits
inferred← citeshttps://doi.org/10.48550/arxiv.2008.10066openalex-snapshot
Learning Off-Policy with Online Planning
inferred← citeshttps://doi.org/10.48550/arxiv.2010.01374openalex-snapshot
Exponential Lower Bounds for Planning in MDPs With Linearly-Realizable Optimal Action-Value Functions
inferred← citeshttps://doi.org/10.48550/arxiv.2102.03718openalex-snapshot
An Analysis of Frame-skipping in Reinforcement Learning
inferred← citeshttps://doi.org/10.48550/arxiv.2105.08666openalex-snapshot
Reinforcement Learning With Sparse-Executing Actions via Sparsity Regularization
inferred← citeshttps://doi.org/10.48550/arxiv.2108.05533openalex-snapshot
Efficient Local Planning with Linear Function Approximation
inferred← citeshttps://doi.org/10.48550/arxiv.2112.01506openalex-snapshot
Sample Complexity of Robust Reinforcement Learning with a Generative Model
inferred← citeshttps://doi.org/10.48550/arxiv.2112.08451openalex-snapshot
Quantum Algorithms for Reinforcement Learning with a Generative Model
inferred← citeshttps://doi.org/10.48550/arxiv.2512.02383openalex-snapshot
Reinforcement Learning in POMDP's via Direct Gradient Ascent
inferred← citeshttps://doi.org/10.5555/1577069.1755867openalex-snapshot
Reinforcement Learning in Finite MDPs: PAC Analysis
inferred← citeshttps://doi.org/10.70675/43d0f3b9zdcdbz4f53z820azb4efcc1072c4openalex-snapshot
Near-optimal control of discrete-time nonlinear systems with stability guarantees
inferred← citeshttps://doi.org/10.7210/jrsj.22.120openalex-snapshot
Hierarchical Reinforcement Learning for Multiple Reward Functions
inferred← citeshttps://doi.org/10.7282/t370814hopenalex-snapshot
Efficient learning of relational models for sequential decision making
inferred← citeshttps://doi.org/10.7282/t3s46s46openalex-snapshot
A unifying framework for computational reinforcement learning theory
inferred← citeshttps://doi.org/10.7282/t3z3202gopenalex-snapshot
Probably Approximately Correct (PAC) exploration in reinforcement learning
inferred← citeshttps://doi.org/10.7936/k7kd1vzxopenalex-snapshot
Scheduling Policy Design using Stochastic Dynamic Programming
inferred← citeshttps://doi.org/10.7939/r31g0hx9nopenalex-snapshot
Focus of Attention in Reinforcement Learning
inferred← citeshttps://doi.org/10.7939/r38p5vn6wopenalex-snapshot
Toward Practical Reinforcement Learning Algorithms: Classification Based Policy Iteration and Model-Based Learning
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.