Cover Image

Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Tsuchiya, Taira, Ito, Shinji, Honda, Junya
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds
by: Ito, Shinji, et al.
Published: (2024)

Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds
by: Tsuchiya, Taira, et al.
Published: (2023)

A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $Θ(T^{2/3})$ and its Application to Best-of-Both-Worlds
by: Tsuchiya, Taira, et al.
Published: (2024)

Adversarial Learning in Games with Bandit Feedback: Logarithmic Pure-Strategy Maximin Regret
by: Ito, Shinji, et al.
Published: (2026)

Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets
by: Tsuchiya, Taira, et al.
Published: (2024)

Reinforcement Learning from Adversarial Preferences in Tabular MDPs
by: Tsuchiya, Taira, et al.
Published: (2025)

Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound
by: Sakaue, Shinsaku, et al.
Published: (2025)

Follow-the-Perturbed-Leader with Fréchet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds
by: Lee, Jongyeong, et al.
Published: (2024)

Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback
by: Ito, Shinji, et al.
Published: (2025)

Learning with Posterior Sampling for Revenue Management under Time-varying Demand
by: Shimizu, Kazuma, et al.
Published: (2024)

Corrupted Learning Dynamics in Games
by: Tsuchiya, Taira, et al.
Published: (2024)

Scale-Invariant Fast Convergence in Games
by: Tsuchiya, Taira, et al.
Published: (2026)

Tight Regret Upper and Lower Bounds for Optimistic Hedge in Two-Player Zero-Sum Games
by: Tsuchiya, Taira
Published: (2025)

Optimal Regret of Bernoulli Bandits under Global Differential Privacy
by: Azize, Achraf, et al.
Published: (2025)

Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback
by: Ito, Shinji, et al.
Published: (2025)

Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis
by: Sakaue, Shinsaku, et al.
Published: (2025)

Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problems
by: Lee, Jongyeong, et al.
Published: (2025)

Data- and Variance-dependent Regret Bounds for Online Tabular MDPs
by: Li, Mingyi, et al.
Published: (2026)

Online Control of Linear Systems under Unbounded Noise
by: Ito, Kaito, et al.
Published: (2024)

Logarithmic Regret for Online KL-Regularized Reinforcement Learning
by: Zhao, Heyang, et al.
Published: (2025)

Logarithmic Regret of Exploration in Average Reward Markov Decision Processes
by: Boone, Victor, et al.
Published: (2025)

Thompson Exploration with Best Challenger Rule in Best Arm Identification
by: Lee, Jongyeong, et al.
Published: (2023)

Online Structured Prediction with Fenchel--Young Losses and Improved Surrogate Regret for Online Multiclass Classification with Logistic Loss
by: Sakaue, Shinsaku, et al.
Published: (2024)

Optimal Dynamic Regret by Transformers for Non-Stationary Reinforcement Learning
by: Chen, Baiyuan, et al.
Published: (2025)

Heavy-tailed Linear Bandits: Adversarial Robustness, Best-of-both-worlds, and Beyond
by: Zhao, Canzhe, et al.
Published: (2025)

Logarithmic Regret for Nonlinear Control
by: Wang, James, et al.
Published: (2025)

Simple Projection-Free Algorithm for Contextual Recommendation with Logarithmic Regret and Robustness
by: Sakaue, Shinsaku
Published: (2026)

Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems
by: Chen, Botao, et al.
Published: (2025)

Instance-Dependent Regret Bounds for Nonstochastic Linear Partial Monitoring
by: Di Gennaro, Federico, et al.
Published: (2025)

Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret
by: Zhong, Han, et al.
Published: (2023)

Achieving Logarithmic Regret in KL-Regularized Zero-Sum Markov Games
by: Nayak, Anupam, et al.
Published: (2025)

Multi-Player Approaches for Dueling Bandits
by: Raveh, Or, et al.
Published: (2024)

Finite-Time Logarithmic Bayes Regret Upper Bounds
by: Atsidakou, Alexia, et al.
Published: (2023)

Logarithmic Neyman Regret for Adaptive Estimation of the Average Treatment Effect
by: Neopane, Ojash, et al.
Published: (2024)

Rate-optimal Design for Anytime Best Arm Identification
by: Komiyama, Junpei, et al.
Published: (2025)

The Survival Bandit Problem
by: Riou, Charles, et al.
Published: (2022)

A General Recipe for the Analysis of Randomized Multi-Armed Bandit Algorithms
by: Baudry, Dorian, et al.
Published: (2023)

Globalized Adversarial Regret Optimization: Robust Decisions with Uncalibrated Predictions
by: Kurtz, Jannis, et al.
Published: (2026)

Bayesian Optimisation with Unknown Hyperparameters: Regret Bounds Logarithmically Closer to Optimal
by: Ziomek, Juliusz, et al.
Published: (2024)

Logarithmic Regret for Unconstrained Submodular Maximization Stochastic Bandit
by: Zhou, Julien, et al.
Published: (2024)