Results 101 to 110 of about 830,323 (220)
Multiplicative random walk Metropolis-Hastings on the real line
In this article we propose multiplication based random walk Metropolis Hastings (MH) algorithm on the real line. We call it the random dive MH (RDMH) algorithm.
A Jasra +20 more
core +1 more source
Semispectral Measures and Feller markov Kernels
We give a characterization of commutative semispectral measures by means of Feller and Strong Feller Markov kernels. In particular: {itemize} we show that a semispectral measure $F$ is commutative if and only if there exist a self-adjoint operator $A$ and a Markov kernel $ _{(\cdot)}(\cdot): \times\mathcal{B}(\mathbb{R})\to[0,1]$, $ \subset (A ...
openaire +2 more sources
Models for Patch-Based Image Restoration
We present a supervised learning approach for object-category specific restoration, recognition, and segmentation of images which are blurred using an unknown kernel.
Petrovic Nemanja +3 more
doaj +2 more sources
Splitting-Based Regenerations for Accelerated Simulation of Queues
In this paper, we address the problem of increasing the number of regenerations in the simulation of the workload process in a single-server queueing system.
Irina Peshkova +2 more
doaj +1 more source
A kernel interpolation method for the acoustic transfer function (ATF) between regions constrained by the physics of sound while being adaptive to the data is proposed.
Juliano G. C. Ribeiro +2 more
doaj +1 more source
Clustering-Based Construction of Hidden Markov Models for Generative Kernels [PDF]
Generative kernels represent theoretically grounded tools able to increase the capabilities of generative classification through a discriminative setting. Fisher Kernel is the first and mostly-used representative, which lies on a widely investigated mathematical background.
Pekalska, Elzbieta +5 more
openaire +1 more source
Properties of sharp observables (normalized PV measures) in relation to smearing by a Markov kernel are studied. It is shown that for a sharp observable $P$ defined on a standard Borel space, and an arbitrary observable $M$, the following properties are ...
A. Jenčová +23 more
core +1 more source
Simple procedures for finding mean first passage times in Markov chains [PDF]
The derivation of mean first passage times in Markov chains involves the solution of a family of linear equations. By exploring the solution of a related set of equations, using suitable generalized inverses of the Markovian kernel I – P, where P is the ...
Hunter, Jeffrey J.
core
Online Learning in Kernelized Markov Decision Processes
22nd International Conference on Artificial Intelligence and Statistics (AISTATS ...
Chowdhury, Sayak Ray, Gopalan, Aditya
openaire +2 more sources

