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

139277416554 · Jun 202019922001200920172026
48 results for closed-form computation

New formulas for geodesics on Stiefel and flag manifolds using trust-region method.

problem Computing geodesics and logarithms on Stiefel and flag manifolds.
method Closed-form geodesic formulas, trust-region solver, Fréchet derivatives.
result Efficient computation of geodesic distance and logarithm map.

Regression problems that have closed-form solutions are well understood and can be easily implemented when the dataset is small enough to be all loaded into the RAM. Challenges arise when data is too big to be stored in RAM to compute the closed form solutions. Many techniques were proposed to overcome or alleviate the…

2019-03-03abs ↗pdf ↗

We derive a closed-form formula for computing bond prices between coupon payments. Our results cover both the `Treasury' and the `Street' pricing methods used by sovereign and corporate issuers. We apply our formulas to two UK gilts, the 8% Treasury Gilt 2015, and the 0.5% Treasury Gilt 2022, and show that we can obtai…

2018-01-18abs ↗pdf ↗

Develops efficient methods for approximating densities of financial models with jumps.

problem Approximating densities of affine jump diffusions with state-independent jump intensities.
method Recursive approach for deriving closed-form solutions to moments, constructing density approximations via moment matching.
result Superior computational efficiency and precision in option pricing and simulation compared to existing techniques.

Paper introduces robust Gaussian process regression without sacrificing computational efficiency.

problem Violation of independent and identically distributed Gaussian observation noise assumption in Gaussian process regression.
method Proves robust and conjugate Gaussian process regression (RCGP) at no additional cost using generalised Bayesian inference.
result RCGP enables exact conjugate closed form updates in all settings where standard GPs admit them.

Improved portfolio optimization using VaR and CVaR with NMVM models.

problem Optimizing portfolios with VaR and CVaR under NMVM distributions.
method Transformed mean-CVaR-skewness problems into quadratic optimization with closed-form solutions for NMVM models.
result Approximate closed-form expressions for VaR and CVaR of NMVM portfolios.

We revisit the task of learning a Euclidean metric from data. We approach this problem from first principles and formulate it as a surprisingly simple optimization problem. Indeed, our formulation even admits a closed form solution. This solution possesses several very attractive properties: (i) an innate geometric app…

2016-07-18abs ↗pdf ↗

Closed-form relations and approximations for SE(3) derivatives for robust numerical simulations.

problem Deriving closed-form derivatives and approximations for SE(3) for robust numerical simulations.
method Avoiding block partitioning, deriving higher-order approximations for differential, first and second derivatives, Jacobian, and Hessian.
result Compact and numerically robust closed-form relations for SE(3) derivatives.

