Sciweavers

569 search results - page 84 / 114
» Online Bounds for Bayesian Algorithms
Sort
View
JMLR
2008
159views more  JMLR 2008»
14 years 9 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
ALT
2004
Springer
15 years 6 months ago
Prediction with Expert Advice by Following the Perturbed Leader for General Weights
When applying aggregating strategies to Prediction with Expert Advice, the learning rate must be adaptively tuned. The natural choice of complexity/current loss renders the analys...
Marcus Hutter, Jan Poland
ICML
2007
IEEE
15 years 10 months ago
Winnowing subspaces
We generalize the Winnow algorithm for learning disjunctions to learning subspaces of low rank. Subspaces are represented by symmetric projection matrices. The online algorithm ma...
Manfred K. Warmuth
NAACL
2010
14 years 7 months ago
Stream-based Translation Models for Statistical Machine Translation
Typical statistical machine translation systems are trained with static parallel corpora. Here we account for scenarios with a continuous incoming stream of parallel training data...
Abby Levenberg, Chris Callison-Burch, Miles Osborn...
FOCS
2003
IEEE
15 years 3 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...