Sciweavers

2683 search results - page 133 / 537
» Machine learning problems from optimization perspective
Sort
View
ICML
2004
IEEE
16 years 3 months ago
Learning large margin classifiers locally and globally
A new large margin classifier, named MaxiMin Margin Machine (M4 ) is proposed in this paper. This new classifier is constructed based on both a "local" and a "globa...
Kaizhu Huang, Haiqin Yang, Irwin King, Michael R. ...
NIPS
2007
15 years 3 months ago
Convex Learning with Invariances
Incorporating invariances into a learning algorithm is a common problem in machine learning. We provide a convex formulation which can deal with arbitrary loss functions and arbit...
Choon Hui Teo, Amir Globerson, Sam T. Roweis, Alex...
122
Voted
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
16 years 2 months ago
Learning subspace kernels for classification
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
Jianhui Chen, Shuiwang Ji, Betul Ceran, Qi Li, Min...
IJCAI
1989
15 years 3 months ago
A Study of Empirical Learning for an Involved Problem
In real-world domains a concept to be learned may be unwieldy and the environment may be less than ideal. One combination of difficulties occurs if the concept is probabilistic an...
Larry A. Rendell
143
Voted
ICML
2001
IEEE
16 years 3 months ago
Direct Policy Search using Paired Statistical Tests
Direct policy search is a practical way to solve reinforcement learning problems involving continuous state and action spaces. The goal becomes finding policy parameters that maxi...
Malcolm J. A. Strens, Andrew W. Moore