← Search

Emanuel Laude

8 accepted papers

2025

ConStellaration: A dataset of QI-like stellarator plasma boundaries and optimization benchmarks

NeurIPS 2025poster

Stellarators are magnetic confinement devices under active development to deliver steady-state carbon-free fusion energy. Their design involves a high-dimensional, constrained optimization problem that requires expensive physics simulations and significant domain expertise. Recent advances in plasma…

Cited by 10SourcecodeScholar
2025

Nonlinearly Preconditioned Gradient Methods under Generalized Smoothness

ICML 2025oral

We analyze nonlinearly preconditioned gradient methods for solving smooth minimization problems. We introduce a generalized smoothness property, based on the notion of abstract convexity, that is broader than Lipschitz smoothness and provide sufficient first- and second-order conditions. Notably, ou…

Cited by 1SourcePDFScholar
2024

Adaptive Proximal Gradient Methods Are Universal Without Approximation

ICML 2024spotlight

We show that adaptive proximal gradient methods for convex problems are not restricted to traditional Lipschitzian assumptions. Our analysis reveals that a class of linesearch-free methods is still convergent under mere local Hölder gradient continuity, covering in particular continuously differenti…

2024

Convex Relaxations for Manifold-Valued Markov Random Fields with Approximation Guarantees

ECCV 2024oral

"While neural network models have garnered significant attention in the imaging community, their application remains limited in important settings where optimality certificates are required or in the absence of extensive datasets. In such cases, classical models like (continuous) Markov Random Field…

2019

Optimization of Inf-Convolution Regularized Nonconvex Composite Problems

AISTATS 2019poster

In this work, we consider nonconvex composite problems that involve inf-convolution with a Legendre function, which gives rise to an anisotropic generalization of the proximal mapping and Moreau-envelope. In a convex setting such problems can be solved via alternating minimization of a splitting for…

Cited by 7SourcePDFScholar
2018

A Nonconvex Proximal Splitting Algorithm under Moreau-Yosida Regularization

AISTATS 2018poster

We tackle highly nonconvex, nonsmooth composite optimization problems whose objectives comprise a Moreau-Yosida regularized term. Classical nonconvex proximal splitting algorithms, such as nonconvex ADMM, suffer from lack of convergence for such a problem class. To overcome this difficulty, in this…

Cited by 0SourcePDFScholar
2018

Discrete-Continuous ADMM for Transductive Inference in Higher-Order MRFs

CVPR 2018poster

This paper introduces a novel algorithm for transductive inference in higher-order MRFs, where the unary energies are parameterized by a variable classifier. The considered task is posed as a joint optimization problem in the continuous classifier parameters and the discrete label variables. In cont…

Cited by 10SourcePDFScholar
2016

Sublabel-Accurate Relaxation of Nonconvex Energies

CVPR 2016oral

We propose a novel spatially continuous framework for convex relaxations based on functional lifting. Our method can be interpreted as a sublabel-accurate solution to multilabel problems. We show that previously proposed functional lifting methods optimize an energy which is linear between two label…

Cited by 50PDFcodeScholar