Sciweavers

98 search results - page 12 / 20
» A Function Representation for Learning in Banach Spaces
Sort
View
ICML
2004
IEEE
14 years 8 months ago
Relational sequential inference with reliable observations
We present a trainable sequential-inference technique for processes with large state and observation spaces and relational structure. Our method assumes "reliable observation...
Alan Fern, Robert Givan

Publication
222views
14 years 4 months ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
14 years 1 months ago
Constructive induction and genetic algorithms for learning concepts with complex interaction
Constructive Induction is the process of transforming the original representation of hard concepts with complex interaction into a representation that highlights regularities. Mos...
Leila Shila Shafti, Eduardo Pérez
ICPR
2008
IEEE
14 years 2 months ago
Learning a discriminative sparse tri-value transform
Simple binary patterns have been successfully used for extracting feature representations for visual object classification. In this paper, we present a method to learn a set of d...
Zhenhua Qu, Guoping Qiu, Pong Chi Yuen
SLSFS
2005
Springer
14 years 1 months ago
Generalization Bounds for Subspace Selection and Hyperbolic PCA
We present a method which uses example pairs of equal or unequal class labels to select a subspace with near optimal metric properties in a kernel-induced Hilbert space. A represen...
Andreas Maurer