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

3547071,0611,414 · Jun 202019922001200920172026
48 results for Closed-Form Model

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.

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 ↗

This note finds closed-form solutions for mean-risk portfolios using a specific type of mixture distribution.

problem Finding optimal portfolios under mean-risk criteria for general distributions.
method Using normal mean-variance mixture (NMVM) distributions, the paper derives closed-form expressions for mean-risk frontiers by optimizing a Markowitz model with adjusted return vectors.
result Closed-form solutions for mean-risk portfolios are found for return vectors following NMVM distributions.

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 obtain new closed-form pricing formulas for contingent claims when the asset follows a Dupire-type local volatility model. To obtain the formulas we use the Dyson-Taylor commutator method that we have recently developed in [5, 6, 8] for short-time asymptotic expansions of heat kernels, and obtain a family of general…

2009-10-13abs ↗pdf ↗

Develops semi-closed form solutions for barrier and American options on time-dependent OU process.

problem Valuation of barrier and American options on a time-dependent Ornstein-Uhlenbeck process.
method Semi-closed form solutions involving numerical solution of Fredholm equations and integration of Jacobi theta functions.
result Method is more efficient than backward finite difference method and can be as efficient as forward finite difference solver with better accuracy and stability.

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.

Survey on closed-form Fisher-Rao distance expressions.

problem Finding closed-form expressions for Fisher-Rao distance.
method Collect and present examples of closed-form expressions for Fisher-Rao distance of discrete and continuous distributions.
result Presentation of closed-form expressions for Fisher-Rao distance of various distributions.

The paper introduces closed-form expressions for interpreting Tsetlin Machines.

problem Interpreting complex Tsetlin Machines with a large number of clauses.
method Developed closed-form expressions for local and global interpretability of Tsetlin Machines.
result The expressions enable real-time feature importance assessment and data clustering.

We propose Deep Closed-Form Subspace Clustering (DCFSC), a new embarrassingly simple model for subspace clustering with learning non-linear mapping. Compared with the previous deep subspace clustering (DSC) techniques, our DCFSC does not have any parameters at all for the self-expressive layer. Instead, DCFSC utilizes …

2019-08-26abs ↗pdf ↗

Closed-form flow matching yields similar performance to stochastic version, improving model performance.

problem Understanding why flow matching models generalize well.
method Empirical analysis and comparison of stochastic and closed-form flow matching losses.
result Closed-form flow matching can improve model performance.

A large proportion of market making models derive from the seminal model of Avellaneda and Stoikov. The numerical approximation of the value function and the optimal quotes in these models remains a challenge when the number of assets is large. In this article, we propose closed-form approximations for the value functi…

2018-10-10abs ↗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.

Paper proposes a closed-form formula for geometric Istanbul call options.

problem Pricing geometric Istanbul call options under the Black-Scholes model.
method Second-order Taylor expansion to derive a closed-form approximation.
result The proposed formula accurately approximates GIC values compared to Monte-Carlo simulations.

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.

We find a closed-form determinant for a specific sparse covariance matrix model.

problem Finding the determinant of a specific class of sparse positive definite matrices.
method Using Fourier transform of local factors, Normal Factor Graph Duality Theorem, and Matrix Determinant Lemma.
result We derive a closed-form expression for the determinant.

Linear models like EASE and SLIM are competitive in recommendation, and this work explores their theoretical relationship.

problem Understanding the relationship between linear models and matrix factorization in recommendation systems.
method Derivation and analysis of closed-form solutions for regression and matrix factorization approaches.
result Linear models and matrix factorization approaches are related but diverge in scaling singular values.

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.

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 ↗

Layer-wise networks have a closed-form solution and a stopping criterion.

problem Training networks one layer at a time without backpropagation.
method Proved the closed-form solution using the kernel Mean Embedding and Neural Indicator Kernel.
result Layer-wise networks have a closed-form solution and a stopping criterion.

FP uses random projections to train networks without feedback, achieving comparable performance to backpropagation.

problem Training neural networks without feedback from downstream layers.
method Forward Projection (FP) method that uses randomised nonlinear projections and closed-form regression.
result FP achieves comparable generalisation to backpropagation methods with a single forward pass, offering significant speedup.

We present three models of stock price with time-dependent interest rate, dividend yield, and volatility, respectively, that allow for explicit forms of the optimal exercise boundary of the finite maturity American put option. The optimal exercise boundary satisfies the nonlinear integral equation of Volterra type. We …

2019-12-11abs ↗pdf ↗

Transformer improves parameter estimation without needing closed-form solutions.

problem Parameter estimation in statistics, especially for complex distributions.
method Transformer-based approach for parameter estimation without closed-form solutions or derivations.
result Transformer-based approach achieves similar or better accuracy than maximum likelihood estimation.

Cumulant expansion is used to derive accurate closed-form approximation for Monthly Sum Options in case of constant volatility model. Payoff of Monthly Sum Option is based on sum of NN caped (and probably floored) returns. It is noticed, that 1/N1/\sqrt{N} can be used as a small parameter in Edgeworth expansion. First …

2010-11-17abs ↗pdf ↗

Optimizes neural networks' last layer with closed-form solutions.

problem Optimizing neural networks' last layer with stochastic gradient descent.
method Adapting closed-form last layer optimization for stochastic gradient descent, alternating between backbone and last layer updates.
result The method converges to optimal solutions and outperforms standard SGD and Adam in regression tasks.