No article text was recorded for this version.
periodic restart strategy
Version 1 of 131 papers39 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Interference Constrained Beam Alignment for Time-Varying Channels via Kernelized Bandits
- Blog: Non-Stationary Bandits with Auto-Regressive Temporal Dependency
- Blog: A Simple Approach for Non-stationary Linear Bandits
- Blog: Time-Varying Gaussian Process Bandit Optimization
- Blog: Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards
- Blog: Variance-Dependent Regret Bounds for Nonstationary Linear Bandits
- Blog: Near-Optimal Model-Free Reinforcement Learning in Non-Stationary Episodic MDPs
- Blog: Semi-Parametric Contextual Pricing with General Smoothness
- Blog: Tracking the Best Expert in Non-stationary Stochastic Environments
- Blog: Variational Regret Bounds for Reinforcement Learning
- Blog: Efficient Contextual Bandits in Non-stationary Worlds
- Blog: A Kernel-Based Approach to Non-Stationary Reinforcement Learning in Metric Spaces
- Blog: Near-Optimal Algorithm for Non-Stationary Kernelized Bandits
- Blog: On the Dynamic Regret of Following the Regularized Leader: Optimism with History Pruning
- Blog: Stochastic Bandits with Graph Feedback in Non-Stationary Environments
- Blog: Provably Efficient Model-Free Algorithms for Non-stationary CMDPs
- Blog: Decentralized Cooperative Multi-Agent Reinforcement Learning with Exploration
- Blog: A Black-box Approach for Non-stationary Multi-agent Reinforcement Learning
- Blog: Provably Efficient Primal-Dual Reinforcement Learning for CMDPs with Non-stationary Objectives and Constraints
- Blog: Competing Bandits in Time Varying Matching Markets
- Blog: Truth and Regret in Online Scheduling
- Blog: Online Non-convex Learning in Dynamic Environments
- Blog: Sun Tracking using a Weightless Q-Learning Neural Network
- Blog: Distribution-Aware Online Learning for Urban Spatiotemporal Forecasting on Streaming Data
- Blog: Non-stationary Risk-Sensitive Reinforcement Learning: Near-Optimal Dynamic Regret, Adaptive Detection, and Separation Design
- Blog: No-Regret Algorithms for Time-Varying Bayesian Optimization
- Blog: Learning to Collaborate in Markov Decision Processes
- Blog: A Biased Graph Neural Network Sampler with Near-Optimal Regret
- Blog: Dynamic Regret of Policy Optimization in Non-Stationary Environments
- Blog: Approximately Stationary Bandits with Knapsacks
- Blog: Nonstationary Reinforcement Learning with Linear Function Approximation
History & citation
Current · Permanent link
- This direction split from variation budget dependency (52% overlap)
- This direction split from Adaptive Learning through Strategic Memory Resets (52% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_periodic_restart_strategy_e1e63f61,
title = {periodic restart strategy},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/periodic-restart-strategy/rdr_e1e63f617c5644609f6937cf974989a5},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_periodic_restart_strategy_e1e63f61_v1,
title = {periodic restart strategy},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/periodic-restart-strategy/rdr_e1e63f617c5644609f6937cf974989a5/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}