Sciweavers

3694 search results - page 450 / 739
» Stochastic complexity in learning
Sort
View

Publication
222views
16 years 3 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
PKDD
2009
Springer
118views Data Mining» more  PKDD 2009»
16 years 1 months ago
The Feature Importance Ranking Measure
Most accurate predictions are typically obtained by learning machines with complex feature spaces (as e.g. induced by kernels). Unfortunately, such decision rules are hardly access...
Alexander Zien, Nicole Krämer, Sören Son...
SCIA
2005
Springer
186views Image Analysis» more  SCIA 2005»
16 years 5 days ago
Building Detection from Mobile Imagery Using Informative SIFT Descriptors
We propose reliable outdoor object detection on mobile phone imagery from off-the-shelf devices. With the goal to provide both robust object detection and reduction of computation...
Gerald Fritz, Christin Seifert, Manish Kumar, Luca...
ISLPED
2004
ACM
108views Hardware» more  ISLPED 2004»
16 years 3 days ago
SEPAS: a highly accurate energy-efficient branch predictor
Designers have invested much effort in developing accurate branch predictors with short learning periods. Such techniques rely on exploiting complex and relatively large structure...
Amirali Baniasadi, Andreas Moshovos
COLT
2007
Springer
15 years 10 months ago
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
Alexandre Belloni, Robert M. Freund, Santosh Vempa...