15 citations · 49 across the 6 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.LG2017★ 7 cited
Coordinate Descent with Bandit Sampling
Farnood Salehi, Patrick Thiran, L. Elisa Celis
Coordinate descent methods usually minimize a cost function by updating a random decision variable (corresponding to one coordinate) at a time. Ideally, we would update the decisio…
cs.LG2017★ 11 cited
Stochastic Optimization with Bandit Sampling
Farnood Salehi, L. Elisa Celis, Patrick Thiran
Many stochastic optimization algorithms work by estimating the gradient of the cost function on the fly by sampling datapoints uniformly at random from a training set. However, the…
cs.LG2017★ 1 cited
Lean From Thy Neighbor: Stochastic & Adversarial Bandits in a Network
L. Elisa Celis, Farnood Salehi
An individual's decisions are often guided by those of his or her peers, i.e., neighbors in a social network. Presumably, being privy to the experiences of others aids in learning…