Generalization of Quasi-Newton Methods: Application to Robust Symmetric Multisecant Updates

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In this paper, we focus on the localization of a passive source from time difference of arrival (TDOA) measurements. TDOA values are computed with respect to pairs of fixed sensors that are required to be accurately time-synchronized. This constitutes a we ...

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 ...

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 ...

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 ...

We consider the numerical approximation of an optimal control problem for an elliptic Partial Differential Equation (PDE) with random coefficients. Specifically, the control function is a deterministic, distributed forcing term that minimizes the expected ...

We address the challenge of learning factored policies in cooperative MARL scenarios. In particular, we consider the situation in which a team of agents collaborates to optimize a common cost. The goal is to obtain factored policies that determine the indi ...

Physically based rendering is a process for photorealistic digital image synthesis and one of the core problems in computer graphics. It involves simulating the light transport, i.e. the emission, propagation, and scattering of light through a virtual scen ...

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 ...

Motivation: Proteins are intrinsically dynamic entities. Flexibility sampling methods, such as molecular dynamics or those arising from integrative modeling strategies, are now commonplace and enable the study of molecular conformational landscapes in many ...

We present a new approach for estimating the parameters of three-phase untransposed electrically short transmission lines using voltage/current synchrophasor measurements obtained from phasor measurement units. The parameters to be estimated are the entrie ...

In many problems such as phase retrieval, molecular biology, source localization, and sensor array calibration, one can measure vector differences between pairs of points and attempt to recover the position of these points; this class of problems is called ...

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 ...

Generalization of Quasi-Newton Methods: Application to Robust Symmetric Multisecant Updates

Chat with Graph Search

TDOA Source-Localization Technique Robust to Time-Synchronization Attacks

Large Steps in Inverse Rendering of Geometry

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

STORM+: Fully Adaptive SGD with Momentum for Nonconvex Optimization

Complexity analysis of stochastic gradient methods for PDE-constrained optimal control problems with uncertain parameters

Logical Team Q-learning: An approach towards factored policies in cooperative MARL

Light Path Gradients for Forward and Inverse Rendering

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

CLoNe: automated clustering based on local density neighborhoods for application to biomolecular structural ensembles

Parameter Estimation of Three-Phase Untransposed Short Transmission Lines from Synchrophasor Measurements

Coordinate Difference Matrices

Adaptive Gradient Descent without Descent