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 Nelson-Siegel model

Genetic Algorithm improves Nelson-Siegel-Svensson model calibration for interest rates.

problem Calibrating the Nelson-Siegel-Svensson model is difficult due to nonlinearity and parameter co-dependence.
method Applied Genetic Algorithm to optimize model parameters.
result Constructs stable interest rate curves and model parameters over time.

A new model explains relative spreads between economies using dynamic Nelson-Siegel and functional regression.

problem Analyzing and predicting relative spreads between economies in fixed income markets.
method State-space functional regression model incorporating dynamic Nelson-Siegel model and kernel PCA.
result The new model outperforms the dynamic Nelson-Siegel model in explaining relative spreads.

This study models Burundi's bond market yield curve using Nelson-Siegel and Svensson models.

problem Modeling the yield curve of Burundian bond market for financial analytics.
method Collected treasury securities auction reports, computed zero-coupon rates, and applied Nelson-Siegel and Svensson models.
result Nelson-Siegel model is optimal for Burundian yield curve modeling.

Investment strategies derived from commodity futures curves exploit dynamics in price movements.

problem Modeling and predicting the term structure of commodity futures prices.
method Employed the Nelson-Siegel framework to model term structure, and developed investment strategies based on changes in slope and curvature parameters.
result Significant profits generated from systematic strategies based on the change in slope, unrelated to risk factors and robust to transaction costs.

Yield curve modeling is an essential problem in finance. In this work, we explore the use of Bayesian statistical methods in conjunction with Nelson-Siegel model. We present the hierarchical Bayesian model for the parameters of the Nelson-Siegel yield function. We implement the MAP estimates via BFGS algorithm in rstan…

2018-09-17abs ↗pdf ↗

A robust machine learning approach forecasts U.S. Treasury yields, reducing risk for investors.

problem Noisy and uncertain U.S. Treasury yields pose risk to forecast users.
method Formulates yield curve forecasting as a distributionally robust problem, combining factor models and machine learning.
result Robust forecast combinations improve out-of-sample performance across different maturity periods.

In this work we introduce Heath-Jarrow-Morton (HJM) interest rate models driven by fractional Brownian motions. By using support arguments we prove that the resulting model is arbitrage free under proportional transaction costs in the same spirit of Guasoni [Math. Finance 16 (2006) 569-582]. In particular, we obtain a …

2008-02-09abs ↗pdf ↗

We orthogonalize the NSS model to condition and diagnose its ill-conditioned parameters.

problem The ill-conditioning of the NSS model's design matrix.
method Exact orthogonal reparametrization via QR decomposition.
result Orthogonalization isolates the conditioning structure and maintains fit uncertainty.

Neural network model improves robustness of mortgage bond yield curve estimation.

problem Overfitting and instability in traditional yield curve estimation methods for small mortgage bond markets.
method Neural network framework with a new loss function for smoothness and stability.
result Empirical results show more robust and stable yield curve estimates compared to existing methods.

We derive an equation of motion for interest-rate yield curves by applying a minimum Fisher information variational approach to the implied probability density. By construction, solutions to the equation of motion recover observed bond prices. More significantly, the form of the resulting equation explains the success …

2005-07-13abs ↗pdf ↗

Deep learning framework for bond and yield curve forecasting with no-arbitrage constraints.

problem Arbitrage-free yield curve and bond price forecasting.
method Combines Kalman, extended Kalman, and particle filters with LSTM/CLSTM, and introduces AER term.
result Arbitrage regularization improves forecast accuracy, especially at short maturities.

Bayesian model predicts interest rates with short-term accuracy and long-term stability.

problem Improving short- and long-term prediction of time series with temporary non-stationary behavior.
method Time-varying autoregressive model with Bayesian regularization and MCMC inference.
result Model outperforms existing methods in both short and long-term predictions.

Machine learning models outperform traditional econometric methods for forecasting term structure of government bonds

problem Forecasting the term structure of government bonds
method Combining traditional econometric models with neural network architectures
result Neural network models consistently outperform traditional models in both forecasting accuracy and portfolio performance

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.