Sampling Correctors
From MaRDI portal
Publication:4577769
DOI10.1137/16M1076666zbMath1397.68216OpenAlexW2952828455MaRDI QIDQ4577769
Clément L. Canonne, Themis Gouleakis, Ronitt Rubinfeld
Publication date: 3 August 2018
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1076666
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality
- Property-preserving data reconstruction
- On the risk of histograms for estimating decreasing densities
- Self-testing/correcting with applications to numerical problems
- Learning Poisson binomial distributions
- Sampling Correctors
- On the learnability of discrete distributions
- Local Reconstructors and Tolerant Testers for Connectivity and Diameter
- On the power of conditional samples in distribution testing
- Efficient Sample Extractors for Juntas with Applications
- On Testing Expansion in Bounded-Degree Graphs
- Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator
- Sublinear algorithms for testing monotone and unimodal distributions
- A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data
- Sample-Optimal Density Estimation in Nearly-Linear Time
- Robustly Learning a Gaussian: Getting Optimal Error, Efficiently
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
- Learning from untrusted data
- Testing Probability Distributions Underlying Aggregated Data
- Efficient density estimation via piecewise polynomial approximation
- Testing equivalence between distributions using conditional samples
- Local Monotonicity Reconstruction
- Testing Closeness of Discrete Distributions
- Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions
- The Power of Linear Estimators
- Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy
- Learning $k$-Modal Distributions via Testing
- The Complexity of Approximating the Entropy
- Learning mixtures of structured distributions over discrete domains
- Testing k-Modal Distributions: Optimal Algorithms via Reductions
- Locally Decodable Codes
- Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
- Robust Statistics
- Combinatorial methods in density estimation
This page was built for publication: Sampling Correctors
