Sciweavers

1822 search results - page 299 / 365
» Risk-Sensitive Online Learning
Sort
View
NIPS
1994
13 years 9 months ago
A Non-linear Information Maximisation Algorithm that Performs Blind Separation
A new learning algorithmis derived which performs online stochastic gradient ascent in the mutual informationbetween outputs and inputs of a network. In the absence of a priori kn...
Anthony J. Bell, Terrence J. Sejnowski
ICASSP
2010
IEEE
13 years 8 months ago
Fixed-budget kernel recursive least-squares
We present a kernel-based recursive least-squares (KRLS) algorithm on a fixed memory budget, capable of recursively learning a nonlinear mapping and tracking changes over time. I...
Steven Van Vaerenbergh, Ignacio Santamaría,...
AROBOTS
2010
128views more  AROBOTS 2010»
13 years 8 months ago
Track-based self-supervised classification of dynamic obstacles
Abstract This work introduces a self-supervised architecture for robust classification of moving obstacles in urban environments. Our approach presents a hierarchical scheme that r...
Roman Katz, Juan Nieto, Eduardo Mario Nebot, Bertr...
JMLR
2008
133views more  JMLR 2008»
13 years 7 months ago
Algorithms for Sparse Linear Classifiers in the Massive Data Setting
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...
Suhrid Balakrishnan, David Madigan
JAIR
2006
102views more  JAIR 2006»
13 years 7 months ago
Multiple-Goal Heuristic Search
This paper presents a new framework for anytime heuristic search where the task is to achieve as many goals as possible within the allocated resources. We show the inadequacy of t...
Dmitry Davidov, Shaul Markovitch