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

9182736 · May 202619922001200920172026
48 results for Callable Claims

This paper addresses recalibration issues in hedging callable assets, proposing a new risk-adjusted approach.

problem The mismatch between dynamic hedging theory and practice due to daily recalibration.
method Extends HVA model risk approach to callable assets, focusing on recalibration and model risks.
result Model risk reserves adjusted for exercise decisions may significantly exceed basic valuation differences.

The paper values perpetual callable American volatility options using a mean-reverting volatility model.

problem Valuation of callable American volatility put options.
method Modeling volatility dynamics as a mean-reverting 3/2 process and proposing a pricing formula.
result The value of perpetual callable American volatility put options is discussed under given conditions.

Study callable convertible bonds with liquidity constraints, generalizing previous work.

problem Callable convertible bond problem with liquidity constraints.
method Introduced a new technique to handle non-ordered payoff situations.
result Complete solution to callable convertible bond problem with liquidity constraint.

A semi-static approach efficiently replicates and prices callable interest rate derivatives.

problem Efficiently replicating and pricing callable interest rate derivatives under dynamic market conditions.
method Proposes a semi-static hedging algorithm that updates the replication portfolio on a finite number of instances, rather than continuously.
result The hedging error can be made arbitrarily small with a sufficiently large replication portfolio, and closed-form error margins are determined.

The paper compares machine learning methods with traditional techniques for pricing and sensitivities of financial products with path-dependent structures.

problem Evaluating financial products with early-termination clauses, especially those with path-dependent structures.
method The paper compares regression methods including randomized recurrent and feed-forward neural networks, and a novel approach using signatures of the underlying price process, with traditional polynomial basis functions for pricing and sensitivities.
result Machine learning algorithms often match the accuracy and efficiency of traditional methods for Asian and look-back options, while randomized neural networks are best for callable certificates.

We develop a semi-analytic approach to the valuation of auto-callable structures with accrual features subject to barrier conditions. Our approach is based on recent studies of multi-assed binaries, present in the literature. We extend these studies to the case of time-dependent parameters. We compare numerically the s…

2016-08-18abs ↗pdf ↗

New method prices interest rate derivatives without Monte Carlo, achieving high accuracy and speed.

problem Arbitrage-free pricing of path-dependent interest rate derivatives using infinite-dimensional models.
method Casting the stochastic pricing problem as a deterministic PDE solved by FINNs, which minimize violations of the PDE and boundary conditions.
result FINNs achieve pricing accuracy within 0.04 to 0.07 cents per dollar of contract value compared to Monte Carlo benchmarks.

Unified framework for pricing various debt securities.

problem Pricing of different types of debt securities under general short-rate processes.
method Unifying framework using continuous-time Markov chain approximations and bi-dimensional diffusion processes.
result Closed-form matrix expressions and efficient algorithms for pricing various debt securities.

QRAFTI uses multi-agent framework to improve equity factor research.

problem Replicating and developing new equity factors in large financial datasets.
method Integrates a research toolkit with MCP servers for data access and custom coding operations.
result Improves performance and explainability in multi-step empirical tasks.

In this paper we introduce a new algorithm for American Monte Carlo that can be used either for American-style options, callable structured products or for computing counterparty credit risk (e.g. CVA or PFE computation). Leveraging least squares regressions, the main novel feature of our algorithm is that it can be fu…

2014-04-04abs ↗pdf ↗

Reinforcement learning improves insurance claims reserving by learning from all claim trajectories.

problem Traditional reserving models learn only from settled claims, missing valuable data from ongoing claims.
method Formulated as a Markov decision process, uses reinforcement learning to update OCL estimates sequentially.
result Soft Actor-Critic implementation achieves competitive claim-level accuracy and strong aggregate performance.

The study analyzes how bonus-malus systems and delayed claims settlement affect insurance companies' financial stability.

problem Analyzing the impact of bonus-malus systems and delayed claims settlement on insurance companies' financial stability.
method Examined a discrete-time risk model with time-varying premiums, evaluating two types of claims and settlement delays.
result Delayed settlement of by-claims leads to lower ruin probabilities under specific assumptions.

Deep Claim predicts payer responses from claims data using deep learning.

problem Predicting payer responses from claims data to improve healthcare performance.
method Learning complex dependencies in claim inputs to create a compact representation, then using deep learning to predict responses.
result Deep Claim improves claim denial prediction by 22.21%.