Optimal transport (\OT) theory defines a powerful set of tools to compare probability distributions. \OT~suffers however from a few drawbacks, computational and statistical, which have encouraged the proposal of several regularized variants of OT in the recent literature, one of the most notable being the \textit{slice…

2019-02-01abs ↗pdf ↗

Boosting ridge regression for high-dimensional data classification reduces computational cost and improves learning time.

problem High computational demand of inverting regularised covariance matrix in ridge regression for high-dimensional problems.
method Train an ensemble of ridge regressors in randomly projected subspaces, then combine them using adaptive boosting.
result Effective in terms of learning time and improved predictive performance in some cases.

Estimation of the operational risk capital under the Loss Distribution Approach requires evaluation of aggregate (compound) loss distributions which is one of the classic problems in risk theory. Closed-form solutions are not available for the distributions typically used in operational risk. However with modern comput…

2010-08-06abs ↗pdf ↗

COSMIC identifies LTV systems from large data sets efficiently.

problem Identification of discrete-time linear time-variant systems from large-scale data.
method Formulates as regularized least squares problem, develops closed-form algorithm with linear complexity.
result Achieves optimal results even with large data volumes, significantly faster than general solvers.

Proposes efficient Bayesian logistic regression for large sparse datasets.

problem Infeasibility of theoretical Bayesian methods for large sparse feature sets.
method Low complexity analytical approximations for sparse online logistic and probit regressions.
result Empirical results show superior performance compared to more complex methods.

We study the effect of parameters uncertainties on a stochastic diffusion model, in particular the impact on the pricing of contingent claims, thanks to Dirichlet Forms methods. We apply recent techniques, developed by Bouleau, to hedging procedures in order to compute the sensitivities of SDE trajectories with respect…

2010-01-28abs ↗pdf ↗

The paper derives closed-form approximations for mean-reverting SABR models and calibrates them to equity volatilities.

problem Calibration of mean-reverting SABR models to equity volatilities.
method Derive closed-form approximations using a CIR process for volatility, lognormal process for volatility, and CIR process for squared volatility. Calibrate to empirical volatilities using a computer algebra system.
result Calibrated mean-reverting SABR models provide excellent fits to equity volatilities with only five parameters per surface.

Proximal operators are of particular interest in optimization problems dealing with non-smooth objectives because in many practical cases they lead to optimization algorithms whose updates can be computed in closed form or very efficiently. A well-known example is the proximal operator of the vector 1\ell_1 norm, whic…

2019-10-09abs ↗pdf ↗

We study the effect of parameter uncertainty on a stochastic diffusion model, in particular the impact on the pricing of contingent claims, using methods from the theory of Dirichlet forms. We apply these techniques to hedging procedures in order to compute the sensitivity of SDE trajectories with respect to parameter …

2012-03-26abs ↗pdf ↗

Neural network discovers exact solutions to QP with linear constraints.

problem Discovering exact solutions to Quadratic Programs (QP) with linear constraints using neural networks.
method Proposes a neural network modeling approach that analytically derives model parameters from problem coefficients, ensuring closed-form solutions without training.
result The closed-form NN model produces exact solutions for every critical region of the QP solution function, outperforming DNNs and commercial solvers in terms of optimality and feasibility.

This work studies Gaussian geometry under entropy-regularized 2-Wasserstein distance.

problem Understanding Gaussian distributions in uncertainty quantification and diffusivity.
method Entropy-regularized 2-Wasserstein distance, closed-form solutions, fixed-point characterization.
result Closed-form expressions for the 2-Sinkhorn divergence and fixed-point barycenter.

Alternative closed-form formula for spread call option prices under log-normal models.

problem Valuation of spread call options under log-normal models.
method Developed an alternative closed-form formula for spread call option prices.
result Our formula performs better for certain range of model parameters than existing closed-form formula.

This paper summarizes closed-form relations for SE(3) maps and their derivatives.

problem Closed-form expressions for SE(3) maps and their derivatives are scattered in the literature.
method Summarizes and provides proofs for relevant closed-form relations of the exponential and Cayley map on SE(3).
result Provides an implicit generalized-alpha scheme for rigid/flexible multibody systems using the Cayley map.

Naz and Chaudhry [3] established multiple closed-form solutions for the basic Lucas-Uzawa model. According to Boucekkine and Ruiz-Tamarit [1] and Chilarescu [2] unique closed-form solutions exist for the basic Lucas-Uzawa model. We equate expressions for variables h(t) and u(t). We provide here condition for the unique…

2017-12-06abs ↗pdf ↗

We prove that the control polygon of a Bezier curve B becomes homeomorphic and ambient isotopic to B via subdivision, and we provide closed-form formulas to compute the number of iterations to ensure these topological characteristics. We first show that the exterior angles of control polygons converge exponentially to …

2012-11-02abs ↗pdf ↗

A new metric for comparing probability measures on graphs, scalable and negative definite.

problem Optimal transport's high complexity and indefiniteness for kernel machines.
method Sobolev transport metric for graph metrics, closed-form formula, negative definiteness.
result Sobolev transport yields a scalable and negative definite metric.

Novel Hilbert space Gaussian process improves sequential design accuracy and efficiency.

problem Efficiently implementing Gaussian process acquisition functions for expensive simulations.
method Proposed a truncated eigenbasis representation for closed-form evaluation of IMSE acquisition function.
result Significantly lower prediction error and reduced computation time compared to benchmarks.

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.

Paper improves MFC algorithm for clustering linear subspaces.

problem Challenges in subspace clustering, especially with close cluster spans.
method Integrates MFC and iPursuit algorithms, focusing on innovation components.
result MFC/iPursuit algorithms robust to cluster intersections and span closeness.

This article proposes a novel solution for stretchy polynomial regression learning. The solution comes in primal and dual closed-forms similar to that of ridge regression. Essentially, the proposed solution stretches the covariance computation via a power term thereby compresses or amplifies the estimation. Our experim…

2014-08-23abs ↗pdf ↗

Binary classification models get more efficient predictive probabilities.

problem Computing predictive probabilities in Bayesian probit models is computationally challenging.
method Use of expectation propagation (EP) to find a closed-form expression for predictive probabilities.
result Closed-form predictive probabilities improve over existing methods.