Goto

Collaborating Authors

 Statistical Learning



Small steps no more: Global convergence of stochastic gradient bandits for arbitrary learning rates

Neural Information Processing Systems

In particular, we establish the surprising result that: F or any constant learning rate η > 0, the stochastic gradient bandit algorithm is guaranteed to converge to the globally optimal policy almost surely.






Uncovering the Hidden Dynamics of Video Self-supervised Learning under Distribution Shifts

Neural Information Processing Systems

Specifically, we pose and answer the following questions: Q1. How do the learned spatial and temporal representations vary based on different VSSL pretrain-ing methodologies? How robust are these representations to different distribution shifts?