1974 search results - page 348 / 395 » On Unbiased Linear Approximations |
151
click to vote
TOMS
2011
15 years 26 days ago
2011
Abstract. We present a partitioned algorithm for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithm computes a factorization P AP T = ...
156
click to vote
JGO
2010
15 years 22 days ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
190
Voted
JMLR
2010
15 years 22 days ago
2010
Actor-Critic based approaches were among the first to address reinforcement learning in a general setting. Recently, these algorithms have gained renewed interest due to their gen...
182
click to vote
JMLR
2010
15 years 22 days ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
201
click to vote
JMLR
2010
15 years 22 days ago
2010
We prove the statistical consistency of kernel Partial Least Squares Regression applied to a bounded regression learning problem on a reproducing kernel Hilbert space. Partial Lea...