Sciweavers

403 search results - page 53 / 81
» Sampling Bounds for Stochastic Optimization
Sort
View
ICML
2009
IEEE
14 years 10 months ago
Online dictionary learning for sparse coding
Sparse coding--that is, modelling data vectors as sparse linear combinations of basis elements--is widely used in machine learning, neuroscience, signal processing, and statistics...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
CDC
2009
IEEE
156views Control Systems» more  CDC 2009»
14 years 1 months ago
Input design using Markov chains for system identification
This paper studies the input design problem for system identification where time domain constraints have to be considered. A finite Markov chain is used to model the input of the s...
Chiara Brighenti, Bo Wahlberg, Cristian R. Rojas
PROCEDIA
2010
66views more  PROCEDIA 2010»
13 years 8 months ago
Free energy computation by controlled Langevin dynamics
We propose a nonequilibrium sampling method for computing free energy profiles along a given reaction coordinate. The method consists of two parts: a controlled Langevin sampler ...
Juan C. Latorre, Carsten Hartmann, Christof Sch&uu...
ICCAD
2009
IEEE
117views Hardware» more  ICCAD 2009»
13 years 7 months ago
Binning optimization based on SSTA for transparently-latched circuits
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
Min Gong, Hai Zhou, Jun Tao, Xuan Zeng
CPHYSICS
2006
204views more  CPHYSICS 2006»
13 years 10 months ago
Genetically controlled random search: a global optimization method for continuous multidimensional functions
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
Ioannis G. Tsoulos, Isaac E. Lagaris