Search Results for author:
Found 4 papers, 0 papers with code
An Efficient Quasi-Random Sampling for Copulas
This paper examines an efficient method for quasi-random sampling of copulas in Monte Carlo computations.
Fast Approximation of the Shapley Values Based on Order-of-Addition Experimental Designs
Specifically, in a $d$-player coalition game, calculating a Shapley value requires the evaluation of $d!$ or $2^d$ marginal contribution values, depending on whether we are taking the permutation or combination formulation of the Shapley value.
Towards Long-Tailed Recognition for Graph Classification via Collaborative Experts
Graph classification, aiming at learning the graph-level representations for effective class assignments, has received outstanding achievements, which heavily relies on high-quality datasets that have balanced class distribution.
Model-free Subsampling Method Based on Uniform Designs
In order to measure the goodness of representation of a subdata with respect to the original data, we propose a criterion, generalized empirical F-discrepancy (GEFD), and study its theoretical properties in connection with the classical generalized L2-discrepancy in the theory of uniform designs.
