382 citations · 1.3k across the 17 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LG2019★ 8 cited
Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition
Lin Chen, Qian Yu, Hannah Lawrence +1
We study the problem of switching-constrained online convex optimization (OCO), where the player has a limited number of opportunities to change her action. While the discrete anal…
cs.IT2019★ 1 cited
Harmonic Coding: An Optimal Linear Code for Privacy-Preserving Gradient-Type Computation
Qian Yu, A. Salman Avestimehr
We consider the problem of distributedly computing a general class of functions, referred to as gradient-type computation, while maintaining the privacy of the input dataset. Gradi…