paper-with-me

Papers

The Binary Expansion Randomized Ensemble Test (BERET)

2019-12-08 · Duyeol Lee, Kai Zhang, Michael R. Kosorok

Recently, the binary expansion testing framework was introduced to test the independence of two continuous random variables by utilizing symmetry statistics that are complete sufficient statistics for dependence. We develop a new test based on an ensemble approach that uses the sum of squared symmetry statistics and distance correlation. Simulation studies suggest that this method improves the power while preserving the clear interpretation of the binary expansion testing. We extend this method to tests of independence of random vectors in arbitrary dimension. Through random projections, the proposed binary expansion randomized ensemble test transforms the multivariate independence testing problem into a univariate problem. Simulation studies and data example analyses show that the proposed method provides relatively robust performance compared with existing methods.

📄 PDF Abstract BibTeX arXiv:1912.03662

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Test 설명 없음

Similar Papers 제목 키워드 기반

Discussion of Multiscale Fisher's Independence Test for Multivariate Dependence

2022-04-26 · Duyeol Lee, Helal El-Zaatari, Michael R. Kosorok, Xinyi Li 외

The multiscale Fisher's independence test (MULTIFIT hereafter) proposed by Gorsky & Ma (2022) is a novel method to test independence between two random vectors. By its design, this test is particularly useful in detectin…

On the Role of Randomization in Adversarially Robust Classification

2023-02-14 · NeurIPS 2023 11

Deep neural networks are known to be vulnerable to small adversarial perturbations in test data. To defend against adversarial attacks, probabilistic classifiers have been proposed as an alternative to deterministic ones…

Robust classification

A cryptographic approach to black box adversarial machine learning

2019-06-07 · Kevin Shi, Daniel Hsu, Allison Bishop

We propose a new randomized ensemble technique with a provable security guarantee against black-box transfer attacks. Our proof constructs a new security problem for random binary classifiers which is easier to empirical…

BIG-bench Machine Learning

Estimating a sharp convergence bound for randomized ensembles

2013-03-04 · Miles E. Lopes

When randomized ensembles such as bagging or random forests are used for binary classification, the prediction error of the ensemble tends to decrease and stabilize as the number of classifiers increases. However, the pr…

Binary ClassificationDensity EstimationPrediction

BEAUTY Powered BEAST

2021-03-01 · Kai Zhang, Wan Zhang, Zhigen Zhao, Wen Zhou

We study distribution-free goodness-of-fit tests with the proposed Binary Expansion Approximation of UniformiTY (BEAUTY) approach. This method generalizes the renowned Euler's formula, and approximates the characteristic…