267 search results - page 16 / 54 » Convex optimization for the design of learning machines |
AIEDAM
1998
13 years 8 months ago
1998
Gradient-based numerical optimization of complex engineering designs offers the promise of rapidly producing better designs. However, such methods generally assume that the object...
ICDM
2009
IEEE
14 years 3 months ago
2009
IEEE
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
COLT
2010
Springer
13 years 7 months ago
2010
Springer
Multiarmed bandit problem is a typical example of a dilemma between exploration and exploitation in reinforcement learning. This problem is expressed as a model of a gambler playi...
COLT
2006
Springer
14 years 26 days ago
2006
Springer
We are interested in supervised ranking with the following twist: our goal is to design algorithms that perform especially well near the top of the ranked list, and are only requir...
AIMSA
2006
Springer
14 years 26 days ago
2006
Springer
Although speech and language processing techniques achieved a relative maturity during the last decade, designing a spoken dialogue system is still a tailoring task because of the ...