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

188377565753 · Jun 202019922001200920172026
48 results for Recovery Rate Prediction

Hybrid QML model improves recovery rate prediction accuracy.

problem Complex nonlinear dependencies, high-dimensional feature spaces, and limited sample sizes in recovery rate forecasting.
method Hybrid Quantum Machine Learning (QML) with Amplitude Encoding, leveraging PQC and qubit data compression.
result Significantly lower RMSE (0.228) compared to classical models.

This paper improves credit risk analysis by incorporating state-dependent recovery rates into a factor model.

problem Accurate default forecasting in credit risk analysis.
method Extends a one-factor Gaussian copula model to include state-dependent recovery rates and a common factor.
result The proposed model outperforms other models in default prediction, especially during hectic periods.

We derive an arbitrage free relationship between recovery swap rates, digital default swap spreads and conventional CDS spreads, and argue that the fair forward recovery rate used in recovery swaps must contain a convexity premium over the expected recovery value.

2010-01-05abs ↗pdf ↗

A new method enhances signal recovery with FDR control.

problem Challenging signal recovery in compressive sensing.
method Knockoff-guided compressive sensing framework with FDR control.
result Guaranteed FDR control leads to more accurate signal reconstruction.

Transfer learning improves loan recovery rate forecasting under data scarcity.

problem Data scarcity in loan portfolios limits RR modeling accuracy.
method Introduces FT-MDN-Transformer, a mixture-density tabular Transformer architecture for TL.
result FT-MDN-Transformer outperforms baseline models in RR forecasting, especially under covariate and conditional shifts.

Group Shapley evaluates feature groups in business data, improving explainability in AI.

problem Evaluating the importance of feature groups in business and economic data.
method Developed Group Shapley and a significance testing procedure based on chi-square approximation.
result Market-related variables are identified as the most influential feature group.

Develops robust knockoffs for controlling false discoveries in financial data.

problem Challenges in variable selection with highly correlated data in finance and economics.
method Robustified knockoff framework addressing high dependence and time correlation.
result Identifies new important groups of factors on top of known drivers.

In recent years research on credit risk modelling has mainly focused on default probabilities. Recovery rates are usually modelled independently, quite often they are even assumed constant. Then, however, the structural connection between recovery rates and default probabilities is lost and the tails of the loss distri…

2011-02-23abs ↗pdf ↗

We show that a simple and intuitive three-parameter equation fits remarkably well the evolution of the gross domestic product (GDP) in current and constant dollars of many countries during times of recession and recovery. We then argue that this equation is the response function of the economy to isolated shocks, hence…

2008-02-14abs ↗pdf ↗

While defaults are rare events, losses can be substantial even for credit portfolios with a large number of contracts. Therefore, not only a good evaluation of the probability of default is crucial, but also the severity of losses needs to be estimated. The recovery rate is often modeled independently with regard to th…

2012-03-14abs ↗pdf ↗

Researchers prove inner product recovery is impossible in latent space models.

problem Recovering inner products in latent space models with random geometric graphs.
method Rate-distortion theory applied to Gaussian or spherical latent locations.
result Impossible to recover inner products if dimensionality exceeds nh(p)n h(p), matching positive results' conditions.

The current research on credit risk is primarily focused on modeling default probabilities. Recovery rates are often treated as an afterthought; they are modeled independently, in many cases they are even assumed constant. This is despite of their pronounced effect on the tail of the loss distribution. Here, we take a …

2011-02-15abs ↗pdf ↗

Gradient descent recovers low-rank matrices from corrupted measurements with double over-parameterization.

problem Robust recovery of low-rank matrices from grossly corrupted measurements.
method Gradient descent with discrepant learning rates for double over-parameterized models.
result Gradient descent with discrepant learning rates provably recovers the underlying matrix without prior knowledge on rank or sparsity.

Study sparse function recovery from indirect noisy observations using 1\ell^1-regularization.

