activity
20162026
most citedBeyond Adaptive Submodularity: Approximation Guarantees of Greedy Policy with Adaptive Submodularity Ratio

16 citations · 30 across the 24 of their papers we have counts for

collaborators
Showing 2025Show all

5 papers · 1 filter

cs.LG2025

Non-Stationary Online Structured Prediction with Surrogate Losses

Shinsaku Sakaue, Han Bao, Yuzhou Cao

Online structured prediction, including online classification as a special case, is the task of sequentially predicting labels from input features. In this setting, the surrogate r…

cs.LG2025

Revisiting Online Learning Approach to Inverse Linear Optimization: A FenchelYoung Loss Perspective and Gap-Dependent Regret Analysis

Shinsaku Sakaue, Han Bao, Taira Tsuchiya

This paper revisits the online learning approach to inverse linear optimization studied by Bärmann et al. (2017), where the goal is to infer an unknown linear objective function of…

cs.LG2025

Bandit and Delayed Feedback in Online Structured Prediction

Yuki Shibukawa, Taira Tsuchiya, Shinsaku Sakaue +1

Online structured prediction is a task of sequentially predicting outputs with complex structures based on inputs and past observations, encompassing online classification. Recent…

stat.ML2025

Any-stepsize Gradient Descent for Separable Data under Fenchel-Young Losses

Han Bao, Shinsaku Sakaue, Yuki Takezawa

The gradient descent (GD) has been one of the most common optimizer in machine learning. In particular, the loss landscape of a neural network is typically sharpened during the ini…

cs.LG2025

Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound

Shinsaku Sakaue, Taira Tsuchiya, Han Bao +1

In online inverse linear optimization, a learner observes time-varying sets of feasible actions and an agent's optimal actions, selected by solving linear optimization over the fea…