Sciweavers

515 search results - page 84 / 103
» Approximating Markov Processes by Averaging
Sort
View
ICML
2008
IEEE
16 years 17 days ago
An HDP-HMM for systems with state persistence
The hierarchical Dirichlet process hidden Markov model (HDP-HMM) is a flexible, nonparametric model which allows state spaces of unknown size to be learned from data. We demonstra...
Emily B. Fox, Erik B. Sudderth, Michael I. Jordan,...
INFOCOM
2009
IEEE
15 years 6 months ago
Network Bandwidth Allocation via Distributed Auctions with Time Reservations
—This paper studies the problem of allocating network capacity through periodic auctions. Motivated primarily by a service overlay architecture, we impose the following condition...
Pablo Belzarena, Andrés Ferragut, Fernando ...
ATAL
2009
Springer
15 years 6 months ago
SarsaLandmark: an algorithm for learning in POMDPs with landmarks
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...
Michael R. James, Satinder P. Singh
ICRA
2008
IEEE
128views Robotics» more  ICRA 2008»
15 years 6 months ago
A point-based POMDP planner for target tracking
— Target tracking has two variants that are often studied independently with different approaches: target searching requires a robot to find a target initially not visible, and ...
David Hsu, Wee Sun Lee, Nan Rong
FOCI
2007
IEEE
15 years 6 months ago
Almost All Learning Machines are Singular
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
Sumio Watanabe