Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 25 for “"Probabilistic Programs"”.

  1. Incremental Static Analysis of Probabilistic Programs

    Probabilistic models are used successfully in a wide range of fields, including machine learning, data mining, pattern recognition, and robotics. Probabilistic programming languages are designed to express probabilistic models in high-level programming languages and to conduct automatic inference …

    unsw Repository record for Incremental Static Analysis of Probabilistic Programs (opens in a new tab)

  2. Automatic inference for higher-order probabilistic programs

    <p>Probabilistic models used in quantitative sciences have historically co-evolved with methods for performing inference: specific modeling assumptions are made not because they are appropriate to the application domain, but because they are required to leverage existing software packages or …

    oxford Repository record for Automatic inference for higher-order probabilistic programs (opens in a new tab)

  3. Symbolic execution for probabilistic programs: path probabilities testing and verification in prism model checker

    … framework that symbolically executes randomized programs to enumerate all feasible execution paths and compute path probabilities as closed-form expressions over program parameters. These path probabilities are aggregated to derive overall probabilities of user-defined outcomes such as …

    iastate Repository record for Symbolic execution for probabilistic programs: path probabilities testing and verification in prism model checker (opens in a new tab)

  4. Towards formal verification of Bayesian inference in probabilistic programming via guaranteed bounds

    <p>Probabilistic models are an indispensable tool in many scientific fields, from the social and medical sciences to physics and machine learning. In probabilistic programming, such models are specified as computer programs: a flexible yet precise representation that allows for automated analysis. …

    oxford Repository record for Towards formal verification of Bayesian inference in probabilistic programming via guaranteed bounds (opens in a new tab)

  5. Amortized inference and model learning for probabilistic programming

    <p>Probabilistic modeling lets us infer, predict and make decisions based on incomplete or noisy data. The goal of <em>probabilistic programming</em> is to automate inference in probabilistic models that are expressed as probabilistic programs---programs that can draw random values and condition …

    oxford Repository record for Amortized inference and model learning for probabilistic programming (opens in a new tab)

  6. Extending probabilistic programming systems and applying them to real-world simulators

    <p>Probabilistic programming is a paradigm that enables us to efficiently write probabilistic models as program code that we can sample, infer underlying parameters and predict outcomes based on complete or incomplete observations. Naturally, stochastic simulators, a special sub-class of simulators …

    oxford Repository record for Extending probabilistic programming systems and applying them to real-world simulators (opens in a new tab)

  7. On amortized inference in large-scale simulators

    … in large-scale simulators, we introduce a probabilistic programming library that brings us closer to this goal. This library enables us to perform Bayesian inference on any simulator written in a wide variety of programming languages, with minimal modification to the simulator's source …

    ubc Repository record for On amortized inference in large-scale simulators (opens in a new tab) Download PDF for On amortized inference in large-scale simulators (opens in a new tab)

  8. A UNIFYING SEMANTICS FOR MARKOV KERNELS AND LINEAR OPERATORS

    … developing semantic structures for interpreting probabilistic programs. In particular, there have been many models based either on Markov kernels or linear operators, each with their own set of strengths and weaknesses. Concurrently, mathematicians have been working on categorical semantics for …

    cornell Repository record for A UNIFYING SEMANTICS FOR MARKOV KERNELS AND LINEAR OPERATORS (opens in a new tab)

  9. Design and Implementation of Probabilistic Programming Languages for Sound and Scalable Inference

    Probabilistic programming languages (PPLs) provide a powerful framework for specifying and solving complex Bayesian inference problems using general-purpose programming constructs. However, the same linguistic expressiveness that makes PPLs appealing also introduces challenges for performing sound …

    waterloo Repository record for Design and Implementation of Probabilistic Programming Languages for Sound and Scalable Inference (opens in a new tab)

  10. Probabilistic Programming for Theory of Mind for Autonomous Decision Making

    … of another agent's mental state, and that (2) probabilistic programming is a natural way to describe models that involve one agent reasoning about another agent, where the target agent uses complex primitives such as path planners and saliency maps to make decisions. We propose a nested …

    byu Repository record for Probabilistic Programming for Theory of Mind for Autonomous Decision Making (opens in a new tab) Download PDF for Probabilistic Programming for Theory of Mind for Autonomous Decision Making (opens in a new tab)

  11. Nonparametric Involutive Markov Chain Monte Carlo: a MCMC algorithm for universal probabilistic programming

    <p>Probabilistic programming, the idea to write probabilistic models as computer programs, has proven to be a powerful tool for statistical analysis thanks to the computation power of built-in inference algorithms. Developing suitable inference algorithms that work for arbitrary programs in a …

    oxford Repository record for Nonparametric Involutive Markov Chain Monte Carlo: a MCMC algorithm for universal probabilistic programming (opens in a new tab)

  12. Verifiable and reusable conditioning

    … two separate steps: conditioning and querying. Probabilistic programming systems help automate Bayesian inference: they realize the first kind of modularity, and provide a modeling language decoupled from a suite of general-purpose inference tools. Most probabilistic programming systems, …

    iu Repository record for Verifiable and reusable conditioning (opens in a new tab)

  13. Algorithms and modelling for large-scale Bayesian data analysis

    … for certain complex Bayesian models such as probabilistic programs, along with prescriptions to ensure their consistency under well-specified conditions. Finally, we consider the task of learning models from data automatically using deep generative models. We identify a limitation of …

    oxford Repository record for Algorithms and modelling for large-scale Bayesian data analysis (opens in a new tab)

  14. Toward Trustworthy Machine Learning with Blackbox and Whitebox Methods

    … by design. A novel neural representation of probabilistic programs extends existing neural networks to capture complex probabilistic knowledge of the world and perform inference. A reinforcement learning-inspired inference algorithm addresses the efficiency issue in a single input-output …

    duke Repository record for Toward Trustworthy Machine Learning with Blackbox and Whitebox Methods (opens in a new tab)

  15. Essays on Multistage Stochastic Programming applied to Asset Liability Management

    … terms. These problems originate a large class of probabilistic programs recognized as stochastic programming models. They are more realistic than deterministic ones, and their aim is to incorporate uncertainty into their definitions. This dissertation approaches the probabilistic problem class of …

    brazil-ufrgs Repository record for Essays on Multistage Stochastic Programming applied to Asset Liability Management (opens in a new tab)

  16. Applications of probabilistic programming

    … thesis describes work on two applications of probabilistic programming: the learning of probabilistic program code given specifications, in particular program code of one-dimensional samplers; and the facilitation of sequential Monte Carlo inference with help of data-driven proposals. The …

    oxford Repository record for Applications of probabilistic programming (opens in a new tab)

  17. Termination and semantics of probabilistic lambda calculus

    … for proving the almost sure termination of probabilistic programs, in a simply-typed higher-order language with continuous random variables and an explicit recursion construct. The method is based on supermartingales and ranking functions, which are a probabilistic version of a loop variant, …

    oxford Repository record for Termination and semantics of probabilistic lambda calculus (opens in a new tab)

  18. PROBABILISTIC SEPARATION LOGICS FOR RANDOMIZED ALGORITHMS

    … formalmethods to ensure their correctness. When probabilistic separation logic was first developed as a formal method for proving probabilistic independence be- tween program variables, it was unclear whether this approach generalizes to weaker forms of probabilistic separation used in program …

    cornell Repository record for PROBABILISTIC SEPARATION LOGICS FOR RANDOMIZED ALGORITHMS (opens in a new tab)

  19. Structural foundations for probabilistic programming languages

    … theory. We showcase the value of synthetic probabilistic reasoning to computer science by presenting a novel, synthetic analysis of three situations: the Beta-Bernoulli process, exact conditioning on continuous random variables and an investigation into the relationship of random …

    oxford Repository record for Structural foundations for probabilistic programming languages (opens in a new tab)

  20. Complete Deductive Systems for Probability Logic with Application in Harsanyi Type Spaces

    These days, the study of probabilistic systems is very popular not only in theoretical computer science but also in economics. There is a surprising concurrence between game theory and probabilistic programming. J.C. Harsanyi introduced the notion of type spaces to give an implicit description of …

    iu Repository record for Complete Deductive Systems for Probability Logic with Application in Harsanyi Type Spaces (opens in a new tab)

Page 1 of 2