Get our free extension to see links to code for papers anywhere online!

Add to Chrome

Add to Firefox

Picture for Volkan Cevher

Volkan Cevher

Regret minimization in stochastic non-convex learning via a proximal-gradient approach

Oct 13, 2020
Nadav Hallak, Panayotis Mertikopoulos, Volkan Cevher

Access Paper or Ask Questions

Efficient Proximal Mapping of the 1-path-norm of Shallow Networks

Jul 15, 2020
Fabian Latorre, Paul Rolland, Nadav Hallak, Volkan Cevher

Figure 1 for Efficient Proximal Mapping of the 1-path-norm of Shallow Networks

Figure 2 for Efficient Proximal Mapping of the 1-path-norm of Shallow Networks

Figure 3 for Efficient Proximal Mapping of the 1-path-norm of Shallow Networks

Figure 4 for Efficient Proximal Mapping of the 1-path-norm of Shallow Networks

* ICML 2020. Fabian Latorre, Paul Rolland and Nadav Hallak have contributed equally

Access Paper or Ask Questions

Random extrapolation for primal-dual coordinate descent

Jul 13, 2020
Ahmet Alacaoglu, Olivier Fercoq, Volkan Cevher

Figure 1 for Random extrapolation for primal-dual coordinate descent

Figure 2 for Random extrapolation for primal-dual coordinate descent

Figure 3 for Random extrapolation for primal-dual coordinate descent

Figure 4 for Random extrapolation for primal-dual coordinate descent

* To appear in ICML 2020

Access Paper or Ask Questions

Conditional gradient methods for stochastically constrained convex minimization

Jul 07, 2020
Maria-Luiza Vladarean, Ahmet Alacaoglu, Ya-Ping Hsieh, Volkan Cevher

Figure 1 for Conditional gradient methods for stochastically constrained convex minimization

Figure 2 for Conditional gradient methods for stochastically constrained convex minimization

Figure 3 for Conditional gradient methods for stochastically constrained convex minimization

Figure 4 for Conditional gradient methods for stochastically constrained convex minimization

Access Paper or Ask Questions

Robust Inverse Reinforcement Learning under Transition Dynamics Mismatch

Jul 02, 2020
Luca Viano, Yu-Ting Huang, Parameswaran Kamalaruban, Volkan Cevher

Figure 1 for Robust Inverse Reinforcement Learning under Transition Dynamics Mismatch

Figure 2 for Robust Inverse Reinforcement Learning under Transition Dynamics Mismatch

Figure 3 for Robust Inverse Reinforcement Learning under Transition Dynamics Mismatch

Figure 4 for Robust Inverse Reinforcement Learning under Transition Dynamics Mismatch

Access Paper or Ask Questions

Interaction-limited Inverse Reinforcement Learning

Jul 01, 2020
Martin Troussard, Emmanuel Pignat, Parameswaran Kamalaruban, Sylvain Calinon, Volkan Cevher

Figure 1 for Interaction-limited Inverse Reinforcement Learning

Figure 2 for Interaction-limited Inverse Reinforcement Learning

Figure 3 for Interaction-limited Inverse Reinforcement Learning

Figure 4 for Interaction-limited Inverse Reinforcement Learning

Access Paper or Ask Questions

Environment Shaping in Reinforcement Learning using State Abstraction

Jun 23, 2020
Parameswaran Kamalaruban, Rati Devidze, Volkan Cevher, Adish Singla

Figure 1 for Environment Shaping in Reinforcement Learning using State Abstraction

Figure 2 for Environment Shaping in Reinforcement Learning using State Abstraction

Figure 3 for Environment Shaping in Reinforcement Learning using State Abstraction

Access Paper or Ask Questions

On the Almost Sure Convergence of Stochastic Gradient Descent in Non-Convex Problems

Jun 19, 2020
Panayotis Mertikopoulos, Nadav Hallak, Ali Kavis, Volkan Cevher

Figure 1 for On the Almost Sure Convergence of Stochastic Gradient Descent in Non-Convex Problems

Figure 2 for On the Almost Sure Convergence of Stochastic Gradient Descent in Non-Convex Problems

Figure 3 for On the Almost Sure Convergence of Stochastic Gradient Descent in Non-Convex Problems

* 32 pages, 8 figures

Access Paper or Ask Questions

