Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Publication
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Scaling Mcmc Inference And Belief Propagation To Large, Dense Graphical Models, Sameer Singh
Scaling Mcmc Inference And Belief Propagation To Large, Dense Graphical Models, Sameer Singh
Doctoral Dissertations
With the physical constraints of semiconductor-based electronics becoming increasingly limiting in the past decade, single-core CPUs have given way to multi-core and distributed computing platforms. At the same time, access to large data collections is progressively becoming commonplace due to the lowering cost of storage and bandwidth. Traditional machine learning paradigms that have been designed to operate sequentially on single processor architectures seem destined to become obsolete in this world of multi-core, multi-node systems and massive data sets. Inference for graphical models is one such example for which most existing algorithms are sequential in nature and are difficult to scale …
Incorporating Boltzmann Machine Priors For Semantic Labeling In Images And Videos, Andrew Kae
Incorporating Boltzmann Machine Priors For Semantic Labeling In Images And Videos, Andrew Kae
Doctoral Dissertations
Semantic labeling is the task of assigning category labels to regions in an image. For example, a scene may consist of regions corresponding to categories such as sky, water, and ground, or parts of a face such as eyes, nose, and mouth. Semantic labeling is an important mid-level vision task for grouping and organizing image regions into coherent parts. Labeling these regions allows us to better understand the scene itself as well as properties of the objects in the scene, such as their parts, location, and interaction within the scene. Typical approaches for this task include the conditional random field …
Convergence Of A Reinforcement Learning Algorithm In Continuous Domains, Stephen Carden
Convergence Of A Reinforcement Learning Algorithm In Continuous Domains, Stephen Carden
All Dissertations
In the field of Reinforcement Learning, Markov Decision Processes with a finite number of states and actions have been well studied, and there exist algorithms capable of producing a sequence of policies which converge to an optimal policy with probability one. Convergence guarantees for problems with continuous states also exist. Until recently, no online algorithm for continuous states and continuous actions has been proven to produce optimal policies. This Dissertation contains the results of research into reinforcement learning algorithms for problems in which both the state and action spaces are continuous. The problems to be solved are introduced formally as …