Sciweavers

254 search results - page 35 / 51
» Learning with Consistency between Inductive Functions and Ke...
Sort
View
AAAI
1997
13 years 9 months ago
Worst-Case Absolute Loss Bounds for Linear Learning Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. I demonstrateworst-case upper bounds on the absolute loss for the perceptron algorithm and ...
Tom Bylander
NIPS
2007
13 years 10 months ago
Density Estimation under Independent Similarly Distributed Sampling Assumptions
A method is proposed for semiparametric estimation where parametric and nonparametric criteria are exploited in density estimation and unsupervised learning. This is accomplished ...
Tony Jebara, Yingbo Song, Kapil Thadani
ICML
2000
IEEE
14 years 9 months ago
Eligibility Traces for Off-Policy Policy Evaluation
Eligibility traces have been shown to speed reinforcement learning, to make it more robust to hidden states, and to provide a link between Monte Carlo and temporal-difference meth...
Doina Precup, Richard S. Sutton, Satinder P. Singh
ICIP
2005
IEEE
14 years 10 months ago
Hexagonal versus orthogonal lattices: a new comparison using approximation theory
We provide a new comparison between hexagonal and orthogonal lattices, based on approximation theory. For each of the lattices, we select the "natural" spline basis func...
Laurent Condat, Dimitri Van De Ville, Thierry Blu
ICCV
2009
IEEE
13 years 6 months ago
Selection and context for action recognition
Recognizing human action in non-instrumented video is a challenging task not only because of the variability produced by general scene factors like illumination, background, occlu...
Dong Han, Liefeng Bo, Cristian Sminchisescu