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,742 papers · 148 categories

Trend · papers per month

114227341454 · Jun 202019922001200920172026
48 results for stochastic operators

SON learns SPDE solutions and uncertainty from noisy data.

problem Uncertainty quantification in SPDEs with unknown model uncertainties.
method Combining DeepONet and SNNs, SON models stochasticity and predicts uncertainty.
result SON accurately captures solution structure and quantifies predictive uncertainty.

The paper introduces Causal Neural Operators to approximate operators in stochastic analysis.

problem Leveraging temporal structure in non-linear operators for deep learning models.
method Designing a deep learning model framework for infinite-dimensional linear metric spaces.
result Causal Neural Operators can uniformly approximate Hölder or smooth trace class operators.

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 …

2008-10-13abs ↗pdf ↗

Study variance-reduced method for estimating fixed points in Banach spaces.

problem Estimating fixed points of contractive operators in Banach spaces with noisy evaluations.
method Variance-reduced stochastic approximation scheme in Banach spaces.
result Establish non-asymptotic bounds for operator defect and estimation error.

A new stochastic primal--dual algorithm for solving a composite optimization problem is proposed. It is assumed that all the functions/operators that enter the optimization problem are given as statistical expectations. These expectations are unknown but revealed across time through i.i.d. realizations. The proposed al…

2019-01-23abs ↗pdf ↗

This work analyzes nonexpansive stochastic approximations with Markovian noise, proving convergence in reinforcement learning.

problem Applying stochastic approximation to reinforcement learning settings with nonexpansive operators.
method Investigates nonexpansive stochastic approximations with Markovian noise, providing asymptotic and finite sample analysis.
result First-time proof of convergence for classical tabular average reward temporal difference learning.

Paper learns Koopman operator from sparse data, escaping function space constraints.

problem Learning Koopman operator from non-closed function spaces.
method Operator stochastic approximation algorithm using conditional mean embeddings (CME).
result Online sparse learning algorithm with trajectory-based sampling guarantees.

Neural operators improve solving Helmholtz equation for various wave speeds.

problem Neural operators struggle with out-of-distribution scenarios for high-frequency waves.
method Proposed a subfamily of neural operators with stochastic depth for enhanced approximation of the Helmholtz equation.
result Neural operators with stochastic depth outperform standard models in out-of-distribution scenarios.

Proposes a new method to learn operators for stochastic problems using DeepONet with autoencoder.

problem Efficiently solve forward and inverse stochastic problems with limited data.
method MultiAuto-DeepONet, a multi-resolution autoencoder DeepONet model.
result The model effectively handles high-dimensional stochastic inputs and reduces the number of trainable parameters.

Study stochastic processes on surfaces in contact sub-Riemannian manifolds using Riemannian approximations.

problem Analyzing stochastic processes on surfaces in contact sub-Riemannian manifolds.
method Employing Riemannian approximations, a second order partial differential operator is derived on the surface. The stochastic process moves along the characteristic foliation induced by the contact distribution.
result Elliptic characteristic points are inaccessible, while hyperbolic characteristic points are accessible from separatrices.

Novel approach to Nash equilibrium in mean-field stochastic games with operator resolvents.

problem Finding Nash equilibrium in mean-field stochastic games with mean-field interaction.
method Proposed a novel approach to derive Nash equilibrium semi-explicitly using operator resolvents and stochastic Fredholm equations.
result Equilibrium of the NN-player game converges to mean-field equilibrium, and ε\varepsilon-Nash equilibrium derived as a by-product.

This paper extends transfer operator theory to McKean-Vlasov equations.

problem Analyzing the behavior of complex dynamical systems using transfer operators.
method Extended dynamic mode decomposition and Galerkin projection.
result Finite-dimensional approximations of transfer operators computed.

Paper develops SINNOs for approximating stochastic processes.

problem Approximating stochastic processes with neural networks.
method Developed stochastic interpolation neural network operators (SINNOs) with random coefficients.
result Established boundedness, interpolation accuracy, and approximation capabilities of SINNOs.

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.

Develops a framework for learning nonlinear operators using Mercer kernels.

problem Learning nonlinear operators between infinite-dimensional spaces.
method Stochastic approximation framework with Mercer operator-valued kernels.
result Establishes dimension-free polynomial convergence rates for nonlinear operator learning.

New neural operators model turbulence with memory and randomness.

problem Modeling turbulence in complex fluid dynamics with memory and randomness.
method Symmetrized activation functions, fractional derivatives, and stochastic noise.
result Theoretical guarantees for approximation quality in turbulent phenomena.

Graph convolutional networks adapt the architecture of convolutional neural networks to learn rich representations of data supported on arbitrary graphs by replacing the convolution operations of convolutional neural networks with graph-dependent linear operations. However, these graph-dependent linear operations are d…

2017-11-03abs ↗pdf ↗

Unified analysis of stochastic iterative algorithms using Lyapunov functions.

problem Analyzing convergence of stochastic iterative algorithms for fixed-point equations.
method Lyapunov-based techniques for finite-time analysis of stochastic approximation algorithms.
result Unified mean-square convergence guarantees for various algorithms.

Paper proposes Sinkformers for Transformers with doubly stochastic attention.

