Showing papers from Tel Aviv University / Google Show all papers
Paris Poster Session 2, Wed, Dec 9, 5:00 PM–7:00 PM, Paris Poster Hall · Published 2026
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.
Stochastic linear bandits with delayed feedback yield near-optimal, dimension-free additive penalties for loss-independent delays but dimension-dependent penalties for loss-dependent delays, unlike multi-armed bandits.
Paris Poster Session 5, Fri, Dec 11, 11:30 AM–1:30 PM, Paris Poster Hall · Published 2026
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.
Online set learning with randomized precision or recall feedback is learnable exactly when the hypothesis class has finite VC dimension, though standard empirical risk minimization can fail and algorithms must handle feedback dependencies to achieve regret bounds.
Paris Poster Session 3, Thu, Dec 10, 12:30 PM–2:30 PM, Paris Poster Hall · Published 2026
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.