atlas

Research map / Learning theory and algorithms / Sample complexity

Data Structures for Density Estimation

ICML 2023 · Learning theory and algorithms › Sample complexity · approach: Density and property estimation · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use fast tournament (reduced sample sizes in lower tournament levels) instead of base knockout tournamentknockout tournament for hypothesis selection · Half-uniform synthetic data, 60 samplesoperations needed for accuracy above 80%: more than 2.4x fewer operationsHelped
Use fast tournament instead of base tournamentknockout tournament · Networking CAIDA datanumber of Scheffe operations: 5x fewer (nAllPairs=0); 2.4x fewer (nAllPairs=5)Helped
Use fast tournament instead of base tournamentknockout tournament · Networking CAIDA dataTV distance of returned distributionNo clear effect
Increase all-pairs comparison at end of tournament (nAllPairs) (ablation)both tournaments · Synthetic and networking experimentsaccuracyNo clear effect
Reduce number of samples in earlier tournament rounds (smaller fastConst) (ablation)fast tournament · Half-uniform synthetic dataaccuracyNo clear effect
Increase total number of samples (ablation)both tournaments · Half-uniform synthetic dataaccuracy: accuracy rises from 13% at 20 samples to 98% at 60 samplesHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy