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.

169,051 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Nov 199319922001200920172026
48 results for operation procedures

AI system synthesizes chemical plant operation procedures for efficiency and stability.

problem Developing efficient and stable operation procedures for complex chemical plants.
method Integrates automated reasoning, deep reinforcement learning, and dynamic simulation with external knowledge.
result Synthesized procedure achieves faster recovery from malfunctions compared to standard PID control.

This is an expanded version of a series of two lectures given at the IMA summer program "Symmetries and Overdetermined Systems of Partial Differential Equations". The main part of the article describes the Riemannian version of the prolongation procedure for certain overdetermined system obtained recently in joint work…

2006-10-06abs ↗pdf ↗

AgraSSt assesses graph generators using Stein operators and kernel discrepancies.

problem Assessing the quality of graph generators that are implicit or not in explicit form.
method AgraSSt uses Stein operators and kernel discrepancies to assess graph generators, providing interpretable criticisms.
result Theoretical guarantees and empirical validation for various graph models.

BGG-operators form sequences of invariant differential operators and the first of these is overdetermined. Interesting equations in conformal geometry described by these operators are those for Einstein scales, conformal Killing forms and conformal Killing tensors. We present a deformation procedure of the tractor conn…

2008-11-25abs ↗pdf ↗

Paper introduces \ell-DER for regression tasks using morphological operators and convex-concave procedure.

problem Developing a universal approximator for regression tasks.
method Introduces \ell-DER model, trains it using a convex-concave procedure (CCP) to minimize least-squares.
result Outperforms other hybrid morphological models and state-of-the-art approaches.

This manuscript attempts to present a way in which the classical construction of the Dirac operator can be carried over to the setting of diffeology. A more specific aim is to describe a procedure for gluing together two usual Dirac operators and to explain in what sense the result is again a Dirac operator. Since vers…

2017-01-24abs ↗pdf ↗

In this paper we consider the dynamical system involved by the Ricci operator on the space of Kähler metrics. A. Nadel has defined an iteration scheme given by the Ricci operator for Fano manifold and asked whether it has some nontrivial periodic points. First, we prove that no such periodic points can exist. We define…

2007-09-10abs ↗pdf ↗

A new method prunes neural network channels based on operation characteristics.

problem Compressing deep neural networks efficiently and maintaining accuracy.
method Differentiable masks for channel pruning considering BN and ReLU.
result Outstanding performance in accuracy with less resources compared to state-of-the-art methods.

We construct the spectral curve and the Baker--Akhiezer function for the Dirac operator which corresponds to the Clifford torus via the Weierstrass representation. By constructing this Baker--Akhiezer function we demonstrate a general procedure for constructing Dirac operators and their Baker--Akhiezer functions corres…

2003-12-23abs ↗pdf ↗

In this work, we investigate a novel training procedure to learn a generative model as the transition operator of a Markov chain, such that, when applied repeatedly on an unstructured random noise sample, it will denoise it into a sample that matches the target distribution from the training set. The novel training pro…

2017-03-20abs ↗pdf ↗

Feature selection aims to select the smallest subset of features for a specified level of performance. The optimal achievable classification performance on a feature subset is summarized by its Receiver Operating Curve (ROC). When infinite data is available, the Neyman- Pearson (NP) design procedure provides the most e…

2013-01-16abs ↗pdf ↗

Researchers create a method to join hyperboloidal data sets without violating the shear-free condition.

problem Creating consistent initial data sets for simulations of spacetime.
method Developed a new gluing procedure that maintains the shear-free condition using special Hölder spaces and elliptic operators.
result Successfully constructed hyperboloidal initial data sets that preserve the shear-free condition.

This paper provides a description of an algebraic setting for the Lagrangian formalism over graded algebras and is intended as the necessary first step towards the noncommutative C-spectral sequence (variational bicomplex). A noncommutative version of integration procedure, the notion of adjoint operator, Green's formu…

1994-07-06abs ↗pdf ↗

FedSplit improves federated learning by ensuring correct convergence to optimal solutions.

problem Federated learning's fixed points do not always correspond to optimal solutions in simple convex settings.
method FedSplit uses operator splitting procedures to solve distributed convex minimization problems with additive structure.
result FedSplit ensures that the fixed points correspond to optima of the original optimization problem.

The paper studies geometric properties of group equivariant operators and their Riemannian structure.

problem Understanding the geometric structure of group equivariant operators.
method Endowing the space of group equivariant non-expansive operators with a Riemannian manifold structure and using gradient descent methods.
result Gradient descent methods can be applied to minimize cost functions on the space of group equivariant non-expansive operators.

According to the Loss Distribution Approach, the operational risk of a bank is determined as 99.9% quantile of the respective loss distribution, covering unexpected severe events. The 99.9% quantile can be considered a tail event. As supported by the Pickands-Balkema-de Haan Theorem, tail events exceeding some high thr…

2010-12-01abs ↗pdf ↗

