Asuman Ozdaglar

is this you? claim profile

0 followers
MIT

Optimal intervention in traffic networks

We present an efficient algorithm to identify which edge should be impro...
02/16/2021 ∙ by Leonardo Cianfanelli, et al. ∙ 0 ∙ share

read it
Generalization of Model-Agnostic Meta-Learning Algorithms: Recurring and Unseen Tasks

In this paper, we study the generalization properties of Model-Agnostic ...
02/07/2021 ∙ by Alireza Fallah, et al. ∙ 0 ∙ share

read it
Multi-agent Bayesian Learning with Adaptive Strategies: Convergence and Stability

We study learning dynamics induced by strategic agents who repeatedly pl...
10/18/2020 ∙ by Manxi Wu, et al. ∙ 0 ∙ share

read it
Fictitious play in zero-sum stochastic games

We present fictitious play dynamics for the general class of stochastic ...
10/08/2020 ∙ by Muhammed O. Sayin, et al. ∙ 0 ∙ share

read it
GANs May Have No Nash Equilibria

Generative adversarial networks (GANs) represent a zero-sum game between...
02/21/2020 ∙ by Farzan Farnia, et al. ∙ 0 ∙ share

read it
Personalized Federated Learning: A Meta-Learning Approach

The goal of federated learning is to design algorithms in which several ...
02/19/2020 ∙ by Alireza Fallah, et al. ∙ 4 ∙ share

read it
An Optimal Multistage Stochastic Gradient Method for Minimax Problems

In this paper, we study the minimax optimization problem in the smooth a...
02/13/2020 ∙ by Alireza Fallah, et al. ∙ 0 ∙ share

read it
Provably Convergent Policy Gradient Methods for Model-Agnostic Meta-Reinforcement Learning

We consider Model-Agnostic Meta-Learning (MAML) methods for Reinforcemen...
02/12/2020 ∙ by Alireza Fallah, et al. ∙ 1 ∙ share

read it
Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems

In this paper we study the smooth convex-concave saddle point problem. S...
01/31/2020 ∙ by Noah Golowich, et al. ∙ 0 ∙ share

read it
Optimal dynamic information provision in traffic routing

We consider a two-road dynamic routing game where the state of one of th...
01/09/2020 ∙ by Emily Meigs, et al. ∙ 0 ∙ share

read it
A Decentralized Proximal Point-type Method for Saddle Point Problems

In this paper, we focus on solving a class of constrained non-convex non...
10/31/2019 ∙ by Weijie Liu, et al. ∙ 0 ∙ share

read it
On the Convergence Theory of Gradient-Based Model-Agnostic Meta-Learning Algorithms

In this paper, we study the convergence theory of a class of gradient-ba...
08/27/2019 ∙ by Alireza Fallah, et al. ∙ 0 ∙ share

read it
Proximal Point Approximations Achieving a Convergence Rate of O(1/k) for Smooth Convex-Concave Saddle Point Problems: Optimistic Gradient and Extra-gradient Methods

In this paper we analyze the iteration complexity of the optimistic grad...
06/03/2019 ∙ by Aryan Mokhtari, et al. ∙ 0 ∙ share

read it
A Unified Analysis of Extra-gradient and Optimistic Gradient Methods for Saddle Point Problems: Proximal Point Approach

We consider solving convex-concave saddle point problems. We focus on tw...
01/24/2019 ∙ by Aryan Mokhtari, et al. ∙ 0 ∙ share

read it
A Universally Optimal Multistage Accelerated Stochastic Gradient Method

We study the problem of minimizing a strongly convex and smooth function...
01/23/2019 ∙ by Necdet Serhat Aybat, et al. ∙ 0 ∙ share

read it
Escaping Saddle Points in Constrained Optimization

In this paper, we focus on escaping from saddle points in smooth nonconv...
09/06/2018 ∙ by Aryan Mokhtari, et al. ∙ 0 ∙ share

read it
Convergence Rate of Block-Coordinate Maximization Burer-Monteiro Method for Solving Large SDPs

Semidefinite programming (SDP) with equality constraints arise in many o...
07/12/2018 ∙ by Murat A. Erdogdu, et al. ∙ 0 ∙ share

read it
Graphon games

The study of strategic behavior in large scale networks via standard gam...
01/31/2018 ∙ by Francesca Parise, et al. ∙ 0 ∙ share

read it
A variational inequality framework for network games: Existence, uniqueness, convergence and sensitivity analysis

We provide a unified variational inequality framework for the study of f...
12/22/2017 ∙ by Francesca Parise, et al. ∙ 0 ∙ share

read it
A Fast Distributed Proximal-Gradient Method

We present a distributed proximal-gradient method for optimizing the ave...
10/08/2012 ∙ by Annie I. Chen, et al. ∙ 0 ∙ share

read it

Asuman Ozdaglar

Featured Co-authors

Ali Jadbabaie

Constantinos Daskalakis

Aryan Mokhtari

Mert Gurbuzbalaban

Murat A. Erdogdu

Saurabh Amin

Giacomo Como

Noah Golowich

Zebang Shen

Francesca Parise

Pablo A. Parrilo

Optimal intervention in traffic networks

Generalization of Model-Agnostic Meta-Learning Algorithms: Recurring and Unseen Tasks

Multi-agent Bayesian Learning with Adaptive Strategies: Convergence and Stability

Fictitious play in zero-sum stochastic games

GANs May Have No Nash Equilibria

Personalized Federated Learning: A Meta-Learning Approach

An Optimal Multistage Stochastic Gradient Method for Minimax Problems

Provably Convergent Policy Gradient Methods for Model-Agnostic Meta-Reinforcement Learning

Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems

Optimal dynamic information provision in traffic routing

A Decentralized Proximal Point-type Method for Saddle Point Problems

On the Convergence Theory of Gradient-Based Model-Agnostic Meta-Learning Algorithms

Proximal Point Approximations Achieving a Convergence Rate of O(1/k) for Smooth Convex-Concave Saddle Point Problems: Optimistic Gradient and Extra-gradient Methods

A Unified Analysis of Extra-gradient and Optimistic Gradient Methods for Saddle Point Problems: Proximal Point Approach

A Universally Optimal Multistage Accelerated Stochastic Gradient Method

Escaping Saddle Points in Constrained Optimization

Convergence Rate of Block-Coordinate Maximization Burer-Monteiro Method for Solving Large SDPs

Graphon games

A variational inequality framework for network games: Existence, uniqueness, convergence and sensitivity analysis

A Fast Distributed Proximal-Gradient Method