Showing cs.LGShow all
2 papers · 1 filter
cs.LG2026
Approximating Uniform Random Rotations by Two-Block Structured Hadamard Rotations in High Dimensions
Tomer Zilca, Gal Mendelson
Uniform random rotations are a useful primitive in applications such as fast Johnson-Lindenstrauss embeddings, kernel approximation, communication-efficient learning, and recent AI…
cs.LG2025
Fooling Algorithms in Non-Stationary Bandits using Belief Inertia
Gal Mendelson, Eyal Tadmor
We study the problem of worst case regret in piecewise stationary multi armed bandits. While the minimax theory for stationary bandits is well established, understanding analogous…