A new perspective on the learning dynamics for a class of learning problems via averaged gradient systems coupled with diffusion-transmutation processes

In the first part of this paper, we consider a family of continuous-time dynamical systems coupled with diffusion-transmutation processes. Under certain conditions, such randomly perturbed dynamical systems can be interpreted as an averaged dynamical system, whose weighting coefficients, that depend on the state trajectory of the underlying averaged system, are assumed to be strictly positive with sum unity. Here, we provide a large deviation result for the corresponding family of processes, i.e., a variational problem formulation modeling the most likely sample path leading to certain noise-induced rare-events. This remarkably allows us to provide a computational algorithm for solving the corresponding variational problem. In the second part of the paper, we use some of the insights from the first part and provide a new perspective on the learning dynamics for a class of learning problems, whose averaged gradient dynamical systems, from continuous-time perspective, are guided by a set of subsampled datasets that are obtained from the original dataset via bootstrapping or other related resampling-based techniques. Finally, we present some numerical results for a typical nonlinear regression problem, where the corresponding averaged gradient system is interpreted as random walks on a graph, whose outgoing edges are uniformly chosen at random.

Publication Details

Journal
arXiv (Cornell University)
Published
2024-08-20
Primary Topic
Stochastic Gradient Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A new perspective on the learning dynamics for a class of learning problems via averaged gradient systems coupled with diffusion-transmutation processes

arXiv (Cornell University)
Stochastic Gradient Optimization Techniques
article

A new perspective on the learning dynamics for a class of learning problems via averaged gradient systems coupled with diffusion-transmutation processes

article en

Abstract

In the first part of this paper, we consider a family of continuous-time dynamical systems coupled with diffusion-transmutation processes. Under certain conditions, such randomly perturbed dynamical systems can be interpreted as an averaged dynamical system, whose weighting coefficients, that depend on the state trajectory of the underlying averaged system, are assumed to be strictly positive with sum unity. Here, we provide a large deviation result for the corresponding family of processes, i.e., a variational problem formulation modeling the most likely sample path leading to certain noise-induced rare-events. This remarkably allows us to provide a computational algorithm for solving the corresponding variational problem. In the second part of the paper, we use some of the insights from the first part and provide a new perspective on the learning dynamics for a class of learning problems, whose averaged gradient dynamical systems, from continuous-time perspective, are guided by a set of subsampled datasets that are obtained from the original dataset via bootstrapping or other related resampling-based techniques. Finally, we present some numerical results for a typical nonlinear regression problem, where the corresponding averaged gradient system is interpreted as random walks on a graph, whose outgoing edges are uniformly chosen at random.

arXiv (Cornell University)
Openalex Percentile: Top 56%
Stochastic Gradient Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.