6 search results - page 1 / 2 » New Circular Security Counterexamples from Decision Linear a... |
EWRL
2008
13 years 6 months ago
2008
We consider linear fixed point equations and their approximations by projection on a low dimensional subspace. We derive new bounds on the approximation error of the solution, whi...
STOC
2005
ACM
14 years 4 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
ICML
2001
IEEE
14 years 5 months ago
2001
IEEE
We introduce the first algorithm for off-policy temporal-difference learning that is stable with linear function approximation. Off-policy learning is of interest because it forms...
ML
2000
ACM
13 years 4 months ago
2000
ACM
Twenty-two decision tree, nine statistical, and two neural network algorithms are compared on thirty-two datasets in terms of classification accuracy, training time, and (in the ca...
ICPR
2006
IEEE
14 years 5 months ago
2006
IEEE
A new face recognition algorithm is presented. It supposes that a video sequence of a person is available both at enrollment and test time. During enrollment, a client Gaussian Mi...