Sciweavers

1055 search results - page 6 / 211
» Convex Factorization Machines
Sort
View
EWRL
2008
14 years 11 months ago
Exploiting Additive Structure in Factored MDPs for Reinforcement Learning
Thomas Degris, Olivier Sigaud, Pierre-Henri Wuille...
IJON
2007
184views more  IJON 2007»
14 years 10 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen
JMLR
2010
143views more  JMLR 2010»
14 years 8 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
ESANN
2007
14 years 11 months ago
Deploying SDP for machine learning
We discuss the use in machine learning of a general type of convex optimisation problem known as semi-definite programming (SDP) [1]. We intend to argue that SDP’s arise quite n...
Tijl De Bie