Sciweavers

1393 search results - page 53 / 279
» Machine Learning by Function Decomposition
Sort
View
ICML
1995
IEEE
16 years 2 months ago
Stable Function Approximation in Dynamic Programming
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
Geoffrey J. Gordon
KDD
2004
ACM
135views Data Mining» more  KDD 2004»
16 years 1 months ago
Discovering additive structure in black box functions
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
Giles Hooker
ICML
2006
IEEE
16 years 2 months ago
Efficient MAP approximation for dense energy functions
We present an efficient method for maximizing energy functions with first and second order potentials, suitable for MAP labeling estimation problems that arise in undirected graph...
Marius Leordeanu, Martial Hebert
JMLR
2010
187views more  JMLR 2010»
14 years 8 months ago
SFO: A Toolbox for Submodular Function Optimization
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
Andreas Krause
ICDM
2002
IEEE
133views Data Mining» more  ICDM 2002»
15 years 6 months ago
Learning with Progressive Transductive Support Vector Machine
Support vector machine (SVM) is a new learning method developed in recent years based on the foundations of statistical learning theory. By taking a transductive approach instead ...
Yisong Chen, Guoping Wang, Shihai Dong