No article text was recorded for this version.
variation budget dependency
Version 2 of 2205 papers234 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Non-stationary Stochastic Optimization
- Blog: Optimal Exploration-Exploitation in a Multi-Armed-Bandit Problem with Non-stationary Rewards
- Blog: Tracking the Best Expert in Non-stationary Stochastic Environments
- Blog: Variational Regret Bounds for Reinforcement Learning
- Blog: BOF-UCB: A Bayesian-Optimistic Frequentist Algorithm for Non-Stationary Contextual Bandits
- Blog: Weighted Gaussian Process Bandits for Non-stationary Environments
- Blog: Online Learning Problems against Dynamic Strategies in Gradually Evolving Worlds
- Blog: Variational Regret Bounds for Reinforcement Learning
- Blog: Learning User Preferences in Non-Stationary Environments
- Blog: On Slowly-varying Non-stationary Bandits
- Blog: Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards
- Blog: Constrained Feedback Learning for Non-Stationary Multi-Armed Bandits
- Blog: Selective Sampling with Drift
- Blog: Optimistic Policy Optimization is Provably Efficient in Non-stationary MDPs
- Blog: Kiefer Wolfowitz Algorithm is Asymptotically Optimal for a Class of Non-Stationary Bandit Problems
- Blog: Revisiting Weighted Strategy for Non-stationary Parametric Bandits
- Blog: Non-stationary Stochastic Optimization under $L_{p,q}$-Variation Measures
- Blog: Weighted Linear Bandits for Non-Stationary Environments
- Blog: Shifting Regret, Mirror Descent, and Matrices
- Blog: Non-stationary Risk-Sensitive Reinforcement Learning: Near-Optimal Dynamic Regret, Adaptive Detection, and Separation Design
- Blog: Weighted Gaussian Process Bandits for Non-stationary Environments
- Blog: Non-stationary Stochastic Optimization with Local Spatial and Temporal Changes
- Blog: Dynamic Regret of Policy Optimization in Non-stationary Environments
- Blog: Non-stationary Bandits with Knapsacks
- Blog: Dynamic Regret of Policy Optimization in Non-Stationary Environments
- Blog: Revisiting Weighted Strategy for Non-stationary Parametric Bandits
- Blog: Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary Environments
- Blog: Stochastic optimization under time drift: iterate averaging, step-decay schedules, and high probability guarantees
- Blog: Second-Order Non-Stationary Online Learning for Regression
- Blog: Bandit Phase Retrieval
- Blog: An Improved Algorithm for Learning Drifting Discrete Distributions
- Blog: Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits
- Blog: Online Learning of Whittle Indices for Restless Bandits with Non-Stationary Transition Kernels
- Blog: Projection-free Online Learning in Dynamic Environments
- Blog: Approximate optimality with bounded regret in dynamic matching models
- Blog: Efficient Learning in Non-Stationary Linear Markov Decision Processes
- Blog: Nearly Optimal Adaptive Procedure for Piecewise-Stationary Bandit: a Change-Point Detection Approach
- Blog: Learning to Optimize under Non-Stationarity
- Blog: Dynamic Regret of Online Markov Decision Processes
- Blog: Dynamic Regret of Strongly Adaptive Methods
- Blog: Improved Path-length Regret Bounds for Bandits
- Blog: Learning User Preferences in Non-Stationary Environments
- Blog: Provably Efficient Algorithm for Nonstationary Low-Rank MDPs
- Blog: Bandit Submodular Maximization for Multi-Robot Coordination in Unpredictable and Partially Observable Environments
- Blog: Understand Dynamic Regret with Switching Cost for Online Decision Making
- Blog: Learning Constrained Markov Decision Processes With Non-stationary Rewards and Constraints
- Blog: Efficient Contextual Bandits in Non-stationary Worlds
- Blog: Provably Efficient Algorithm for Nonstationary Low-Rank MDPs
- Blog: A Simple Approach for Non-stationary Linear Bandits
- Blog: Cascading Non-Stationary Bandits: Online Learning to Rank in the Non-Stationary Cascade Model
- Blog: Zeroth-order non-convex learning via hierarchical dual averaging
- Blog: Dynamic Regret of Online Markov Decision Processes
- Blog: A Sliding-Window Algorithm for Markov Decision Processes with Arbitrarily Changing Rewards and Transitions
- Blog: Online Learning for Changing Environments using Coin Betting
- Blog: Tracking Most Significant Shifts in Infinite-Armed Bandits
- Blog: ANACONDA: An Improved Dynamic Regret Algorithm for Adaptive Non-Stationary Dueling Bandits
- Blog: A Kernel-Based Approach to Non-Stationary Reinforcement Learning in Metric Spaces
- Blog: Statistical Learning under Nonstationary Mixing Processes
- Blog: Bandit Submodular Maximization for Multi-Robot Coordination in Unpredictable and Partially Observable Environments
- Blog: No-Regret Learning in Time-Varying Zero-Sum Games
Showing 60 of 205 papers.
History & citation
Current · Permanent link
- Optimal Dynamic Regret without Prior Knowledge merged into this direction (66% overlap)
- periodic restart strategy split from this direction (52% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_variation_budget_dependency_a2ece981,
title = {variation budget dependency},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/variation-budget-dependency/rdr_a2ece981b975490ba144d67a5dd2fe13},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 2, frozen text):
@misc{lacuna_variation_budget_dependency_a2ece981_v2,
title = {variation budget dependency},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/variation-budget-dependency/rdr_a2ece981b975490ba144d67a5dd2fe13/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-22},
}