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

183365548730 · Jun 202019922001200920172026
48 results for efficient determinant calculation

Woodbury transformations improve deep generative models with efficient invertibility and determinant calculation.

problem Efficiently invertible and determinant-calculable functions for deep generative models.
method Introducing Woodbury transformations that leverage matrix identities for efficient invertibility and determinant calculation.
result Woodbury transformations enable high-dimensional interactions, efficient sampling, and likelihood evaluation, outperforming other flow architectures.

Q-SHAP efficiently calculates feature contributions in boosting trees.

problem Global evaluation of feature contributions in tree models.
method Q-SHAP, an efficient algorithm that reduces Shapley values calculation to polynomial time.
result Q-SHAP improves computational efficiency and enhances accuracy of feature-specific R2R^2 estimates.

Efficiently predicts long-time dynamics of quantum spin models using MLP regression.

problem Challenges in calculating long-time expectation values for quantum spin models.
method Utilized a multi-layer perceptron (MLP) model for regression on matrix product states (MPS) expectation values.
result Significantly reduced computational cost for generating long-time dynamics while maintaining high accuracy.

New method uses PINNs to efficiently compute Gerber-Shiu functions.

problem Calculating the Gerber-Shiu function efficiently.
method Physics-informed neural networks (PINNs) embedded with differential equations.
result Demonstrates good performance in approximating Gerber-Shiu functions.

In this paper Portfolio Optimization techniques were used to determine the most favorable investment portfolio. In particular, stock indices of three companies, namely Microsoft Corporation, Christian Dior Fashion House and Shevron Corporation were evaluated. Using this data the amounts invested in each asset when a po…

2015-05-19abs ↗pdf ↗

We address the problem of computing a single linkage dendrogram. A possible approach is to: (i) Form an edge weighted graph GG over the data, with edge weights reflecting dissimilarities. (ii) Calculate the MST TT of GG. (iii) Break the longest edge of TT thereby splitting it into subtrees TLT_L, TRT_R. (iv) Apply …

2019-11-01abs ↗pdf ↗

A new machine learning method calculates failure probability efficiently and accurately.

problem Computing the probability of failure for complex systems.
method Penalized Profile Support Vector Machine with adaptive sampling and clustering.
result The method minimizes model evaluations while preserving decision boundary geometry.

For 4L4 \nmid L and gg large, we calculate the integral Picard groups of the moduli spaces of curves and principally polarized abelian varieties with level LL structures. In particular, we determine the divisibility properties of the standard line bundles over these moduli spaces and we calculate the second integral …

2009-08-04abs ↗pdf ↗

Motivated by AdS/CFT, the extension is made to spin-half of a scalar calculation of the conformal anomalies and functional determinants of GJMS operators. The formal aspects are heuristic but sufficient. A Barnes zeta function representation again proves effective. The determinants are calculated for the two factorisat…

2013-10-21abs ↗pdf ↗

In risk management, tail risks are of crucial importance. The assessment of risks should be carried out in accordance with the regulatory authority's requirement at high quantiles. In general, the underlying distribution function is unknown, the database is sparse, and therefore special tail models are used. Very often…

2019-04-27abs ↗pdf ↗

NARD extends ARD for linear models, promoting sparsity and correlation structure.

problem Sparse relationships between inputs and outputs, capturing correlation structure.
method Matrix normal prior with sparsity-inducing parameter, iterative updates, sequential evaluation, and surrogate function approximation.
result Significant computational efficiency improvements with comparable performance.

Paper derives closed-form solutions for CEV model using semiclassical approximation.

problem Analyzing the constant elasticity variance (CEV) option pricing model.
method Utilizes semiclassical (WKB) approximation and Van Vleck-Morette determinant.
result Derives an exponential factor not previously considered in the kernel.

We present a combinatorial method for a calculation of knot Floer homology with Z-coefficient of (1,1)-knots, and then demonstrate it for non-alternating (1,1)-knots with ten crossings and the pretzel knots of type (-2,m,n). Our calculations determine the unknotting numbers and 4-genera of the pretzel knots of this typ…

2003-11-06abs ↗pdf ↗

We investigate the Gram determinant of the bilinear form based on curves in a planar surface, with a focus on the disk with two holes. We prove that the determinant based on n1n-1 curves divides the determinant based on nn curves. Motivated by the work on Gram determinants based on curves in a disk and curves in an an…

2008-10-25abs ↗pdf ↗

Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[S_r] of a symmetric group S_r. If for a class of tensors T such a W is known, the elements of the orthogonal subspace W^{\bot} of W within the dual space of K[S_r] yield linear identities needed for a t…

2002-11-09abs ↗pdf ↗

The importance of counterparty credit risk to the derivative contracts was demonstrated consistently throughout the financial crisis of 2008. Accurate valuation of Credit value adjustment (CVA) is essential to reflect the economic values of these risks. In the present article, we reviewed several different approaches f…

