activity
20162023
most citedConsensus+Innovations Distributed Kalman Filter with Optimized Gains

158 citations · 280 across the 27 of their papers we have counts for

collaborators
Showing 2020Show all

8 papers · 1 filter

eess.SY2020★ 4 cited

Online Optimal Control with Affine Constraints

Yingying Li, Subhro Das, Na Li

This paper considers online optimal control with affine constraints on the states and actions under linear dynamics with bounded random disturbances. The system dynamics and constr…

cs.AI2020

Verifiably Safe Exploration for End-to-End Reinforcement Learning

Nathan Hunt, Nathan Fulton, Sara Magliacane +3

Deploying deep reinforcement learning in safety-critical settings requires developing algorithms that obey hard constraints during exploration. This paper contributes a first appro…

cs.LG2020

GAT-GMM: Generative Adversarial Training for Gaussian Mixture Models

Farzan Farnia, William Wang, Subhro Das +1

Generative adversarial networks (GANs) learn the distribution of observed samples through a zero-sum game between two machine players, a generator and a discriminator. While GANs a…

cs.SE2020★ 1 cited

Formal Verification of End-to-End Learning in Cyber-Physical Systems: Progress and Challenges

Nathan Fulton, Nathan Hunt, Nghia Hoang +1

Autonomous systems -- such as self-driving cars, autonomous drones, and automated trains -- must come with strong safety guarantees. Over the past decade, techniques based on forma…

cs.LG2020★ 1 cited

A Dynamical Systems Approach for Convergence of the Bayesian EM Algorithm

Orlando Romero, Subhro Das, Pin-Yu Chen +1

Out of the recent advances in systems and control (S\&C)-based analysis of optimization algorithms, not enough work has been specifically dedicated to machine learning (ML) algorit…

math.OC2020

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…