701 search results - page 92 / 141 » Self Bounding Learning Algorithms |
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
ICCCN
2008
IEEE
14 years 2 months ago
2008
IEEE
—Most existing wireless ad hoc routing protocols rely upon the use of backward learning technique with explicit control messages to route packets. In this paper we propose a set ...
COLT
2003
Springer
14 years 26 days ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
ICMLA
2007
13 years 9 months ago
2007
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
NIPS
2001
13 years 9 months ago
2001
Policy gradient methods for reinforcement learning avoid some of the undesirable properties of the value function approaches, such as policy degradation (Baxter and Bartlett, 2001...