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 consider the problem of sequentially optimizing a black-box function f based on noisy samples and bandit feedback. We assume that f is smooth in the sense of having a bounded norm in some reproducing kernel Hilbert space (RKHS), yield ...
In recent works, sparse models and convex optimization techniques have been applied to radio-interferometric (RI) imaging showing the potential to outperform state-of-the-art imaging algorithms in the field. In this talk, I will review our latest contribut ...
Tractography is a class of algorithms aiming at in vivo mapping the major neuronal pathways in the white matter from diffusion MRI data. These techniques offer a powerful tool to noninvasively investigate at the macroscopic scale the architecture of the ne ...
Institute of Electrical and Electronics Engineers2015
We study the properties of the normal cone to a proximally smooth set. We give a complete characterization of a proximally smooth set through the monotonicity properties of its normal cone in an arbitrary uniformly convex and uniformly smooth Banach space. ...
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 ...
Extending a result of Caffarelli, we provide global Lipschitz changes of variables between compactly supported perturbations of log-concave measures. The result is based on a combination of ideas from optimal transportation theory and a new Pogorelov-type ...
This paper proposes a tradeoff between computational time, sample complexity, and statistical accuracy that applies to statistical estimators based on convex optimization. When we have a large amount of data, we can exploit excess samples to decrease stati ...
It is known that not all summation methods are linear and stable. Zeta function regularization is in general nonlinear. However, in some cases formal manipulations with zeta function regularization (assuming linearity of sums) lead to correct results. We c ...
In this paper we make a survey of some recent developments of the theory of Sobolev spaces W-1,W-q (X, d, m), 1 < q < infinity, in metric measure spaces (X, d, m). In the final part of the paper we provide a new proof of the reflexivity of the Sobolev spac ...
Modifying the moduli of supporting convexity and supporting smoothness, we introduce new moduli for Banach spaces which occur, for example, as lengths of catheti of right-angled triangles (defined via so-called quasiorthogonality). These triangles have two ...