Related papers: BAT.jl -- A Julia-based tool for Bayesian inference

BAT.jl -- A Julia-based tool for Bayesian inference

URL: http://arxiv.org/abs/2008.03132v1
Date: Fri, 7 Aug 2020 12:55:52 GMT
Title: BAT.jl -- A Julia-based tool for Bayesian inference
Authors: Oliver Schulz and Frederik Beaujean and Allen Caldwell and Cornelius Grunwald and Vasyl Hafych and Kevin Kr\"oninger and Salvatore La Cagnina and Lars R\"ohrig and Lolian Shtembari
Abstract summary: We describe the development of a multi-purpose software for Bayesian statistical inference, BAT.jl, written in the Julia language. The major design considerations and implemented algorithms are summarized here, together with a test suite that ensures the proper functioning of the algorithms.
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: We describe the development of a multi-purpose software for Bayesian statistical inference, BAT.jl, written in the Julia language. The major design considerations and implemented algorithms are summarized here, together with a test suite that ensures the proper functioning of the algorithms. We also give an extended example from the realm of physics that demonstrates the functionalities of BAT.jl.

Related papers

Cost-aware Bayesian Optimization via the Pandora's Box Gittins Index [57.045952766988925]
We develop a previously-unexplored connection between cost-aware Bayesian optimization and the Pandora's Box problem, a decision problem from economics. Our work constitutes a first step towards integrating techniques from Gittins index theory into Bayesian optimization.
arXiv Detail & Related papers (2024-06-28T17:20:13Z)
Equation Discovery with Bayesian Spike-and-Slab Priors and Efficient Kernels [57.46832672991433]
We propose a novel equation discovery method based on Kernel learning and BAyesian Spike-and-Slab priors (KBASS) We use kernel regression to estimate the target function, which is flexible, expressive, and more robust to data sparsity and noises. We develop an expectation-propagation expectation-maximization algorithm for efficient posterior inference and function estimation.
arXiv Detail & Related papers (2023-10-09T03:55:09Z)
Scalable Batch Acquisition for Deep Bayesian Active Learning [70.68403899432198]
In deep active learning, it is important to choose multiple examples to markup at each step. Existing solutions to this problem, such as BatchBALD, have significant limitations in selecting a large number of examples. We present the Large BatchBALD algorithm, which aims to achieve comparable quality while being more computationally efficient.
arXiv Detail & Related papers (2023-01-13T11:45:17Z)
BosonSampling.jl: A Julia package for quantum multi-photon interferometry [0.0]
We present a free open source package for high performance simulation and numerical investigation of boson samplers and, more generally, multi-photon interferometry. Our package is written in Julia, allowing C-like performance with easy notations and fast, high-level coding.
arXiv Detail & Related papers (2022-12-19T15:28:23Z)
A Bayesian Bradley-Terry model to compare multiple ML algorithms on multiple data sets [4.394728504061753]
This paper proposes a Bayesian model to compare multiple algorithms on multiple data sets, on any metric. The model is based on the Bradley-Terry model, that counts the number of times one algorithm performs better than another on different data sets.
arXiv Detail & Related papers (2022-08-09T17:59:06Z)
Introductory Tutorial for SPSA and the Quantum Approximation Optimization Algorithm [0.1827510863075184]
This tutorial provides an introduction to the Quantum Approximation Optimization Algorithm (QAOA) Specifically, how to use QAOA with the Simultaneous Perturbation Approximation (SPSA) algorithm to solve the Max-Cut problem. All steps of the algorithm are explicitly shown and no theory or complex mathematics are used.
arXiv Detail & Related papers (2021-06-03T03:54:24Z)
Bayesian Algorithm Execution: Estimating Computable Properties of Black-box Functions Using Mutual Information [78.78486761923855]
In many real world problems, we want to infer some property of an expensive black-box function f, given a budget of T function evaluations. We present a procedure, InfoBAX, that sequentially chooses queries that maximize mutual information with respect to the algorithm's output. On these problems, InfoBAX uses up to 500 times fewer queries to f than required by the original algorithm.
arXiv Detail & Related papers (2021-04-19T17:22:11Z)
Sequential Subspace Search for Functional Bayesian Optimization Incorporating Experimenter Intuition [63.011641517977644]
Our algorithm generates a sequence of finite-dimensional random subspaces of functional space spanned by a set of draws from the experimenter's Gaussian Process. Standard Bayesian optimisation is applied on each subspace, and the best solution found used as a starting point (origin) for the next subspace. We test our algorithm in simulated and real-world experiments, namely blind function matching, finding the optimal precipitation-strengthening function for an aluminium alloy, and learning rate schedule optimisation for deep networks.
arXiv Detail & Related papers (2020-09-08T06:54:11Z)
The JuliaConnectoR: a functionally oriented interface for integrating Julia in R [0.0]
We develop the R package JuliaConnectoR, available from the CRAN repository and GitHub. For maintainability and stability, we base communication between R and Julia on TCP. This makes it easy to develop R extensions with Julia or to simply call functionality from Julia packages in R.
arXiv Detail & Related papers (2020-05-13T14:18:34Z)
Torch-Struct: Deep Structured Prediction Library [138.5262350501951]
We introduce Torch-Struct, a library for structured prediction. Torch-Struct includes a broad collection of probabilistic structures accessed through a simple and flexible distribution-based API.
arXiv Detail & Related papers (2020-02-03T16:43:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.