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

72145217289 · Jun 202019922001200920172026
48 results for closed-form solution

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 ↗

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.

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.

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.

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.

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.

This paper derives -- considering a Gaussian setting -- closed form solutions of the statistics that Adrian and Brunnermeier and Acharya et al. have suggested as measures of systemic risk to be attached to individual banks. The statistics equal the product of statistic specific Beta-coefficients with the mean corrected…

2012-11-17abs ↗pdf ↗

Paper finds closed-form solutions for tontine with bequest motive.

problem Finding optimal fractional consumption rate and bequest amount under bequest motive.
method Relaxing fixed proportions assumption, introducing bequest proportion as control function.
result Closed-form solutions for fractional consumption rate, wealth, bequest amount, and proportion.

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 ↗

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.

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.

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 ↗

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.

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.

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 ↗

New solutions found for bending of flat surfaces and origami structures.

problem Understanding the energy-efficient bending modes of origami tessellations and corrugated shells.
method Direct construction of closed-form solutions for surfaces of translation.
result Three inextensional modes identified for surfaces of translation, including stretching, bending, and twisting.

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.

In this paper, we consider the Graphical Lasso (GL), a popular optimization problem for learning the sparse representations of high-dimensional datasets, which is well-known to be computationally expensive for large-scale problems. Recently, we have shown that the sparsity pattern of the optimal solution of GL is equiv…

2017-11-24abs ↗pdf ↗

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 ↗

Study on utility maximization with Tsallis entropy in reinforcement learning.

problem Exploring utility maximization with Tsallis entropy in reinforcement learning.
method Introducing Tsallis entropy regularizer to induce exploration, investigating specific examples, characterizing well-posedness, designing reinforcement learning algorithm.
result Characterized well-posedness and provided semi-closed-form solutions for specific examples, found distinct optimal strategies.

We develop an efficient method to calibrate CDS spreads using asymptotic approximations.

problem Calibrating CDS spreads in the SSRD model with correlated processes.
method Asymptotic coefficient expansion to approximate solutions of nonlinear PDEs.
result Our approximation does not require uncorrelated interest rate and default intensity processes.

Drawing insights from the triumph of relativistic over classical mechanics when velocities approach the speed of light, we explore a similar improvement to the seminal Black-Scholes (Black and Scholes (1973)) option pricing formula by considering a relativist version of it, and then finding a respective solution. We sh…

2017-11-12abs ↗pdf ↗

This paper proposes a method to approximate non-Gaussian likelihoods in Gaussian Processes.

problem Approximating non-Gaussian likelihoods in Gaussian Processes.
method Proposes a piece-wise constant approximation for the inverse-link function.
result Yields a closed form solution for the SVGP lower bound.

Closed-form solutions derived for perpetual options under insider models.

problem Pricing perpetual American standard and lookback options for insiders.
method Closed-form solutions derived using progressively enlarged filtrations and optimal stopping problems.
result Optimal exercise times determined based on asset price maximum or minimum.

We solve the mean parametrization of von Mises-Fisher distribution.

problem No closed-form normalization function for mean parameters exists.
method Derived a second-order ODE for mean normalizer and provided approximations.
result Rapid evaluation of densities and natural parameters in terms of mean parameters.

Closed form option pricing formulae explaining skew and smile are obtained within a parsimonious non-Gaussian framework. We extend the non-Gaussian option pricing model of L. Borland (Quantitative Finance, {\bf 2}, 415-431, 2002) to include volatility-stock correlations consistent with the leverage effect. A generalize…

2004-02-29abs ↗pdf ↗