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

Trend · papers per month

131262392523 · Jun 202019922001200920172026
48 results for Operational Parameters

A new method for learning function parameters in operators using data-adaptive RKHS.

problem Learning function parameters in operators with robustness to noise and numerical error.
method Data Adaptive RKHS Tikhonov Regularization (DARTR) method.
result DARTR leads to an accurate estimator robust to noise and numerical error, converging at a consistent rate as data refines.

KOMET identifies Koopman operators from model parameter trajectories to adapt to evolving data distributions.

problem Adaptation of parametric models to non-stationary environments.
method Data-driven framework using Koopman operator identification and Extended Dynamic Mode Decomposition (EDMD).
result KOMET achieves high autonomous-rollout accuracies of 0.981 to 1.000 over 100 time steps on various drifting datasets.

Physics-informed neural networks and neural operators speed up solving parametric PDEs by orders of magnitude.

problem Solving PDEs for varying parameters is computationally expensive.
method Physics-informed neural networks and neural operators learn solution mappings across parameter spaces.
result Neural operators achieve computational speedups of 10^3 to 10^5 times faster than traditional methods.

The paper explores how polynomial roots and operator eigenvalues change with parameters.

problem How do roots of polynomials and eigenvalues of operators vary with parameter changes?
method Analyzes parameter dependence of polynomials and linear operators, covering real analytic to differentiable of finite order.
result Definitive optimal results for perturbation theory of polynomials and linear operators, including hyperbolic polynomials.

We analyze operational risk in terms of a spin glass model. Several regimes are investigated, as a functions of the parameters that characterize the dynamics. The system is found to be robust against variations of these parameters. We unveil the presence of limit cycles and scrutinize the features of the asymptotic sta…

2010-02-18abs ↗pdf ↗

We study the existence of natural and projectively equivariant quantizations for differential operators acting between order 1 vector bundles over a smooth manifold M. To that aim, we make use of the Thomas-Whitehead approach of projective structures and construct a Casimir operator depending on a projective Cartan con…

2006-01-21abs ↗pdf ↗

Paper proposes adaptive parameter selection for KGD algorithms.

problem Improving parameter selection for kernel-based gradient descent.
method Integrates bias-variance analysis with splitting method, introduces empirical effective dimension.
result Adaptive parameter selection strategy achieves optimal generalization error bound.

Graph Laplacians computed from weighted adjacency matrices are widely used to identify geometric structure in data, and clusters in particular; their spectral properties play a central role in a number of unsupervised and semi-supervised learning algorithms. When suitably scaled, graph Laplacians approach limiting cont…

2019-09-13abs ↗pdf ↗

We consider the problem of online learning of optimal control for repeatedly operated systems in the presence of parametric uncertainty. During each round of operation, environment selects system parameters according to a fixed but unknown probability distribution. These parameters govern the dynamics of a plant. An ag…

2016-09-18abs ↗pdf ↗

Novel parametrized graph shift operators improve graph neural network performance.

problem Improving graph neural network performance on various datasets.
method Proposed a novel parametrized graph shift operator (PGSO) that optimizes parameters during training.
result PGSO improves accuracy in node and graph classification tasks on real-world datasets.

Generative operators solve many convex problems with minimal parameters.

problem Worst-case parameter bounds limit the practical use of neural operators.
method Developed generative equilibrium operators (GEOs) using realizable finite-dimensional layers.
result GEOs can uniformly approximate solutions to convex optimization problems with logarithmic growth in parameters.

Physics-informed neural networks improve by measuring effective dimensionality of constraints.

problem Task interference in physics-informed neural networks due to shared parameter space.
method Introduce effective dimensionality (deffd_{eff}) as an operator invariant to quantify constraints.
result Effective dimensionality measures unconstrained parameter directions, independent of network architecture.

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.

DeepONet learns operators for PDEs with varying parameters and initial conditions.

problem Learning operators for partial differential equations with different parameters or initial conditions.
method DeepONet uses a Branch net and Trunk net to minimize error between evaluated and expected outputs, incorporating a scalar auxiliary variable approach for energy dissipation.
result DeepONet can accurately approximate operators for PDEs with varying parameters or initial conditions.

Framework improves data-driven ROMs for complex systems using Bayesian operator inference.

problem Improving the quality of data-driven reduced-order models for complex dynamical systems.
method Develops an active learning framework using Bayesian operator inference to identify and select training parameters.
result The proposed adaptive sampling strategy consistently yields more stable and accurate ROMs than random sampling.

