Math 2.0

Resources / preprint

Structure-Adaptive Tree Field Integrators VCG579E7MM

URIm2://res/VCG579E7MM
Kindpreprint
CreatorsMillend Roy, Soham Samal, Ivan Zelich, Krzysztof Marcin Choromanski
Date2026-09-27
Subjectsarxiv cs.LG, arxiv cs.CV, arxiv cs.DS, arxiv cs.NA, arxiv math.NA, arxiv math.OC
Scopeborder

Expressions

e1: version, preprint

Date2026-09-27
IdsarXiv 2609.34025

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
Backbone choice on equal-arm spidersstatementproposition 2arxiv
A bound in terms of recursion depth and off-backbone depthstatementcorollary 2arxiv
A spine with equally long pendant pathsstatementproposition 5arxiv
Worst-Case Runtime of \STADTFI(Specialized Kernelsstatementcorollary 4arxiv
Amortized work at a selected callstatementlemma 6arxiv
FFT acceleration of the computation of $G$statementproposition 1arxiv
Adaptive selection and local coststatementlemma 4arxiv
Diameter backbonestatementlemma 8arxiv
Stretchdefinitiondefinition 1arxiv
Exactness and decomposition-dependent coststatementtheorem 1arxiv
Merging component penaltiesstatementlemma 5arxiv
Center backbonestatementlemma 9arxiv
Cross-component correctionstatementlemma 2arxiv
Distances through the backbonestatementlemma 1arxiv
Balanced trees with bounded degreestatementproposition 6arxiv
An off-backbone-depth bound for adaptive selectionstatementcorollary 3arxiv
Adaptive complexity in terms of backbone geometrystatementtheorem 3arxiv
Adaptive worst-case guarantee in near-linear timestatementtheorem 2arxiv
Cross interactions for exponential sumsstatementlemma 7arxiv
Joint 2D-FFT acceleration of $G$statementlemma 3arxiv
XCB35N3NRNstatementproposition 3arxiv
Caterpillarsstatementproposition 4arxiv
Adaptive integration on equal-arm spidersstatementcorollary 1arxiv

Catalogue records