نتایج جستجو برای: robust probabilistic programming

تعداد نتایج: 582840  

2014
Daniel Morgan Giri Prashanth Subramanian Saptarshi Bandyopadhyay Soon-Jo Chung Fred Y. Hadaegh

In this paper, we integrate, implement, and validate formation flying algorithms for large number of agents using probabilistic swarm guidance with inhomogeneous Markov chains and model predictive control with sequential convex programming. Using an inhomogeneous Markov chain, each agent determines its target position during each time step in a statistically independent manner while the swarm c...

2005
Olivier Buffet Douglas Aberdeen

Large real-world Probabilistic Temporal Planning (PTP) is a very challenging research field. A common approach is to model such problems as Markov Decision Problems (MDP) and use dynamic programming techniques. Yet, two major difficulties arise: 1dynamic programming does not scale with the number of tasks, and 2the probabilistic model may be uncertain, leading to the choice of unsafe policies. ...

2000
Andrei Sabelfeld David Sands

We present a probability-sensitive confidentiality specification – a form of probabilistic noninterference – for a small multi-threaded programming language with dynamic thread creation. Probabilistic covert channels arise from a scheduler which is probabilistic. Since scheduling policy is typically outside the language specification for multithreaded languages, we describe how to generalise th...

Journal: :Algorithms 2021

Principal component analysis (PCA) is one of the most popular tools in multivariate exploratory data analysis. Its probabilistic version (PPCA) based on maximum likelihood procedure provides a manner to implement dimension reduction. Recently, bilinear PPCA (BPPCA) model, which assumes that noise terms follow matrix variate Gaussian distributions, has been introduced directly deal with two-dime...

Journal: :International Journal of Approximate Reasoning 2016

Journal: :International Journal of Approximate Reasoning 2022

Stochastic approximation methods for variational inference have recently gained popularity in the probabilistic programming community since these are amenable to automation and allow online, scalable, universal approximate Bayesian inference. Unfortunately, common Probabilistic Programming Languages (PPLs) with stochastic engines lack efficiency of message passing-based algorithms deterministic...

Journal: :CoRR 2018
Vaishak Belle

Automated planning is a major topic of research in artificial intelligence, and enjoys a long and distinguished history. The classical paradigm assumes a distinguished initial state, comprised of a set of facts, and is defined over a set of actions which change that state in one way or another. Planning in many real-world settings, however, is much more involved: an agent’s knowledge is almost ...

Journal: :Proceedings of the ACM on Programming Languages 2019

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید