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,694 papers · 148 categories

Trend · papers per month

231462692923 · Jun 202019922001200920172026
48 results for numerical optimization

Optimal insurance policy for exponential utility maximization with convex premium calculation.

problem Maximizing terminal wealth utility with exponential utility function and convex premium formula.
method Necessary condition for optimal indemnity, numerical algorithm to compute it, convergence proof.
result Numerical algorithm converges to unique optimal indemnity.

LogEI improves Bayesian optimization by simplifying numerical computation of EI and related functions.

problem Numerical pathologies in optimizing EI and related acquisition functions.
method Proposes LogEI, a family of acquisition functions that simplify numerical optimization.
result LogEI members improve optimization performance and match or exceed state-of-the-art methods.

In this paper, we investigate a numerical algorithm for the pricing of swing options, relying on the so-called optimal quantization method. The numerical procedure is described in details and numerous simulations are provided to assert its efficiency. In particular, we carry out a comparison with the Longstaff-Schwartz…

2007-05-15abs ↗pdf ↗

New findings on optimal transport gradient for generative models, addressing numerical instabilities.

problem Numerical instabilities in training Wasserstein Generative Adversarial Networks (WGAN).
method Valid differentiation theorem for entropic regularized transport, semi-discrete gradient formulation, and optimization algorithm.
result Existence of optimal transport gradient for generative models under specified conditions.

This paper deals with numerical solutions to an impulse control problem arising from optimal portfolio liquidation with bid-ask spread and market price impact penalizing speedy execution trades. The corresponding dynamic programming (DP) equation is a quasi-variational inequality (QVI) with solvency constraint satisfie…

2010-06-04abs ↗pdf ↗

Investigates numerical issues in GP interpolation parameter estimation.

problem Numerical issues in maximum likelihood parameter estimation for Gaussian process interpolation.
method Investigates and proposes strategies to improve open-source software implementations.
result Improves reliability and reproducibility of studies relying on GP implementations.

New method calculates cut locus on Riemannian manifolds using optimal transport.

problem Computing the cut locus on compact Riemannian manifolds.
method Characterization via optimal transport density solution of Monge-Kantorovich equations, numerical approximation.
result Proposed novel framework for numerical approximation of cut locus.

Study shows how numerical discretization affects reconstructions and parameter distributions in nano metrology.

problem Impact of numerical discretization on parameter reconstructions and model parameter distributions.
method Bayesian target vector optimization, finite element model, Gaussian process, stochastic machine learning surrogate models, Markov chain Monte Carlo sampler.
result Numerical discretization parameters impact the accuracy and distribution of reconstructed model parameters.

We consider the entropic regularization of discretized optimal transport and propose to solve its optimality conditions via a logarithmic Newton iteration. We show a quadratic convergence rate and validate numerically that the method compares favorably with the more commonly used Sinkhorn--Knopp algorithm for small reg…

2017-10-18abs ↗pdf ↗

Bayesian optimization uses triangulation candidates for better performance.

problem Non-convex and multi-modal optimization challenges in Bayesian optimization.
method Proposes using Delaunay triangulation candidates for discrete search over continuous optimization.
result Triangulation candidates outperform numerically optimized and random alternatives.

Optical scatterometry is a method to measure the size and shape of periodic micro- or nanostructures on surfaces. For this purpose the geometry parameters of the structures are obtained by reproducing experimental measurement results through numerical simulations. We compare the performance of Bayesian optimization to …

2019-03-28abs ↗pdf ↗

The paper analyzes optimal retirement timing considering age-dependent mortality risk.

problem Optimal retirement timing under age-dependent mortality risk.
method Formulated as a stochastic control and optimal stopping problem, transformed into a finite time horizon, three-dimensional degenerate optimal stopping problem.
result Existence of an optimal retirement boundary, characterized as a unique solution to a nonlinear integral equation.

In this note we propose a new approach towards solving numerically optimal stopping problems via reinforced regression based Monte Carlo algorithms. The main idea of the method is to reinforce standard linear regression algorithms in each backward induction step by adding new basis functions based on previously estimat…

2018-08-07abs ↗pdf ↗

