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

93187280373 · Jun 202019922001200920172026
48 results for numerical issues

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.

A new approach improves numerical tabular data imputation by addressing diffusion models' limitations.

problem Inaccurate and difficult training in numerical tabular data imputation.
method Kernelized Negative Entropy-regularized Wasserstein gradient flow Imputation (KnewImp) based on Wasserstein gradient flow (WGF) framework.
result KnewImp significantly outperforms existing methods in numerical tabular data imputation.

A Neural Network (NN) based numerical method is formulated and implemented for solving Boundary Value Problems (BVPs) and numerical results are presented to validate this method by solving Laplace equation with Dirichlet boundary condition and Poisson's equation with mixed boundary conditions. The principal advantage o…

2019-09-24abs ↗pdf ↗

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.

Machine learning conferences face ethical issues in review process.

problem Ethical issues in the review process of machine learning conferences.
method Study of recruitment issues, double-blind process infringements, fraudulent behaviors, biases, and appendix phenomenon.
result Highlighting the need for awareness in the machine learning community.

Two-layer networks struggle with high frequencies due to numerical and computational limitations.

problem High frequency approximation and learning in shallow networks.
method Mathematical and computational analysis focusing on numerical error, computational cost, and stability.
result Explicit answers to fundamental computational issues in shallow networks' high frequency handling.

Existing feature selection methods fail to properly account for interactions between features when evaluating feature subsets. In this paper, we attempt to remedy this issue by using orthogonal variance decomposition to evaluate features. The orthogonality of the decomposition allows us to directly calculate the total …

2019-10-22abs ↗pdf ↗

Wasserstein distance plays increasingly important roles in machine learning, stochastic programming and image processing. Major efforts have been under way to address its high computational complexity, some leading to approximate or regularized variations such as Sinkhorn distance. However, as we will demonstrate, regu…

2018-02-12abs ↗pdf ↗

A new numerical framework simplifies elastic surface matching and comparison.

problem Challenging problem in surface comparison and matching in computer vision.
method Relaxing the geodesic boundary constraint using a varifold fidelity metric.
result Flexibility to deal with arbitrary topologies and sampling patterns, scalability to large meshes.

The paper addresses numerical integration issues in SV models, proposing a fast regime switching algorithm.

problem Numerical integration challenges in SV models, especially with high precision and low computational time.
method Proposes a fast regime switching algorithm to determine when higher precision arithmetic is needed.
result Shows that numerical quadratures need to be carefully chosen based on model parameters and parameter values.

The literature on optimal reinsurance does not deal with how much the effectiveness of such solutions is degraded by errors in parameters and models. The issue is investigated through both asymptotics and numerical studies. It is shown that the rate of degradation is often O(1/n)O(1/n) as the sample size nn of historical …

2019-12-09abs ↗pdf ↗

Previously, the exploding gradient problem has been explained to be central in deep learning and model-based reinforcement learning, because it causes numerical issues and instability in optimization. Our experiments in model-based reinforcement learning imply that the problem is not just a numerical issue, but it may …

2019-02-04abs ↗pdf ↗

The memory capacity of linear echo state networks is accurately calculated using new numerical methods.

problem Numerical evaluations of memory capacity in recurrent neural networks often contradict theoretical bounds.
method Developed robust numerical approaches exploiting MC neutrality with respect to the input mask matrix.
result Memory curves fully agree with theory when using the proposed methods.

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.

A novel graph spectral method for mixed categorical and numerical data.

problem Feature learning for mixed data types (numerical and categorical).
method Graph spectral decomposition of the graph Laplacian to model probabilistic dependence structure.
result Increased separability and clusterability of observations in the transformed feature space.

GPU speeds up Monte Carlo simulations for large time steps.

problem Slow convergence and inaccurate solutions with large time steps in Monte Carlo simulations.
method Generalizes the Seven League scheme for GPU acceleration.
result Significantly improved computational speed.

