Efficient Greedy Coordinate Descent for Composite Problems
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.
Several distributed-optimization setups involve a group of agents coordinated by a central entity (coordinator), altogether operating in a collaborative framework. In such environments, it is often common that the agents solve proximal minimization problem ...
Noniterative data-driven techniques are design methods that allow optimal feedback control laws to be derived from input-output (I/O) data only, without the need of a model of the process. A drawback of these methods is that, in their standard formulation, ...
In a recent article series, the authors have promoted convex optimization algorithms for radio-interferometric imaging in the framework of compressed sensing, which leverages sparsity regularization priors for the associated inverse problem and defines a m ...
We present a theoretical analysis and comparison of the effect of ℓ1 versus ℓ2 regularization for the resolution of ill-posed linear inverse and/or compressed sensing problems. Our formulation covers the most general setting where the s ...
The Virtual Reference Feedback Tuning (VRFT) approach is a design method that allow optimal feedback control laws to be derived from input-output (I/O) data only, without need of a model of the process. A drawback of this methods is that, in its standard f ...
We propose new regularization models to solve inverse problems encountered in biomedical imaging applications. In formulating mathematical schemes, we base our approach on the sparse signal processing principles that have emerged as a central paradigm in t ...
We investigate the relation of two fundamental tools in machine learning and signal processing, that is the support vector machine (SVM) for classification, and the Lasso technique used in regression. We show that the resulting optimization problems are eq ...
Poisson inverse problems arise in many modern imaging applications, including biomedical and astronomical ones. The main challenge is to obtain an estimate of the underlying image from a set of measurements degraded by a linear operator and further corrupt ...
This paper proposes a novel algorithmic framework to solve image restoration problems under sparsity assumptions. As usual, the reconstructed image is the minimum of an objective functional that consists of a data fidelity term and an l1 regularization. Ho ...
Institute of Electrical and Electronics Engineers2013
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 ...
