On the public citation graph

Composing functions to speed up reinforcement learning in a changing world

0 signed · 23 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.1007/3-540-63233-6_513openalex-snapshot
Using a case base of surfaces to speed-up reinforcement learning
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/0004-3702(92)90058-6openalex-snapshot
Automatic programming of behavior-based robots using reinforcement learning
inferredcites →https://doi.org/10.1016/0364-0213(90)90018-ropenalex-snapshot
Case-based planning: A framework for planning from experience
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.1016/b978-1-55860-247-2.50015-2openalex-snapshot
Learning to Predict in Uncertain Continuous Tasks
inferredcites →https://doi.org/10.1016/b978-1-55860-377-6.50061-xopenalex-snapshot
Efficient Memory-Based Dynamic Programming
inferredcites →https://doi.org/10.1023/a:1006597715165openalex-snapshot
A Teaching Strategy for Memory-Based Control
inferredcites →https://doi.org/10.1023/a:1022676722315openalex-snapshot
Technical Note: Q-Learning
inferredcites →https://doi.org/10.1023/a:1022686910523openalex-snapshot
Derivational Analogy in PRODIGY: Automating Case Acquisition, Storage, and Utilization
inferredcites →https://doi.org/10.1109/34.244675openalex-snapshot
Finite-element methods for active contour models and balloons for 2-D and 3-D images
inferredcites →https://doi.org/10.1145/128762.128763openalex-snapshot
Computational strategies for object recognition
inferredcites →https://doi.org/10.17791/jcsopenalex-snapshot
Journal of Cognitive Science

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11539902_46openalex-snapshot
Automatic Discovery of Subgoals for Sequential Decision Problems Using Potential Fields
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00052-1openalex-snapshot
Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning
inferred← citeshttps://doi.org/10.1023/a:1017944732463openalex-snapshot
Structure in the Space of Value Functions
inferred← citeshttps://doi.org/10.1109/icicisys.2009.5357937openalex-snapshot
Automatic construct of options in RL
inferred← citeshttps://doi.org/10.1109/icsmc.2008.4811303openalex-snapshot
Learning task decomposition and exploration shaping for reinforcement learning agents
inferred← citeshttps://doi.org/10.1109/smc.2013.424openalex-snapshot
Deep Belief Network for Modeling Hierarchical Reinforcement Learning Policies
inferred← citeshttps://doi.org/10.1109/tcds.2022.3177691openalex-snapshot
Concurrent Skill Composition Using Ensemble of Primitive Skills
inferred← citeshttps://doi.org/10.1613/jair.904openalex-snapshot
Accelerating Reinforcement Learning by Composing Solutions of Automatically Identified Subtasks
inferred← citeshttps://doi.org/10.20965/jaciii.2006.p0578openalex-snapshot
Opposition-Based Reinforcement Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1912.01683openalex-snapshot
Optimal Policies Tend to Seek Power
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.