Multichannel Boxcar Deconvolution with Growing Number of Channels
Marianna Pensky, Theofanis Sapatinas

TL;DR
This paper studies the estimation of an unknown response function in multichannel deconvolution with a boxcar kernel, focusing on scenarios where the number of channels grows slowly with the total observations, and develops methods for constructing badly approximable tuples to optimize estimation accuracy.
Contribution
It introduces a procedure for constructing badly approximable tuples when the number of channels grows slowly, and evaluates the impact on the $L^2$-risk of wavelet-based estimators.
Findings
Constructed badly approximable $M$-tuples with explicit bounds.
Derived $L^2$-risk bounds for the estimator.
Provided a method to choose the optimal number of channels.
Abstract
We consider the problem of estimating the unknown response function in the multichannel deconvolution model with a boxcar-like kernel which is of particular interest in signal processing. It is known that, when the number of channels is finite, the precision of reconstruction of the response function increases as the number of channels grow (even when the total number of observations for all channels remains constant) and this requires that the parameter of the channels form a Badly Approximable -tuple. Recent advances in data collection and recording techniques made it of urgent interest to study the case when the number of channels grow with the total number of observations . However, in real-life situations, the number of channels usually refers to the number of physical devices and, consequently, may grow to infinity only at a slow rate as $n…
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.
