Cover Image

Fooling Algorithms in Non-Stationary Bandits using Belief Inertia

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mendelson, Gal, Tadmor, Eyal
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Concentration of the Langevin Algorithm's Stationary Distribution
by: Altschuler, Jason M., et al.
Published: (2022)

A Unifying Perspective on Non-Stationary Kernels for Deeper Gaussian Processes
by: Noack, Marcus M., et al.
Published: (2023)

Learning Service Slowdown using Observational Data
by: Kuang, Xu, et al.
Published: (2024)

Deep Learning for Markov Chains: Lyapunov Functions, Poisson's Equation, and Stationary Distributions
by: Qu, Yanlin, et al.
Published: (2025)

Fast Conditional Mixing of MCMC Algorithms for Non-log-concave Distributions
by: Cheng, Xiang, et al.
Published: (2023)

Non-Asymptotic Convergence of Stochastic Iterative Algorithms: A Lyapunov Framework
by: Chen, Zaiwei, et al.
Published: (2026)

Near-Optimal Algorithm for Non-Stationary Kernelized Bandits
by: Iwazaki, Shogo, et al.
Published: (2024)

A UCB Bandit Algorithm for General ML-Based Estimators
by: Liu, Yajing, et al.
Published: (2026)

Non-Reversible Langevin Algorithms for Constrained Sampling
by: Du, Hengrong, et al.
Published: (2025)

Bandit Allocational Instability
by: Chen, Yilun, et al.
Published: (2026)

Scalable Machine Learning Algorithms using Path Signatures
by: Tóth, Csaba
Published: (2025)

Strategic A/B testing via Maximum Probability-driven Two-armed Bandit
by: Zhang, Yu, et al.
Published: (2025)

Fitting an ellipsoid to a quadratic number of random points
by: Bandeira, Afonso S., et al.
Published: (2023)

Non-Stationary Lipschitz Bandits
by: Nguyen, Nicolas, et al.
Published: (2025)

Extended UCB Policies for Multi-armed Bandit Problems
by: Liu, Keqin, et al.
Published: (2011)

Model Predictive Control is Almost Optimal for Restless Bandit
by: Gast, Nicolas, et al.
Published: (2024)

Approximating Uniform Random Rotations by Two-Block Structured Hadamard Rotations in High Dimensions
by: Zilca, Tomer, et al.
Published: (2026)

A Practical Algorithm for Feature-Rich, Non-Stationary Bandit Problems
by: Loh, Wei Min, et al.
Published: (2026)

Representative Action Selection for Large Action Space Bandit Families
by: Zhou, Quan, et al.
Published: (2025)

Anchored Langevin Algorithms
by: Gurbuzbalaban, Mert, et al.
Published: (2025)

Representative Action Selection for Large Action Space: From Bandits to MDPs
by: Zhou, Quan, et al.
Published: (2025)

gp2Scale: A Class of Compactly-Supported Non-Stationary Kernels and Distributed Computing for Exact Gaussian Processes on 10 Million Data Points
by: Noack, Marcus M., et al.
Published: (2025)

Stationary distribution of node2vec random walks on household models
by: Schroeder, Lars, et al.
Published: (2025)

Model Predictive Control is almost Optimal for Heterogeneous Restless Multi-armed Bandits
by: Narasimha, Dheeraj, et al.
Published: (2025)

High-Order Langevin Monte Carlo Algorithms
by: Dang, Thanh, et al.
Published: (2025)

Early Stopping in Contextual Bandits and Inferences
by: Cui, Zihan
Published: (2025)

Throughput-Optimal Scheduling Algorithms for LLM Inference and AI Agents
by: Dai, J. G., et al.
Published: (2025)

Inequalities for Optimization of Classification Algorithms: A Perspective Motivated by Diagnostic Testing
by: Patrone, Paul N., et al.
Published: (2025)

Suboptimal Performance of the Bayes Optimal Algorithm in Frequentist Best Arm Identification
by: Komiyama, Junpei
Published: (2022)

Selective Reviews of Bandit Problems in AI via a Statistical View
by: Zhou, Pengjie, et al.
Published: (2024)

Adaptive Smooth Non-Stationary Bandits
by: Suk, Joe
Published: (2024)

On Universality of Non-Separable Approximate Message Passing Algorithms
by: Lovig, Max, et al.
Published: (2025)

Random ReLU Neural Networks as Non-Gaussian Processes
by: Parhi, Rahul, et al.
Published: (2024)

Lagrangian Index Policy for Restless Bandits with Average Reward
by: Avrachenkov, Konstantin, et al.
Published: (2024)

Algorithms and Scientific Software for Quasi-Monte Carlo, Fast Gaussian Process Regression, and Scientific Machine Learning
by: Sorokin, Aleksei G.
Published: (2025)

Regime-Switching Langevin Monte Carlo Algorithms
by: Wang, Xiaoyu, et al.
Published: (2025)

A Learning-Based Superposition Operator for Non-Renewal Arrival Processes in Queueing Networks
by: Sherzer, Eliran
Published: (2026)

The Partition Principle Revisited: Non-Equal Volume Designs Achieve Minimal Expected Star Discrepancy
by: Xu, Xiaoda
Published: (2026)

Non-Stationary Bandit Learning via Predictive Sampling
by: Liu, Yueyang, et al.
Published: (2022)

Smooth Non-Stationary Bandits
by: Jia, Su, et al.
Published: (2023)