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 16 of 16 for “"Tractable Inference"”.

  1. Bayesian modeling with tractable inference and applications to online peer-to-peer lending

    … of Bayesian statistics, I have been dedicated to tractable Bayesian inference and interpretable modeling, and especially interested in Markov chain Monte Carlo (MCMC) on which Bayesian inference has highly depended until variational inferences was invented to provide an alternative solution. …

    texas Repository record for Bayesian modeling with tractable inference and applications to online peer-to-peer lending (opens in a new tab)

  2. Gaussian processes for survival analysis

    … While these assumptions allow us to have tractable inference schemes, we lose inference power and overlook important relationships in the data. Due to the inherent limitations of parametric models, it is natural to consider non-parametric approaches.</p> <p>In this thesis, we introduce a …

    oxford Repository record for Gaussian processes for survival analysis (opens in a new tab)

  3. Graphical models for inference and learning in computer vision

    Graphical models are indispensable as tools for inference in computer vision, where highly structured and interdependent output spaces can be described in terms of low-order, local relationships. One such problem is that of graph matching, where the goal is to localise various parts of an object …

    anu Repository record for Graphical models for inference and learning in computer vision (opens in a new tab)

  4. NAT-Modeled Dynamic Discretization for Inference with Sum of Continuous Variables

    … to both discrete and continuous variables. For inference with HBNs, we focus on dynamic discretization, which is an approximate inference algorithm that converts HBNs to discrete BNs. However, the CPTs have exponential growth on the number of parent variables. So, the complexity of BN inference …

    guelph Repository record for NAT-Modeled Dynamic Discretization for Inference with Sum of Continuous Variables (opens in a new tab)

  5. Learning, sampling and inference with stochastic differential equations

    … processes, and the difficulty of conducting tractable inference and sampling caused by inefficient SDE solvers. In this dissertation, I outline my efforts to develop novel computational models capable of efficient and scalable learning, sampling, and inference from SDEs. Specifically, I …

    gatech Repository record for Learning, sampling and inference with stochastic differential equations (opens in a new tab)

  6. Decision making under uncertainty

    … uncertainty. Unfortunately such methodology is intractable in realworld problems, and thus approximation of one form or another is inevitable.</p> <p>Many techniques make use of heuristic procedures for managing uncertainty. We note that such methods suffer unreliable performance and rely on the …

    oxford Repository record for Decision making under uncertainty (opens in a new tab)

  7. Algorithms for next generation sequencing data analysis

    … good mathematical abstractions permitting tractable inference and fast, scalable and accurate solutions using ideas from diverse fields such as optimization, probability, statistics and algorithms. This dissertation deals with two such problems occurring in the field of …

    texas Repository record for Algorithms for next generation sequencing data analysis (opens in a new tab)

  8. Essays in Econometrics

    … chapters address the problem of uniformly valid inference for set-identified linear functionals in models with linear moment inequalities. The identified set for the linear functional is characterized by value functions of two linear programs parameterized by the underlying probability …

    toronto-retro Repository record for Essays in Econometrics (opens in a new tab)

  9. On the Development of Deep Convolutional Sum-Product Networks

    … about a problem expressed as a BN: modeling and inference. In modeling, we want to express the problem domain as a DAG in which indepen- dencies among the variables involved can be read. There are two main algorithms for testing independencies from a BN DAG, namely, d-separation and m-separation. …

    regina Repository record for On the Development of Deep Convolutional Sum-Product Networks (opens in a new tab) Download PDF for On the Development of Deep Convolutional Sum-Product Networks (opens in a new tab)

  10. Application, Methodology, and Theory for Gaussian Processes

    … size. This is addressed for the case of GP inference with exponential family observations by the Vecchia-Laplace approximation method. By imposing sparsity in the posterior precision and a second order approximation to the exponential family likelihood, we achieve tractable inference with …

    tamu Repository record for Application, Methodology, and Theory for Gaussian Processes (opens in a new tab)

  11. Directly Learning Tractable Models for Sequential Inference and DecisionMaking

    … However, even if the resulting network is small, inference may be intractable (e.g., exponential in the size of the network) and practitioners must often resort to approximate inference techniques. Recent work has focused on the development of alternative graphical models such as arithmetic …

    waterloo Repository record for Directly Learning Tractable Models for Sequential Inference and DecisionMaking (opens in a new tab)

  12. Learning to Build Probabilistic Models with Limited Data

    … a Pólya-Gamma augmentation scheme to achieve tractable inference. We show strong predictive accuracy on several challenging few-shot learning datasets and improved uncertainty quantification over baseline methods.

    toronto-retro Repository record for Learning to Build Probabilistic Models with Limited Data (opens in a new tab)

  13. Generative Non-Markov Models for Information Extraction

    … develop expressive generative models that retain tractable inference. This is the topic of this thesis. In particular, we explore joint models which relax fixed-order Markov assumptions, and investigate the use of recurrent neural networks for automatic feature induction in the generative process. …

    jhu Repository record for Generative Non-Markov Models for Information Extraction (opens in a new tab)

  14. Impact of epistasis on phylogenetic trees

    … independently. While this simplification enables tractable inference, it does not account for the effects of epistasis (interactions among sites), which, by constraining the accessible sequence space, distort the distribution of pairwise distances. This model misspecification can introduce …

    temple Repository record for Impact of epistasis on phylogenetic trees (opens in a new tab)

  15. Estimation and Testing Following Model Selection

    The field of post-selection inference focuses on developing solutions for problems in which a researcher uses a single dataset to both identify a promising set of hypotheses and conduct statistical inference. One promising heuristic for adjusting for model/hypothesis selection in inference is that …

    washington Repository record for Estimation and Testing Following Model Selection (opens in a new tab)