Sequential Regression Learning with Randomized Algorithms

arXiv stat.ML / 4/20/2026

📰 NewsIdeas & Deep AnalysisModels & Research

Key Points

  • The paper introduces “randomized SINDy,” a sequential machine learning algorithm for dynamic/time-dependent data.
  • It uses a probabilistic prediction framework by learning a probability distribution over predictors and updates model weights via gradient descent plus a proximal method to keep a valid probability density.
  • The authors provide a rigorous PAC learning guarantee based on functional analysis, supporting theoretical learnability.
  • The method is inspired by the SINDy approach and adds feature augmentation and Tikhonov regularization to improve learning.
  • Experiments on real-world regression and binary classification tasks show the algorithm’s effectiveness compared to baseline approaches.

Abstract

This paper presents ``randomized SINDy", a sequential machine learning algorithm designed for dynamic data that has a time-dependent structure. It employs a probabilistic approach, with its PAC learning property rigorously proven through the mathematical theory of functional analysis. The algorithm dynamically predicts using a learned probability distribution of predictors, updating weights via gradient descent and a proximal algorithm to maintain a valid probability density. Inspired by SINDy (Brunton et al. 2016), it incorporates feature augmentation and Tikhonov regularization. For multivariate normal weights, the proximal step is omitted to focus on parameter estimation. The algorithm's effectiveness is demonstrated through experimental results in regression and binary classification using real-world data.