arXiv (All)
open access
Hierarchical Learning Automata Without a Shared Reinforcement Signal: Recovering the Environment Response From Action-Probability Changes
A hierarchy of learning automata in the sense of Thathachar and Ramakrishnan activates one root-to-leaf path per round, and every automaton on that path updates from the environment response. Analyses of this hierarchy deliver the response to every level. In many deployed hierarchies only the root o
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Discovering Temporal Structure: An Overview of Hierarchical Reinforcement Learning#997438
- Q-Shaped Options for Hierarchical Reinforcement Learning#1249559
- Fork Where the Model Changes Its Mind: Belief-Shift Branching for Tree-Structured Reinforcement Learning#998621
- Breaking the Environment Wall: A Unified Framework for Preparing and Evolving Agent-Native Environments#1258023
- CoDA: Co-Evolution of Data Engines and Action Policies#1358017
Record · ID 1343567
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive