On the public citation graph

Using Experience Classification for Training Non-Markovian Tasks

0 signed · 20 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/978-3-030-57628-8_1openalex-extracted
Deep Reinforcement Learning with Temporal Logics
inferredcites →https://doi.org/10.1007/978-3-030-63461-2_1openalex-extracted
Formal Policy Synthesis for Continuous-State Systems via Reinforcement Learning
inferredcites →https://doi.org/10.1007/978-3-031-29476-1_2openalex-extracted
An Approach of Transforming Non-Markovian Reward to Markovian Reward
inferredcites →https://doi.org/10.1016/s0925-2312(00)00324-6openalex-extracted
Reinforcement Learning: An Introduction
inferredcites →https://doi.org/10.1109/icra40945.2020.9196796openalex-extracted
Control Synthesis from Linear Temporal Logic Specifications using Model-Free Reinforcement Learning
inferredcites →https://doi.org/10.1109/iros.2017.8206234openalex-extracted
Reinforcement learning with temporal logic rewards
inferredcites →https://doi.org/10.1109/lcsys.2020.2980552openalex-extracted
Reinforcement Learning of Control Policy for Linear Temporal Logic Specifications Using Limit-Deterministic Generalized Büchi Automata
inferredcites →https://doi.org/10.1609/icaps.v22i1.13518openalex-extracted
PROST: Probabilistic Planning Based on UCT
inferredcites →https://doi.org/10.1609/icaps.v31i1.15954openalex-extracted
Compositional Approach to Translate LTLf/LDLf into Deterministic Finite Automata
inferredcites →https://doi.org/10.1613/jair.1.12440openalex-extracted
Reward Machines: Exploiting Reward Function Structure in Reinforcement Learning
inferredcites →https://doi.org/10.1613/jair.1.14819openalex-extracted
Actor Prioritized Experience Replay
inferredcites →https://doi.org/10.1613/jair.1676openalex-extracted
Decision-Theoretic Planning with non-Markovian Rewards
inferredcites →https://doi.org/10.24963/ijcai.2019/840openalex-extracted
LTL and Beyond: Formal Languages for Reward Function Specification in Reinforcement Learning
inferredcites →https://doi.org/10.48550/arxiv.1511.05952openalex-extracted
Prioritized Experience Replay
inferredcites →https://doi.org/10.48550/arxiv.1801.00690openalex-extracted
DeepMind Control Suite
inferredcites →https://doi.org/10.48550/arxiv.1801.01290openalex-extracted
Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor
inferredcites →https://doi.org/10.48550/arxiv.1802.09477openalex-extracted
Addressing Function Approximation Error in Actor-Critic Methods
inferredcites →https://doi.org/10.48550/arxiv.2007.06049openalex-extracted
An Equivalence between Loss Functions and Non-Uniform Sampling in Experience Replay
inferredcites →https://doi.org/10.48550/arxiv.2007.07358openalex-extracted
Learning to Sample with Local and Global Contexts in Experience Replay Buffer
inferredcites →https://doi.org/10.48550/arxiv.2206.09546openalex-extracted
Policy Optimization with Linear Temporal Logic Constraints
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.