2010-10-08abs ↗pdf ↗

Novel algorithm speeds up log-determinant estimation for large matrices.

problem Efficiently estimating log-determinants of large positive definite matrices under memory constraints.
method Hierarchical algorithm based on block-wise computation of LDL decomposition.
result Accurate estimation of NTK log-determinants from a tiny fraction of the full dataset.

The ability of many powerful machine learning algorithms to deal with large data sets without compromise is often hampered by computationally expensive linear algebra tasks, of which calculating the log determinant is a canonical example. In this paper we demonstrate the optimality of Maximum Entropy methods in approxi…

2017-09-08abs ↗pdf ↗

Researchers derive asymptotic expansions for thermoelastic operators on manifolds.

problem Determining precise geometric information from thermoelastic spectra.
method Asymptotic expansions with Dirichlet and Neumann boundary conditions.
result Explicit calculation of first two coefficients for volumes.

Analyzes a finite set of metrics and functions to determine manifold torsion.

problem Determining the torsion of a manifold from a finite set of metrics and functions.
method Introduces a finite set of analytic quantities derived from a Riemannian metric and Morse function, which determine the torsion of the manifold.
result The virtually small spectral package determines the torsion of the manifold, analogous to calculating the Euler-Poincaré characteristic.

Paper proposes efficient method to calculate Fisher-Bingham distribution normalizing constant.

problem Efficiently calculating the normalizing constant of Fisher-Bingham distributions.
method Numerical integration with continuous Euler transform to Fourier-type integral representation.
result The method is fast and accurate, applicable to high-dimensional distributions.

Study on pseudo-Einstein 3-manifolds, calculating determinant changes under conformal transformations.

problem Prescribing the Q'-curvature on pseudo-Einstein 3-manifolds.
method Established an expression for the difference of determinants of Paneitz type operators under conformal changes.
result Generalized the expression of functional determinant from four to three dimensions.

This thesis builds a real-time VaR calculation workflow for crypto derivatives.

problem Managing risk in volatile cryptocurrency markets.
method Applied EMWA, GARCH, and HAR models to forecast volatility; used delta-gamma-theta approach and Cornish-Fisher expansion.
result Real-time VaR estimates with millisecond calculation latencies.

The paper generalizes the second Pappus-Guldin theorem for calculating volumes of bodies.

problem Calculating the volume of a body cut into perpendicular slices.
method Using a generalized formula and properties of centroids and floating bodies.
result A curve with centroid property exists for convex bodies, leading to simpler volume calculations.

The paper calculates bounds on the local Lipschitz constants of neural network layers.

problem Understanding the Lipschitz constants of neural network layers for robustness analysis.
method Analytical approach to determine upper bounds on local Lipschitz constants of affine-ReLU functions.
result The method produces tighter bounds than the standard conservative bound, especially for small perturbations.

UAMM uses external market prices to improve AMM efficiency and reduce liquidity provider risk.

problem Traditional AMMs lack consideration of external markets and risk management.
method UAMM calculates prices by incorporating external market prices and impermanent loss, maintaining constant product curve properties.
result UAMM eliminates arbitrage opportunities when external market prices are efficient, reducing liquidity provider risk.

Credit Suisse First Boston (CSFB) launched in 1997 the model CreditRisk+ which aims at calculating the loss distribution of a credit portfolio on the basis of a methodology from actuarial mathematics. Knowing the loss distribution, it is possible to determine quantile-based values-at-risk (VaRs) for the portfolio. An o…

2001-12-04abs ↗pdf ↗

We consider the oscillator group equipped with a bi-invariant Lorentzian metric, and then some geometrical properties of this group i.e. homogeneous Ricci solitons and harmonicity properties of invariant vector fields are obtained. We also determine all vector fields which are critical points for the energy functional …

2016-04-15abs ↗pdf ↗

New ODE solvers improve training efficiency and accuracy.

problem Training Neural ODEs requires efficient and accurate gradient calculation.
method Presented algebraically reversible ODE solvers that are time and memory efficient, calculate exact gradients, and are numerically stable.
result Reversible solvers strictly improve upon previous architectures in efficiency and accuracy.

In this paper we consider some families of links, including (-2,2m+1,2n)-pretzel links and twisted Whitehead links. We calculate the character varieties of these families, and determine the number of irreducible components of these character varieties.

2014-03-26abs ↗pdf ↗

We calculate relations on characteristic classes which are obstructions preventing closed Kähler manifolds from carrying holomorphic Cartan geometries. We apply these relations to give global constraints on the phase spaces of complex analytic determined and underdetermined systems of differential equations.

2007-04-19abs ↗pdf ↗

The calculation of minimum energy paths for transitions such as atomic and/or spin re-arrangements is an important task in many contexts and can often be used to determine the mechanism and rate of transitions. An important challenge is to reduce the computational effort in such calculations, especially when ab initio …

2017-03-30abs ↗pdf ↗