Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

99198297396 · Jun 202019922001200920172026
48 results for matrix differential equations

New integrable matrix PDEs derived from Frölicher-Nijenhuis brackets.

problem Developing integrable systems from tensor field properties.
method Using Frölicher-Nijenhuis brackets to generate bi-differential graded algebras and PDE systems.
result New integrable nonlinear matrix PDEs and systems are derived.

Quaternionic differential geometry expands geometric concepts using quaternions.

problem Generalizing geometric concepts to quaternionic constraints.
method Generalizing curves and surfaces, curvature, torsion, differential forms, and directional derivatives to quaternionic constraints.
result Quaternionic formalism provides a suitable language for differential geometry.

We prove constrained trace, matrix and constrained matrix Harnack inequalities for the nonlinear heat equation ωt=Δω+aωlnωω_t=Δω+aω\ln ω on closed manifolds. We also derive a new interpolated Harnack inequality for the equation ωt=Δωωlnω+εRωω_t=Δω-ω\lnω+\varepsilon Rω on closed surfaces under the ε\varepsilon-Ricci flow. Finally we prove…

2018-03-28abs ↗pdf ↗

Traditional models of macroeconomic dynamics are fundamentally incorrect. The reason lies in a misunderstanding of peculiarities of the analysis of infinitesimal quantities. However, even those types of solutions that are envisaged by the above-mentioned models are nonrepresentative in the sense of the reflection of re…

2008-04-23abs ↗pdf ↗

Study on Langevin dynamics for recovering planted signals in spiked matrix models.

problem Recovering a planted signal in spiked matrix models.
method Path-wise characterization of overlap using integro-differential equations and explicit formula derivation.
result Sharp phase transition in limiting overlap: positive in one regime, zero in another due to injected noise.

Representations of coherent state Lie algebras on coherent state manifolds as first order differential operators are presented. The explicit expressions of the differential action of the generators of semisimple Lie groups determine for linear Hamiltonians in the generators of the groups first order differential equati…

2004-08-19abs ↗pdf ↗

New method finds efficient low-rank neural networks during training.

problem High memory and computational demands of neural networks.
method Restricts weight matrices to a low-rank manifold and updates low-rank factors.
result Significantly reduced time and memory resources required for training and evaluation.

New bounds for private matrix approximation using Gaussian noise and Dyson Brownian Motion.

problem Private approximation of symmetric matrices with Gaussian noise.
method Viewing Gaussian noise as Dyson Brownian Motion to track eigenvalue and eigenvector evolution.
result Improved bounds on Frobenius-distance utility for private matrix approximation.

Particles representing tokens cluster in Transformers, influenced by initial tokens and matrix spectrum.

problem Understanding the geometry of learned representations in Transformers.
method Viewing Transformers as particle systems, applying dynamical systems and partial differential equations.
result Particles cluster towards limiting objects, confirming context-awareness and the emergence of leaders.

A non-commutative differential calculus on the hh-superplane is presented via a contraction of the qq-superplane. An R-matrix which satisfies both ungraded and graded Yang-Baxter equations is obtained and a new deformation of the (1+1)(1+1) dimensional classical phase space (the super-Heisenberg algebra) is introduced.

2001-12-12abs ↗pdf ↗

Gradients of neural networks can be computed efficiently for any architecture, but some applications require differential operators with higher time complexity. We describe a family of restricted neural network architectures that allow efficient computation of a family of differential operators involving dimension-wise…

2019-12-08abs ↗pdf ↗

Study on neural network initialization with shaped infinite depth-and-width networks.

problem Understanding the distribution of random covariance matrices in shaped infinite-depth-and-width networks.
method Introduced the Neural Covariance SDE to model the distribution of the random covariance matrix.
result Identified the precise scaling of the activation function necessary for a non-trivial limit.

