mlsanityData to 7 Oct 2026

TinyUDE: Solver-Free Universal Differential Equations on Microcontrollers via Lie-Taylor Jet Matching

arXiv 2609.26972 ↗First posted 22 Sep 2026cs.LG cs.ETcited by 0

Not on the map. Why?

Abstract (arXiv)

Training Universal Differential Equations (UDEs) traditionally relies on backpropagating through numerical ODE solvers, creating memory footprints far exceeding the capabilities of edge microcontrollers. We present Lie-Taylor jet matching, a solver-free training framework that fits a hybrid vector field directly to the first and second time-derivatives of observed system states. These derivatives, the truncated Lie-Taylor jet, are estimated online via Savitzky-Golay filtering, yielding fully analytic gradients without automatic differentiation software. We evaluate whether eliminating the solver compromises accuracy against a conventional baseline (fixed-step RK4 integration, multiple shooting, exact discrete adjoints, Adam) sharing identical dynamics, noise models, network architectures, and metrics. While naive derivative matching degrades under sensor noise, our noise-adaptive mechanisms close and reverse this gap: full-rate phase-shifted sampling, a reservoir buffer, cosine-annealed optimization with weight averaging, on-device noise estimation, and polynomial-misfit quality gating. On a damped pendulum and chaotic double pendulum, our method matches or exceeds baseline accuracy at matched data windows and recovers unmodeled damping coefficients. Across noise levels from 0% to 5%, it attains a geometric-mean relative field error of 0.65x that of the baseline within 108 kB of static memory, compared with megabytes of solver tape. On an ESP32 microcontroller, the on-device run reaches a field error of 0.0020 and recovers the damping coefficient to c = 0.400 (true 0.400) within 61.3 kB of static memory and 7.24 ms per update (18.1% duty cycle at 25 Hz), confirming real-time on-device training is feasible without a numerical solver.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 58 references that are in the map. First posted on arXiv 22 Sep 2026.

Builds on

22 of 58 references.

References · 22

  1. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
  2. 2018Neural Ordinary Differential Equationscited by 3,733
  3. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
  4. 2015Automatic differentiation in machine learning: a surveycited by 846
  5. 2019Hamiltonian Neural Networkscited by 702
  6. 2019Augmented Neural ODEscited by 396
  7. 2020Lagrangian Neural Networkscited by 388
  8. 2020Universal Differential Equations for Scientific Machine Learningcited by 345
  9. 2020MCUNet: Tiny Deep Learning on IoT Devicescited by 269
  10. 2022On Neural Differential Equationscited by 264
  11. 2019Deep Lagrangian Networks: Using Physics as Model Prior for Deep Learningcited by 205
  12. 2019Latent ODEs for Irregularly-Sampled Time Seriescited by 182
10 more
  1. 2020TensorFlow Lite Micro: Embedded Machine Learning on TinyML Systemscited by 161
  2. 2022On-Device Training Under 256KB Memorycited by 158
  3. 2020SINDy-PI: A Robust Algorithm for Parallel Implicit Sparse Identification of Nonlinear Dynamicscited by 125
  4. 2021MLPerf Tiny Benchmarkcited by 118
  5. 2019ANODE: Unconditionally Accurate Memory-Efficient Gradients for Neural ODEscited by 83
  6. 2020Adaptive Checkpoint Adjoint Method for Gradient Estimation in Neural ODEcited by 76
  7. 2021TinyOL: TinyML with Online-Learning on Microcontrollerscited by 65
  8. 2020Discretize-Optimize vs. Optimize-Discretize for Time-Series Regression and Continuous Normalizing Flowscited by 36
  9. 2020Numerical differentiation of noisy data: A unifying multi-objective optimization frameworkcited by 19
  10. 2021Multiple shooting for training neural differential equations on time seriescited by 17

Built on by

Not cited yet.