Riemannian stochastic gradient descent approximates a diffusion process called Riemannian stochastic modified flow.
problem Improving convergence rate of Riemannian stochastic gradient descent.
method Using stochastic differential geometry, the paper shows RSGD can be approximated by the Riemannian stochastic modified flow (RSMF).
result RSGD can be approximated by the solution to the RSMF driven by an infinite-dimensional Wiener process, increasing the order of approximation.
Paper uses second-order differential geometry to study stochastic mechanics.
problem Stochastic differential equations and their symmetries.
method Develops second-order differential geometry to study symmetries of SDEs and constructs stochastic mechanics.
result Establishes stochastic Lagrangian and Hamiltonian mechanics and their relations with HJB equations.
We introduce a stochastic model for noisy vector fields on manifolds.
problem Noisy vector fields violate the assumption of parallel transport in stochastic analysis.
method We define a stochastic Lie bracket that induces torsion and analyze its consequences.
result The stochastic Lie bracket induces torsion in expectation.
New method learns dynamics from sparse data using geometric constraints.
problem Learning dynamics from sparse, undersampled data.
method Reformulates inference as a stochastic control problem, using geometry-driven path augmentation.
result Accurately recovers stochastic dynamics from extremely undersampled data.
Toolbox for stochastic Euler equations using Ebin-Marsden theory.
problem Applying geometric framework to stochastic PDEs.
method Combining infinite-dimensional geometry and stochastic analysis.
result Local well-posedness of maximal solutions for incompressible Euler equation with noise.
We study computational and statistical consequences of problem geometry in stochastic and online optimization. By focusing on constraint set and gradient geometry, we characterize the problem families for which stochastic- and adaptive-gradient methods are (minimax) optimal and, conversely, when nonlinear updates -- su…
This study analyzes satellite communication latency using a stochastic geometry model.
problem Latency analysis of LEO satellite relay communication systems.
method Stochastic geometry framework with spherical BPP models, suboptimal satellite relay selection strategy.
result Derives distance distributions and analytical expressions for transmission delays.
The book explores stochastic areas and heat kernels on manifolds.
problem Understanding stochastic area functionals and heat kernels on manifolds.
method Study of Brownian motions and heat kernels on Lie groups and Riemannian manifolds.
result Rich interactions between stochastic calculus, geometry, and random matrices.
The paper analyzes how noise geometry influences the performance of SGD in machine learning.
problem Understanding how noise geometry affects the performance of stochastic gradient descent.
method Developed two metrics to quantify noise alignment strength and analyzed their effects on loss and subspace projection dynamics.
result Noise geometry can be used to guarantee alignment under certain conditions, aiding SGD's ability to escape from sharp minima.
Deep learning models viewed through tame geometry for convergence guarantees.
problem Understanding convergence guarantees in deep learning models.
method Introducing tame geometry concepts and tools for nonsmooth nonconvex settings.
result Illustrates tame geometry as a natural framework for AI systems, especially deep learning.
Quantized Stochastic Primal-Dual Methods for Distributed Optimization
problem Distributed optimization with stochastic gradients and finite-bit communication
method q-PDGD, a quantized stochastic primal-dual method
result Linear contraction to an explicit neighborhood under RSI, O(1/k) convergence under PL inequality
Geometric approach for unsupervised word embedding alignment.
problem Learning alignment between word embeddings of source and target languages.
method Formulates alignment as domain adaptation on the manifold of doubly stochastic matrices, employing Riemannian conjugate gradient algorithm.
result Empirically outperforms state-of-the-art methods on bilingual lexicon induction tasks.
Several recent works have explored stochastic gradient methods for variational inference that exploit the geometry of the variational-parameter space. However, the theoretical properties of these methods are not well-understood and these methods typically only apply to conditionally-conjugate models. We present a new s…
New model estimates higher-order interactions in stochastic processes using lower-dimensional projections.
problem Estimating higher-order interaction effects in stochastic processes with limited data.
method Additive Poisson Process (APP) combines information geometry and generalized additive models to model intensity functions in lower dimensions.
result The model can estimate higher-order intensity functions with sparse data.
We consider stochastic versions of Euler--Arnold equations using the infinite-dimensional geometric approach as pioneered by Ebin and Marsden. For the Euler equation on a compact manifold (possibly with smooth boundary) we establish local existence and uniqueness of a strong solution (in the stochastic sense) in spaces…
Finite-time queue peaks in stochastic networks have logarithmic scaling after geometric thresholds.
problem Queue peak laws in stochastic networks with geometric thresholds.
method Self-normalization mechanism
result Logarithmic scaling of queue peaks after geometric thresholds.
Develops a functional generalization of Eldan's stochastic localization for optimization and privacy.
problem Sampling under non-Euclidean geometries and optimization in differential privacy.
method Functional generalization of Eldan's stochastic localization, incorporating log-Laplace transform.
result Improves query complexities in zeroth-order differential private convex optimization.
We consider the problem of multi-class classification and a stochastic opti- mization approach to it. We derive risk bounds for stochastic mirror descent algorithm and provide examples of set geometries that make the use of the algorithm efficient in terms of error in k.
Study on stochastic mean curvature flow on networks using Ito calculus.
problem Understanding the dynamics of network structures under random influences.
method Application of Ito calculus to derive a stochastic differential equation (SDE) for network edges.
result New insights into the stability, long-term behavior, and pattern formation of complex networks under stochastic influences.
These notes represent a much expanded and updated version of the \textquotedblleft mini course\textquotedblright that the author gave at the ETH (Zürich) and the University of Zürich in February of 1995. The purpose of these notes is to first provide some basic background to Riemannian geometry and stochastic calculus …
Geometry arising from two diffusion operators (smooth semi-elliptic, second order differential operators) on different spaces but intertwined by a smooth map is described. Particular cases arise from Riemannian submersions when the operators are Laplace-Beltrami operators, from equivariant operators on the total space …
New adaptive step-size method for convex optimization without tuning.
problem Optimizing convex functions efficiently with stochastic gradients.
method Adapted Adaptive Gradient Descent Without Descent to stochastic setting.
result Stochastic gradient descent converges under various assumptions.
The study identifies volatility models from path geometry using signature-based methods.
problem Identifying different stochastic volatility models from observed data.
method Mapping volatility trajectories into a feature space via truncated path signatures and applying a gradient boosting classifier.
result The method achieves high classification accuracy across various volatility dynamics and parameter settings.
New framework models neural systems with random architecture on manifolds.
problem Complex, uncertain systems with non-Gaussian outputs.
method Latent random field on compact manifold generates neural architecture and weights.
result Synthetic neural systems can produce stochastic outputs for deterministic inputs.
In a noncommutative torus, effect of perturbation by inner derivation on the associated quantum stochastic process and geometric parameters like volume and scalar curvature have been studied. Cohomological calculations show that the above perturbation produces new spectral triples. Also for the Weyl C^*-algebra, the La…
Given a second order partial differential operator L satisfying the strong Hörmander condition with corresponding heat semigroup Pt, we give two different stochastic representations of dPtf for a bounded smooth function f. We show that the first identity can be used to prove infinite lifetime of a diffusion …
The stable under iterated tessellation (STIT) process is a stochastic process that produces a recursive partition of space with cut directions drawn independently from a distribution over the sphere. The case of random axis-aligned cuts is known as the Mondrian process. Random forests and Laplace kernel approximations …
This work investigates implicit bias in multiclass separable data using a novel geometry-aware optimizer.
problem Understanding implicit bias in overparameterized models on multiclass separable data.
method Introduces NucGD, a geometry-aware optimizer enforcing low-rank structures through nuclear norm constraints.
result NucGD enables scalable training and characterizes the impact of stochastic optimization dynamics.
Study of operators on loop spaces using Fermionic calculus and stochastic methods.
problem Analyzing operators on loop spaces arising from self-adjoint and closed operators.
method Fermionic calculus and stochastic methods to derive regularity and stochastic representations.
result Derivation of a stochastic refinement of the Duistermaat-Heckman localization formula.
We consider maximum likelihood estimation for Gaussian Mixture Models (Gmms). This task is almost invariably solved (in theory and practice) via the Expectation Maximization (EM) algorithm. EM owes its success to various factors, of which is its ability to fulfill positive definiteness constraints in closed form is of …
A new model encodes distances and topology in latent variables.
problem Modeling dissimilarity data with latent variables and invariances.
method Isometric Gaussian Process Latent Variable Model using Riemannian geometry and variational inference.
result The model can encode invariances in learned manifolds.
We provide a numerically robust and fast method capable of exploiting the local geometry when solving large-scale stochastic optimisation problems. Our key innovation is an auxiliary variable construction coupled with an inverse Hessian approximation computed using a receding history of iterates and gradients. It is th…
The Noether theorem is extended to stochastic control problems using contact symmetries.
problem Stochastic optimal control problems.
method Exploiting jet bundles and contact geometry, the authors prove the existence of conserved quantities.
result Optimal control problems admit infinitely many conserved quantities in the form of local martingales.
Stochastic optimization is key to efficient inversion in PDE-constrained optimization. Using 'simultaneous shots', or random superposition of source terms, works very well in simple acquisition geometries where all sources see all receivers, but this rarely occurs in practice. We develop an approach that interpolates d…
Surveying random sections on Kähler manifolds, leading to metrics.
problem Understanding statistics of random sections on Kähler manifolds.
method Analyzing tensor powers of line bundles.
result Induced metrics from random sections.
We consider the minimization of composite objective functions composed of the expectation of quadratic functions and an arbitrary convex function. We study the stochastic dual averaging algorithm with a constant step-size, showing that it leads to a convergence rate of O(1/n) without strong convexity assumptions. This …
Study on stochastic covariant derivatives in curved space-time.
problem Analyzing covariant derivatives in curved space-time under stochastic processes.
method Using Itô-Wiener processes and stochastic calculus, including Besov spaces, Schrödinger operators, and white noise.
result Developed a framework for stochastic geodesics and white noise in fractoid spaces.
GH-PID uses guided harmonic paths for efficient SOT with interpretable diagnostics.
problem Efficiently solving Stochastic Optimal Transport with hard terminal distributions and soft costs.
method Guided Harmonic Path-Integral Diffusion (GH-PID) framework with low-dimensional guidance.
result GH-PID generates geometry-aware, cost-reducing trajectories that match terminal distributions.
Generative model calibrates 3D battery cathode morphologies from 2D images.
problem Calibrate 3D morphologies of all-solid-state battery cathodes from 2D microscopy images.
method Combining GANs with excursion sets of Gaussian random fields.
result Calibrated digital twins enable systematic exploration of morphological scenarios.
We prove a Feynman-Kac formula for differential forms satisfying absolute boundary conditions on Riemannian manifolds with boundary and of bounded geometry. We use this to construct L2 harmonic forms out of bounded ones on the universal cover of a compact Riemannian manifold whose geometry displays a positivity prop…
In several experimental reports on nonconvex optimization problems in machine learning, stochastic gradient descent (SGD) was observed to prefer minimizers with flat basins in comparison to more deterministic methods, yet there is very little rigorous understanding of this phenomenon. In fact, the lack of such work has…
New algorithm tackles nonconvex machine learning problems with adaptive normalization and independent sampling.
problem Nonconvex machine learning problems with generalized-smoothness.
method Adaptive gradient normalization, independent sampling, and gradient clipping.
result Achieves an O(ε^(-4)) sample complexity for fast convergence.
We describe a framework for deriving and analyzing online optimization algorithms that incorporate adaptive, data-dependent regularization, also termed preconditioning. Such algorithms have been proven useful in stochastic optimization by reshaping the gradients according to the geometry of the data. Our framework capt…
The paper uses geometry to understand how neural networks learn.
problem Understanding the learning capability of neural networks.
method Statistical and differential geometric analysis of neural networks performing simple regression.
result Neural networks with higher generalization capability have a slower convergence rate.
Stochastic differential equation approximation for linear TD(0) under Markovian noise
problem Temporal-difference learning with linear function approximation
method Stochastic differential equation approximation
result Explains the constant-stepsize error floor
Develops a new theory for neural systems stability and width effects.
problem Stability and finite-width effects in deep neural systems.
method Gauge-covariant stochastic effective field theory using classical commuting fields.
result Predicts the edge of chaos and low-frequency spectral deformation.
The paper studies horizontal semimartingales on Riemannian manifolds and their connections to Euclidean spaces.
problem Stochastic lifts and anti-developments of semimartingales on Riemannian manifolds.
method Using stochastic differential geometry with jumps, the paper establishes correspondences between discontinuous semimartingales and their lifts.
result The paper extends previous results to include geodesics and small jumps, enabling the construction of martingales from local martingales.
Randomly sampled interpolators achieve zero generalization error with enough data.
problem Understanding the high generalization ability of machine learning models.
method Algebraic geometry tools to prove zero generalization error for random interpolators.
result Generalization error of randomly sampled interpolators becomes zero once the number of training samples exceeds a geometric threshold.