Sciweavers

569 search results - page 4 / 114
» Online Bounds for Bayesian Algorithms
Sort
View
ALT
2008
Springer
14 years 2 months ago
Online Regret Bounds for Markov Decision Processes with Deterministic Transitions
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...
Ronald Ortner
IPL
2010
93views more  IPL 2010»
13 years 4 months ago
Randomized algorithms for online bounded bidding
In the online bidding problem, a bidder is trying to guess a positive number T, by placing bids until the value of the bid is at least T. The bidder is charged with the sum of the...
Leah Epstein, Asaf Levin
IEEEARES
2008
IEEE
14 years 10 hour ago
A Bayesian Approach for on-Line Max Auditing
In this paper we propose a method for on-line max auditing of dynamic statistical databases. The method extends the Bayesian approach presented in [2], [3] and [4] for static data...
Gerardo Canfora, Bice Cavallo
JMLR
2002
115views more  JMLR 2002»
13 years 5 months ago
PAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification
Approximate Bayesian Gaussian process (GP) classification techniques are powerful nonparametric learning methods, similar in appearance and performance to support vector machines....
Matthias Seeger
TSP
2010
13 years 8 days ago
Compressive Sensing on Manifolds Using a Nonparametric Mixture of Factor Analyzers: Algorithm and Performance Bounds
Nonparametric Bayesian methods are employed to constitute a mixture of low-rank Gaussians, for data x RN that are of high dimension N but are constrained to reside in a low-dimen...
Minhua Chen, Jorge Silva, John William Paisley, Ch...