cs.LGNov 7, 2026

The Fast Tree Transform

Authors: Paul Burchard

Abstract

The Fast Tree Transform is a locally-aggregated transform defined for arbitrary graph geometries that generalizes both the Hadamard frequency transform and the Haar wavelet transform on the circle. The pure frequency part of the transform approximately diagonalizes the graph Laplacian; this fact makes it useful as a preconditioner in geometric optimization problems. The full transform provides an only slightly-redundant representation of signals on the graph that allows sparse representation of signals that include both edges and textures.

Figures & tables

Explore similar work

CardsList
  1. CAST: Canonical Approximate Schur Tree for Approximate Cholesky on Graphs

    Sep 8, 2026Meher Chaitanya, Cameron Musco, Aristides GionisGraph SparsificationMatrix Factorization

  2. Learning Doubly Sparse Explicitly Conditioned Transforms

    Jun 9, 2026Tudor PistolRepresentation Learning

  3. Structure-Adaptive Tree Field Integrators

    Sep 27, 2026Millend Roy, Soham Samal, Ivan Zelich +1