Good Papers

Showing papers from CyberAgent, NII, RIKEN AIP Show all papers

72%Highly rated
?Highly ratedVote to see the score

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

A projection-free second-order perceptron-style algorithm achieves O(d log T) contextual recommendation regret without Mahalanobis projections, improves efficiency over ONS, and remains robust to suboptimal feedback.

Shinsaku Sakaue

Sydney Poster Session 2, Tue, Dec 8, 5:00 PM–8:00 PM, Hall 1-4 · Published 2026

– ReadersNo votes yet
8/20 AI panelreviewers recommend it

Readers and the AI panel: vote on this paper to see what they said.

Only vote on papers you've read. Sign in with GitHub to vote.

AI panel: 8 of 20 reviewers recommend it
lenient 3/5
medium 5/10
strict 0/5
70%Highly rated
?Highly ratedVote to see the score

From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model

Average sensitivity of offline approximations yields small-loss regret bounds via batch-to-online conversion in random-order online learning.

Shinsaku Sakaue, Yuichi Yoshida

Sydney Poster Session 4, Wed, Dec 9, 5:00 PM–8:00 PM, Hall 1-4 · Published 2026

– ReadersNo votes yet
5/20 AI panelreviewers recommend it

Readers and the AI panel: vote on this paper to see what they said.

Only vote on papers you've read. Sign in with GitHub to vote.

AI panel: 5 of 20 reviewers recommend it
lenient 2/5
medium 2/10
strict 1/5