activity
20052026
most citedSimplicial Closure and higher-order link prediction

555 citations · 2.5k across the 105 of their papers we have counts for

collaborators
Showing 2019 · math.OCShow all

5 papers · 2 filters

math.OC2019

Non-Bayesian Social Learning with Uncertain Models over Time-Varying Directed Graphs

César A. Uribe, James Z. Hare, Lance Kaplan +1

We study the problem of non-Bayesian social learning with uncertain models, in which a network of agents seek to cooperatively identify the state of the world based on a sequence o…

math.OC2019

Robust and Adaptive Sequential Submodular Optimization

Vasileios Tzoumas, Ali Jadbabaie, George J. Pappas

Emerging applications of control, estimation, and machine learning, ranging from target tracking to decentralized model fitting, pose resource constraints that limit which of the a…

math.OC2019★ 3 cited

Acceleration in First Order Quasi-strongly Convex Optimization by ODE Discretization

Jingzhao Zhang, Suvrit Sra, Ali Jadbabaie

We study gradient-based optimization methods obtained by direct Runge-Kutta discretization of the ordinary differential equation (ODE) describing the movement of a heavy-ball under…

math.OC2019★ 83 cited

Why gradient clipping accelerates training: A theoretical justification for adaptivity

Jingzhao Zhang, Tianxing He, Suvrit Sra +1

We provide a theoretical explanation for the effectiveness of gradient clipping in training deep neural networks. The key ingredient is a new smoothness condition derived from prac…

math.OC2019

Sales-Based Rebate Design

Amir Ajorlou, Ali Jadbabaie

We propose a novel family of sales-based rebate mechanisms that induce network effects in sales of products that do not exhibit such externalities. The proposed rebate mechanisms e…