1055 search results - page 6 / 211 » Convex Factorization Machines |
ECTEL
2007
Springer
15 years 4 months ago
2007
Springer
79
Voted
EWRL
2008
15 years 2 months ago
2008
114
click to vote
IJON
2007
15 years 7 days ago
2007
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
118
Voted
JMLR
2010
14 years 10 months ago
2010
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...
ESANN
2007
15 years 1 months ago
2007
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...