scientific article; zbMATH DE number 7053360
From MaRDI portal
Publication:5743483
zbMath1421.68091MaRDI QIDQ5743483
Ilias Diakonikolas, Constantinos Daskalakis, Rocco A. Servedio
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095224
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Density estimation (62G07) Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25) Nonparametric estimation (62G05) Randomized algorithms (68W20)
Related Items (4)
Big Data on the Rise? ⋮ Optimal Estimation of Wasserstein Distance on a Tree With an Application to Microbiome Studies ⋮ Robust Estimators in High-Dimensions Without the Computational Intractability ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality
- Rates of convergence of minimum distance estimators and Kolmogorov's entropy
- Estimating a density under order restrictions: Nonasymptotic minimax risk
- On the risk of histograms for estimating decreasing densities
- Mixtures with a limited number of modal intervals
- A universally acceptable smoothing factor for kernel density estimates
- Estimation of unimodal densities without smoothness assumptions
- Nonasymptotic universal smoothing factors, kernel complexity and Yatracos classes
- Learning Poisson binomial distributions
- Property testing and its connection to learning and approximation
- Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator
- The Double Dixie Cup Problem
- Sublinear algorithms for testing monotone and unimodal distributions
- Optimal Auction Design
- Estimation and Moment Recursion Relations for Multimodal Distributions of the Exponential Family
- Testing for multimodality with dependent data
- Maximum Likelihood Estimation of a Unimodal Density Function
- Combinatorial methods in density estimation
- Testing problems with sublearning sample complexity
This page was built for publication:
