paper-with-me

Papers

Black-box density function estimation using recursive partitioning

2020-10-26 · Erik Bodin, Zhenwen Dai, Neill D. F. Campbell, Carl Henrik Ek

We present a novel approach to Bayesian inference and general Bayesian computation that is defined through a sequential decision loop. Our method defines a recursive partitioning of the sample space. It neither relies on gradients nor requires any problem-specific tuning, and is asymptotically exact for any density function with a bounded domain. The output is an approximation to the whole density function including the normalisation constant, via partitions organised in efficient data structures. Such approximations may be used for evidence estimation or fast posterior sampling, but also as building blocks to treat a larger class of estimation problems. The algorithm shows competitive performance to recent state-of-the-art methods on synthetic and real-world problems including parameter inference for gravitational-wave physics.

📄 PDF Abstract BibTeX arXiv:2010.13632

Code (1)

bodin-e/defer 공식 구현

Tasks

Bayesian Inference

Similar Papers 제목 키워드 기반

LAMBDA: Covering the Solution Set of Black-Box Inequality by Search Space Quantization

2022-03-25 · Lihao Liu, Tianyue Feng, Xingyu Xing, Junyi Chen

Black-box functions are broadly used to model complex problems that provide no explicit information but the input and output. Despite existing studies of black-box function optimization, the solution set satisfying an in…

BenchmarkingQuantization

Discrete minimax estimation with trees

2018-12-14 · Luc Devroye, Tommy Reddad

We propose a simple recursive data-based partitioning scheme which produces piecewise-constant or piecewise-linear density estimates on intervals, and show how this scheme can determine the optimal $L_1$ minimax rate for…

Statistical-Computational Trade-offs for Recursive Adaptive Partitioning Estimators

2024-11-07 · Yan Shuo Tan, Jason M. Klusowski, Krishnakumar Balasubramanian

Models based on recursive adaptive partitioning such as decision trees and their ensembles are popular for high-dimensional regression as they can potentially avoid the curse of dimensionality. Because empirical risk min…

regression

Partitioning Structure Learning for Segmented Linear Regression Trees

2019-12-01 · NeurIPS 2019 12 · Xiangyu Zheng, Song Xi Chen

This paper proposes a partitioning structure learning method for segmented linear regression trees (SLRT), which assigns linear predictors over the terminal nodes. The recursive partitioning process is driven by an adapt…

regression

Accuracy Limits of Causal Trees for Individualized Treatment Effects

2025-09-14 · Matias D. Cattaneo, Jason M. Klusowski, Ruiqi Rae Yu arxiv

Recursive decision trees are widely used to estimate heterogeneous causal treatment effects in experimental and observational studies. These methods are typically implemented using CART-type recursive partitioning, with …