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.

169,341 papers · 148 categories

Trend · papers per month

3527031,0551,406 · Jun 202019922001200920182026
48 results for PD model

Researchers formalize PD and PFI to relate them to data generating process.

problem Lack of theory linking PD and PFI to data generating process.
method Formalize PD and PFI as estimators of ground truth estimands, account for model variance with learner-PD and learner-PFI.
result PD and PFI estimates deviate from ground truth due to statistical biases, model variance, and Monte Carlo approximation errors.

The paper stabilizes PD term structures under forecast uncertainty using a Kalman filter with an anchored observation model.

problem Stable estimation of lifetime PDs under forecast uncertainty.
method Reformulated in state-space framework, introduced an anchored observation model.
result Asymptotic stochastic stability of error dynamics, leading to smoother projections.

A reinforcement learning framework evolves persistence diagrams on PD space for stochastic dynamics.

problem Stochastic modeling and evolution of persistence diagrams (PDs) for topological analysis.
method Reinforcement learning framework for PD space, evolving diagrams through topology-aware local edit operations.
result Established conditions for geometric ergodicity of Markov chains on PD space, yielding unique stationary laws.

Paper presents a method for estimating long-term PDs with incomplete data.

problem Estimating long-term PDs with limited and incomplete historical data.
method Single risk factor approach for simultaneous calibration of PDs across sub-portfolios.
result Method yields long-term PDs without requiring complete historical data.

A new tree-based estimator, FastPD, efficiently estimates PD functions for machine learning models.

problem Efficiently estimating Partial Dependence functions for machine learning models.
method Proposes a new tree-based estimator, FastPD, to estimate PD functions.
result FastPD consistently estimates the desired population quantity and improves complexity from quadratic to linear.

Study pro-pp completions of orientable PD_n groups, proving best results in three cases.

problem Understanding pro-pp completions of orientable PD_n groups.
method Examined four cases of orientable PD_3-groups and some PD_n groups (n≤5), providing examples and proving best results in three cases.
result Best results in three out of four cases of orientable PD_3-groups.

Paper proposes a simple method for deriving lifetime PD forecasts.

problem Deriving accurate lifetime PD forecasts with minimal data.
method Classical asset-based credit portfolio model with autoregressive process for systematic factor, Bayesian methodology for macroeconomic judgments.
result Endogenous derivation of lifetime PD forecasts without exogenous macroeconomic forecasts.

A new kernel for persistence diagrams using Sliced Wasserstein distance.

problem Incorporating persistence diagrams into machine learning pipelines.
method Proposes a new kernel for persistence diagrams based on the Sliced Wasserstein approximation of the Wasserstein distance, demonstrating its stability and discriminative power.
result The proposed kernel is stable and discriminative, outperforming existing kernels on various benchmarks.

Method predicts motor symptoms of Parkinson's disease from daily activities.

problem Objective monitoring of Parkinson's disease symptoms.
method Multi-layer Gaussian process models for three types of movement abnormalities.
result Strong agreement between model predictions and clinical annotations.

The paper classifies PD_4-complexes based on their fundamental group properties.

problem Understanding the structure of PD_4-complexes based on their fundamental group properties.
method Analyzing the fundamental group and its modules to classify PD_4-complexes.
result The classification of PD_4-complexes based on their fundamental group properties.

We define partial differential (PD in the following), i.e., field theoretic analogues of Hamiltonian systems on abstract symplectic manifolds and study their main properties, namely, PD Hamilton equations, PD Noether theorem, PD Poisson bracket, etc.. Unlike in standard multisymplectic approach to Hamiltonian field the…

2009-03-26abs ↗pdf ↗

In this paper we formalize a combinatorial object for describing link diagrams called a Planar Diagram Code. PD-codes are used by the KnotTheory Mathematica package developed by Bar-Natan, et al. We present the set of PD-codes as a stand alone object and discuss its relationship with link diagrams. We give an explicit …

2013-09-12abs ↗pdf ↗

Extends characterization of PD3PD_3-pairs with aspherical boundaries to those with spherical boundaries.

problem Characterizing fundamental triples of PD3PD_3-pairs with boundary components of different types.
method Extends Turaev and Bleile's work by relaxing the π1π_1-injectivity hypothesis and considering pairs with spherical boundary components.
result Characterization of fundamental triples for PD3PD_3-pairs with spherical boundary components and c.d.π1(P)2c.d.π_1(P)\leq2.

Paper exposes vulnerabilities in interpreting machine learning models using adversarial attacks on PD plots.

problem Vulnerability of permutation-based interpretation methods, particularly PD plots, to adversarial attacks.
method Adversarial framework to manipulate black-box models and produce deceptive PD plots.
result It is possible to hide discriminatory behaviors in machine learning models through interpretation tools like PD plots.

New framework for efficient PD averaging and clustering.

problem Challenges in averaging and clustering persistence diagrams.
method Reformulate PD metrics as optimal transport problems, leveraging recent computational advances.
result Scalable computations of PD barycenters and clustering on thousands of diagrams.

A model learns symptom-drug relations for PD patients.

problem Automatic prescription recommendation for Parkinson's Disease patients.
method Builds a dataset of PD symptoms and prescriptions, learns latent symptom space, uses alternating optimization.
result Effective in recommending suitable prescription drugs for new PD patients.

Unreduced PDs can perform similarly to reduced PDs in machine learning tasks.

