Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Maximum-entropy adversarial data augmentation for improved generalization and robustness
Adversarial data augmentation has shown promise for training robust deep neural networks
against unforeseen data shifts or corruptions. However, it is difficult to define heuristics to …
against unforeseen data shifts or corruptions. However, it is difficult to define heuristics to …
Estimating mutual information for discrete-continuous mixtures
Estimation of mutual information from observed samples is a basic primitive in machine
learning, useful in several learning tasks including correlation mining, information …
learning, useful in several learning tasks including correlation mining, information …
A survey on distribution testing: Your data is big. But is it blue?
CL Canonne - Theory of Computing, 2020 - theoryofcomputing.org
The field of property testing originated in work on program checking, and has evolved into
an established and very active research area. In this work, we survey the developments of …
an established and very active research area. In this work, we survey the developments of …
Minimax estimation of functionals of discrete distributions
We propose a general methodology for the construction and analysis of essentially minimax
estimators for a wide class of functionals of finite dimensional parameters, and elaborate on …
estimators for a wide class of functionals of finite dimensional parameters, and elaborate on …
Estimating the unseen: improved estimators for entropy and other properties
We show that a class of statistical properties of distributions, which includes such practically
relevant properties as entropy, the number of distinct elements, and distance metrics …
relevant properties as entropy, the number of distinct elements, and distance metrics …
Demystifying Fixed -Nearest Neighbor Information Estimators
Estimating mutual information from independent identically distributed samples drawn from
an unknown joint density function is a basic statistical problem of broad interest with …
an unknown joint density function is a basic statistical problem of broad interest with …
Differentially private assouad, fano, and le cam
Abstract Le Cam's method, Fano's inequality, and Assouad's lemma are three widely used
techniques to prove lower bounds for statistical estimation tasks. We propose their …
techniques to prove lower bounds for statistical estimation tasks. We propose their …
Optimal prediction of the number of unseen species
Estimating the number of unseen species is an important problem in many scientific
endeavors. Its most popular formulation, introduced by Fisher et al.[Fisher RA, Corbet AS …
endeavors. Its most popular formulation, introduced by Fisher et al.[Fisher RA, Corbet AS …
Multivariate trace estimation in constant quantum depth
There is a folkloric belief that a depth-$\Theta (m) $ quantum circuit is needed to estimate the
trace of the product of $ m $ density matrices (ie, a multivariate trace), a subroutine crucial to …
trace of the product of $ m $ density matrices (ie, a multivariate trace), a subroutine crucial to …
Chebyshev polynomials, moment matching, and optimal estimation of the unseen
We consider the problem of estimating the support size of a discrete distribution whose
minimum nonzero mass is at least 1 k. Under the independent sampling model, we show …
minimum nonzero mass is at least 1 k. Under the independent sampling model, we show …