Stability of Deep Neural Networks via discrete rough paths
Using rough path techniques, we provide a priori estimates for the output of Deep Residual Neural Networks in terms of both the input data and the (trained) network weights. As trained network weights are typically very rough when seen as functions of the layer, we propose to derive stability bounds in terms of the total $p$-variation of trained weights for any $p\in[1,3]$. Unlike the $C^1$-theory underlying the neural ODE literature, our estimates remain bounded even in the limiting case of weights behaving like Brownian motions, as suggested in [arXiv:2105.12245]. Mathematically, we interpret residual neural network as solutions to (rough) difference equations, and analyse them based on recent results of discrete time signatures and rough path theory.
Code (1)
Similar Papers 제목 키워드 기반
Flow Matching with General Discrete Paths: A Kinetic-Optimal Perspective
The design space of discrete-space diffusion or flow generative models are significantly less well-understood than their continuous-space counterparts, with many works focusing only on a simple masked construction. In th…
Image GenerationText GenerationBridging Discrete Planning and Continuous Execution for Redundant Robot
Voxel-grid reinforcement learning is widely adopted for path planning in redundant manipulators due to its simplicity and reproducibility. However, direct execution through point-wise numerical inverse kinematics on 7-Do…
Reinforcement LearningA Frequency-Domain Path-Following Method for Discrete Data-Based Paths
This paper presents a novel frequency-domain approach for path following problem, specifically designed to handle paths described by discrete data. The proposed algorithm utilizes the fast Fourier Transform (FFT) to proc…
Discrete Flow Matching
Despite Flow Matching and diffusion models having emerged as powerful generative paradigms for continuous variables such as images and videos, their application to high-dimensional discrete data, such as language, is sti…
HumanEvalmbppPredictionMinimal-Action Discrete Schrödinger Bridge Matching for Peptide Sequence Design
Generative modeling of peptide sequences requires navigating a discrete and highly constrained space in which many intermediate states are chemically implausible or unstable. Existing discrete diffusion and flow-based me…
Protein Language Model