Cover Image

Simple Projection-Free Algorithm for Contextual Recommendation with Logarithmic Regret and Robustness

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Sakaue, Shinsaku
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting
by: Oki, Taihei, et al.
Published: (2024)

Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
by: Oki, Taihei, et al.
Published: (2026)

From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model
by: Sakaue, Shinsaku, et al.
Published: (2026)

Generalization Bound and Learning Methods for Data-Driven Projections in Linear Programming
by: Sakaue, Shinsaku, et al.
Published: (2023)

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)

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)

Non-Stationary Online Structured Prediction with Surrogate Losses
by: Sakaue, Shinsaku, et al.
Published: (2025)

Any-stepsize Gradient Descent for Separable Data under Fenchel-Young Losses
by: Bao, Han, et al.
Published: (2025)

Bandit and Delayed Feedback in Online Structured Prediction
by: Shibukawa, Yuki, et al.
Published: (2025)

Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit
by: Kim, Seok-Jin, et al.
Published: (2024)

Active Context Selection Improves Simple Regret in Contextual Bandits
by: Shahverdikondori, Mohammad, et al.
Published: (2026)

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

Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring
by: Tsuchiya, Taira, et al.
Published: (2024)

Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games
by: Gao, Minbo, et al.
Published: (2023)

Learning What to Recommend: Minimax Optimal Simple Regret in Logistic Bandits
by: Liu, Shuai, et al.
Published: (2026)

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

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

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

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

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)

Optimal Regret for Policy Optimization in Contextual Bandits
by: Levy, Orin, et al.
Published: (2026)

Fast Best-in-Class Regret for Contextual Bandits
by: Girard, Samuel, et al.
Published: (2025)

Eluder-based Regret for Stochastic Contextual MDPs
by: Levy, Orin, et al.
Published: (2022)

Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions
by: Jiang, Jiashuo, et al.
Published: (2022)

Queue Length Regret Bounds for Contextual Queueing Bandits
by: Bae, Seoungbin, et al.
Published: (2026)

How Does Variance Shape the Regret in Contextual Bandits?
by: Jia, Zeyu, et al.
Published: (2024)

Regret Guarantees for Linear Contextual Stochastic Shortest Path
by: Polikar, Dor, et al.
Published: (2025)

Logarithmic Regret and Polynomial Scaling in Online Multi-step-ahead Prediction
by: Qian, Jiachen, et al.
Published: (2025)

Tighter Regret Bounds for Contextual Action-Set Reinforcement Learning
by: Chen, Zijun, et al.
Published: (2026)

Federated Q-Learning with Reference-Advantage Decomposition: Almost Optimal Regret and Logarithmic Communication Cost
by: Zheng, Zhong, et al.
Published: (2024)

Sequential Probability Assignment with Contexts: Minimax Regret, Contextual Shtarkov Sums, and Contextual Normalized Maximum Likelihood
by: Liu, Ziyi, et al.
Published: (2024)

Variance-Dependent Regret Lower Bounds for Contextual Bandits
by: He, Jiafan, et al.
Published: (2025)

On the Optimal Regret of Locally Private Linear Contextual Bandit
by: Li, Jiachun, et al.
Published: (2024)

Logarithmic Width Suffices for Robust Memorization
by: Egosi, Amitsour, et al.
Published: (2025)

Why Most Optimism Bandit Algorithms Have the Same Regret Analysis: A Simple Unifying Theorem
by: Krishnamurthy, Vikram
Published: (2025)

Parameter-Free Algorithms for Performative Regret Minimization under Decision-Dependent Distributions
by: Park, Sungwoo, et al.
Published: (2024)

Contextual Bandit with Herding Effects: Algorithms and Recommendation Applications
by: Xu, Luyue, et al.
Published: (2024)

An Online Gradient-Based Caching Policy with Logarithmic Complexity and Regret Guarantees
by: Carra, Damiano, et al.
Published: (2024)