Concept

Point stationnaire

Publications associées (36)

Dynamical system approach to navigation around obstacles

In this article, we propose a dynamical system to avoid obstacles which are star shaped and simultaneously converge to a goal. The convergence is almost-global in a domain and the stationary points are identified explicitly. Our approach is based on the id ...

2024

Photothermal spectroscopy on-chip sensor for the measurement of a PMMA film using a silicon nitride micro-ring resonator and an external cavity quantum cascade laser

Simone Iadanza

Laser-based mid-infrared (mid-IR) photothermal spectroscopy (PTS) represents a selective, fast, and sensitive analytical technique. Recent developments in laser design permits the coverage of wider spectral regions in combination with higher power, enablin ...

Berlin2024

Data-Driven Control and Optimization under Noisy and Uncertain Conditions

Baiwei Guo

Control systems operating in real-world environments often face disturbances arising from measurement noise and model mismatch. These factors can significantly impact the perfor- mance and safety of the system. In this thesis, we aim to leverage data to de ...

EPFL2023

Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy

Nicolas Boumal

We consider the problem of provably finding a stationary point of a smooth function to be minimized on the variety of bounded-rank matrices. This turns out to be unexpectedly delicate. We trace the difficulty back to a geometric obstacle: On a nonsmooth se ...

SPRINGER HEIDELBERG2022

Automated identification of local contamination in remote atmospheric composition time series

Jian Wang, Julia Schmale, Andrea Baccarini, Ivo Fabio Beck, Hélène Paule Angot, Lubna Dada

A common challenge of atmospheric measurements in remote environments is to identify pollution from nearby activities that interfere with the purpose of the observations. Pollution, particularly from combustion, typically reveals itself in enhanced particl ...

2022

From SU(2)5 to SU(2)3 Wess-Zumino-Witten transitions in a frustrated spin-52 chain

Frédéric Mila, Natalia Chepiga

We investigate the properties of a frustrated spin-5/2 chain with next-nearest-neighbor two- and three-site interactions, with two questions in mind: the nature of the transition into the dimerized phase induced by the three-site interaction, and the possi ...

AMER PHYSICAL SOC2022

Development of a new method to determine the axial void velocity profile in BWRs from measurements of the in-core neutron noise

Mathieu Hursin

Determination of the local void fraction in BWRs from in-core neutron noise measurements requires the knowledge of the axial velocity of the void. The purpose of this paper is to revisit the problem of determining the axial void velocity profile from the t ...

PERGAMON-ELSEVIER SCIENCE LTD2021

Geometry of the Loss Landscape in Overparameterized Neural Networks: Symmetries and Invariances

Wulfram Gerstner, Clément Hongler, Johanni Michael Brea, Francesco Spadaro, Berfin Simsek, Arthur Jacot

We study how permutation symmetries in overparameterized multi-layer neural networks generate `symmetry-induced' critical points. Assuming a network with

L

layers of minimal widths

r_1^*, \ldots, r_{L-1}^*

reaches a zero-loss minimum at $ r_1^*! \c ...

2021

A Catalyst Framework for Minimax Optimization

Negar Kiyavash

We introduce a generic \emph{two-loop} scheme for smooth minimax optimization with strongly-convex-concave objectives. Our approach applies the accelerated proximal point framework (or Catalyst) to the associated \emph{dual problem} and takes full advantag ...

2020

A Catalyst Framework for Minimax Optimization

Negar Kiyavash

We introduce a generic two-loop scheme for smooth minimax optimization with strongly-convex-concave objectives. Our approach applies the accelerated proximal point framework (or Catalyst) to the associated dual problem and takes full advantage of existing ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2020

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search