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

Trend · papers per month

3517021,0521,403 · Jun 202019922001200920172026
48 results for multi-state models

In this paper we propose a multi-state model for the evaluation of the conversion option contract. The multi-state model is based on age-indexed semi-Markov chains that are able to reproduce many important aspects that influence the valuation of the option such as the duration problem, the time non-homogeneity and the …

2017-07-03abs ↗pdf ↗

The paper analyzes multivariate payments in multi-state life insurance using Markovian state processes.

problem Analyzing joint effects of life annuities and death benefits in a multi-state framework.
method Introduces multivariate present value of future payments, derives differential equations and moment generating functions, and focuses on pair-wise covariances.
result Derives Hattendorff type results for pair-wise covariances in a disability model.

Proposes a new model to analyze mortgage delinquency transitions.

problem Analyzing mortgage delinquency transitions in a flexible yet identifiable way.
method Combines structured additive predictor with neural network for complex interactions, orthogonalising components for identifiability.
result The semi-structured model provides modest gains in discrimination compared to a structured model, especially in the early prediction spans.

The idea of forward rates stems from interest rate theory. It has natural connotations to transition rates in multi-state models. The generalization from the forward mortality rate in a survival model to multi-state models is non-trivial and several definitions have been proposed. We establish a theoretical framework f…

2018-10-31abs ↗pdf ↗

A Longitudinal Attribute-Conditioned Neural Network (LANTERN) framework for modeling health-state transition probabilities in irregular longitudinal data.

problem Estimating long-term care transition probabilities in irregular longitudinal health data.
method A neural network that learns from individual health history, incorporates time elapsed, and conditions on demographic and socioeconomic attributes.
result Improves severe disability discrimination and maintains strong calibration.

Study on stock trading model with uncertain market status, proving free boundaries and optimal strategies.

problem Optimal trading strategies in a stock market with uncertain market status.
method Free boundary problem, variational inequality system, degenerate operator, C^∞-smoothness.
result All four switching free boundaries are no-overlapping, monotonic, and C^∞-smooth, and their relative localities are completely determined.

Fair clustering under the disparate impact doctrine requires that population of each protected group should be approximately equal in every cluster. Previous work investigated a difficult-to-scale pre-processing step for kk-center and kk-median style algorithms for the special case of this problem when the number of …

2019-01-29abs ↗pdf ↗

The study uses Bayesian Hidden Markov Models to predict cryptocurrency returns.

problem Predicting the volatility and trends of cryptocurrencies.
method Bayesian Hidden Markov Models with four states to capture different return characteristics.
result The NHHM model with four states outperforms other models in predicting cryptocurrency returns.

Complex contagion model explains financial fire sales through continuous asset prices.

problem Modeling financial fire sales with a continuum of asset prices.
method Developed a threshold model of continuous-state cascades using real values for asset prices.
result Discretization approach accurately replicates the distribution of defaulted banks and asset prices.

The paper reveals that baselines significantly impact RL algorithms' convergence.

problem Understanding the true impact of baselines on policy optimization.
method Theoretical analysis of bandit and RL problems, focusing on natural policy gradient and EXP3.
result Baselines can determine algorithm convergence, contradicting traditional optimization theory.

The paper models stochastic interest rates for life insurance using phase-type distributions.

problem Modeling stochastic interest rates in life insurance with matrix approach.
method Integrates piecewise deterministic interest rates into a Markov jump process framework.
result Explicit formulas for reserves and future payments can be derived.

Excited-state dynamics simulations are a powerful tool to investigate photo-induced reactions of molecules and materials and provide complementary information to experiments. Since the applicability of these simulation techniques is limited by the costs of the underlying electronic structure calculations, we develop an…

2019-12-18abs ↗pdf ↗

SiBBlInGS discovers interpretable building blocks across states in multi-way data.

problem Identifying interpretable units (Building Blocks) in multi-state, multi-way data.
method Graph-based dictionary learning approach for sparse BBs and temporal traces.
result Captures per-trial variability and state-specific vs. state-invariant components.

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.

The paper uses model-based trees to create interpretable surrogate models for complex machine learning models.

problem Interpreting complex machine learning models.
method Using model-based trees to partition feature space and create interpretable models.
result Model-based trees generate optimal surrogate models that balance interpretability and performance.

The study examines how model predictions hold up under model extensions.

problem Model predictions may not be robust under model extensions, limiting their applicability.
method The study uses causal ordering to assess robustness of qualitative model predictions and characterizes model extensions that preserve predictions.
result Conditions and techniques are provided to assess robustness of model predictions under model extensions.

Revises Bayesian model averaging for foundation models.

problem Ensemble pre-trained and lightly-finetuned foundation models for improved classification performance.
method Introduces trainable linear classifiers and computationally cheaper model averaging scheme (OMA).
result Ensembled models can better predict on various datasets.

Paper introduces symmetric divergence link models for probability distributions.

problem Symmetric divergence measures for probability distributions.
method Two general classes of link models: one for survival functions and another for cumulative probability distribution functions.
result Advantages of symmetric divergence measures over asymmetric measures for model averaging and feature assessment.

Researchers review challenges in interpreting additive models, especially neural additive models.

problem Challenges in interpreting additive models, particularly neural additive models.
method Review of generalized additive models and discussion of nonidentifiability.
result Challenges in claiming interpretability or suitability for safety-critical applications of additive models.

Sigma models linked to Gross-Neveu models via quiver varieties.

problem Understanding the relationship between sigma models and Gross-Neveu models.
method Exploring the mathematical correspondence between sigma models and Gross-Neveu models, including their geometric and trigonometric/elliptic deformations.
result Sigma models are mathematically equivalent to Gross-Neveu models under certain conditions.

Simple models are preferred over complex models, but over-simplistic models could lead to erroneous interpretations. The classical approach is to start with a simple model, whose shortcomings are assessed in residual-based model diagnostics. Eventually, one increases the complexity of this initial overly simple model a…

2017-06-26abs ↗pdf ↗

Matryoshka hides secret models in a carrier model, achieving high capacity and robustness.

problem Stealing functionality of private ML data by hiding models in a carrier model.
method Parameter sharing approach exploiting the learning capacity of the carrier model.
result Hides a 26x larger secret model or 8 secret models in the carrier model.

This work develops scalable model selection methods with fast update and selection.

problem Efficient model selection for large pools of candidate models.
method Isolated model embedding, which supports asymptotically fast update and selection.
result Standardized Embedder achieves competitive model selection performances.

Copulas outperform marginal models in multivariate risk forecasting, reducing model risk by narrowing down the set of models.

problem Model risk in multivariate risk forecasting, especially during crises.
method Comprehensive empirical study comparing Copula-GARCH models with fixed marginals, copulas, or neither.
result Model risk is almost entirely due to copula choice, not marginal models.

BayesBlend blends multiple models' predictions for better insurance loss predictions.

problem Improving insurance loss predictions by combining multiple models.
method Pseudo-Bayesian model averaging, stacking, and hierarchical stacking.
result BayesBlend provides a user-friendly way to blend model predictions and estimate weights.

The paper identifies when larger models improve predictions and proposes a switcher model.

problem Understanding when larger models benefit from added complexity.
method Numerical studies on T5 architecture to analyze predictive uncertainty and model performance.
result Large models improve on examples where small models are uncertain, but not on certain examples.

We propose a generalization of neural network sequence models. Instead of predicting one symbol at a time, our multi-scale model makes predictions over multiple, potentially overlapping multi-symbol tokens. A variation of the byte-pair encoding (BPE) compression algorithm is used to learn the dictionary of tokens that …

2017-07-03abs ↗pdf ↗