Multi-stage financial decision optimization under uncertainty depends on a careful numerical approximation of the underlying stochastic process, which describes the future returns of the selected assets or asset categories. Various approaches towards an optimal generation of discrete-time, discrete-state approximations…

2009-12-08abs ↗pdf ↗

We consider rate swaps which pay a fixed rate against a floating rate in presence of bid-ask spread costs. Even for simple models of bid-ask spread costs, there is no explicit strategy optimizing an expected function of the hedging error. We here propose an efficient algorithm based on the stochastic gradient method to…

2015-01-29abs ↗pdf ↗

Develops a numerical algorithm for stochastic impulse control using regression surrogates.

problem Optimal impulse control in stochastic processes.
method Generates statistical surrogates for continuation and intervention functions, recursively trained over simulated state trajectories.
result Demonstrates flexibility and extensibility of the numerical scheme through case studies.

A deep learning model speeds up computation of numerous implied volatilities.

problem Frequent computation of numerous implied volatilities using iteration methods like Newton-Raphson reaches processing speed limits.
method Emulated Newton-Raphson method using PyTorch and optimized with TensorRT.
result Up to 1,000 times faster than a benchmark implementation of Newton-Raphson.

Enhances optimization and sampling methods using ensemble-based gradient inference.

problem Improving ensemble-based methods for optimization and sampling.
method Ensemble-based gradient inference (EGI) to extract higher-order derivatives from particle ensembles.
result Augmented algorithms outperform gradient-free variants, especially in multimodal and non-Gaussian settings.

This work frames active inference through control as inference, offering robust control algorithms.

problem Active inference framework lacks practical sensorimotor control algorithms.
method Frame active inference through control as inference, presenting trajectory optimization as inference.
result AI may be framed as partially-observed CaI when the cost function is defined in observation states.

Optimizes control of infectious disease spread using stochastic methods.

problem Optimizing control of highly infectious diseases like COVID-19.
method Reformulated Hamilton-Jacobi-Bellman equation as stochastic minimum principle, leading to forward-backward stochastic differential equations.
result Numerous numerical solutions presented under various scenarios.

Study on queues with Hawkes arrivals, proving steady-state behavior and developing an efficient algorithm.

problem Analyzing the steady-state behavior of queues with Hawkes arrivals.
method Novel coupling techniques and exponential convergence results for workload and busy period processes.
result Exponential convergence of queueing processes to their stationary distribution.

DNA-SE uses deep learning to solve semiparametric problems efficiently.

problem Solving semiparametric integral equations in high dimensions.
method Formulates semiparametric estimation as a bi-level optimization problem and uses DNN to approximate solutions.
result Demonstrates numerical and statistical advantages over traditional methods.

A new method optimizes Fourier pricing for multi-asset options using adaptive quadrature.

problem Efficiently pricing multi-asset options in Lévy models.
method Optimized damping parameters and hierarchical adaptive quadrature.
result Significant speed-up in computational time for up to six dimensions.

This research optimizes Andrews plots for better visual clarity in high-dimensional data.

problem Visualizing high-dimensional datasets with clarity and aesthetics.
method Developed a method to add spectral smoothing to Andrews plots to reduce visual clutter.
result Optimal spatial-spectral smoothing leads to more aesthetically pleasing and clutter-free visualizations.

We present two algorithms for Bayesian optimization in the batch feedback setting, based on Gaussian process upper confidence bound and Thompson sampling approaches, along with frequentist regret guarantees and numerical results.

2019-11-04abs ↗pdf ↗

Paper introduces a differentiable regularizer for condition number to improve neural network stability.

problem Maintaining numerical stability in neural networks to ensure reliable and performant models.
method Introduces a novel differentiable regularizer for the condition number of weight matrices.
result Derives a differentiable formula for the gradient of the regularizer, promoting matrices with low condition numbers.

This paper tackles ranking-based performance normalization for optimization algorithms.

problem Ranking optimization algorithms across diverse numerical scales disrupts performance comparisons.
method Introduces absolute ranking and a sampling-based computational method to address numerical scale variation.
result Provides a more robust framework for assessing performance across multiple algorithms and problems.