1 citations · 2 across the 5 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.LG2023★ 1 cited
Online Convex Optimization with Switching Cost and Delayed Gradients
Spandan Senapati, Rahul Vaze
We consider the online convex optimization (OCO) problem with quadratic and linear switching cost in the limited information setting, where an online algorithm can choose its actio…
math.OC2023★ 1 cited
Sharpened Lazy Incremental Quasi-Newton Method
Aakash Lahoti, Spandan Senapati, Ketan Rajawat +1
The problem of minimizing the sum of functions in dimensions is ubiquitous in machine learning and statistics. In many applications where the number of observations is…