158 citations · 280 across the 27 of their papers we have counts for
4 papers · 1 filter
Non-asymptotic System Identification for Linear Systems with Nonlinear Policies
Yingying Li, Tianpeng Zhang, Subhro Das +2
This paper considers a single-trajectory system identification problem for linear systems under general nonlinear and/or time-varying policies with i.i.d. random excitation noises.…
On Convergence of Gradient Descent Ascent: A Tight Local Analysis
Haochuan Li, Farzan Farnia, Subhro Das +1
Gradient Descent Ascent (GDA) methods are the mainstream algorithms for minimax optimization in generative adversarial networks (GANs). Convergence properties of GDA have drawn sig…
A Stochastic Proximal Gradient Framework for Decentralized Non-Convex Composite Optimization: Topology-Independent Sample Complexity and Communication Efficiency
Ran Xin, Subhro Das, Usman A. Khan +1
Decentralized optimization is a promising parallel computation paradigm for large-scale data analytics and machine learning problems defined over a network of nodes. This paper is…
Beyond Worst-Case Analysis in Stochastic Approximation: Moment Estimation Improves Instance Complexity
Jingzhao Zhang, Hongzhou Lin, Subhro Das +2
We study oracle complexity of gradient based methods for stochastic approximation problems. Though in many settings optimal algorithms and tight lower bounds are known for such pro…