We determine the homogeneous Kähler diffeomorphism FCFC which expresses the Kähler two-form on the Siegel-Jacobi ball $\mc{D}^J_n=\C^n\times \mc{D}_n$ as the sum of the Kähler two-form on $\C^n$ and the one on the Siegel ball $\mc{D}_n$. The classical motion and quantum evolution on $\mc{D}^J_n$ determined by a hermiti…

2012-04-25abs ↗pdf ↗

A new method estimates SDEs using occupation kernels.

problem Learning multivariate stochastic differential equations (SDEs).
method Two-step procedure: estimate drift, then diffusion. Occupation kernels used in RKHS.
result Validated on simulated and real-world data.

The paper analyzes convergence of Langevin dynamics with time-dependent metrics.

problem Analyzing convergence of Langevin dynamics with time-dependent metrics.
method Formulated a modified gradient flow of the Kullback-Leibler divergence, selected a time-dependent relative Fisher information functional, and developed a time-dependent Hessian matrix condition.
result Proved convergence conditions for various Langevin dynamics.

A new neural approach for generating origin-destination matrices in ABMs.

problem Challenges in generating origin-destination matrices for ABMs, including discretisation errors and inability to explore multimodal distributions.
method A computationally efficient framework that learns trip intensity through a neural differential equation, operating directly on the discrete combinatorial space.
result Outperforms prior art in terms of reconstruction error and ground truth matrix coverage, at a fraction of the computational cost.

Paper establishes convergence rates for learning elliptic pseudo-differential operators.

problem Learning elliptic pseudo-differential operators in partial differential equations.
method Wavelet-Galerkin framework, structured infinite-dimensional regression problem, sparse estimator, matrix compression, nested-support strategy.
result Obtained convergence rates for the estimator and efficient Galerkin solver.

A new graph neural network framework captures long-range interactions efficiently.

problem Efficiently modeling long-range interactions in graph neural networks for PDEs.
method Proposes a multi-level graph neural network framework using multipole methods.
result Captures interaction at all ranges with only linear complexity, learning discretization-invariant solution operators.

These lecture notes provide a self-contained introduction to the mathematical methods required in a Bachelor degree programme in Business, Economics, or Management. In particular, the topics covered comprise real-valued vector and matrix algebra, systems of linear algebraic equations, Leontief's stationary input-output…

2015-09-11abs ↗pdf ↗

CoLA automates efficient numerical linear algebra for complex matrix structures.

problem Efficiently solving large-scale linear algebra problems with complex matrix structures.
method Combining linear operator abstraction with compositional dispatch rules.
result Automatic and efficient numerical algorithms for various linear algebra operations.

Study solves DREs for trading strategies using signals and past prices.

problem Solving DREs for optimal trading strategies.
method Analyzes DREs with indefinite matrix coefficients and applies to trading problems.
result Derives optimal trading strategies using signals and past prices.

A new algorithm solves high-dimensional nonlinear BSDEs efficiently.

problem Solving high-dimensional nonlinear backward stochastic differential equations (BSDEs).
method Transformed BSDE into a differential deep learning problem using Malliavin calculus. Discretized integrals using Euler-Maruyama method. Approximated solution with three deep neural networks. Optimized parameters using a differential learning loss function.
result Our algorithm is more accurate and faster than other methods.

Utilizing a weight matrix we study surfaces of prescribed weighted mean curvature which yield a natural generalisation to critical points of anisotropic surface energies. We first derive a differential equation for the normal of immersions with prescribed weighted mean curvature, generalising a result of Clarenz and vo…

2007-11-15abs ↗pdf ↗

A regression algorithm uses Green's function and covariance matrix for predictive distributions.

problem Regression and uncertainty quantification for machine learning.
method Green's function theory, Bayesian approach, covariance matrix of normalized Green's function.
result The covariance matrix provides predictive distributions with mean and confidence intervals.

HTE improves PINNs for high-dimensional, high-order PDEs by reducing computational cost and memory usage.

