mlsanityData to 14 Oct 2026

A Trainable Approach to Zero-delay Smoothing Spline Interpolation

arXiv 2203.03776 ↗First posted 7 Mar 2022cs.LG eess.SPcited by 1

Not on the map. Why?

Abstract (arXiv)

The task of reconstructing smooth signals from streamed data in the form of signal samples arises in various applications. This work addresses such a task subject to a zero-delay response; that is, the smooth signal must be reconstructed sequentially as soon as a data sample is available and without having access to subsequent data. State-of-the-art approaches solve this problem by interpolating consecutive data samples using splines. Here, each interpolation step yields a piece that ensures a smooth signal reconstruction while minimizing a cost metric, typically a weighted sum between the squared residual and a derivative-based measure of smoothness. As a result, a zero-delay interpolation is achieved in exchange for an almost certainly higher cumulative cost as compared to interpolating all data samples together. This paper presents a novel approach to further reduce this cumulative cost on average. First, we formulate a zero-delay smoothing spline interpolation problem from a sequential decision-making perspective, allowing us to model the future impact of each interpolated piece on the average cumulative cost. Then, an interpolation method is proposed to exploit the temporal dependencies between the streamed data samples. Our method is assisted by a recurrent neural network and accordingly trained to reduce the accumulated cost on average over a set of example data samples collected from the same signal source generating the signal to be reconstructed. Finally, we present extensive experimental results for synthetic and real data showing how our approach outperforms the abovementioned state-of-the-art.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 11 of its 66 references that are in the map. First posted on arXiv 7 Mar 2022.

Builds on

11 of 66 references.

References · 11

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2021Convex optimizationcited by 2,515
  3. 2014On the Properties of Neural Machine Translation: Encoder-Decoder Approachescited by 1,304
  4. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,150
  5. 2019Introduction to Online Convex Optimizationcited by 803
  6. 2019Differentiable Convex Optimization Layerscited by 465
  7. 2019Algorithm Unrolling: Interpretable, Efficient Deep Learning for Signal and Image Processingcited by 421
  8. 2019Online Learning: A Modern Introduction Using Convex Optimizationcited by 417
  9. 2017Recent Advances in Recurrent Neural Networkscited by 89
  10. 2021Incremental Ensemble Gaussian Processescited by 15
  11. 2017Real-Time Machine Learning: The Missing Piecescited by 7

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.