activity
20072026
most citedOnline Learning with Inexact Proximal Online Gradient Descent Algorithms

111 citations · 338 across the 50 of their papers we have counts for

collaborators
Showing 2019Show all

11 papers · 1 filter

math.OC2019★ 13 cited

Parallel Restarted SPIDER -- Communication Efficient Distributed Nonconvex Optimization with Optimal Computation Complexity

Pranay Sharma, Swatantra Kafle, Prashant Khanduri +3

In this paper, we propose a distributed algorithm for stochastic smooth, non-convex optimization. We assume a worker-server architecture where nodes, each having (potential…

cs.RO2019

Model Free Calibration of Wheeled Robots Using Gaussian Process

Mohan Krishna Nutalapati, Lavish Arora, Anway Bose +2

Robotic calibration allows for the fusion of data from multiple sensors such as odometers, cameras, etc., by providing appropriate relationships between the corresponding reference…

math.OC2019★ 7 cited

Nonstationary Nonparametric Online Learning: Balancing Dynamic Regret and Model Parsimony

Amrit Singh Bedi, Alec Koppel, Ketan Rajawat +1

An open challenge in supervised learning is \emph{conceptual drift}: a data point begins as classified according to one label, but over time the notion of that label changes. Beyon…

eess.SP2019★ 2 cited

Optimally Compressed Nonparametric Online Learning

Alec Koppel, Amrit Singh Bedi, Ketan Rajawat +1

Batch training of machine learning models based on neural networks is now well established, whereas to date streaming methods are largely based on linear models. To go beyond linea…

math.OC2019

Adaptive Kernel Learning in Heterogeneous Networks

Hrusikesha Pradhan, Amrit Singh Bedi, Alec Koppel +1

We consider learning in decentralized heterogeneous networks: agents seek to minimize a convex functional that aggregates data across the network, while only having access to their…

math.OC2019★ 4 cited

Distributed Inexact Successive Convex Approximation ADMM: Analysis-Part I

Sandeep Kumar, Ketan Rajawat, Daniel P. Palomar

In this two-part work, we propose an algorithmic framework for solving non-convex problems whose objective function is the sum of a number of smooth component functions plus a conv…