problem Challenges in solving high-dimensional, high-order PDEs with PINNs due to computational cost and memory constraints.
method Introduces Hutchinson Trace Estimation (HTE) to transform Hessian matrix calculations into Hessian vector products (HVP), reducing computational cost and memory usage.
result HTE significantly reduces memory consumption and computational cost, enabling faster and more efficient solution of high-dimensional and high-order PDEs.

Efficiently values and computes sensitivities of Bermudan options using Method of Lines.

problem Valuation and sensitivities of Bermudan options.
method Method of Lines converting Black Scholes PDE to ODEs, spatial discretization, exponential matrix operation for efficiency.
result Computational efficiency and straightforward implementation for computing sensitivities.

We prove that the Ricci flow equation for left invariant metrics on Lie groups reduces to a first order ordinary differential equation for a map Q:(a,a)UTQ : (-a,a) \to UT, where UTUT is the group of upper triangular matrices. We decompose the matrix RijR_{ij} of Ricci tensor coordinates with respect to an orthonormal frame fi…

2005-07-22abs ↗pdf ↗

Study on SGD dynamics and scaling laws for training quadratic neural networks in high dimensions.

problem Optimizing and understanding the training dynamics of quadratic neural networks in high-dimensional settings.
method Sharp analysis of SGD dynamics, combining matrix Riccati differential equations and matrix monotonicity arguments.
result Derivation of scaling laws for prediction risk, highlighting power-law dependencies on optimization time, sample size, and model width.

Efficiently differentiate functions of large matrices using new adjoint systems.

problem Differentiating functions of large matrices in scientific and probabilistic machine learning models.
method Deriving and implementing new adjoint systems for Lanczos and Arnoldi iterations in JAX.
result Efficient differentiation of PDEs, Gaussian process models, and Bayesian neural networks.

The Davey Stewartson hierarchy will be developed based on a set of three matrix differential operators. These equations will act as evolution equations for different types of surface deformation in Euclidean four space. The Weierstrass representation for surfaces will be developed and its uniqueness up to gauge transfo…

2006-12-15abs ↗pdf ↗

We consider stochastic partial differential equations appearing as Markovian lifts of matrix valued (affine) Volterra type processes from the point of view of the generalized Feller property (see e.g., \cite{doetei:10}). We introduce in particular Volterra Wishart processes with fractional kernels and values in the con…

2019-07-02abs ↗pdf ↗

Model liquidity premia using a risk-sharing economy with quadratic costs.

problem Understanding the cross-section of liquidity premia earned by assets with different trading costs.
method Developed a risk-sharing economy model with quadratic transaction costs, leading to matrix-valued Riccati equations for equilibrium.
result Calibrated model to time series data, revealing liquidity premia across assets with varying trading costs.

Study differential properties of matrix square roots in specific cases.

problem Understanding matrix square roots in semi-simple, symmetric, and orthogonal cases.
method Analysis of differential and metric structures of real square roots of matrices under specific conditions.
result Differential properties of matrix square roots in semi-simple, symmetric, and orthogonal cases.

New Transformer architecture prevents rank degeneracy in deep attention models.

problem Rank degeneracy in deep attention models.
method Modified Softmax-based attention model with skip connections, centered at identity, and scaled logits.
result Existence of a stable SDE implies well-behaved covariance structure, preventing rank degeneracy.

Research proves unique continuation for Einstein-vacuum equations on aAdS spacetimes.

problem Establishing rigorous mathematical statements for AdS/CFT correspondence.
method Novel Carleman estimates and unique continuation results for wave equations on aAdS spacetimes.
result Proved a unique continuation result for the Einstein-vacuum equations from aAdS conformal boundaries.

Study real logarithms of semi-simple matrices, focusing on differential structure.

problem Understanding the differential structure of real logarithms of semi-simple matrices.
method Examines the differential structure of real logarithms of semi-simple matrices under specific matrix types.
result Characterizes the differential structure of real logarithms of semi-simple matrices.