problem Improving Transformer models' accuracy in vision and natural language processing.
method Using Sinkhorn's algorithm to make attention matrices doubly stochastic instead of SoftMax normalization.
result Sinkformers enhance model accuracy in vision and natural language processing tasks.

Unified framework for solving fixed-point equations in deterministic and stochastic settings.

problem Solving fixed-point equations for seminorm-contractive operators in both deterministic and stochastic contexts.
method Fixed-point theorem and stochastic approximation analysis.
result Unified finite-sample bounds for various reinforcement learning algorithms.

We model how Lipschitz continuity changes during neural network training.

problem Understanding how Lipschitz continuity evolves during training.
method We use a system of stochastic differential equations to capture the dynamics of Lipschitz continuity under SGD.
result We identify three factors driving the evolution of Lipschitz continuity: gradient flow projection, gradient noise, and Hessian projection.

NOVAS uses adaptive stochastic search for non-convex optimization in deep networks.

problem Non-convex optimization challenges in deep neural networks.
method Adaptive stochastic search for non-convex optimization.
result NOVAS outperforms existing alternatives in a structured prediction task.

Improved stochastic Halpern iteration for fixed-point approximation in normed spaces.

problem Approximating fixed-points of nonexpansive and contractive operators in normed finite-dimensional spaces.
method Stochastic Halpern iteration with minibatch, analyzing oracle complexity.
result Improved oracle complexity for nonexpansive operators, with a lower bound of Ω(ε3)Ω(\varepsilon^{-3}).

New algorithm learns Koopman operator online, with complexity control and convergence guarantees.

problem Online learning of Koopman operator for general nonlinear systems.
method Sparse online learning via stochastic approximation, RKHS action, CME operator.
result Provably convergent algorithm with finite-time guarantees in mis-specified setting.

In this paper, we introduce various mechanisms to obtain accelerated first-order stochastic optimization algorithms when the objective function is convex or strongly convex. Specifically, we extend the Catalyst approach originally designed for deterministic objectives to the stochastic setting. Given an optimization me…

2019-06-03abs ↗pdf ↗

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.

DeepSVM learns SVMs without PDE solving, achieving high pricing accuracy.

problem Computational bottleneck in real-time calibration of stochastic volatility models.
method Physics-informed Deep Operator Network (PI-DeepONet) that enforces terminal payoffs and no-arbitrage conditions.
result DeepSVM achieves high pricing accuracy across various market dynamics.

Sorting input objects is an important step in many machine learning pipelines. However, the sorting operator is non-differentiable with respect to its inputs, which prohibits end-to-end gradient-based optimization. In this work, we propose NeuralSort, a general-purpose continuous relaxation of the output of the sorting…

2019-03-21abs ↗pdf ↗

Active data collection improves convergence rates in operator learning.

problem Improving convergence rates in operator learning with linear target and stochastic input.
method Active data collection strategies with mean-zero stochastic process and continuous covariance kernels.
result Achieves arbitrarily fast error convergence rates with eigenvalue decay of covariance kernels.

Unified view of federated learning and distributed RL using local stochastic approximation.

problem Finding the root of an operator composed of local operators in a network of agents with dependent data.
method Local stochastic approximation over a network of agents with Markov process-dependent data.
result Convergence rates of local stochastic approximation for both constant and time-varying step sizes, within a logarithmic factor of independent data.

The paper develops a new probabilistic framework for denoising diffusion models using free entropy and stochastic analysis.

problem Developing a mathematical framework for denoising diffusion models in noncommutative settings.
method Formulating diffusion and reverse processes governed by operator-valued stochastic dynamics, using tools from free stochastic analysis.
result Establishing an information-geometric link between entropy production, transport, and deconvolution.

The paper tackles data-driven optimal control of unknown nonlinear systems using RKHS.

problem Unknown nonlinear dynamics and stage cost functions.
method Embed state densities into RKHS, learn Markov operators, solve Hamilton-Jacobi-Bellman recursions.
result Solves a wide range of nonlinear control problems, including depth regulation.

Paper introduces a Gaussian Process for operator learning in computational mechanics.

problem Efficient and accurate solutions for large datasets with reliable uncertainty quantification.
method Gaussian Process (GP) embedded in a neural operator framework with stochastic dual descent (SDD) algorithm.
result Improves GP resolution independence and scalability for high-dimensional and non-linear systems.

Approximates derivative pricing under fractional stochastic volatility.

problem Derivative pricing under fractional stochastic volatility model.
method Approximate expression derived from deterministic functions and fractional Ornstein-Uhlenbeck process.
result Numerical simulations show the feasibility and effect of long-range dependencies on derivative prices.

In this paper we propose and study a family of continuous wavelets on general domains, and a corresponding stochastic discretization that we call Monte Carlo wavelets. First, using tools from the theory of reproducing kernel Hilbert spaces and associated integral operators, we define a family of continuous wavelets by …

2019-03-15abs ↗pdf ↗

This research develops approximation theory for OOMs of infinite-dimensional processes.

problem Developing an approximation theory for OOMs of infinite-dimensional processes.
method Establishing an inner product structure and proving continuity of observable operators.
result A fundamental obstacle in making an infinite-dimensional space of future distributions into a Hilbert space is described.