The limits of min-max optimization algorithms: convergence to spurious non-critical sets

Jun 16, 2020
Ya-Ping Hsieh, Panayotis Mertikopoulos, Volkan Cevher

Figure 1 for The limits of min-max optimization algorithms: convergence to spurious non-critical sets

Figure 2 for The limits of min-max optimization algorithms: convergence to spurious non-critical sets

Figure 3 for The limits of min-max optimization algorithms: convergence to spurious non-critical sets

Figure 4 for The limits of min-max optimization algorithms: convergence to spurious non-critical sets

Access Paper or Ask Questions

Convergence of adaptive algorithms for weakly convex constrained optimization

Jun 11, 2020
Ahmet Alacaoglu, Yura Malitsky, Volkan Cevher

Figure 1 for Convergence of adaptive algorithms for weakly convex constrained optimization

Access Paper or Ask Questions

Lipschitz constant estimation of Neural Networks via sparse polynomial optimization

Apr 18, 2020
Fabian Latorre, Paul Rolland, Volkan Cevher

Figure 1 for Lipschitz constant estimation of Neural Networks via sparse polynomial optimization

Figure 2 for Lipschitz constant estimation of Neural Networks via sparse polynomial optimization

Figure 3 for Lipschitz constant estimation of Neural Networks via sparse polynomial optimization

Figure 4 for Lipschitz constant estimation of Neural Networks via sparse polynomial optimization

* Published as a conference paper in ICLR2020, originally submitted in September 25 2019 and available at https://openreview.net/forum?id=rJe4_xSFDB

Access Paper or Ask Questions

A new regret analysis for Adam-type algorithms

Mar 21, 2020
Ahmet Alacaoglu, Yura Malitsky, Panayotis Mertikopoulos, Volkan Cevher

Access Paper or Ask Questions

A Newton Frank-Wolfe Method for Constrained Self-Concordant Minimization

Feb 17, 2020
Deyi Liu, Volkan Cevher, Quoc Tran-Dinh

Figure 1 for A Newton Frank-Wolfe Method for Constrained Self-Concordant Minimization

Figure 2 for A Newton Frank-Wolfe Method for Constrained Self-Concordant Minimization

Figure 3 for A Newton Frank-Wolfe Method for Constrained Self-Concordant Minimization

Figure 4 for A Newton Frank-Wolfe Method for Constrained Self-Concordant Minimization

Access Paper or Ask Questions

Optimization for Reinforcement Learning: From Single Agent to Cooperative Agents

Dec 01, 2019
Donghwan Lee, Niao He, Parameswaran Kamalaruban, Volkan Cevher

Figure 1 for Optimization for Reinforcement Learning: From Single Agent to Cooperative Agents

Figure 2 for Optimization for Reinforcement Learning: From Single Agent to Cooperative Agents

Figure 3 for Optimization for Reinforcement Learning: From Single Agent to Cooperative Agents

Figure 4 for Optimization for Reinforcement Learning: From Single Agent to Cooperative Agents

Access Paper or Ask Questions

UniXGrad: A Universal, Adaptive Algorithm with Optimal Guarantees for Constrained Optimization

Oct 30, 2019
Ali Kavis, Kfir Y. Levy, Francis Bach, Volkan Cevher

Figure 1 for UniXGrad: A Universal, Adaptive Algorithm with Optimal Guarantees for Constrained Optimization

Figure 2 for UniXGrad: A Universal, Adaptive Algorithm with Optimal Guarantees for Constrained Optimization

Figure 3 for UniXGrad: A Universal, Adaptive Algorithm with Optimal Guarantees for Constrained Optimization

* NeurIPS 2019

Access Paper or Ask Questions

Nearly Minimal Over-Parametrization of Shallow Neural Networks

Oct 29, 2019
Armin Eftekhari, ChaeHwan Song, Volkan Cevher

* This paper is submitted without consent of the co-authors

Access Paper or Ask Questions

Fast and Provable ADMM for Learning with Generative Priors

Jul 07, 2019
Fabian Latorre Gómez, Armin Eftekhari, Volkan Cevher

Figure 1 for Fast and Provable ADMM for Learning with Generative Priors

Figure 2 for Fast and Provable ADMM for Learning with Generative Priors

Figure 3 for Fast and Provable ADMM for Learning with Generative Priors

Figure 4 for Fast and Provable ADMM for Learning with Generative Priors

Access Paper or Ask Questions

Interactive Teaching Algorithms for Inverse Reinforcement Learning

Jun 05, 2019
Parameswaran Kamalaruban, Rati Devidze, Volkan Cevher, Adish Singla

Figure 1 for Interactive Teaching Algorithms for Inverse Reinforcement Learning

Figure 2 for Interactive Teaching Algorithms for Inverse Reinforcement Learning

Figure 3 for Interactive Teaching Algorithms for Inverse Reinforcement Learning

Figure 4 for Interactive Teaching Algorithms for Inverse Reinforcement Learning

* IJCAI'19 paper (extended version)

Access Paper or Ask Questions

On Certifying Non-uniform Bound against Adversarial Attacks

Mar 15, 2019
Chen Liu, Ryota Tomioka, Volkan Cevher

Figure 1 for On Certifying Non-uniform Bound against Adversarial Attacks

Figure 2 for On Certifying Non-uniform Bound against Adversarial Attacks

Figure 3 for On Certifying Non-uniform Bound against Adversarial Attacks

Figure 4 for On Certifying Non-uniform Bound against Adversarial Attacks

Access Paper or Ask Questions

An Optimal-Storage Approach to Semidefinite Programming using Approximate Complementarity

Feb 09, 2019
Lijun Ding, Alp Yurtsever, Volkan Cevher, Joel A. Tropp, Madeleine Udell

Figure 1 for An Optimal-Storage Approach to Semidefinite Programming using Approximate Complementarity

Figure 2 for An Optimal-Storage Approach to Semidefinite Programming using Approximate Complementarity

Figure 3 for An Optimal-Storage Approach to Semidefinite Programming using Approximate Complementarity

Figure 4 for An Optimal-Storage Approach to Semidefinite Programming using Approximate Complementarity

* 29 pages and 4 figures

Access Paper or Ask Questions

Stochastic Conditional Gradient Method for Composite Convex Minimization

Jan 29, 2019
Francesco Locatello, Alp Yurtsever, Olivier Fercoq, Volkan Cevher

Figure 1 for Stochastic Conditional Gradient Method for Composite Convex Minimization

Figure 2 for Stochastic Conditional Gradient Method for Composite Convex Minimization

Figure 3 for Stochastic Conditional Gradient Method for Composite Convex Minimization

Figure 4 for Stochastic Conditional Gradient Method for Composite Convex Minimization

Access Paper or Ask Questions

Efficient learning of smooth probability functions from Bernoulli tests with guarantees

Jan 07, 2019
Paul Rolland, Ali Kavis, Adish Singla, Volkan Cevher

Figure 1 for Efficient learning of smooth probability functions from Bernoulli tests with guarantees

Figure 2 for Efficient learning of smooth probability functions from Bernoulli tests with guarantees

Figure 3 for Efficient learning of smooth probability functions from Bernoulli tests with guarantees

Figure 4 for Efficient learning of smooth probability functions from Bernoulli tests with guarantees

Access Paper or Ask Questions

An Introductory Guide to Fano's Inequality with Applications in Statistical Estimation

Jan 02, 2019
Jonathan Scarlett, Volkan Cevher

Figure 1 for An Introductory Guide to Fano's Inequality with Applications in Statistical Estimation

Figure 2 for An Introductory Guide to Fano's Inequality with Applications in Statistical Estimation

Figure 3 for An Introductory Guide to Fano's Inequality with Applications in Statistical Estimation

Figure 4 for An Introductory Guide to Fano's Inequality with Applications in Statistical Estimation

* Chapter in upcoming book "Information-Theoretic Methods in Data Science" (Cambridge University Press) edited by Yonina Eldar and Miguel Rodrigues

Access Paper or Ask Questions

Iterative Classroom Teaching

Nov 12, 2018
Teresa Yeo, Parameswaran Kamalaruban, Adish Singla, Arpit Merchant, Thibault Asselborn, Louis Faucon, Pierre Dillenbourg, Volkan Cevher

Figure 1 for Iterative Classroom Teaching

Figure 2 for Iterative Classroom Teaching

Figure 3 for Iterative Classroom Teaching

* AAAI'19 (extended version)

Access Paper or Ask Questions