Ultra-Fast Optimization Algorithm for Sparse Multi Kernel Learning
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 work presents a synthesis method that leads to the preliminary design of industrial energy systems. Such systems are composed of several technologies that transform, through a set of physical unit operations, raw materials and energy into products and ...
We present a method for the design of 3D constructions from planar pieces that can be cut easily and cheaply with laser cutters and similar Computer Numerical Control (CNC) machines. By cutting tight slits in intersecting pieces, they can be slid into each ...
We propose a novel stochastic optimization algorithm, hybrid simulated annealing (SA), to train hidden Markov models (HMMs) for visual speech recognition. In our algorithm, SA is combined with a local optimization operator that substitutes a better solutio ...
Robust streaming of video over wireless networks poses many challenges, as coping with bandwidth variations, data losses, and heterogeneity of the receivers. Rate-distortion (RD) optimization studies are aimed at increasing the reliability of received bits ...
Many state-of-the-art approaches for Multi Kernel Learning (MKL) struggle at finding a compromise between performance, sparsity of the solution and speed of the optimization process. In this paper we look at the MKL problem at the same time from a learning ...
Real-time optimization (RTO) is a class of methods that use measurements to reject the effect of uncertainty on optimal performance. This article compares six implicit RTO schemes, that is, schemes that implement optimality not through numerical optimizati ...
Various real-time optimization techniques proceed by controlling the gradient to zero. These methods primarily differ in the way the gradient is estimated. This paper compares various gradient estimation methods. It is argued that methods with model-based ...
The optimization of k-space sampling for nonlinear sparse MRI reconstruction is phrased as Bayesian experimental design problem. Bayesian inference is approximated by a novel relaxation to standard signal processing primitives, resulting in an efficient op ...
For good performance in practice, real-time optimization schemes need to be able to deal with the inevitable plant-model mismatch problem. Unlike the two-step schemes combining parameter estimation and optimization, the modifier-adaptation approach does no ...
Mainstream surrogate approaches for multi-objective problems build one approximation for each objective. Mono-surrogate approaches instead aim at characterizing the Pareto front with a single model. Such an approach has been recently introduced using a mix ...
