SyncAI.news, a Varaisys broadcasting
Structure-Adaptive Tree Field Integrators
MR

Millend Roy, Soham Samal, Ivan Zelich, Krzysztof Marcin Choromanski

· 1 min read

ResearcharXiv cs.LG

Structure-Adaptive Tree Field Integrators

arXiv:2609.34025v1 Announce Type: new Abstract: We present a new class of near-linear algorithms for efficiently integrating general tensor fields defined on trees with distance dependent kernels, the Structure-Adaptive Tree Field Integrators (STAD-TFIs). STAD-TFIs exploit the tree's underlying structure through decompositions built around path backbones and single vertex separators, and use two-dimensional fast Fourier transforms to compute interactions jointly. By exploiting this structural information, STAD-TFIs achieve more computationally efficient integration than their regular efficient tree field integrators (TFI) counterparts. We provide a detailed theoretical analysis of our proposed approach and complement it with an exhaustive empirical evaluation, ranging from speed tests on synthetic trees, through accelerated Sinkhorn-based relaxations of the Optimal Transport algorithms on real meshes, to Topological Attention Transformers for vision tasks. To the best of our knowledge, we provide some of the first results showing that efficient to compute and accurate relaxations of the geodesic Sinkhorn-based solutions of the Optimal Transport problem can be derived by applying fast TFI methods.

Original source

This story was published by arXiv cs.LG and written by Millend Roy, Soham Samal, Ivan Zelich, Krzysztof Marcin Choromanski. SyncAI.news shows a preview; the complete article is on the publisher's site.

Read the full story on arxiv.org

Similar News