Sciweavers

894 search results - page 84 / 179
» Universal Relations and
Sort
View
NIPS
2003
13 years 9 months ago
Can We Learn to Beat the Best Stock
A novel algorithm for actively trading stocks is presented. While traditional universal algorithms (and technical trading heuristics) attempt to predict winners or trends, our app...
Allan Borodin, Ran El-Yaniv, Vincent Gogan
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
13 years 9 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
WSC
1996
13 years 9 months ago
Simulation for computer science majors: a preliminary report
The author is revising and restructuring an existing simulation course designed primarily for senior computer science majors by: 1) developing an integrated set of laboratory exer...
Ruth Silverman
ICASSP
2010
IEEE
13 years 8 months ago
A kernel mean matching approach for environment mismatch compensation in speech recognition
The mismatch between training and test environmental conditions presents a challenge to speech recognition systems. In this paper, we investigate an approach for matching the dist...
Abhishek Kumar, John H. L. Hansen
CORR
2010
Springer
53views Education» more  CORR 2010»
13 years 8 months ago
Prequential Plug-In Codes that Achieve Optimal Redundancy Rates even if the Model is Wrong
We analyse the prequential plug-in codes relative to one-parameter exponential families M. We show that if data are sampled i.i.d. from some distribution outside M, then the redund...
Peter Grünwald, Wojciech Kotlowski