Cover Image

Leaf Stripping on Uniform Attachment Trees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Addario-Berry, Louigi, Brandenberger, Anna, Briend, Simon, Broutin, Nicolas, Lugosi, Gábor
Format:	Preprint
Published:	2024
Subjects:	Probability Data Structures and Algorithms Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Leaf Stripping on Uniform Attachment Trees
by: Louigi Addario‐Berry, et al.
Published: (2025)

Simple, unified analysis of Johnson-Lindenstrauss with applications
by: Li, Yingru
Published: (2024)

Efficiently learning and sampling multimodal distributions with data-based initialization
by: Koehler, Frederic, et al.
Published: (2024)

A General Reduction for High-Probability Analysis with General Light-Tailed Distributions
by: Attia, Amit, et al.
Published: (2024)

The graph alignment problem: fundamental limits and efficient algorithms
by: Ganassali, Luca
Published: (2024)

Improved sampling algorithms and functional inequalities for non-log-concave distributions
by: He, Yuchen, et al.
Published: (2025)

Approximating the Total Variation Distance between Gaussians
by: Bhattacharyya, Arnab, et al.
Published: (2025)

On approximating the $f$-divergence between two Ising models
by: Feng, Weiming, et al.
Published: (2025)

Private Synthetic Graph Generation and Fused Gromov-Wasserstein Distance
by: Wirth, Leoni Carla, et al.
Published: (2025)

Approximating the total variation distance between spin systems
by: Feng, Weiming, et al.
Published: (2025)

On Computing Total Variation Distance Between Mixtures of Product Distributions
by: Feng, Weiming, et al.
Published: (2026)

Rapid mixing in positively weighted restricted Boltzmann machines
by: Feng, Weiming, et al.
Published: (2026)

Finding the root in random nearest neighbor trees
by: Brandenberger, Anna, et al.
Published: (2024)

Succinct Preferential Attachment Graphs
by: Alaoui, Ziad Ismaili, et al.
Published: (2025)

The Transient Cost of Learning in Queueing Systems
by: Freund, Daniel, et al.
Published: (2023)

Quality control in sublinear time: a case study via random graphs
by: Marcussen, Cassandra, et al.
Published: (2025)

Adversarially-Robust Inference on Trees via Belief Propagation
by: Hopkins, Samuel B., et al.
Published: (2024)

Data organization limits the predictability of binary classification
by: Jing, Fei, et al.
Published: (2024)

On the quality of randomized approximations of Tukey's depth
by: Briend, Simon, et al.
Published: (2023)

Uniform Temporal Trees
by: Caelan Atamanchuk, et al.
Published: (2025)

Errors are Robustly Tamed in Cumulative Knowledge Processes
by: Brandenberger, Anna, et al.
Published: (2023)

Parallel Sampling via Counting
by: Anari, Nima, et al.
Published: (2024)

Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity
by: Chenakkod, Shabarish, et al.
Published: (2024)

Learning Mixtures of Gaussians Using Diffusion Models
by: Gatmiry, Khashayar, et al.
Published: (2024)

Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing
by: Kunisky, Dmitriy
Published: (2024)

Online Differentially Private Synthetic Data Generation
by: He, Yiyun, et al.
Published: (2024)

Sparsifying Suprema of Gaussian Processes
by: De, Anindya, et al.
Published: (2024)

A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
by: Ding, Jian, et al.
Published: (2022)

Functional Stochastic Localization
by: Gu, Anming, et al.
Published: (2026)

High-accuracy log-concave sampling with stochastic queries
by: Chen, Fan, et al.
Published: (2026)

Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling
by: Blanca, Antonio, et al.
Published: (2022)

A computational phase transition for learning-to-sample from Ising models
by: Risteski, Andrej, et al.
Published: (2026)

Learning bounded-degree polytrees with known skeleton
by: Choo, Davin, et al.
Published: (2023)

Nonlinear Laplacians: Tunable principal component analysis under directional prior information
by: Ma, Yuxin, et al.
Published: (2025)

Perspectives on Stochastic Localization
by: Shi, Bobby, et al.
Published: (2025)

Computational and statistical lower bounds for low-rank estimation under general inhomogeneous noise
by: De, Debsurya, et al.
Published: (2025)

Active Learning for Non-Parametric Choice Models
by: Susan, Fransisca, et al.
Published: (2022)

Orthogonal Nonnegative Matrix Factorization with Sparsity Constraints
by: Basiri, Salar, et al.
Published: (2022)

Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization
by: Bhuyan, Neelkamal, et al.
Published: (2023)

Well-Conditioned Oblivious Perturbations in Linear Space
by: Chenakkod, Shabarish, et al.
Published: (2026)