This paper encloses a complete and explicit description of the derivations of the Lie algebra D(M) of all linear differential operators of a smooth manifold M, of its Lie subalgebra D^1(M) of all linear first-order differential operators of M, and of the Poisson algebra S(M)=Pol(T*M) of all polynomial functions on T*M,…

2003-12-08abs ↗pdf ↗

We provide some insights in the study of branching problems of reductive groups, and a method of investigations into symmetry breaking operators. First, we give geometric criteria for finiteness property of linearly independent continuous (respectively, differential) operators that intertwine two induced representation…

2013-03-14abs ↗pdf ↗

New method solves blind inverse problems by optimizing both operator and image parameters.

problem Solving blind inverse problems with known forward operator.
method Parallel reverse diffusion guided by gradients from intermediate stages.
result State-of-the-art performance on blind deblurring and imaging through turbulence.

In this article we consider means of positive operators on a Hilbert space. We extend the theory of matrix power means to arbitrary operator means in the sense of Kubo-Ando. The basis of the extension is relying on ideas coming from differential geometry. We consider generalized Karcher equations for positive operators…

2012-08-28abs ↗pdf ↗

Hybrid approach combines VI and HMC for efficient Bayesian inference in neural networks.

problem Computational demands and inaccuracies in Bayesian inference for neural networks.
method Combines VI and HMC, reducing parameter space and accelerating inference.
result Significantly reduces inference time for large neural networks, improving uncertainty quantification.

DISCO predicts system states from short trajectories using an evolved operator.

problem Predicting next states of dynamical systems governed by unknown PDEs.
method DISCO uses a hypernetwork to generate parameters of a smaller operator network for state prediction.
result DISCO achieves state-of-the-art performance with fewer training epochs and generalizes well.

The statistical mechanics approach to wealth distribution is based on the conservative kinetic multi-agent model for money exchange, where the local interaction rule between the agents is analogous to the elastic particle scattering process. Here, we discuss the role of a class of conservative local operators, and we s…

2016-05-30abs ↗pdf ↗

Convolutional Neural Networks (CNNs) filter the input data using spatial convolution operators with compact stencils. Commonly, the convolution operators couple features from all channels, which leads to immense computational cost in the training of and prediction with CNNs. To improve the efficiency of CNNs, we introd…

2019-04-15abs ↗pdf ↗

A method is developed to estimate the parameters of a Levy copula of a discretely observed bivariate compound Poisson process without knowledge of common shocks. The method is tested in a small sample simulation study. Also, the method is applied to a real data set and a goodness of fit test is developed. With the meth…

2012-12-01abs ↗pdf ↗

We considered an extension of the standard functional for the Einstein-Dirac equation where the Dirac operator is replaced by the square of the Dirac operator and a real parameter controlling the length of spinors is introduced. For one distinguished value of the parameter, the resulting Euler-Lagrange equations provid…

2006-03-29abs ↗pdf ↗

We give a complete classification of intertwining operators (symmetry breaking operators) between spherical principal series representations of G=O(n+1,1) and G'=O(n,1). We construct three meromorphic families of the symmetry breaking operators, and find their distribution kernels and their residues at all poles explic…

2013-10-11abs ↗pdf ↗

We give a new definition of a Laplace operator for Finsler metric as an average with regard to an angle measure of the second directional derivatives. This definition uses a dynamical approach due to Foulon that does not require the use of connections nor local coordinates. We show using 1-parameter families of Katok--…

2011-04-21abs ↗pdf ↗

A novel dynamical model for the study of operational risk in banks and suitable for the calculation of the Value at Risk (VaR) is proposed. The equation of motion takes into account the interactions among different bank's processes, the spontaneous generation of losses via a noise term and the efforts made by the bank …

2010-06-30abs ↗pdf ↗

Paper introduces FNM framework for learning finite-dimensional parametrized models.

problem Efficiently learning finite-dimensional parametrized models from limited data.
method Fourier Neural Mappings (FNMs) framework for operator learning.
result End-to-end learning of PtO maps can be less data-efficient than learning the solution operator first.

DeepONets combine neural networks with physics constraints for PDEs and parameter estimation.

problem Estimating parameters in PDEs with uncertainty quantification.
method Physics-informed neural networks (PINNs) integrated with Deep Operator Networks (DeepONets) for Bayesian inference.
result Robust and accurate solutions with comprehensive uncertainty quantification.