A Multi-Agent Primal-Dual Strategy for Composite Optimization over Distributed Features
Graph Chatbot
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.
This paper addresses the problem of image alignment based on random measurements. Image alignment consists of estimating the relative transformation between a query image and a reference image. We consider the specific problem where the query image is prov ...
We consider a family of elliptic equations introduced in the context of traffic congestion. They have the form del . (del F(del u)) = f where F is a convex function which vanishes inside some convex set and is elliptic outside. Under some natural assumptio ...
Exploiting recent regularity estimates for the Monge-Ampère equation, under some suitable assumptions on the initial data we prove global-in-time existence of Eulerian distributional solutions to the semigeostrophic equations in 3-dimensional convex domain ...
Exploiting recent regularity estimates for the Monge-Ampere equation, under some suitable assumptions on the initial data we prove global in-time existence of Eulerian distributional solutions to the semigeostrophic equations in 3-dimensional convex domain ...
Energy efficiency is a major design issue in the context of Wireless Sensor Networks (WSN). If the acquired data is to be sent to a far-away base station, collaborative beamforming performed by the sensors may help to distribute the communication load amon ...
Time-optimal path following considers the problem of moving along a predetermined geometric path in minimum time. In the case of a robotic manipulator with simplified constraints, a convex reformulation of this optimal control problem has been derived prev ...
Institute of Electrical and Electronics Engineers2013
We consider minimization problems that are compositions of convex functions of a vector \x∈RN with submodular set functions of its support (i.e., indices of the non-zero coefficients of \x). Such problems are in general difficult for large N ...
In this work, we exploit the fact that wavelets can represent magnetic resonance images well, with relatively few coefficients. We use this property to improve magnetic resonance imaging (MRI) reconstructions from undersampled data with arbitrary k-space t ...
Institute of Electrical and Electronics Engineers2011
We consider the problem of distributed classification of multiple observations of the same object that are collected in an ad hoc network of vision sensors. Assuming that each sensor captures a different observation of the same object, the problem is to cl ...
Institute of Electrical and Electronics Engineers2011
Machine learning is most often cast as an optimization problem. Ideally, one expects a convex objective function to rely on efficient convex optimizers with nice guarantees such as no local optima. Yet, non-convexity is very frequent in practice and it may ...
