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

82163245326 · Jun 202019922001200920172026
48 results for ERP systems

Generative AI agents improve ERP systems by automating complex financial tasks.

problem Static, rule-based workflows limit adaptability and intelligence in ERP systems.
method Introducing Generative Business Process AI Agents (GBPAs) that integrate generative AI with business process modeling and multi-agent orchestration.
result GBPAs achieve up to 40% reduction in processing time and 94% drop in error rate.

Article explores G2-structures with quadratic conditions, finding new ERP and complete solitons.

problem Investigating closed G2-structures satisfying quadratic conditions.
method Analyzing a second-order PDE system involving parameter λ, producing new examples of ERP and complete solitons.
result First examples of ERP G2-structures, including complete inhomogeneous ERP G2-structure.

Novel Bayesian model improves EEG-based BCI character selection.

problem Accurately identifying target-related responses in EEG-based BCIs.
method Probit-link Split-and-merge Gaussian Process (P-SMGP) prior for feature selection.
result Reduces computational complexity and provides interpretable statistical interpretations.

ERP improves drug discovery by balancing molecule generation quality and efficiency.

problem Generating valid and optimal molecules from large language models.
method Entropy-Reinforced Planning (ERP) for Transformer Decoding.
result ERP outperforms current state-of-the-art algorithms by 1-5 percent on SARS-CoV-2 and human cancer cell targets.

This paper improves financial derivative pricing by incorporating multiple hedging instruments.

problem Valuation of financial derivatives with multiple hedging instruments.
method Deep hedging algorithm and reinforcement learning to solve global hedging problems.
result Including options as hedging instruments can significantly decrease equal risk prices and market incompleteness.

New method uses non-translation invariant risk measures for fair financial derivative pricing.

problem Inequalities in financial derivative pricing under traditional risk measures.
method Deep reinforcement learning with modified deep hedging algorithm.
result Effective pricing of financial derivatives without price inflation.

Researchers extend a groupoid approach to calculate Wodzicki residue and Kontsevich-Vishik trace.

problem Calculating Wodzicki residue and Kontsevich-Vishik trace for pseudo-differential operators of any order.
method Groupoid approach to pseudo-differential operators.
result Extension of van Erp and Yuncken's work to operators of any order.

This paper presents a new classification methods for Event Related Potentials (ERP) based on an Information geometry framework. Through a new estimation of covariance matrices, this work extend the use of Riemannian geometry, which was previously limited to SMR-based BCI, to the problem of classification of ERPs. As co…

2014-08-30abs ↗pdf ↗

Scoping review finds EEG key in MCI research, identifying ERP/EEG, QEEG, and machine learning.

problem Identifying MCI early and accurately.
method Scoping review with co-occurrence analysis and PAGER framework.
result Main research themes identified: ERP/EEG, QEEG, and EEG-based machine learning.

Study geometric characterization of asymptotic pseudodifferential calculus on spinor bundles.

problem Geometric characterization of asymptotic pseudodifferential calculus on spinor bundles.
method Groupoid approach to pseudodifferential calculus, rescaled bundle.
result Rescaled bundle provides geometric characterization to asymptotic pseudodifferential calculus on spinor bundles.

Let X be a closed connected contact manifold. On X there is a naturally arising class of hypoelliptic (but not elliptic) operators which are Fredholm. In this paper we solve the index problem for this class of operators. The solution is achieved by combining Van Erp's earlier partial result with the Baum-Douglas isomor…

2011-07-08abs ↗pdf ↗

A complete classification of left-invariant closed G2-structures on Lie groups which are extremally Ricci pinched, up to equivalence and scaling, is obtained. There are five of them, they are defined on five different completely solvable Lie groups and the G2-structure is exact in all cases except one, given by the onl…

2019-09-23abs ↗pdf ↗

The paper introduces isotropy as a regularizer to enhance portfolio stability.

problem Model uncertainty and estimation errors in diversification strategies.
method Integrates isotropy as a geometric regularizer into mean-variance optimization.
result Isotropy constraint systematically induces negative average-signal exposure, providing a robust crash hedge.

BCI system improves word selection efficiency using sequential best-arm identification.

problem Conventional non-adaptive BCI paradigms lead to a lengthy learning process.
method Casted as sequence of best-arm identification tasks in multi-armed bandits, using pre-trained LLMs and STTS algorithm.
result Substantial empirical improvement in word selection efficiency demonstrated.

Researchers construct an index map for contact manifolds using K-theory.

problem Constructing an index for maximally hypoelliptic operators on contact manifolds.
method Using Higson's construction for symbol class in K-theory, they derive a series of maps whose induced map in K-theory is the Heisenberg Atiyah-Singer index map.
result Explicit construction of a series of maps leading to the Heisenberg Atiyah-Singer index map.

