Research map / Learning theory and algorithms / Sample complexity
Lattice partition recovery with dyadic CART
OSCAR HERNAN MADRID PADILLA, Yi Yu, Alessandro Rinaldo
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use the two-step DCART estimator instead of TV-based pruning | Partition recovery · Scenarios 1–4, σ=0.5, 1.0, and 1.5 | dist_2 | Improved |
| Use the two-step DCART estimator instead of TV-based pruning | Partition recovery · Scenarios 1–4, σ=0.5, 1.0, and 1.5 | dist_1 | Mixed |
| Apply the constrained two-step DCART estimator rather than naive DCART partition output | DCART partition recovery · Lattice simulations | partition recovery | Improved |
Closest papers by meaning
- Sampling Binary Data by Denoising through Score Functions (ICML 2025 · similarity 0.84)
- Fast exact recovery of noisy matrix from few entries: the infinity norm approach (NeurIPS 2025 · similarity 0.83)
- Distribution Learning Meets Graph Structure Sampling (NeurIPS 2025 · similarity 0.83)
- Matrix Denoising with Doubly Heteroscedastic Noise: Fundamental Limits and Optimal Spectral Methods (NeurIPS 2024 · similarity 0.82)
- Exact Community Recovery under Side Information: Optimality of Spectral Algorithms (ICLR 2025 · similarity 0.82)
- Nonlinear Laplacians: Tunable principal component analysis under directional prior information (NeurIPS 2025 · similarity 0.82)
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.
