Maximum Entropy Principle in Deep Thermalization and in Hilbert-Space Ergodicity
We report universal statistical properties displayed by ensembles of pure states that
naturally emerge in quantum many-body systems. Specifically, two classes of state …
naturally emerge in quantum many-body systems. Specifically, two classes of state …
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 …
Minimax rates of entropy estimation on large alphabets via best polynomial approximation
Consider the problem of estimating the Shannon entropy of a distribution over k elements
from n independent samples. We show that the minimax mean-square error is within the …
from n independent samples. We show that the minimax mean-square error is within the …
Estimation of wasserstein distances in the spiked transport model
Estimation of Wasserstein distances in the Spiked Transport Model Page 1 Bernoulli 28(4),
2022, 2663–2688 https://doi.org/10.3150/21-BEJ1433 Estimation of Wasserstein distances …
2022, 2663–2688 https://doi.org/10.3150/21-BEJ1433 Estimation of Wasserstein distances …
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 …
An automatic inequality prover and instance optimal identity testing
We consider the problem of verifying the identity of a distribution: Given the description of a
distribution over a discrete finite or countably infinite support, p=(p_1,p_2,...), how many …
distribution over a discrete finite or countably infinite support, p=(p_1,p_2,...), how many …
Optimal algorithms for testing closeness of discrete distributions
We study the question of closeness testing for two discrete distributions. More precisely,
given samples from two distributions p and q over an n-element set, we wish to distinguish …
given samples from two distributions p and q over an n-element set, we wish to distinguish …
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 …
[HTML][HTML] On the quantum versus classical learnability of discrete distributions
Here we study the comparative power of classical and quantum learners for generative
modelling within the Probably Approximately Correct (PAC) framework. More specifically we …
modelling within the Probably Approximately Correct (PAC) framework. More specifically we …
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 …