Universal and adaptive methods for robust stochastic optimization
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.
Learning a visual object category from few samples is a compelling and challenging problem. In several real-world applications collecting many annotated data is costly and not always possible. However a small training set does not allow to cover the high i ...
Redundant Gabor frames admit an infinite number of dual frames, yet only the canonical dual Gabor system, con- structed from the minimal l2-norm dual window, is widely used. This window function however, might lack desirable properties, such as good time-f ...
Efficient Global Optimization (EGO) is an optimization strategy based on approximating functions, namely Gaussian process models. We show the application of this technique to a model calibration problem referred to a geomechanical application. By means of ...
The convex ℓ1-regularized logdet divergence criterion has been shown to produce theoretically consistent graph learning. However, this objective function is challenging since the ℓ1-regularization is nonsmooth, the logdet objective is n ...
The convex l(1)-regularized log det divergence criterion has been shown to produce theoretically consistent graph learning. However, this objective function is challenging since the l(1)-regularization is nonsmooth, the log det objective is not globally Li ...
In this work, we study the task of distributed optimization over a network of learners in which each learner possesses a convex cost function, a set of affine equality constraints, and a set of convex inequality constraints. We propose a distributed diffus ...
We study the multi-view imaging problem where one has to reconstruct a set of l images, representing a single scene, from a few measurements made at different viewpoints. We first express the solution of the problem as the minimizer of a non-convex objecti ...
This paper deals with direct data-driven design of model-reference controllers whose number of parameters is constrained. Input-output (I/O) sparse controllers are introduced and proposed as an alternative to low-order controller tuning. The optimal I/O sp ...
We study the multi-view imaging problem where one has to reconstruct a set of l images, representing a single scene, from a few measurements made at different viewpoints. We first express the solution of the problem as the minimizer of a non-convex objecti ...
We develop tractable semidefinite programming based approximations for distributionally robust individual and joint chance constraints, assuming that only the first- and second-order moments as well as the support of the uncertain parameters are given. It ...
