1 citations · 1 across the 13 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.LG2025
A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
Zachary Chase, Shinji Ito, Idan Mehalel
We determine the minimax optimal expected regret in the classic non-stochastic multi-armed bandit with expert advice problem, by proving a lower bound that matches the upper bound…
stat.ML2025
Online Learning of Neural Networks
Amit Daniely, Idan Mehalel, Elchanan Mossel
We study online learning of feedforward neural networks with the sign activation function that implement functions from the unit ball in to a finite label set $\{1,…