AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Robustifying Algorithms of Learning Latent Trees with Vector Variables

Fengzhuo Zhang, Vincent Tan

NeurIPS 2021 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of learning distributions · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

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
Add Chow-Liu initialization before Recursive GroupingRRG, yielding RCLRG · HMMclean-sample complexity: O\big((\frac{9}{2})^{\mathrm{Diam}(\mathbb{T})}\big) to O\big(\log \mathrm{Diam}(\mathbb{T})\big)Improved
Use truncated inner products to estimate information distancesRRG, RCLRG, RNJ, and RSNJ · Latent Gaussian trees with arbitrary corruptionscorruption tolerance: n_{1}=O\big(\frac{\sqrt{n_{2}}}{\log n_{2}}\big)Improved
Robustify the algorithms using truncated inner productsRRG, RCLRG, RNJ, and RSNJ · HMM simulations with uniform, constant-magnitude, and HMM corruptionsRobinson-Foulds distanceImproved
Use Chow-Liu initialization to shorten error propagation from L_R to L_CRCLRG · Latent tree structure learningclean-sample complexity: L_{\mathrm{C}}\ll L_{\mathrm{R}}Improved

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