problem Ignoring much of the information in persistence diagrams in machine learning pipelines.
method Developed methods to generate topological feature vectors from unreduced boundary matrices.
result Unreduced PDs can perform on par with, and sometimes outperform, fully-reduced PDs in machine learning tasks.

The study uses the Merton model to estimate PD and finds a phase transition affecting convergence speed.

problem Estimating the probability of default (PD) using limited historical data.
method Adopted the Merton model and analyzed phase transitions in default correlation.
result PD estimation converges slowly when temporal correlation decays by power law less than one.

Study extends Elkalla's work on subnormal subgroups to PD3PD_3-groups, but L2L^2-Betti numbers need verification.

problem Verifying L2L^2-Betti numbers for PD3PD_3-groups and group pairs.
method Algebraic arguments extending Elkalla's work, but reliant on unproven L2L^2-Betti number hypothesis.
result Need further research on L2L^2-Betti numbers for general PD3PD_3-groups.

The risk of a credit portfolio depends crucially on correlations between the probability of default (PD) in different economic sectors. Often, PD correlations have to be estimated from relatively short time series of default rates, and the resulting estimation error hinders the detection of a signal. We present statist…

2004-01-19abs ↗pdf ↗

Develops a PD estimation model using Lévy-driven processes for credit risk.

problem Estimating Probability of Default under new IFRS 9 regulations.
method Lévy-driven Ornstein-Uhlenbeck process with multiple latent variables, Integral Equation and PIDE formulation.
result Existence of weak and strong solutions for PD function, numerical schemes developed.

Scaff-PD improves fairness and robustness in federated learning with reduced communication.

problem Improving fairness and robustness in federated learning with limited communication.
method Scaff-PD uses a family of distributionally robust objectives and an accelerated primal dual algorithm with bias-corrected steps.
result Scaff-PD achieves significant gains in communication efficiency and convergence speed while maintaining fairness and robustness.

PD curve calibration refers to the transformation of a set of rating grade level probabilities of default (PDs) to another average PD level that is determined by a change of the underlying portfolio-wide PD. This paper presents a framework that allows to explore a variety of calibration approaches and the conditions un…

2012-12-15abs ↗pdf ↗

Model quantifies systemic risk in financial networks using PD and contagion mechanisms.

problem Underestimation of capital needed for financial system stability.
method Dynamic PD model combining credit risk techniques and contagion mechanism on network of exposures.
result Systemic risk statistics and node contributions revealed through loss distribution.

Paper solves open question about non-positive kernels by decomposing them into PD kernels.

problem Can non-positive definite kernels be decomposed into the difference of two positive definite kernels?
method Introduced signed measure to transform positive decomposition into measure decomposition, providing a sufficient and necessary condition.
result First random features algorithm for unbiased estimation of non-positive kernels.

The study examines Cox models for lifetime loan default risk, addressing biased estimates by incorporating recurrent events.

problem Ignoring recurrent default events in Cox models leads to biased and inaccurate PD estimates.
method Investigates and compares different Cox models (Andersen-Gill and Prentice-Williams-Peterson) for lifetime loan default risk.
result The Andersen-Gill model underperforms compared to the Prentice-Williams-Person model and the time to first default model.

We show that if XX is an indecomposable PD3PD_3-complex and π1(X)isthefundamentalgroupofareducedfinitegraphoffinitegroupsbutisnotvirtuallycyclicthenπ_1(X) is the fundamental group of a reduced finite graph of finite groups but is not virtually cyclic then Xisorientable,theunderlyinggraphisatree,alltheedgegroupsare is orientable, the underlying graph is a tree, all the edge groups are Z/2Zandallbutatmostoneofthevertexgroupsisdihedraloforder and all but at most one of the vertex groups is dihedral of order 2m…

2008-08-13abs ↗pdf ↗

A new model SIPS improves graph embedding by approximating non-PD similarities.

problem Improving neural network-based graph embedding by approximating non-positive definite similarities.
method Shifted Inner Product Similarity (SIPS) model that approximates Conditionally Positive Definite (CPD) similarities.
result SIPS significantly improves graph embedding without configuring the similarity function.

Intuitively, the default risk of a single borrower is higher when her or his assets and debt are denominated in different currencies. Additionally, the default dependence of borrowers with assets and debt in different currencies should be stronger than in the one-currency case. By combining well-known models by Merton …

2007-12-20abs ↗pdf ↗

Machine learning classifies Parkinson's Disease stages from walker sensors data.

problem Limited cost-effective methods for quantitatively assessing Parkinson's Disease stages.
method Machine learning applied to walker-mounted sensors data, feature selection methods compared.
result Feature selection method using ANOVA provides similar accuracy to full feature set and is clinically interpretable.

Machine learning aids in diagnosing Parkinson's disease with higher accuracy.

problem Subjectivity in traditional PD diagnosis methods and missed early symptoms.
method Machine learning applied to various data modalities for PD and control group classification.
result Machine learning methods show high potential for improving PD diagnosis.

A new model reduces rating transition matrix estimation errors for small portfolios.

problem Estimating rating transition matrices for small portfolios leads to unreliable and unstable predictions.
method A sparse structural model with three parameters that assumes an autoregressive mean-reverting ability-to-pay process.
result The model produces well-behaved transition probabilities, reducing statistical degrees of freedom and improving reliability.

Unified framework detects changes in complex system models.

problem Accurate identification of dynamic changes in simulation models.
method Combines machine learning and process-driven simulation modeling.
result Significantly improves change point detection accuracy.