English
Related papers

Related papers: Markov cubature rules for polynomial processes

200 papers

Markov decision processes (MDPs) are the defacto frame-work for sequential decision making in the presence ofstochastic uncertainty. A classical optimization criterion forMDPs is to maximize the expected discounted-sum pay-off, which…

Artificial Intelligence · Computer Science 2020-02-28 Tomas Brazdil , Krishnendu Chatterjee , Petr Novotny , Jiri Vahala

We study Markov-modulated affine processes (abbreviated MMAPs), a class of Markov processes that are created from affine processes by allowing some of their coefficients to be a function of an exogenous Markov process. MMAPs allow for…

Probability · Mathematics 2022-09-13 Kevin Kurt , Rüdiger Frey

Multi-state models are frequently applied for representing processes evolving through a discrete set of state. Important classes of multi-state models arise when transitions between states may depend on the time since entry into the current…

Methodology · Statistics 2022-02-28 Rosario Barone , Andrea Tancredi

We consider a robust approach to address uncertainty in model parameters in Markov Decision Processes (MDPs), which are widely used to model dynamic optimization in many applications. Most prior works consider the case where the uncertainty…

Optimization and Control · Mathematics 2021-09-02 Vineet Goyal , Julien Grand-Clément

We consider a Markov additive process with a finite phase space and study its path decompositions at the times of extrema, first passage and last exit. For these three families of times we establish splitting conditional on the phase, and…

Probability · Mathematics 2015-10-14 Jevgenijs Ivanovs

In the paper we study continuous time controlled Markov processes using discrete time controlled Markov processes. We consider long run functionals: average reward per unit time or long run risk sensitive functional. We also investigate…

Optimization and Control · Mathematics 2025-08-12 Lukasz Stettner

Uncertain partially observable Markov decision processes (uPOMDPs) allow the probabilistic transition and observation functions of standard POMDPs to belong to a so-called uncertainty set. Such uncertainty, referred to as epistemic…

Artificial Intelligence · Computer Science 2021-11-02 Murat Cubuktepe , Nils Jansen , Sebastian Junges , Ahmadreza Marandi , Marnix Suilen , Ufuk Topcu

The parameters of a discrete stationary Markov model are transition probabilities between states. Traditionally, data consist in sequences of observed states for a given number of individuals over the whole observation period. In such a…

Computation · Statistics 2012-04-30 Alberto Pasanisi , Shuai Fu , Nicolas Bousquet

Markov Decision Processes (MDPs) are stochastic optimization problems that model situations where a decision maker controls a system based on its state. Partially observed Markov decision processes (POMDPs) are generalizations of MDPs where…

Optimization and Control · Mathematics 2019-03-26 Victor Cohen , Axel Parmentier

A method is developed to compute analytically fully symmetric cubature rules on the triangle by using symmetric polynomials to express the two kinds of invariance inherent in these rules. Rules of degree up to 15, some of them new and of…

Numerical Analysis · Mathematics 2011-11-17 Stefanos-Aldo Papanicolopulos

Partially observable Markov decision processes (POMDPs) have recently become popular among many AI researchers because they serve as a natural model for planning under uncertainty. Value iteration is a well-known algorithm for finding…

Artificial Intelligence · Computer Science 2011-06-02 N. L. Zhang , W. Zhang

Markov models are often used to capture the temporal patterns of sequential data for statistical learning applications. While the Hidden Markov modeling-based learning mechanisms are well studied in literature, we analyze a…

Machine Learning · Statistics 2021-03-25 Devesh K. Jha

We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomized or history-based policies can improve performance. We prove…

Machine Learning · Computer Science 2011-05-02 Shie Mannor , John Tsitsiklis

Markov decision processes (MDPs) are a popular model for performance analysis and optimization of stochastic systems. The parameters of stochastic behavior of MDPs are estimates from empirical observations of a system; their values are not…

Artificial Intelligence · Computer Science 2017-10-26 Dimitri Scheftelowitsch , Peter Buchholz , Vahid Hashemi , Holger Hermanns

This paper studies function approximation for finite horizon discrete time Markov decision processes under certain convexity assumptions. Uniform convergence of these approximations on compact sets is proved under several sampling schemes…

Optimization and Control · Mathematics 2018-02-21 Jeremy Yee

In the design of probabilistic timed systems, bounded requirements concerning behaviour that occurs within a given time, energy, or more generally cost budget are of central importance. Traditionally, such requirements have been…

Logic in Computer Science · Computer Science 2016-05-19 Ernst Moritz Hahn , Arnd Hartmanns

Multistate Markov models are a canonical parametric approach for data modeling of observed or latent stochastic processes supported on a finite state space. Continuous-time Markov processes describe data that are observed irregularly over…

Planning under uncertainty is critical to robotics. The Partially Observable Markov Decision Process (POMDP) is a mathematical framework for such planning problems. It is powerful due to its careful quantification of the non-deterministic…

Robotics · Computer Science 2021-07-19 Hanna Kurniawati

This project attempts to address the problem of asset pricing in a financial market, where the interest rates and volatilities exhibit regime switching. This is an extension of the Black-Scholes model. Studies of Markov-modulated regime…

Mathematical Finance · Quantitative Finance 2016-09-19 Tanmay S. Patankar

For a series of Markov processes we prove stochastic duality relations with duality functions given by orthogonal polynomials. This means that expectations with respect to the original process (which evolves the variable of the orthogonal…

Probability · Mathematics 2017-02-01 Chiara Franceschini , Cristian Giardinà