2295 search results - page 231 / 459 » Learning Overcomplete Representations |
144
click to vote
NIPS
2008
15 years 8 months ago
2008
Regularized Least Squares (RLS) algorithms have the ability to avoid over-fitting problems and to express solutions as kernel expansions. However, we observe that the current RLS ...
177
click to vote
FLAIRS
2004
15 years 8 months ago
2004
er provides new techniques for abstracting the state space of a Markov Decision Process (MDP). These techniques extend one of the recent minimization models, known as -reduction, ...
155
click to vote
IIS
2001
15 years 8 months ago
2001
: Research on a new system implementing the AQ learning methodology, called AQ20, is briefly described, and illustrated by initial results from an experimental version. Like its pr...
186
click to vote
AAAI
1996
15 years 7 months ago
1996
This paper presents recent work using the Chill parser acquisition system to automate the construction of a natural-language interface for database queries. Chill treats parser ac...
205
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...