Concept

Algorithme du gradient stochastique

Publications associées (431)

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.

Connectez-vous pour utiliser Chat avec Graph Search

Use of Learned Dictionaries in Tomographic Reconstruction

Martin Vetterli, Ivana Jovanovic, Vincent Etter

We study the use and impact of a dictionary in a tomographic reconstruction setup. First, we build two different dictionaries: one using a set of bases functions (Discrete Cosine Transform), and the other that is learned using patches extracted from traini ...

Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa2011

Transient Analysis of Adaptive Affine Combinations

Ali H. Sayed

In this correspondence, we provide a transient analysis of an affinely constrained mixture method that adaptively combines the outputs of adaptive filters running in parallel on the same task. The affinely constrained mixture is adapted using a stochastic ...

IEEE2011

Adaptive Content Search Through Comparisons

Amin Karbasi

We study the problem of navigating through a database of similar objects using comparisons. This problem is known to be strongly related to the small-world network design problem. However, contrary to prior work, which focuses on cases where objects in the ...

Massachusetts Institute of Technology Press2011

Content Search Through Comparisons

Amin Karbasi

We study the problem of navigating through a database of similar objects using comparisons under heterogeneous demand, a prob- lem strongly related to small-world network design. We show that, under heterogeneous demand, the small-world network design prob ...

2011

Nonholonomic source seeking in switching random fields

Mahmut Selman Sakar

We consider the problem of designing controllers for nonholonomic mobile robots converging to the source (minimum) of a field. In addition to the mobility constraints posed by the nonholonomic dynamics, we assume that the field is completely unknown to the ...

2010

Design of tensegrity structures using parametric analysis and stochastic search

Ian Smith, Landolf-Giosef-Anastasios Rhode-Barbarigos, Himanshu Jain

Tensegrity structures are lightweight structures composed of cables in tension and struts in compression. Since tensegrity systems exhibit geometrically nonlinear behavior, finding optimal structural designs is difficult. This paper focuses on the use of s ...

Springer Verlag2010

Exponential Natural Evolution Strategies

Daniël Pieter Wierstra, Tom Schaul

The family of natural evolution strategies (NES) offers a principled approach to real-valued evolutionary optimization by following the natural gradient of the expected fitness. Like the well-known CMA-ES, the most competitive algorithm in the field, NES c ...

2010

Feature Selection using Stochastic Search: An Application to System Identification

Ian Smith, Sandro Saitta

System identification using multiple-model strategies may involve thousands of models with several parameters. However, only a few models are close to the correct model. A key task involves finding which parameters are important for explaining candidate mo ...

American Society of Civil Engineers2010

Robust Ultrasound Travel-time Tomography Using the Bent Ray Model

Martin Vetterli, Olivier Roy, Ali Hormati, Ivana Jovanovic

We present a bent ray reconstruction algorithm for an ultrasound tomography (UT) scanner designed for breast screening. The scanner consists of a circular array of transmitters and receivers which encloses the object to be imaged. By solving a nonlinear sy ...

Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa2010

On-line independent support vector machines

Barbara Caputo

Support vector machines (SVMs) are one of the most successful algorithms for classification. However, due to their space and time requirements, they are not suitable for on-line learning, that is, when presented with an endless stream of training observati ...

2010