Abstract
Henrik Marklund, Ashish Rao, Hong Jun Jeon, Liu Yueyang
Abstract
Rights: UNKNOWN · Source: journal-auto-sync:external:CROSSREF_ISSN
Authors
Institutions
No ROR-resolved institution is linked to this work yet.
Provenance
crossref
Confidence 100%
unpaywall
Confidence 95%
datacite
Confidence 0%
No local citing links have been materialized yet.
10.52202/075280-2192
10.52202/075280-2192 · 2023
Reinforcement learning: Theory and algorithms
2019
Gradient based sample selection for online continual learning
2019
Unresolved referenced work
2021
The value of information when deciding what to learn
2021
Unresolved referenced work
2021
Unresolved referenced work
2019
Online label shift: Optimal dynamic regret meets practical algorithms
2024
Unresolved referenced work
2022
Unresolved referenced work
1996
Stochastic multi-armed-bandit problem with non-stationary rewards
2014
Non-stationary stochastic optimization
10.1287/opre.2015.1408 · 2015
Optimal Exploration-Exploitation in a Multi-Armed-Bandit Problem with Non-Stationary Rewards
10.1287/stsy.2019.0033 · 2019
The generalized likelihood ratio test meets KLUCB: an improved algorithm for piece-wise non-stationary bandits
2019
Unresolved referenced work
2016
The individual ergodic theorem of information theory
10.1214/aoms/1177706899 · 1957
Unresolved referenced work
2020
Dark experience for general continual learning: a strong, simple baseline
2020
Unresolved referenced work
2021
Unresolved referenced work
2019
You Only Live Once: Single-Life Reinforcement Learning
10.52202/068431-1075 · 2022
Non-stationary bandits with auto-regressive temporal dependency
2023
Unresolved referenced work
2019
Learning to optimize under non-stationarity
2019
Unresolved referenced work
2020
Unresolved referenced work
2006
Unresolved referenced work
2012
Strongly adaptive online learning
2015
Unresolved referenced work
2013
Feature reinforcement learning: state of the art
2014
Average, sensitive and Blackwell optimal policies in denumerable Markov decision chains with unbounded rewards
10.1287/moor.13.3.395 · 1988
Unresolved referenced work
2020
de Finetti’s theorem for Markov chains
1980
Unresolved referenced work
2021
Unresolved referenced work
2021
Simple agent, complex environment: Efficient reinforcement learning with agent states
2022
Unresolved referenced work
2016
Dynamic regret of policy optimization in non-stationary environments
2020
Funzione caratteristica di un fenomeno aleatorio
1929
Unresolved referenced work
2020
Random sampling with a reservoir
10.1145/3147.3165 · doi-reference
Lifelong learning for robust AI systems
10.1117/12.2624855 · doi-reference
Sliding-window Thompson sampling for non-stationary settings
10.1613/jair.1.11407 · doi-reference
Learning to learn: Introduction and overview
10.1007/978-1-4615-5529-2_1 · doi-reference
On the likelihood that one unknown probability exceeds another in view of the evidence of two samples
10.1093/biomet/25.3-4.285 · doi-reference
Entropy rate estimates for natural language—A new extrapolation of compressed large-scale corpora
10.3390/e18100364 · doi-reference
Algorithms for reinforcement learning
10.1007/978-3-031-01551-9 · doi-reference
A mathematical theory of communication
10.1002/j.1538-7305.1948.tb01338.x · doi-reference
Connectionist models of recognition memory: constraints imposed by learning and forgetting functions
10.1037/0033-295x.97.2.285 · doi-reference
A survey of reinforcement learning algorithms for dynamically varying environments
10.1145/3459991 · doi-reference
A unifying view on dataset shift in classification
10.1016/j.patcog.2011.06.019 · doi-reference
10.1017/9781009051873
10.1017/9781009051873 · doi-reference
10.1017/9781108571401
10.1017/9781108571401 · doi-reference
Exploration vs Exploitation with Partially Observable Gaussian Autoregressive Arms
10.4108/icst.valuetools.2014.258207 · doi-reference
Overcoming catastrophic forgetting in neural networks
10.1073/pnas.1611835114 · doi-reference
Towards continual reinforcement learning: A review and perspectives
10.1613/jair.1.13673 · doi-reference
A New Approach to Linear Filtering and Prediction Problems
10.1115/1.3662552 · doi-reference
10.1007/978-3-540-68677-4_8
10.1007/978-3-540-68677-4_8 · doi-reference
Drinking from a firehose: Continual learning with web-scale natural language
10.1109/tpami.2022.3218265 · doi-reference
Embracing Change: Continual Learning in Deep Neural Networks
10.1016/j.tics.2020.09.004 · doi-reference
A change-detection-based Thompson sampling framework for non-Stationary bandits
10.1109/tc.2020.3022634 · doi-reference