The tail of the distribution of a sum of a random number of independent and identically distributed nonnegative random variables depends on the tails of the number of terms and of the terms themselves. This situation is of interest in the collective risk model, where the total claim size in a portfolio is the sum of a …

2007-03-01abs ↗pdf ↗

Two machine learning models detect anomalies in ER claims, saving up to 40% in improper payments.

problem Improper health insurance payments from fraud and upcoding.
method Two machine learning models: an upcoding model based on severity code distributions and a random forest model for claim sorting.
result Random forest model saved 12% to 40% in improper payments compared to a baseline approach.

This study compares the largest claims from two insurance portfolios using stochastic orderings.

problem Comparing the largest claims from two heterogeneous insurance portfolios.
method Used various stochastic orderings and established sufficient conditions associated with model parameters.
result Established sufficient conditions for comparing the largest claims from two insurance portfolios.

Model detects insurance fraud using social network analysis.

problem Fraudulent insurance claims by exaggeration or intentional damage.
method Network construction linking claims and parties, BiRank algorithm for fraud score computation, feature extraction from network and claims, supervised model building.
result Network features improve fraud detection performance.

Model predicts individual insurance claim reserves using activation patterns.

problem Accurately predicting individual claim reserves in insurance contracts.
method Multinomial logistic regression to model claim activation and development.
result The model generates accurate predictions of total and per coverage reserves.

Traditional non-life reserving models largely neglect the vast amount of information collected over the lifetime of a claim. This information includes covariates describing the policy, claim cause as well as the detailed history collected during a claim's development over time. We present the hierarchical reserving mod…

2019-10-28abs ↗pdf ↗

A new method for modeling insurance claim frequencies using random proportions.

problem Inaccurate fitting of classical distributions to insurance claim frequency data.
method Modeling claim frequencies using random proportions of insurance contracts and applying goodness-of-fit tests.
result A new statistical approach for better modeling insurance claim frequencies.

The paper introduces BCART models for aggregate claim amount, improving frequency-severity and joint modeling.

problem Modeling aggregate claim amount with frequency-severity and joint dependencies.
method Developed three types of BCART models: frequency-severity, sequential, and joint models. Used various distributions for claim severity data.
result Weibull distribution outperforms gamma and lognormal for right-skewed, heavy-tailed claim severity data.

In this work, we focus on fine-tuning an OpenAI GPT-2 pre-trained model for generating patent claims. GPT-2 has demonstrated impressive efficacy of pre-trained language models on various tasks, particularly coherent text generation. Patent claim language itself has rarely been explored in the past and poses a unique ch…

2019-07-01abs ↗pdf ↗

Study tackles imbalanced data in car insurance claims prediction.

problem Predicting rare events (claims) in car insurance with imbalanced data.
method Various machine learning techniques (logistic-regression, decision tree, random forest, xgBoost, feed-forward network) applied to imbalanced dataset.
result Comparison of machine learning algorithms' performance in claim occurrence prediction.

Time-aware fact-checking improves veracity predictions for time-sensitive claims.

problem Fact-checking decisions should consider temporal information of claims and evidence.
method Investigated four temporal ranking methods to optimize evidence ranking for fact-checking models.
result Time-aware evidence ranking surpasses relevance assumptions and improves veracity predictions for time-sensitive claims.

We investigate, focusing on the ruin probability, an adaptation of the Cramer-Lundberg model for the surplus process of an insurance company, in which, conditionally on their intensities, the two mixed Poisson processes governing the arrival times of the premiums and of the claims respectively, are independent. Such a …

2016-02-15abs ↗pdf ↗

Audit shows risk claims from distributional reinforcement learning agents are often false.

problem Evaluating the risk claims made by distributional reinforcement learning agents.
method Combines a decision-relevant screening metric, ground truth from Monte Carlo, and statistical methods to audit risk claims.
result 40-95% of the strongest risk claims are refuted, indicating the learned risk reflects a training artifact rather than environment stochasticity.

Study uses SVM to predict weather-induced home insurance claims and losses.

problem Assessing future weather-induced home insurance claims and losses for disaster preparedness.
method Support Vector Machine (SVM) regression for forecasting future claim dynamics.
result Illustrates SVM approach in forecasting weather-induced home insurance claims in a Canadian city.