Rigorous optimization recipes for sparse and low rank inverse problems with applications in data sciences
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.
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 ...
Many applications in machine learning require optimizing unknown functions defined over a high-dimensional space from noisy samples that are expensive to obtain. We address this notoriously hard challenge, under the assumptions that the function varies onl ...
We consider a blind calibration problem in a compressed sensing measurement system in which each sensor introduces an unknown phase shift to be determined. We show that this problem can be approached similarly to the problem of phase retrieval from quadrat ...
We present a novel method for robust reconstruction of the image of a moving object from incomplete linear measurements. We assume that only few measurements of this object can be acquired at different instants and model the correlation between measurement ...
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 ...
We introduce a recursive algorithm for performing compressed sensing on streaming data. The approach consists of a) recursive encoding, where we sample the input stream via overlapping windowing and make use of the previous measurement in obtaining the nex ...
Submitted to IEEE Transactions on Information Theory2013
The objective of this thesis is to develop reduced models for the numerical solution of optimal control, shape optimization and inverse problems. In all these cases suitable functionals of state variables have to be minimized. State variables are solutions ...
Magnetic resonance imaging (MRI) scanners produce raw measurements that are unfit to direct interpretation, unless an algorithmic step, called reconstruction, is introduced. Up to the last decade, this reconstruction was performed by algorithms of moderate ...
Optimization is important in science and engineering as a way of finding ”optimal” situations, designs or operating conditions. Optimization is typically performed on the basis of a mathematical model of the process under investigation. In practice, optimi ...
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 ...