The paper explores the index theory of sub-Laplacians on higher nilpotent Carnot manifolds.

problem Characterizing the index theory of sub-Laplacians on higher nilpotent Carnot manifolds.
method Analyzes the structure of hypoelliptic sub-Laplacian type operators and provides examples where the index theory is trivial.
result Provides examples where the index theory of sub-Laplacians is trivial in higher degrees of nilpotency.

Study recovers C*-algebra from fields of Toeplitz algebras on specific groups.

problem Recovering C*-algebra from fields of Toeplitz algebras on specific groups.
method Using continuous fields of Toeplitz algebras and a crossed product.
result Algebra of principal symbols can be recovered from fields of Toeplitz algebras.

Nowadays, organizations collect vast quantities of accounting relevant transactions, referred to as 'journal entries', in 'Enterprise Resource Planning' (ERP) systems. The aggregation of those entries ultimately defines an organization's financial statement. To detect potential misstatements and fraud, international au…

2019-10-09abs ↗pdf ↗

We consider topological T-duality of torus bundles equipped with S^{1}-gerbes. We show how a geometry on the gerbe determines a reduction of its band to the subsheaf of S^{1}-valued functions which are constant along the torus fibres. We observe that such a reduction is exactly the additional datum needed for the const…

2013-05-26abs ↗pdf ↗

New extensions for homogeneous distributions on deformations to the normal cone.

problem Extending homogeneous distributions on a specific geometric structure.
method Using the zoom action and Meyer's results on weakly homogeneous distributions.
result All homogeneous extensions of distributions on the DNC are described.

Multidimensional time series are sequences of real valued vectors. They occur in different areas, for example handwritten characters, GPS tracking, and gestures of modern virtual reality motion controllers. Within these areas, a common task is to search for similar time series. Dynamic Time Warping (DTW) is a common di…

2018-04-17abs ↗pdf ↗

Paper tackles P vs NP problem in portfolio optimization with cardinality constraints and Black-Scholes derivatives.

problem Operationalizing the P vs NP problem in cardinality-constrained portfolio selection.
method Mixed-integer quadratic program with genetic algorithms, Monte Carlo sampling, and greedy screening.
result Cardinality constraint reshapes efficient frontier, highlighting trade-offs between stability and computational cost.

A criterion for training-free time-lagged spectral embeddings of multivariate time series

problem Applicability of fixed-length descriptors for multivariate time series
method Using a stationary Gaussian VAR(1) model and cosine similarity to classify descriptors
result D(τ) separates two classes when signals are approximately stationary and cross-channel temporal coupling is present

Overview of integrable systems with symmetries, focusing on toric and semitoric systems.

problem Classifying and understanding integrable systems with symmetries.
method Using decorated polygons and controlled bifurcations in one-parameter families of systems.
result Construction of explicit semitoric systems with prescribed invariants.

Learning to control linear systems is statistically hard, especially for underactuated systems.

problem Statistical difficulty of learning to control linear systems, especially underactuated ones.
method Utilized minimax lower bounds and structural assumptions to prove learning complexity can be exponential.
result Learning complexity can be at most exponential with the controllability index of the system.

Discrete-time systems can be characterized by simple flat coordinates and their shifts.

problem Characterizing flatness of discrete-time systems.
method Developed a map from flat coordinates and their shifts to system state and input, fulfilling system equations identically.
result Derived necessary conditions for a system to be flat, without requiring differential geometry methods.

The paper explores when linear system identification is hard or easy, especially for under-actuated systems.

problem Statistical hardness of learning linear systems, especially under-actuated or under-excited systems.
method Using tools from minimax theory and recent statistical tools for finite sample analysis of system identification.
result The controllability index of linear systems affects the sample complexity of identification, making some systems hard to learn.

This paper improves system identification by reducing sample complexity for high-dimensional linear dynamical systems.

problem High sample complexity for learning partially observed linear dynamical systems in high dimensions.
method Introduces an 1\ell_1-regularized estimation method that reduces sample complexity from linear to logarithmic with system dimension.
result Markov parameters can be learned with logarithmic number of samples relative to system dimension, improving sample complexity.

In integrable hydrodynamic systems, coordinates exist where generators and symmetries are simple.

problem Existence of Riemannian invariants for integrable systems of hydrodynamic type.
method Finding coordinates where the generator and all symmetries are diagonal.
result In integrable hydrodynamic systems, there exist coordinates where the generator and all symmetries are diagonal.

This paper studies nonholonomic constraints in Hamiltonian systems, deriving equations and theorems.

problem Analyzing nonholonomic constraints in Hamiltonian systems.
method Deriving distributional RCH systems, geometric constraint conditions, and Hamilton-Jacobi theorems.
result Derives precise geometric constraint conditions and Hamilton-Jacobi theorems for nonholonomic systems.