Theoretical Results on Reinforcement Learning With Temporally Abstract Options

Lecture Notes in Computer Science - Germany
doi 10.1007/bfb0026709
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Probabilistic Inference for Determining Options in Reinforcement Learning

Machine Learning
Artificial IntelligenceSoftware
2016English

TTree: Tree-Based State Generalization With Temporally Abstract Actions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Learning Options With Interest Functions

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

Interaction Algorithm Effect on Human Experience With Reinforcement Learning

ACM Transactions on Human-Robot Interaction
2018English

Relational Reinforcement Learning With Guided Demonstrations

Artificial Intelligence
LinguisticsLanguageArtificial Intelligence
2017English

Offline Reinforcement Learning With Task Hierarchies

Machine Learning
Artificial IntelligenceSoftware
2017English

Dynamic Colocation Policies With Reinforcement Learning

Transactions on Architecture and Code Optimization
HardwareInformation SystemsArchitectureSoftware
2020English

Reinforcement Learning

Computers and Mathematics with Applications
MathematicsComputational MathematicsSimulationModelingComputational Theory
1993English

Naive Reinforcement Learning With Endogenous Aspirations

International Economic Review
EconomicsEconometrics
2000English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy