Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.

Graph
Search

fr|en

Show all results for

Home

Person

Ali Kavis

This person is no longer with EPFL

Related publications (13)

About
Privacy
Disclaimer

Related publications (13)

Universal and adaptive methods for robust stochastic optimization

Ali Kavis

Within the context of contemporary machine learning problems, efficiency of optimization process depends on the properties of the model and the nature of the data available, which poses a significant problem as the complexity of either increases ad infinit ...

EPFL2023

Alternation makes the adversary weaker in two-player games

Volkan Cevher, Efstratios Panteleimon Skoulakis, Luca Viano, Ali Kavis

Motivated by alternating game-play in two-player games, we study an altenating variant of the Online Linear Optimization (OLO). In alternating OLO, a learner at each round t ∈[n] selects a vector xt and then an adversary selects a cost-vector ct ∈[−1,1]n. ...

2023

Extra Newton: A First Approach to Noise-Adaptive Accelerated Second-Order Methods

Volkan Cevher, Kimon Antonakopoulos, Ali Kavis

This work proposes a universal and adaptive second-order method for minimizing second-order smooth, convex functions. Our algorithm achieves O(σ/T‾‾√) convergence when the oracle feedback is stochastic with variance σ2, and improves its convergence to O(1/ ...

2022

, , , ,

We propose an adaptive variance-reduction method, called AdaSpider, for minimization of L-smooth, non-convex functions with a finite-sum structure. In essence, AdaSpider combines an AdaGrad-inspired [Duchi et al., 2011, McMahan & Streeter, 2010], but a fai ...

2022

Sifting through the Noise: Universal First-Order Methods for Stochastic Variational Inequalities

Volkan Cevher, Kimon Antonakopoulos, Thomas Michaelsen Pethick, Ali Kavis

We examine a flexible algorithmic framework for solving monotone variational inequalities in the presence of randomness and uncertainty. The proposed template encompasses a wide range of popular first-order methods, including dual averaging, dual extrapola ...

2021

STORM+: Fully Adaptive SGD with Momentum for Nonconvex Optimization

Volkan Cevher, Ali Kavis

In this work we investigate stochastic non-convex optimization problems wherethe objective is an expectation over smooth loss functions, and the goal is to find an approximate stationary point. The most popular approach to handling such problems is varianc ...

2021

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

Volkan Cevher, Ali Kavis, Shaul Nadav Hallak

This paper analyzes the trajectories of stochastic gradient descent (SGD) to help understand the algorithm’s convergence properties in non-convex problems. We first show that the sequence of iterates generated by SGD remains bounded and converges with prob ...

2020

Double-Loop Unadjusted Langevin Algorithm

Volkan Cevher, Paul Thierry Yves Rolland, Ali Kavis, Armin Eftekhari

A well-known first-order method for sampling from log-concave probability distributions is the Unadjusted Langevin Algorithm (ULA). This work proposes a new annealing step-size schedule for ULA, which allows to prove new convergence guarantees for sampling ...

2020

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

Volkan Cevher, Ali Kavis

We propose a novel adaptive, accelerated algorithm for the stochastic constrained convex optimization setting. Our method, which is inspired by the Mirror-Prox method, \emph{simultaneously} achieves the optimal rates for smooth/non-smooth problems with eit ...

2019

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

Volkan Cevher, Ali Kavis

We propose a novel adaptive, accelerated algorithm for the stochastic constrained convex optimization setting. Our method, which is inspired by the Mirror-Prox method, simultaneously achieves the optimal rates for smooth/non-smooth problems with either det ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2019

Page 1 of 2

, , , ,

2022

Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization

Volkan Cevher

Kimon Antonakopoulos

Efstratios Panteleimon Skoulakis

Leello Tadesse Dadi

Ali Kavis