Denoising Flows on Trees
From MaRDI portal
Publication:4566741
DOI10.1109/TIT.2017.2782369zbMATH Open1390.94958arXiv1602.08048OpenAlexW2964269753MaRDI QIDQ4566741FDOQ4566741
Authors: Sabyasachi Chatterjee, John Lafferty 
Publication date: 27 June 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: We study the estimation of flows on trees, a structured generalization of isotonic regression. A tree flow is defined recursively as a positive flow value into a node that is partitioned into an outgoing flow to the children nodes, with some amount of the flow possibly leaking outside. We study the behavior of the least squares estimator for flows, and the associated minimax lower bounds. We characterize the risk of the least squares estimator in two regimes. In the first regime the diameter of the tree grows at most logarithmically with the number of nodes. In the second regime, the tree contains long paths. The results are compared with known risk bounds for isotonic regression.
Full work available at URL: https://arxiv.org/abs/1602.08048
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Applications of graph theory to circuits and networks (94C15)
Cited In (2)
This page was built for publication: Denoising Flows on Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566741)
