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.
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 …
Twelve numerical methods for Poisson geometry concepts.
problem Computing and evaluating Poisson geometry concepts.
method Twelve numerical methods for various Poisson geometry operations.
result Experimental verifications of methods in dimensions two and three.
The paper analyzes numerical instability in variational flows and proposes a diagnostic method.
problem Numerical instability in variational flows affects sampling, density evaluation, and ELBO estimation.
method Treated variational flows as dynamical systems, used shadowing theory for theoretical guarantees, and developed a diagnostic procedure.
result Despite numerical instability, results from variational flows can be accurate enough for practical applications.
This paper deals with the evaluation of double line integrals of the squared exponential covariance function. We propose a new approach in which the double integral is reduced to a single integral using the error function. This single integral is then computed with efficiently implemented numerical techniques. The perf…
Numeracy is the ability to understand and work with numbers. It is a necessary skill for composing and understanding documents in clinical, scientific, and other technical domains. In this paper, we explore different strategies for modelling numerals with language models, such as memorisation and digit-by-digit composi…
NGRC shows numerical instabilities with short lags and high-degree polynomials.
problem Numerical instabilities in NGRC feature matrix.
method Combining numerical linear algebra and dynamical systems theory, we study feature matrix conditioning. We evaluate different numerical algorithms for solving the regularized least-squares problem.
result SVD-based training achieves accurate forecasts without regularization, preferable for short lags and high-degree polynomials.
Since the introduction and the public availability of the \textsc{ucr} time series benchmark data sets, numerous Time Series Classification (TSC) methods has been designed, evaluated and compared to each others. We suggest a critical view of TSC performance evaluation protocols put in place in recent TSC literature. Th…
A numerical expression in the form of an integral is given for the determinant of the scalar GJMS operator on an odd--dimensional sphere. Manipulation yields a curious sum formula for the logdet in terms of the logdets of the ordinary conformal Laplacian for other dimensions. A few graphs are drawn.
We first estimate the average growth of a company's annual income and its variance by using both real company data and a numerical model which we already introduced a couple of years ago. Investment strategies expecting for income growth is evaluated based on the numerical model. Our numerical simulation suggests the p…
In this report, we derive a non-negative series expansion for the Jensen-Shannon divergence (JSD) between two probability distributions. This series expansion is shown to be useful for numerical calculations of the JSD, when the probability distributions are nearly equal, and for which, consequently, small numerical er…
In this Article, a fast numerical numerical algorithm for pricing discrete double barrier option is presented. According to Black-Scholes model, the price of option in each monitoring date can be evaluated by a recursive formula upon the heat equation solution. These recursive solutions are approximated by using Legend…
The paper evaluates functions of stable Lévy processes and their extrema efficiently.
problem Efficiently evaluating functions of stable Lévy processes and their extrema.
method Integral representations, conformal acceleration technique, simplified trapezoid rule.
result Efficient numerical procedures for cumulative probability distribution functions (cpdfs) are developed.
A non-parametric method for evaluation of the aggregate loss distribution (ALD) by combining and numerically inverting the empirical characteristic functions (CFs) is presented and illustrated. This approach to evaluate ALD is based on purely non-parametric considerations, i.e., based on the empirical CFs of frequency …
Differentially private (DP) machine learning has recently become popular. The privacy loss of DP algorithms is commonly reported using (ε,δ)-DP. In this paper, we propose a numerical accountant for evaluating the privacy loss for algorithms with continuous one dimensional output. This accountant can be appl…
Agent Trading Arena trains LLMs in real-time financial markets to improve numerical reasoning.
problem Limited real-world training for LLMs in financial markets.
method Virtual zero-sum stock market with competitive multi-agent trading.
result LLMs perform better with chart-based visualizations and a reflection module.
We look at the meaning of 'relaxation' in the wealth exchange models that are recently proposed in Econophysics to interpret the wealth distributions. To quantify and characterise the process of relaxation, we define an appropriate quantity and evaluate that numerically for the systems of many agents. Also, the numeric…
SOO uses bandit theory to optimize functions with limited evaluations.
problem Optimizing functions with a limited number of evaluations.
method SOO is a machine learning approach that uses domain partitioning and a tradeoff between exploration and exploitation.
result SOO provides guarantees on the returned solution and is numerically efficient.
Paper presents a fast algorithm for pricing Bermudan swaptions under the two-factor Hull-White model.
problem Evaluating Bermudan swaption prices under the two-factor Hull-White model with high computational efficiency.
method Discretization of expected value calculation, Gaussian kernel sums, fast Gauss transform, grid rotation for stability.
result Significant reduction in computation time and improved stability for correlation close to -1.
Efficiently approximates integrals using a subset of samples from a target distribution in RKHS.
problem Approximating integrals with a target distribution using limited pointwise evaluations.
method Proposes a procedure using a small random subset of samples from the target distribution, either uniformly or using approximate leverage scores.
result Upper bound on approximation error for both sampling strategies, achieving optimal rate with reduced evaluations.
We consider the problem of computing the Credit Value Adjustment ({CVA}) of a European option in presence of the Wrong Way Risk ({WWR}) in a default intensity setting. Namely we model the asset price evolution as solution to a linear equation that might depend on different stochastic factors and we provide an approxima…
A new metric evaluates generative models by comparing real and generated samples.
problem Evaluating the quality of generative models.
method Relative Density Ratio (RDR) function, optimization on variational form of φ-divergence.
result The RDR function provides a clear, interpretable, and numerically stable evaluation metric.
Study evaluates neural networks based on random graph structures and finds key performance indicators.
problem Understanding and optimizing neural network architectures using graph theory.
method Evaluation of neural networks with random graph structures, focusing on structural and numerical properties.
result A new numerical graph characteristic selects a set of quasi-1-dimensional graphs that perform well.
A neural network approach to compute stable metrics for numerical simulation data.
problem Computing stable and generalizing metrics for diverse numerical simulation data.
method A Siamese neural network architecture with a specialized loss function trained on a controlled data generation setup.
result LSiM outperforms existing metrics for vector spaces and image-based metrics.
Sparse grids reduce xVA exposure evaluations by up to 6000 times.
problem Efficiently computing exposures for xVA in large portfolios with many risk factors.
method Sparse Grid Method combined with Stochastic Collocation and Smolyak's extension.
result Significant reduction in the number of portfolio evaluations, up to 6000 times.
A new method evaluates invariant performance of IRM-based representations.
problem Impact of data changes on machine learning model performance.
method Proposes a novel method to evaluate invariant performance of IRM-based representations.
result Establishes a robust criterion to assess invariant performance of various representation techniques.
Bayesian quadrature improves integration on Riemannian manifolds.
problem Efficiently computing integrals on nonlinear geometric data.
method Probabilistic numerical methods, specifically Bayesian quadrature, on Riemannian manifolds.
result Bayesian quadrature reduces the number of function evaluations compared to Monte Carlo methods.
The development of molecular signatures for the prediction of time-to-event outcomes is a methodologically challenging task in bioinformatics and biostatistics. Although there are numerous approaches for the derivation of marker combinations and their evaluation, the underlying methodology often suffers from the proble…
The Normalized Mutual Information (NMI) has been widely used to evaluate the accuracy of community detection algorithms. However in this article we show that the NMI is seriously affected by systematic errors due to finite size of networks, and may give a wrong estimate of performance of algorithms in some cases. We gi…
Stochastic models analyze traffic network performance.
problem Evaluate traffic system performance.
method Stochastic cell transmission models, preference functionals, Gaussian process regression.
result Illustrated in two case studies.
We introduce a new deep-learning based algorithm to evaluate options in affine rough stochastic volatility models. Viewing the pricing function as the solution to a curve-dependent PDE (CPDE), depending on forward curves rather than the whole path of the process, for which we develop a numerical scheme based on deep le…
FEET protocol evaluates foundation models across three scenarios.
problem Lack of standardized evaluation protocols for foundation models.
method Structured evaluation protocol across three use cases: frozen, few-shot, and fine-tuned embeddings.
result Demonstrates comprehensive assessment of foundation models' effectiveness.
Study evaluates and compares numerical differentiation methods on three case studies.
problem Evaluating and comparing numerical differentiation methods for efficiency.
method Forward, Backward, and Centered Finite-Difference methods applied at two levels of precision.
result Different methods perform differently across case studies, with varying levels of computational cost and accuracy.
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.
The paper evaluates forecast accuracy of realized volatility measures in large cross-sections.
problem Forecast evaluation of realized volatility measures in large cross-sections of financial data.
method Equal predictive accuracy testing procedures, LASSO shrinkage, measurement error correction, cross-sectional jump component measures.
result The augmented HAR model outperforms the standard HAR model in forecasting realized volatility.
Efficiently calculates privacy guarantees for 2020 Census data.
problem Evaluate privacy guarantees for 2020 U.S. Census data releases.
method Sieve-accelerated quadrature method to evaluate tail probabilities of high-dimensional convolutions.
result Achieves 1,824-fold speedup over prior methods while maintaining error tolerances.
The DoD needs a robust process to evaluate AI/ML model performance and robustness.
problem AI/ML models are brittle and nonrobust, posing risks in national security.
method Reviews AI/ML development process and best practices for evaluation.
result Recommendations for DoD evaluators to ensure robust AI/ML capabilities.
In many fields of science, high-dimensional integration is required. Numerical methods have been developed to evaluate these complex integrals. We introduce the code i-flow, a python package that performs high-dimensional numerical integration utilizing normalizing flows. Normalizing flows are machine-learned, bijectiv…
The paper models financial asset prices with jumps and evaluates European option prices using numerical methods.
problem Modeling and pricing European options with jumps in delayed stochastic systems.
method Existence, uniqueness, and positivity of solutions to delayed stochastic differential equations with jumps. Application of Fourier transformation for analytical pricing and Monte-Carlo simulation with a logarithmic Euler-Maruyama scheme for numerical approximation.
result The logarithmic Euler-Maruyama scheme provides a positive and convergent method for approximating the solution to the delayed stochastic differential equations with jumps.
New metrics reveal oversmoothing in GNNs more accurately than traditional methods.
problem Oversmoothing in graph neural networks reduces model performance.
method Rank-based metrics to measure oversmoothing in GNNs.
result Rank-based metrics consistently capture oversmoothing, while energy-based metrics often fail.
Mathematical framework for transfer learning feasibility and transfer risk.
problem Theoretical analysis of transfer learning.
method Reformulated transfer learning as an optimization problem, introduced transfer risk concept.
result Demonstrated the potential and benefits of incorporating transfer risk in transfer learning evaluation.
Paper improves bootstrapping for off-policy reinforcement learning inference.
problem Improving bootstrapping for off-policy reinforcement learning inference.
method Proposes a bootstrapping FQE method for off-policy statistical inference and a subsampling procedure to improve runtime.
result Asymptotically efficient and distributionally consistent bootstrapping FQE method for off-policy inference.
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.
Evaluation and validation of complicated control systems are crucial to guarantee usability and safety. Usually, failure happens in some very rarely encountered situations, but once triggered, the consequence is disastrous. Accelerated Evaluation is a methodology that efficiently tests those rarely-occurring yet critic…
ML surrogates speed up Bayesian inverse problem solving.
problem Infer source location from noisy acoustic wave equation data.
method Use neural network as surrogate for PDE, apply MCMC to posterior.
result Accurately infers source location from noisy data.
Study evaluates thresholds for removing noise from DNN weights using random matrix theory.
problem Removing noise from deep neural network weights for better approximation.
method Model weights as signal + noise, use random matrix theory to estimate thresholds, evaluate using cosine similarity.
result Proposed threshold estimation method improves approximation quality.
Improves interpretability of anomaly scores in GBRBM-based detection.
problem Difficulty in setting a proper threshold for anomaly scores.
method Proposes a measure based on cumulative distribution and uses simulated annealing for evaluation.
result Established a guideline for setting the threshold using the interpretable measure.
PHS optimizes hyperparameters in parallel for expensive computations.
problem Optimizing hyperparameters in computationally expensive tasks.
method Bayesian optimization for parallel hyperparameter search.
result Efficient hyperparameter optimization on multiple instances.