Approximate independence of permutation mixtures
From MaRDI portal
Cites work
- A Class of Statistics with Asymptotically Normal Distribution
- A dozen de Finetti-style results in search of a theory
- Amplification by shuffling: from local to central differential privacy via anonymity
- An inequality of Hadamard type for permanents
- An information-theoretic proof of a finite de Finetti theorem
- Analytic combinatorics
- Asymptotic efficiency of simple decisions for the compound decision problem
- Asymptotic Solutions of the Compound Decision Problem for Two Completely Specified Distributions
- Bayes, oracle Bayes and empirical Bayes
- Capacity of noisy permutation channels
- Classical deterministic complexity of Edmonds' Problem and quantum entanglement
- Coding Theorems for Noisy Permutation Channels
- Comment: Empirical Bayes, compound decisions and exchangeability
- Compound decision theory and empirical Bayes methods
- Computational barriers to estimation from low-degree polynomials
- Conformal prediction beyond exchangeability
- De Finetti's theorem and related results for infinite weighted exchangeable sequences
- Differentiators and the geometry of polynomials.
- Distance between sampling with and without replacement
- Finite exchangeable sequences
- Finite forms of de Finetti's theorem on exchangeability
- Funzione caratteristica di un fenomeno aleatorio.
- General maximum likelihood empirical Bayes estimation of normal means
- Generalized Matrix Functions
- Generalized symmetric polynomials and an approximate de Finetti representation
- Hiding among the clones: a simple and nearly optimal analysis of privacy amplification by shuffling
- scientific article; zbMATH DE number 3169867 (Why is no real title available?)
- scientific article; zbMATH DE number 7561734 (Why is no real title available?)
- scientific article; zbMATH DE number 3297736 (Why is no real title available?)
- scientific article; zbMATH DE number 3068128 (Why is no real title available?)
- Hypothesis testing for densities and high-dimensional multinomials: sharp local minimax rates
- Information theory. From coding to learning (to appear)
- Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization
- Inverse spectral problem for normal matrices and the Gauss-Lucas theorem
- Is it easier to count communities than find them?
- Low coordinate degree algorithms. I: Universality of computational thresholds for hypothesis testing
- Mean field approximations via log-concavity
- Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective
- Minimax \(\ell_q\) risk in \(\ell_p\) balls
- Minimax estimation of linear and quadratic functionals on sparsity classes
- Minimax Estimation of the <inline-formula> <tex-math notation="LaTeX">$L_{1}$ </tex-math> </inline-formula> Distance
- Minimax Rates of Entropy Estimation on Large Alphabets via Best Polynomial Approximation
- Minimax risk over \(l_ p\)-balls for \(l_ q\)-error
- Non-asymptotic minimax rates of testing in signal detection
- Nonparametric empirical Bayes and compound decision approaches to estimation of a high-dimensional vector of normal means
- Nonparametric goodness-of-fit testing under Gaussian models
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio
- On Bobkov's approximate de Finetti representation via approximation of permanents of complex rectangular matrices
- On estimation of the \(L_r\) norm of a regression function
- Optimal estimation of Gaussian mixtures via denoised method of moments
- Optimal rates of estimation for multi-reference alignment
- Optimality and sub-optimality of PCA. I: Spiked random matrix models
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- Pseudorandom generators for width-3 branching programs
- Relative entropy bounds for sampling with and without replacement
- Statistical field theory. With a foreword by David Pines
- Symmetric Measures on Cartesian Products
- Testing composite hypotheses, Hermite polynomials and optimal estimation of a nonsmooth functional
- The concentration of measure phenomenon
- The solution of van der Waerden's problem for permanents
- Theory of Cryptography
- Tight bounds for learning a mixture of two Gaussians (extended abstract)
- Über homogene Polynome in ($L^{2}$)
This page was built for publication: Approximate independence of permutation mixtures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289811)
