scientific article; zbMATH DE number 7008315

zbMath1407.68118MaRDI QIDQ4614093

Ashkan Jafarpour, Alon Orlitsky, Jayadev Acharya, Moein Falahatgar, Ananda Theertha Suresh

Publication date: 30 January 2019

Full work available at URL: http://jmlr.csail.mit.edu/papers/v19/17-165.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

density estimationadversarial comparatorsnoisy sortingScheffe estimator

Mathematics Subject Classification ID

Density estimation (62G07) Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (1)

Learning Poisson binomial distributions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning Poisson binomial distributions
• On the learnability of discrete distributions
• Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
• Sorting and Selection with Imprecise Comparisons
• A theory of the learnable
• Large Deviations for Quicksort
• Combinatorial analysis of quicksort algorithm
• Computing with Noisy Information
• Competitive analysis of the top-K ranking problem
• Robust Estimators in High-Dimensions Without the Computational Intractability
• Parallel algorithms for select and partition with noisy comparisons
• Rank Centrality: Ranking from Pairwise Comparisons
• A Useful Convergence Theorem for Probability Distributions
• Combinatorial methods in density estimation

This page was built for publication: