activity
20182026
most citedBlack-box Adversarial Attacks with Bayesian Optimization

25 citations · 64 across the 20 of their papers we have counts for

collaborators
Showing 2018Show all

8 papers · 1 filter

cs.LG2018

Federated Optimization in Heterogeneous Networks

Tian Li, Anit Kumar Sahu, Manzil Zaheer +3

Federated Learning is a distributed learning paradigm with two key challenges that differentiate it from traditional distributed optimization: (1) significant variability in terms…

cs.GT2018

Managing App Install Ad Campaigns in RTB: A Q-Learning Approach

Anit Kumar Sahu, Shaunak Mishra, Narayan Bhamidipati

Real time bidding (RTB) enables demand side platforms (bidders) to scale ad campaigns across multiple publishers affiliated to an RTB ad exchange. While driving multiple campaigns…

math.OC2018

Towards Gradient Free and Projection Free Stochastic Optimization

Anit Kumar Sahu, Manzil Zaheer, Soummya Kar

This paper focuses on the problem of \emph{constrained} \emph{stochastic} optimization. A zeroth order Frank-Wolfe algorithm is proposed, which in addition to the projection-free n…

math.OC2018

Communication-Efficient Distributed Strongly Convex Stochastic Optimization: Non-Asymptotic Rates

Anit Kumar Sahu, Dusan Jakovetic, Dragana Bajovic +1

We examine fundamental tradeoffs in iterative distributed zeroth and first order stochastic optimization in multi-agent networks in terms of \emph{communication cost} (number of pe…

math.OC2018

Distributed Zeroth Order Optimization Over Random Networks: A Kiefer-Wolfowitz Stochastic Approximation Approach

Anit Kumar Sahu, Dusan Jakovetic, Dragana Bajovic +1

We study a standard distributed optimization framework where networked nodes collaboratively minimize the sum of their local convex costs. The main body of existing work consid…

math.OC2018

Convergence rates for distributed stochastic optimization over random networks

Dusan Jakovetic, Dragana Bajovic, Anit Kumar Sahu +1

We establish the O() convergence rate for distributed stochastic gradient methods that operate over strongly convex costs and random networks. The considered class of…