Neural networks struggle with long sequences, but a new method improves their performance.

problem Neural networks struggle to generalize to longer sequences and unseen data.
method Proposed a learned conditional masking mechanism and binary encoding for numbers.
result Models can now generalize far outside their training range with near-perfect accuracy.

The credit crisis and the ongoing European sovereign debt crisis have highlighted the native form of credit risk, namely the counterparty risk. The related Credit Valuation Adjustment, (CVA), Debt Valuation Adjustment (DVA), Liquidity Valuation Adjustment (LVA) and Replacement Cost (RC) issues, jointly referred to in t…

2012-10-18abs ↗pdf ↗

This survey paper is focused on qualitative and numerical analyses of fully nonlinear partial differential equations of parabolic type arising in financial mathematics. The main purpose is to review various non-linear extensions of the classical Black-Scholes theory for pricing financial instruments, as well as models …

2017-07-04abs ↗pdf ↗

Recognizing written domain numeric utterances (e.g. I need $1.25.) can be challenging for ASR systems, particularly when numeric sequences are not seen during training. This out-of-vocabulary (OOV) issue is addressed in conventional ASR systems by training part of the model on spoken domain utterances (e.g. I need one …

2019-07-01abs ↗pdf ↗

We address the issue of edge detection in Synthetic Aperture Radar imagery. In particular, we propose nonparametric methods for edge detection, and numerically compare them to an alternative method that has been recently proposed in the literature. Our results show that some of the proposed methods display superior res…

2012-07-08abs ↗pdf ↗

This paper tackles Bayesian system identification with probabilistic numerical methods.

problem Accurately modeling nonlinear dynamic systems from noisy data.
method Probabilistic Sequential Monte Carlo (SMC) combined with probabilistic numerical integration.
result Efficient identification of latent states and system parameters from noisy measurements.

In this short note, we consider mean-variance optimized portfolios with transaction costs. We show that introducing quadratic transaction costs makes the optimization problem more difficult than using linear transaction costs. The reason lies in the specification of the budget constraint, which is no longer linear. We …

2020-01-06abs ↗pdf ↗

In high dimension, low sample size (HDLSS)settings, the simple average distance classifier based on the Euclidean distance performs poorly if differences between the locations get masked by the scale differences. To rectify this issue, modifications to the average distance classifier was proposed by Chan and Hall (2009…

2020-01-08abs ↗pdf ↗

The paper stabilizes invertible neural networks by using Gaussian mixture models.

problem Invertible neural networks can have exploding Lipschitz constants, leading to numerical errors.
method The authors use Gaussian mixture models to stabilize the latent distribution of invertible neural networks.
result Numerical simulations confirm that this modification improves sampling quality in multimodal applications.

We address feature interpretation and reproducibility issues in dense nets, proposing a modified loss function.

problem Feature interpretation and reproducibility issues in dense nets.
method Proposed a modified loss function to circumvent basis collapse.
result Substantially concise nets with 100x fewer parameters and lower MSE loss.

New recommendations improve Gaussian process accuracy and stability.

problem Numerical instabilities and poor test likelihoods in iterative Gaussian process learning.
method Investigated CG tolerance, preconditioner rank, and Lanczos decomposition rank. Recommended small CG tolerance and large root decomposition size.
result L-BFGS-B optimizer achieves convergence with fewer gradient updates, improving Gaussian process accuracy.

Improved MLMC method for robust and efficient probability and density estimation.

problem Stability and poor complexity of MLMC for low-regularity functionals.
method Numerical smoothing combined with MLMC for deterministic quadrature methods.
result Significant improvement in strong convergence and robustness of MLMC method.

This paper describes a consistent and arbitrage-free pricing methodology for bespoke CDO tranches. The proposed method is a multi-factor extension to the (Li 2009) model, and it is free of the known flaws in the current standard pricing method of base correlation mapping. This method assigns a distinct market factor to…

2010-04-11abs ↗pdf ↗