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.
We propose a new primal-dual algorithmic framework for a prototypical con- strained convex optimization template. The algorithmic instances of our frame- work are universal since they can automatically adapt to the unknown Ho ̈lder con- tinuity properties ...
We discuss three types of problems. The first one involves Jacobian equations and the two others involve Hessian equations. We proceed by fixed point, obtaining the results under a smallness assumption. ...
This is a survey paper on estimates for the topological degree and related topics which range from the characterizations of Sobolev spaces and BV functions to the Jacobian determinant and nonlocal filter problems in Image Processing. These results are obta ...
We introduce a novel family of invariant, convex, and non-quadratic functionals that we employ to derive regularized solutions of ill-posed linear inverse imaging problems. The proposed regularizers involve the Schatten norms of the Hessian matrix, which a ...
This paper deals with the problem of sparse H-infinity dynamic output-feedback control of LTI interconnected systems with polytopic uncertainty. The main objective is to find a controller structure with minimum information exchange between subsystems and l ...
Many applications in computational science require computing the elements of a function of a large matrix. A commonly used approach is based on the the evaluation of the eigenvalue decomposition, a task that, in general, involves a computing time that scal ...
A definition of bivariate matrix functions is introduced and some theoretical as well as algorithmic aspects are analyzed. It is shown that our framework naturally extends the usual notion of (univariate) matrix functions and allows to unify existing resul ...
We consider the Node-weighted Steiner Forest problem on planar graphs. Demaine et al. showed that a generic primal-dual algorithm gives a 6-approximation. We present two different proofs of an approximation factor of~3. Then, we draw a connection to Goem ...
This paper investigates the control of an ML component within the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) devoted to black-box optimization. The known CMA-ES weakness is its sample complexity, the number of evaluations of the objective fun ...
Inverse problems with shot noise arise in many modern biomedical imaging applications. The main challenge is to obtain an estimate of the underlying specimen from measurements corrupted by Poisson noise. In this work, we propose an efficient framework for ...