problem Recovering sparse functions from indirect, noisy observations.
method Proposes an 1\ell^1-regularized empirical risk minimizer and analyzes its statistical properties.
result Established almost-sure consistency and derived high-probability convergence rates in prediction and 1\ell^1 norms.

Empirical study on UEEs reveals liquidity's role and universal recovery patterns.

problem Understanding and stabilizing financial markets affected by UEEs.
method Comparative analysis of UEEs over different years in US stock market.
result Liquidity is dominant in UEEs emergence and recovery patterns are universal.

Study robust recovery of low-rank matrices from corrupted measurements without rank prior.

problem Robust recovery of low-rank matrices from corrupted Gaussian measurements with unknown rank.
method Subgradient method with diminishing stepsizes for nonconvex nonsmooth problem.
result Subgradient method converges to exact low-rank solution at sublinear rate under RDPP condition.

Two methods improve tensor recovery in Ising models, revealing gene interactions.

problem Improving tensor recovery in Ising models for complex data structures.
method Pseudolikelihood and interaction screening approaches for tensor learning.
result Both methods achieve tensor recovery with sample size logarithmic in nodes, exponential in strength and degree.

We propose a Bayesian model that predicts recovery curves based on information available before the disruptive event. A recovery curve of interest is the quantified sexual function of prostate cancer patients after prostatectomy surgery. We illustrate the utility of our model as a pre-treatment medical decision aid, pr…

2015-04-27abs ↗pdf ↗

Paper proposes sparse classification method for high-dimensional data.

problem Sparse classification in high-dimensional data with positive-confidence samples.
method Developed a novel sparse-penalization framework using L1, SCAD, and MCP penalties for convex and non-convex shrinkage.
result Proved near minimax-optimal sparse recovery rates under Restricted Strong Convexity condition.

New tensor recovery method uses Riemannian optimization on Segre manifold.

problem Recovering low-rank tensors from noisy measurements.
method Riemannian Gradient Descent (RGD) and Riemannian Gauss-Newton (RGN) algorithms over the Segre manifold.
result Proven convergence rates for RGD and RGN under mild noise assumptions.

The paper tackles partial inference in structured prediction using a convex optimization approach.

problem Maximizing a score function with unary and pairwise potentials in graph label spaces.
method Generative model approach with two-stage convex optimization for label recovery.
result Conditions for recovering a majority of labels with provable guarantees.

Higher-order tensors can represent scores in a rating system, frames in a video, and images of the same subject. In practice, the measurements are often highly quantized due to the sampling strategies or the quality of devices. Existing works on tensor recovery have focused on data losses and random noises. Only a few …

2019-12-05abs ↗pdf ↗

We propose a general modeling and algorithmic framework for discrete structure recovery that can be applied to a wide range of problems. Under this framework, we are able to study the recovery of clustering labels, ranks of players, signs of regression coefficients, cyclic shifts, and even group elements from a unified…

2019-11-04abs ↗pdf ↗

We reveal a model rank that predicts successful recovery of target functions at overparameterization.

problem Understanding the mysterious good generalization performance of overparameterized nonlinear models.
method Rank stratification and linear stability theory for general nonlinear models.
result Linearly stable functions are preferred by nonlinear training, and model rank predicts minimal training data size.

Neural surrogate predicts SPN rates from token trajectories.

problem Challenging parameter estimation in SPNs with covariates.
method 1D Convolutional Residual Network trained on Gillespie-simulated SPN realizations.
result Surrogate predicts rate-function coefficients with RMSE = 0.043.

IRKSN algorithm achieves sparse recovery with wider applicability conditions.

problem Sparse recovery challenges due to NP-hard nature and restrictive conditions.
method IRKSN algorithm based on kk-support norm regularizer.
result Achieves sparse recovery with explicit constants and standard linear rate.

This paper sets thresholds for recovering vertex correspondences in partially correlated graphs.

problem Recovering hidden vertex correspondences in partially correlated graphs.
method Proposed partially correlated Erdős-Rényi graphs model; information-theoretic thresholds; correlated functional digraphs.
result Optimal rates for partial and exact recovery of vertex correspondences.