412 search results - page 21 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We derive generalization bounds for learning algorithms based on their robustness: the property that if a testing sample is "similar" to a training sample, then the test...
118
click to vote
ICS
2010
Tsinghua U.
15 years 9 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
INTERSPEECH
2010
14 years 6 months ago
2010
We describe a new method for pruning in dynamic models based on running an adaptive filtering algorithm online during decoding to predict aspects of the scores in the near future....
BIOSYSTEMS
2008
14 years 12 months ago
2008
Change of DNA sequence that fuels evolution is, to a certain extent, a deterministic process because mutagenesis does not occur in an absolutely random manner. So far, it has not ...
ALGORITHMICA
2002
14 years 11 months ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...