:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Shimizu, Kazuma, Honda, Junya, Ito, Shinji, Nakadai, Shinji
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2405.04910
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)

Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring
by: Tsuchiya, Taira, 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)

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)

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

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

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)

LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits
by: Kato, Masahiro, et al.
Published: (2024)

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)

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

Influential Bandits: Pulling an Arm May Change the Environment
by: Sato, Ryoma, et al.
Published: (2025)

Fast EXP3 Algorithms
by: Sato, Ryoma, et al.
Published: (2025)

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

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

Bandit Max-Min Fair Allocation
by: Harada, Tsubasa, et al.
Published: (2025)

A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
by: Chase, Zachary, et al.
Published: (2025)

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

Demand Balancing in Primal-Dual Optimization for Blind Network Revenue Management
by: Miao, Sentao, et al.
Published: (2024)

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

Replicability is Asymptotically Free in Multi-armed Bandits
by: Komiyama, Junpei, et al.
Published: (2024)

Combinatorial Allocation Bandits with Nonlinear Arm Utility
by: Shibukawa, Yuki, et al.
Published: (2026)

Safe Arrival Scheduling at Constraint Waypoints in UAM Corridors
by: Pruekprasert, Sasinee, et al.
Published: (2026)

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

A Perturbation Approach to Unconstrained Linear Bandits
by: Jacobsen, Andrew, et al.
Published: (2026)

Data-dependent Bounds with $T$-Optimal Best-of-Both-Worlds Guarantees in Multi-Armed Bandits using Stability-Penalty Matching
by: Nguyen, Quan, et al.
Published: (2025)

Safety-Assured Arrival Scheduling in Sequential UAM Corridor Sections under Speed and Separation Constraints
by: Pruekprasert, Sasinee, et al.
Published: (2026)

Online $\mathrm{L}^{\natural}$-Convex Minimization
by: Yokoyama, Ken, et al.
Published: (2024)

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

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)

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

A Further Efficient Algorithm with Best-of-Both-Worlds Guarantees for $m$-Set Semi-Bandit Problem
by: Chen, Botao, et al.
Published: (2026)

Revenue Optimization with Price-Sensitive and Interdependent Demand
by: Laasri, Julien, et al.
Published: (2025)

Learning Attributed Graphlets: Predictive Graph Mining by Graphlets with Trainable Attribute
by: Shinji, Tajima, et al.
Published: (2024)

Don't Learn the Shape: Forecasting Periodic Time Series by Rank-1 Decomposition
by: Honda, Takato
Published: (2026)

Efficient Adaptive Experimental Design for Average Treatment Effect Estimation
by: Kato, Masahiro, et al.
Published: (2020)

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

Theoretical Analysis of Heteroscedastic Gaussian Processes with Posterior Distributions
by: Ito, Yuji
Published: (2024)