Learning k-modal distributions via testing

zbMATH Open1421.68091MaRDI QIDQ5743483FDOQ5743483

Authors: Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio 

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095224

Recommendations

• Learning \(k\)-modal distributions via testing
• Testing \(k\)-modal distributions: optimal algorithms via reductions
• Sublinear algorithms for testing monotone and unimodal distributions
• Testing shape restrictions of discrete distributions
• Testing shape restrictions of discrete distributions

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Density estimation (62G07) Analysis of algorithms and problem complexity (68Q25) Computational learning theory (68Q32) Randomized algorithms (68W20)

Cites Work

• The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality
• Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator
• Property testing and its connection to learning and approximation
• Combinatorial methods in density estimation
• Rates of convergence of minimum distance estimators and Kolmogorov's entropy
• Estimation and Moment Recursion Relations for Multimodal Distributions of the Exponential Family
• Optimal Auction Design
• Title not available (Why is that?)
• Estimation of unimodal densities without smoothness assumptions
• Title not available (Why is that?)
• The Double Dixie Cup Problem
• Estimating a density under order restrictions: Nonasymptotic minimax risk
• A universally acceptable smoothing factor for kernel density estimates
• Nonasymptotic universal smoothing factors, kernel complexity and Yatracos classes
• Mixtures with a limited number of modal intervals
• Maximum Likelihood Estimation of a Unimodal Density Function
• Sublinear algorithms for testing monotone and unimodal distributions
• On the risk of histograms for estimating decreasing densities
• Testing problems with sublearning sample complexity
• Testing for multimodality with dependent data

Cited In (9)

• Title not available (Why is that?)
• Efficient density estimation via piecewise polynomial approximation
• Robust estimators in high-dimensions without the computational intractability
• Optimal Estimation of Wasserstein Distance on a Tree With an Application to Microbiome Studies
• Learning mixtures of structured distributions over discrete domains
• Sublinear algorithms for testing monotone and unimodal distributions
• Learning \(k\)-modal distributions via testing
• Testing \(k\)-modal distributions: optimal algorithms via reductions
• Big data on the rise? Testing monotonicity of distributions

This page was built for publication: Learning \(k\)-modal distributions via testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743483)