Search Results for author: Kody J. H. Law

Found 10 papers, 4 papers with code

Scalable Bayesian Monte Carlo: fast uncertainty estimation beyond deep ensembles

no code implementations19 May 2025 Xinzhu Liang, Joseph M. Lukens, Sanjaya Lohani, Brian T. Kirby, Thomas A. Searles, Xin Qiu, Kody J. H. Law

A systematic numerical study reveals that parallel implementations of SMC and MCMC are comparable to serial implementations in terms of performance and total cost, and they achieve accuracy at or beyond the state-of-the-art (SOTA) methods like deep ensembles at convergence, along with substantially improved uncertainty quantification (UQ)--in particular, epistemic UQ.

Uncertainty Quantification

SMC Is All You Need: Parallel Strong Scaling

no code implementations9 Feb 2024 Xinzhu Liang, Joseph M. Lukens, Sanjaya Lohani, Brian T. Kirby, Thomas A. Searles, Kody J. H. Law

The Bayesian posterior distribution can only be evaluated up-to a constant of proportionality, which makes simulation and consistent estimation challenging.

All Bayesian Inference

Accelerating Look-ahead in Bayesian Optimization: Multilevel Monte Carlo is All you Need

1 code implementation3 Feb 2024 Shangda Yang, Vitaly Zankin, Maximilian Balandat, Stefan Scherer, Kevin Carlberg, Neil Walton, Kody J. H. Law

We leverage multilevel Monte Carlo (MLMC) to improve the performance of multi-step look-ahead Bayesian optimization (BO) methods that involve nested expectations and maximizations.

All Bayesian Optimization

Bayesian Deep Learning with Multilevel Trace-class Neural Networks

no code implementations24 Mar 2022 Neil K. Chada, Ajay Jasra, Kody J. H. Law, Sumeetpal S. Singh

In particular, an MLMC method that was introduced is used to approximate posterior expectations of Bayesian TNN models with optimal computational complexity, and this is mathematically proved.

Bayesian Inference Deep Learning +1

Sparse online variational Bayesian regression

1 code implementation24 Feb 2021 Kody J. H. Law, Vitaly Zankin

Furthermore, for p unknown covariates the method can be implemented exactly online with a cost of $O(p^3)$ in computation and $O(p^2)$ in memory per iteration -- in other words, the cost per iteration is independent of n, and in principle infinite data can be considered.

Bayesian Inference regression +2

On Unbiased Estimation for Discretized Models

1 code implementation24 Feb 2021 Jeremy Heng, Ajay Jasra, Kody J. H. Law, Alexander Tarakanov

In this article, we consider computing expectations w. r. t.

Bayesian Inference Computation Numerical Analysis Numerical Analysis Methodology

Materials Fingerprinting Classification

1 code implementation14 Jan 2021 Adam Spannaus, Kody J. H. Law, Piotr Luszczek, Farzana Nasrin, Cassie Putman Micucci, Peter K. Liaw, Louis J. Santodonato, David J. Keffer, Vasileios Maroulas

Significant progress in many classes of materials could be made with the availability of experimentally-derived large datasets composed of atomic identities and three-dimensional coordinates.

Classification General Classification +1

Cluster, Classify, Regress: A General Method For Learning Discountinous Functions

no code implementations15 May 2019 David E. Bernholdt, Mark R. Cianciosa, Clement Etienam, David L. Green, Kody J. H. Law, J. M. Park

This paper presents a method for solving the supervised learning problem in which the output is highly nonlinear and discontinuous.

Unbiased inference for discretely observed hidden Markov model diffusions

no code implementations26 Jul 2018 Neil K. Chada, Jordan Franks, Ajay Jasra, Kody J. H. Law, Matti Vihola

The resulting estimator leads to inference without a bias from the time-discretisation as the number of Markov chain iterations increases.

Bayesian Inference Methodology Probability Computation 65C05 (primary), 60H35, 65C35, 65C40 (secondary)

Cannot find the paper you are looking for? You can Submit a new open access paper.