Sciweavers

1419 search results - page 74 / 284
» Approximation Methods for Supervised Learning
Sort
View
ICML
2006
IEEE
14 years 10 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan
NN
2002
Springer
224views Neural Networks» more  NN 2002»
13 years 9 months ago
Optimal design of regularization term and regularization parameter by subspace information criterion
The problem of designing the regularization term and regularization parameter for linear regression models is discussed. Previously, we derived an approximation to the generalizat...
Masashi Sugiyama, Hidemitsu Ogawa
ACCV
2009
Springer
14 years 1 months ago
Head Pose Estimation Based on Manifold Embedding and Distance Metric Learning
In this paper, we propose an embedding method to seek an optimal low-dimensional manifold describing the intrinsical pose variations and to provide an identity-independent head pos...
Xiangyang Liu, Hongtao Lu, Daqiang Zhang
ICML
2010
IEEE
13 years 11 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
TNN
2010
176views Management» more  TNN 2010»
13 years 4 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao