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

3517021,0521,403 · Jun 202019922001200920172026
48 results for multistate modeling

New model for disability insurance reserving handles delays in claim information.

problem Disability insurance claims are affected by long delays and adjudication processes.
method Proposes a new individual reserving model for real-time claim evolution.
result Shows that new reserves can be calculated as modifications of classic reserves.

Study improves loan default risk estimation using advanced regression models.

problem Modeling loan default risk over time is challenging and affects financial reserves.
method Comparative study of three multistate regression techniques: Markov chain, beta regression, and multinomial logistic regression.
result Each successive model outperforms the previous, indicating greater sophistication.

MDNs offer a data-efficient alternative to diffusion and flow models for multimodal scientific learning.

problem Capturing multimodal conditional uncertainty in scientific inverse problems.
method Mixture Density Networks (MDNs) as explicit parametric density estimators.
result MDNs achieve superior generalization, interpretability, and sample efficiency in scientific tasks.

In this paper we propose a simple and efficient method to compute the ordered default time distributions in both the homogeneous case and the two-group heterogeneous case under the interacting intensity default contagion model. We give the analytical expressions for the ordered default time distributions with recursive…

2012-04-18abs ↗pdf ↗

Logit-link models reveal socio-temporal effects on microfinance delinquency.

problem Understanding and quantifying socio-temporal factors affecting microfinance loan delinquency.
method Developed and evaluated discrete-time logit-link models with fixed-effects and frailty extensions.
result Simple random intercept structures capture latent heterogeneity in microfinance repayment behavior.

New method links covariates to CTMCs using RKHS, improving state transitions modeling.

problem Traditional multistate models rely on linear relationships, limiting flexibility.
method Nonparametric approach using RKHS, with Frequentist and Bayesian versions.
result Effective in identifying nonlinear transition functions and predicting long-term behaviors.

Discovering quasipotential equations from data using machine learning.

problem Understanding escape mechanisms from metastable states in nonlinear systems.
method Combining neural networks and sparse regression to symbolically reconstruct quasipotential equations.
result Model-unbiased analytical forms of quasipotential discovered directly from data.

RNNs struggle with chaotic dynamics due to exploding gradients, but we found a way to optimize training.

problem Challenging training of RNNs with chaotic dynamics due to exploding gradients.
method Relating loss gradients to Lyapunov spectrum to optimize training on chaotic data.
result RNNs with chaotic dynamics always have diverging gradients, while stable ones have bounded gradients.

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 ↗

The paper extends statistical inference methods for black-box generative models.

problem Understanding and validating black-box generative models without access to their internal data.
method Develops model-level statistical inference tasks using generative model representations.
result Model-level representations are effective for multiple inference tasks.

Combining models in appropriate ways to achieve high performance is commonly seen in machine learning fields today. Although a large amount of combinatorial models have been created, little attention is drawn to the commons in different models and their connections. A general modelling technique is thus worth studying …

2012-01-18abs ↗pdf ↗

Macroscopic price evolution models are commonly used for investment strategies. There are first promising achievements in defining microscopic agent based models for the same purpose. Microscopic models allow a deeper understanding of mechanisms in the market than the purely phenomenological macroscopic models, and thu…

2011-03-28abs ↗pdf ↗

Introduces model class selection to find sets of near-optimal models.

problem Finding sets of near-optimal models within multiple model collections.
method Generalizes model set selection framework to model class selection, using data splitting approaches.
result Shows that simpler, interpretable models can perform similarly to complex machine learning models.

Latent tree models are graphical models defined on trees, in which only a subset of variables is observed. They were first discussed by Judea Pearl as tree-decomposable distributions to generalise star-decomposable distributions such as the latent class model. Latent tree models, or their submodels, are widely used in:…

2017-08-02abs ↗pdf ↗

Gradient boosting enhances existing Mendelian models for genetic disease risk prediction.

problem Improving existing Mendelian models for genetic disease risk prediction.
method Combining gradient boosting with existing Mendelian models.
result Improved model outperforms both original and gradient boosting-only models.

New data accumulation prevents model collapse in generative models.

problem Model collapse in generative models trained on their own outputs.
method Empirical study of language models, diffusion models, and variational autoencoders; analytically tractable framework for linear models.
result Accumulating synthetic data alongside real data avoids model collapse, preventing performance degradation.

BRAID fine-tunes diffusion models to optimize reward models in offline scenarios.

problem Combining generative modeling and model-based optimization in offline scenarios.
method Conservative fine-tuning of diffusion models using RL to optimize reward models.
result BRAID outperforms existing methods in offline data, avoiding invalid designs.