Sciweavers

309 search results - page 54 / 62
» Smooth Optimization with Approximate Gradient
Sort
View
AAAI
2010
15 years 4 months ago
Multi-Instance Dimensionality Reduction
Multi-instance learning deals with problems that treat bags of instances as training examples. In single-instance learning problems, dimensionality reduction is an essential step ...
Yu-Yin Sun, Michael K. Ng, Zhi-Hua Zhou
126
Voted
NIPS
2008
15 years 3 months ago
Bayesian Kernel Shaping for Learning Control
In kernel-based regression learning, optimizing each kernel individually is useful when the data density, curvature of regression surfaces (or decision boundaries) or magnitude of...
Jo-Anne Ting, Mrinal Kalakrishnan, Sethu Vijayakum...
NN
2000
Springer
192views Neural Networks» more  NN 2000»
15 years 2 months ago
A new algorithm for learning in piecewise-linear neural networks
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
Emad Gad, Amir F. Atiya, Samir I. Shaheen, Ayman E...
129
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Fast damped gauss-newton algorithm for sparse and nonnegative tensor factorization
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
Anh Huy Phan, Petr Tichavský, Andrzej Cicho...
ICCV
2011
IEEE
14 years 2 months ago
CARD: Compact And Real-time Descriptors
We propose Compact And Real-time Descriptors (CARD) which can be computed very rapidly and be expressed by short binary codes. An efficient algorithm based on lookup tables is pr...
Mitsuru Ambai, Yuichi Yoshida