Hierarchical paraproducts
Oluwadamilola Fasina

TL;DR
This paper extends paraproduct decompositions to finite and product spaces, enabling analysis of compositions with less smooth functions, with applications in graph signal processing.
Contribution
It introduces a hierarchical paraproduct framework for finite and product spaces, generalizing previous continuous-space results and facilitating separation of singular and smooth components.
Findings
Constructed partition trees for finite and product spaces.
Developed paraproducts with controlled regularity properties.
Achieved bounds on the residual terms in the decompositions.
Abstract
We outline an extension of paraproduct decompositions for compositions of the form where developed in [arXiv:2503.12629] and [arXiv:2508.13322] to settings where and . To do so, we construct partition trees on and such that analysis with respect to scale is sensible. We obtain results resembling those of [arXiv:2503.12629] and [arXiv:2508.13322], but with the finite sets and as support. In particular we construct the paraproduct such that and $\lVert \Delta_{L,S}(A,f) \rVert_{\Lambda_{2\alpha}(X \times Y)} \leq C_A \lVert f \rVert_{\Lambda_{\alpha}(X \times…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Topological and Geometric Data Analysis · Rough Sets and Fuzzy Logic
