Hugging Face Trending Papers
Continuous-Time Machine Learning: A Unified Mathematical Perspective
Read the original on Hugging Face Trending Papers →The Flow has not summarised this story yet — read it at Hugging Face Trending Papers.
Related stories
arXiv AI
Sep 16
Continuous-Time Machine Learning: A Unified Mathematical Perspective
The paper surveys continuous‑time (CT) machine learning, a framework for modeling temporal dynamics as continuous processes, especially useful when data are sampled irregularly or over long horizons. It introduces a unified taxonomy that groups major CT methods by their underlying mathematical formulations and shows how different architectural choices—such as vector‑field parameterization, stochasticity, memory mechanisms, and discretization—relate these families. The survey compares training algorithms, optimization strategies, failure modes, computational complexity, and benchmarks, reviews supporting software ecosystems, and outlines open challenges and future research directions.
arXiv Machine Learning
Oct 21
Accelerating Optimization via Differentiable Stopping Time
arXiv:2505.22509v2 Announce Type: replace Abstract: Optimization is an important module of modern machine learning applications. Tremendous efforts have been made to accelerate optimization algorithm...
arXiv Machine Learning
Jul 31
Enhancing Irregular Time Series Forecasting with Continuous-Time Modeling Framework
arXiv:2607. 28035v1 Announce Type: new Abstract: Irregular multivariate time series are widely encountered in applications such as healthcare monitoring, human activity recognition, and environmental sensing.
arXiv Machine Learning
Jul 7
Advances in Neural Controlled Differential Equations
arXiv:2607. 05280v1 Announce Type: new Abstract: Many real-world systems evolve continuously, yet most machine learning models interpret time series as discrete sequences.
arXiv Machine Learning
Aug 10
Optimization as a Dynamical System: Generative Schedules from Latent ODEs
arXiv:2509. 23052v2 Announce Type: replace Abstract: We present a new meta-learning method to determine the optimal learning rate schedule for gradient descent.
arXiv Machine Learning
Oct 12
Fast Gradient-Based Approximation of Continuous Dynamic Time Warping
The paper introduces FastCDTW, an efficient approximation for Continuous Dynamic Time Warping (CDTW). It offers two computational strategies: an exact closed‑form solution for piecewise‑linear warping functions and an unbiased Monte Carlo estimator for smooth warping functions such as those implemented by implicit neural networks. Both approaches provide gradients with respect to the warping function and the input time series, making the algorithm GPU‑friendly and suitable for integration into complex learning tasks like time‑series averaging, classification, and deep domain adaptation.