Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ruya Kang

dblp:267/1346 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Trustworthy machine learning · 50% Probabilistic and Bayesian machine learning · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression
bayesian additive regression trees
0.412020
Bayesian Probabilistic Numerical Integration with Tree-Based Models · NeurIPS 2020
Machine learning › Trustworthy machine learning › uncertainty estimation › probabilistic numerics
bayesian quadrature
0.412020
Bayesian Probabilistic Numerical Integration with Tree-Based Models · NeurIPS 2020

Methods — techniques the papers use, named apart from their topics

sequential design · 0.4bayesian additive regression trees · 0.4
YearPublicationVenuePosition
2020 Bayesian Probabilistic Numerical Integration with Tree-Based Models
abstract
Bayesian quadrature (BQ) is a method for solving numerical integration problems in a Bayesian manner, which allows users to quantify their uncertainty about the solution. The standard approach to BQ is based on a Gaussian process (GP) approximation of the integrand. As a result, BQ is inherently limited to cases where GP approximations can be done in an efficient manner, thus often prohibiting very high-dimensional or non-smooth target functions. This paper proposes to tackle this issue with a new Bayesian numerical integration algorithm based on Bayesian Additive Regression Trees (BART) priors, which we call BART-Int. BART priors are easy to tune and well-suited for discontinuous functions. We demonstrate that they also lend themselves naturally to a sequential design setting and that explicit convergence rates can be obtained in a variety of settings. The advantages and disadvantages of this new methodology are highlighted on a set of benchmark tests including the Genz functions, on a rare-event simulation problem and on a Bayesian survey design problem.
Harrison Zhu, Ruya Kang, Zhichao Shen, Seth R. Flaxman, François-Xavier Briol
NeurIPS3