Publications associées à Scalable Convex Methods for Phase Retrieval

Publications associées (24)

Scalable constrained optimization

Modern optimization is tasked with handling applications of increasingly large scale, chiefly due to the massive amounts of widely available data and the ever-growing reach of Machine Learning. Consequently, this area of research is under steady pressure t ...

EPFL2024

Safe Zeroth-Order Convex Optimization Using Quadratic Local Approximations

Giancarlo Ferrari Trecate, Yuning Jiang, Maryam Kamgarpour, Baiwei Guo

We address black-box convex optimization problems, where the objective and constraint functions are not explicitly known but can be sampled within the feasible set. The challenge is thus to generate a sequence of feasible points converging towards an optim ...

IEEE2023

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Mehmet Fatih Sahin

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

EPFL2023

Stochastic distributed learning with gradient quantization and double-variance reduction

Sebastian Urban Stich

We consider distributed optimization over several devices, each sending incremental model updates to a central server. This setting is considered, for instance, in federated learning. Various schemes have been designed to compress the model updates in orde ...

TAYLOR & FRANCIS LTD2022

Efficient Meso-Scale Modeling of Alkali-Silica-Reaction Damage in Concrete

Ali Falsafi

The alkali-silica reaction (ASR), also known as concrete cancer, is one of the most prevalent causes of concrete degradation. In this chemical reaction, amorphous silica in the aggregates reacts with alkalis in the pore solution. By absorbing water, hydrop ...

EPFL2022

A first-order primal-dual method with adaptivity to local smoothness

Volkan Cevher, Maria-Luiza Vladarean

We consider the problem of finding a saddle point for the convex-concave objective

\min_x \max_y f(x) + \langle Ax, y\rangle - g^*(y)

, where

f

is a convex function with locally Lipschitz gradient and

g

is convex and possibly non-smooth. We propose an ...

2021

A Newton Frank-Wolfe method for constrained self-concordant minimization

Volkan Cevher, Quoc Tran Dinh

We develop a new Newton Frank-Wolfe algorithm to solve a class of constrained self-concordant minimization problems using linear minimization oracles (LMO). Unlike L-smooth convex functions, where the Lipschitz continuity of the objective gradient holds gl ...

SPRINGER2022

Large Steps in Inverse Rendering of Geometry

Wenzel Alban Jakob, Baptiste Alexandre Marie Philippe Claude Nicolet

Inverse reconstruction from images is a central problem in many scientific and engineering disciplines. Recent progress on differentiable rendering has led to methods that can efficiently differentiate the full process of image formation with respect to mi ...

ASSOC COMPUTING MACHINERY2021

Adaptive Gradient Descent without Descent

We present a strikingly simple proof that two rules are sufficient to automate gradient descent: 1) don’t increase the stepsize too fast and 2) don’t overstep the local curvature. No need for functional values, no line search, no information about the func ...

2020

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

A Non-Euclidean Gradient Descent Framework for Non-Convex Matrix Factorization

Volkan Cevher, Anastasios Kyrillidis, Ya-Ping Hsieh, Rabeeh Karimi Mahabadi

We study convex optimization problems that feature low-rank matrix solutions. In such scenarios, non-convex methods offer significant advantages over convex methods due to their lower space complexity as well as faster convergence speed. Moreover, many of ...

2018

A Data-Driven Frequency-Domain Approach for Robust Controller Design via Convex Optimization

Achille Nicoletti

The objective of this dissertation is to develop data-driven frequency-domain methods for designing robust controllers through the use of convex optimization algorithms. Many of today's industrial processes are becoming more complex, and modeling accurate ...

EPFL2018

Service Restoration in DG-Integrated Distribution Networks Using an Exact Convex OPF Model

Mario Paolone, Mostafa Nick, Hossein Sekhavatmanesh

The ever-increasing requirements for reliability and quality of supply suggest to enable the self-healing features of modern distribution networks. Within the context of Active Distribution Networks (ADNs), new, fast and efficient restoration strategies ca ...

Power Systems Computation Conference2018

A Fast Gradient Method for Nonnegative Sparse Regression With Self-Dictionary

Robert Gerhard Jérôme Luce

A nonnegative matrix factorization (NMF) can be computed efficiently under the separability assumption, which asserts that all the columns of the given input data matrix belong to the cone generated by a (small) subset of them. The provably most robust met ...

Ieee-Inst Electrical Electronics Engineers Inc2018

Distributed Modifier-Adaptation Schemes for the Real-Time Optimization of Interconnected Systems in the Presence of Structural Plant-Model Mismatch

Dominique Bonvin, Predrag Milosavljevic, René Uwe Schneider

The desire to operate chemical processes in a safe and economically optimal way has motivated the development of so-called real-time optimization (RTO) methods [1]. For continuous processes, these methods aim to compute safe and optimal steady-state set ...

2016

Stochastic Three-Composite Convex Minimization

Volkan Cevher, Alp Yurtsever, Cong Bang Vu

We propose a stochastic optimization method for the minimization of the sum of three convex functions, one of which has Lipschitz continuous gradient as well as restricted strong convexity. Our approach is most suitable in the setting where it is computati ...

2016

Automated Reconstruction of Evolving Curvilinear Tree Structures

Przemyslaw Rafal Glowacki

Curvilinear networks are prevalent in nature and span many different scales, ranging from micron-scale neural structures in the brain to petameter-scale dark-matter arbors binding massive galaxy clusters. Reliably reconstructing them in an automated fashio ...

EPFL2016

Riemannian Optimization for Solving High-Dimensional Problems with Low-Rank Tensor Structure

Michael Maximilian Steinlechner

In this thesis, we present a Riemannian framework for the solution of high-dimensional optimization problems with an underlying low-rank tensor structure. Here, the high-dimensionality refers to the size of the search space, while the cost function is scal ...

EPFL2016

A Convex Solution to Disparity Estimation from Light Fields via the Primal-Dual Method

Pierre Vandergheynst, Mahdad Hosseini Kamal

We present a novel approach to the reconstruction of depth from light field data. Our method uses dictionary representations and group sparsity constraints to derive a convex formulation. Although our solution results in an increase of the problem dimensio ...

Springer-Verlag2015

Composite convex minimization involving self-concordant-like cost functions

Volkan Cevher, Quoc Tran Dinh, Yen-Huan Li

The self-concordant-like property of a smooth convex func- tion is a new analytical structure that generalizes the self-concordant notion. While a wide variety of important applications feature the self- concordant-like property, this concept has heretofor ...

2015