Iterative procedures for parameter estimation based on stochastic gradient descent allow the estimation to scale to massive data sets. However, in both theory and practice, they suffer from numerical instability. Moreover, they are statistically inefficient as estimators of the true parameter value. To address these tw…

2015-05-10abs ↗pdf ↗

Positive definite operator-valued kernels generalize the well-known notion of reproducing kernels, and are naturally adapted to multi-output learning situations. This paper addresses the problem of learning a finite linear combination of infinite-dimensional operator-valued kernels which are suitable for extending func…

2012-03-07abs ↗pdf ↗

We prove some Fredholm conditions for many algebras of differential operators on particular classes of open manifolds, which include asymptotically Euclidean or asymptotically hyperbolic manifolds. Our typical result is that an operator PP is Fredholm if, and only if, it is elliptic and some limit operators $(P_α)_{α\…

2018-08-04abs ↗pdf ↗

We consider the problem of locating a point-source heart arrhythmia using data from a standard diagnostic procedure, where a reference catheter is placed in the heart, and arrival times from a second diagnostic catheter are recorded as the diagnostic catheter moves around within the heart. We model this situation as a …

2018-07-09abs ↗pdf ↗

NDP improves GNN efficiency by coarsening graphs without losing structure.

problem Efficiently summarize graph data for deep learning models.
method Node Decimation Pooling (NDP) reduces graph density while preserving topology.
result NDP achieves comparable performance to state-of-the-art pooling methods but with improved efficiency.

Echo state networks with random weights can approximate any continuous system.

problem Approximating continuous dynamical systems using echo state networks.
method Randomly generated internal weights and a sampling procedure for activation functions.
result Echo state networks with random weights can approximate any continuous casual time-invariant operators with high probability.

It is established that the existence of non-isotropic vector field which Jacobi operator of maximal rank is an obstacle for the existence of non-trivial second-order symmetric parallel tensor field. In turns out that presence of such obstacle follows that manifold as pseudo-Riemannian manifold is locally non-reducible.…

2018-06-14abs ↗pdf ↗

We propose a dynamical model for the estimation of Operational Risk in banking institutions. Operational Risk is the risk that a financial loss occurs as the result of failed processes. Examples of operational losses are the ones generated by internal frauds, human errors or failed transactions. In order to encompass t…

2012-02-12abs ↗pdf ↗

Detects anomalies and locates their causes in large, high-dimensional data.

problem Locating hidden issues in complex systems with high-dimensional data.
method Copula-based model for multivariate probability distributions.
result Can identify and localize anomalies in large, high-dimensional data.

Extends Rothschild-Stein lifting method to non-nilpotent Lie algebras.

problem Lifting differential operators over non-nilpotent Lie algebras introduces tilting.
method Global construction of Lie group GG associated to g\mathfrak g.
result Fundamental solutions can be obtained for differential operators over non-simply connected manifolds.

The purpose of this paper is to present the construction of a canonical determinant functional on elliptic pseudodifferential operators associated to the Guillemin-Wodzicki residue trace. The resulting functional is multiplicative, a local invariant, and not defined by a regularization procedure. The residue determinan…

2004-06-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.

This study improves estimation of the first principal component in multivariate functional data.

problem Estimating the first principal component of multivariate random processes.
method Defined covariance functions and operators, introduced LASSO optimization, and established minimax lower bounds.
result The method provides an optimal variance in the minimax sense for estimating eigenelements.

Efficient neural architecture search by sampling structure and operations.

problem Efficiently searching for optimal neural architectures.
method Decouples structure and operation search, using reinforcement learning with policy vectors.
result Significantly improved efficiency compared to traditional methods.

A simple continuous relaxation for argsort improves performance and is easy to implement.

problem Discrete nature of argsort operator makes it unsuitable for gradient-based learning.
method Proposed a continuous relaxation for argsort operator that is simple, fast, and achieves state-of-the-art performance.
result The proposed relaxation achieves state-of-the-art performance and is faster than competing approaches.

Framework optimizes expensive manufacturing processes efficiently.

problem Optimizing input parameters for advanced manufacturing methods.
method Bayesian optimization with tailored acquisition function and parallel acquisition.
result Framework efficiently finds optimal parameters with minimal process cost.

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.

New method bounds high-dimensional regression without estimating design covariance.

problem High-dimensional linear regression with random design.
method Error-in-operator approach that incorporates design covariance into empirical risk minimization.
result Dimension-free bounds on excess prediction risk derived.

The paper constructs new algebraic structures from Lie algebras and ternary Nambu-Lie algebras, leading to Yang-Baxter operators.

problem Constructing new algebraic structures from Lie algebras and ternary Nambu-Lie algebras.
method Using compositions of binary Lie algebras, 3-Lie algebras, and ternary Nambu-Lie algebras, the paper constructs ternary self-distributive objects and Yang-Baxter operators.
result The constructed Yang-Baxter operators are not gauge equivalent to the transposition operator and can be deformed to new solutions.