Sciweavers

569 search results - page 52 / 114
» Online Bounds for Bayesian Algorithms
Sort
View
COLT
1999
Springer
15 years 2 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
MICAI
2005
Springer
15 years 3 months ago
Directed Cycles in Bayesian Belief Networks: Probabilistic Semantics and Consistency Checking Complexity
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
Alexander L. Tulupyev, Sergey I. Nikolenko
ICIP
2005
IEEE
15 years 11 months ago
Variational segmentation of color images
A variational Bayesian framework is employed in the paper for image segmentation using color clustering. A Gaussian mixture model is used to represent color distributions. Variati...
Nikolaos Nasios, Adrian G. Bors
ICML
2005
IEEE
15 years 10 months ago
Using additive expert ensembles to cope with concept drift
We consider online learning where the target concept can change over time. Previous work on expert prediction algorithms has bounded the worst-case performance on any subsequence ...
Jeremy Z. Kolter, Marcus A. Maloof
PKDD
2010
Springer
129views Data Mining» more  PKDD 2010»
14 years 8 months ago
Smarter Sampling in Model-Based Bayesian Reinforcement Learning
Abstract. Bayesian reinforcement learning (RL) is aimed at making more efficient use of data samples, but typically uses significantly more computation. For discrete Markov Decis...
Pablo Samuel Castro, Doina Precup