NewA calmer, faster ZeroHour — security assessments on articles, story timelines and search from any page.

#regret

0 stories this week · 2 this month · 2 in 6 months · mostly AI

Stories per day · 30 days

Relatedai-alignment1 bandits1 computational-complexity1 inverse-optimization1 np-hard1 online-learning1 robust-learning1 theory1 variable-metric1

2 stories, newest first · one card per story

arXiv cs.AI / cs.LG / cs.CL19d ago

On the Computational Tractability of Robust Bandits

Researchers give a polynomial-time robust bandit learner with near-square-root regret and show nearby variants are NP-hard.

bandits robust-learning

1

arXiv cs.AI / cs.LG / cs.CL19d ago

Optimal and Efficient Online Inverse Optimization

A deterministic polynomial-time algorithm achieves optimal O(sqrt d) regret for online inverse linear optimization.

online-learning inverse-optimization

2