1974 search results - page 13 / 395 » On Unbiased Linear Approximations |
100
click to vote
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
—Thus far, sparse representations have been exploited largely in the context of robustly estimating functions in a noisy environment from a few measurements. In this context, the...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
Reinforcement learning algorithms can become unstable when combined with linear function approximation. Algorithms that minimize the mean-square Bellman error are guaranteed to co...
CIARP
2004
Springer
15 years 1 months ago
2004
Springer
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
72
Voted
IPL
2008
14 years 9 months ago
2008
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...