AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Lattice partition recovery with dyadic CART

OSCAR HERNAN MADRID PADILLA, Yi Yu, Alessandro Rinaldo

NeurIPS 2021 · Learning theory and algorithms › Sample complexity · approach: Distributed estimation under communication limits · 3 citations (OpenAlex)

Read the paper

AI-extracted. The measured effects below were read by AI from the paper's full text (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 the two-step DCART estimator instead of TV-based pruningPartition recovery · Scenarios 1–4, σ=0.5, 1.0, and 1.5dist_2Improved
Use the two-step DCART estimator instead of TV-based pruningPartition recovery · Scenarios 1–4, σ=0.5, 1.0, and 1.5dist_1Mixed
Apply the constrained two-step DCART estimator rather than naive DCART partition outputDCART partition recovery · Lattice simulationspartition recoveryImproved

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