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

Trend · papers per month

59117176234 · Jun 202019922001200920172026
48 results for KS statistic

Proposes a framework to explain KS deterioration in credit risk models.

problem Inconsistent and ad hoc diagnosis of KS decline in credit risk models.
method Counterfactual diagnostic framework attributing KS decline to sampling variability, portfolio composition, covariate shift, and residual deterioration.
result The proposed approach provides more interpretable and governance-relevant explanations than threshold-based review alone.

We present an extension of the Kolmogorov-Smirnov (KS) two-sample test, which can be more sensitive to differences in the tails. Our test statistic is an integral probability metric (IPM) defined over a higher-order total variation ball, recovering the original KS test as its simplest case. We give an exact representer…

2019-03-24abs ↗pdf ↗

The paper examines the stability of binary choice models using Gini index and scoring indicators.

problem Stability and discriminatory power of binary choice models.
method Derives the real Gini index and incorporates PSI and KS statistics into the model.
result The real Gini index should be less than the calculated Gini index when the population distribution changes.

The statistical properties of the return intervals τqτ_q between successive 1-min volatilities of 30 liquid Chinese stocks exceeding a certain threshold qq are carefully studied. The Kolmogorov-Smirnov (KS) test shows that 12 stocks exhibit scaling behaviors in the distributions of τqτ_q for different thresholds qq. …

2008-07-11abs ↗pdf ↗

The paper introduces a new method to detect rough volatility and market states using fractional derivatives.

problem Testing self-similarity in fractional processes from a single observed trajectory is difficult under long-range dependence.
method The paper introduces a regime-adaptive KS/GL--KS framework based on the discrete Grünwald--Letnikov (GL) fractional derivative.
result The method detects rough volatility and persistent, anti-persistent, or efficient market states in financial applications.

We study the statistical properties of the recurrence intervals ττ between successive trading volumes exceeding a certain threshold qq. The recurrence interval analysis is carried out for the 20 liquid Chinese stocks covering a period from January 2000 to May 2009, and two Chinese indices from January 2003 to April 2…

2010-02-06abs ↗pdf ↗

Estimates Hurst exponent of log-volatility using KS statistic, addressing serial correlation in financial data.

problem Estimating Hurst exponent of log-volatility in financial time series with serial correlation.
method Proposes a random permutation procedure to remove serial correlation, using the Kolmogorov-Smirnov statistic for distribution-based estimation.
result Establishes the asymptotic variance of the estimator and reveals statistically significant hierarchy of roughness in volatility measures.

New findings support a new community recovery threshold for Stochastic Block Model with many communities.

problem Recovering communities in Stochastic Block Model with more than sqrt(n) communities.
method Counting specific motifs to achieve polynomial-time community recovery above a new threshold.
result LDP fails below the new threshold, but polynomial-time recovery is possible above it.

KSKS-algebra consists of expressions constructed with four kinds operations, the minimum, maximum, difference and additively homogeneous generalized means. Five families of ZZ-classifiers are investigated on binary classification tasks between English phonemes. It is shown that the classifiers are able to reflect well…

2013-02-25abs ↗pdf ↗

New algorithm detects communities near KS threshold with optimal rate, even in noisy conditions.

problem Community detection in symmetric stochastic block models with noisy data.
method Polynomial-time algorithm using Sum-of-Squares framework and robust majority voting.
result Achieves minimax-optimal misclassification rate near Kesten-Stigum threshold, even with node corruption.

SurvLIME-KS improves survival model explanations robustly.

problem Improving explanations of unreliable survival models.
method SurvLIME-KS combines Cox proportional hazards model and Kolmogorov-Smirnov bounds for robust optimization.
result SurvLIME-KS minimizes average distance and maximizes distance in approximating cumulative hazard functions.

This the first in a series of papers whose ultimate goal is to establish the full nonlinear stability of the Kerr family for am|a|\ll m. The paper builds on the strategy laid out in \cite{KS} in the context of the nonlinear stability of Schwarzschild for axially symmetric polarized perturbations. In fact the central id…

2019-11-02abs ↗pdf ↗

Synthetic data improves credit scoring models' performance without compromising borrower privacy.

problem Scarcity of real data for credit scoring models due to privacy concerns.
method Privacy-preserving training with synthetic data.
result Credit scoring models trained with synthetic data show a reduction of 3% in AUC and 6% in KS compared to real data models.

We stabilize the Kumaraswamy distribution for efficient sampling and differentiation.

problem Numerical instabilities in the Kumaraswamy distribution's inverse CDF and log-pdf.
method Identified and resolved numerical issues, introduced a stabilized KS distribution.
result Stabilized Kumaraswamy distribution supports efficient sampling and differentiation.

The paper introduces a spline-based method for calibrating neural networks.

problem Ensuring neural network outputs are reliable for safety-critical applications.
method Approximating the empirical cumulative distribution function using splines to map network outputs to calibrated probabilities.
result The spline-based recalibration consistently outperforms existing methods on calibration measures.

In this paper, we prove that Kähler-Ricci flow converges to a Kähler-Einstein metric (or a Kähler-Ricci soliton) in the sense of Cheeger-Gromov as long as an initial Kähler metric is very closed to gKEg_{KE} (or gKSg_{KS}) if a compact Kähler manifold with c1(M)>0c_1(M)>0 admits a Kähler Einstein metric gKEg_{KE} (or a Kähler-…

2009-08-11abs ↗pdf ↗

Generative models speed up complex system simulations.

problem Accurately forecasting the dynamics of complex systems at reduced cost.
method Generative Learning of Effective Dynamics (G-LED) using auto-regressive attention and Bayesian diffusion models.
result Generative models can accurately forecast complex system dynamics at lower computational cost.

A graph is intrinsically knotted if every embedding contains a knotted cycle. It is known that intrinsically knotted graphs have at least 21 edges and that the KS graphs, K7K_7 and the 13 graphs obtained from K7K_7 by Y\nabla Y moves, are the only minor minimal intrinsically knotted graphs with 21 edges. This set incl…

2014-11-07abs ↗pdf ↗

The paper identifies conditions for free circle actions on specific 7-manifolds.

problem Determining conditions for free circle actions on certain 7-manifolds.
method Analyzing specific 7-manifolds and their components.
result Identifies conditions for free circle actions on kS2imesS5#lS3imesS4#ΣkS^{2} imes S^{5}\#lS^{3} imes S^{4}\#Σ.

The paper classifies vacuum static spaces with harmonic curvature.

problem Classifying vacuum static spaces with harmonic curvature.
method Extending the 4-dimensional work by Kim-Shin, the paper classifies nn-dimensional spaces (n5n\geq 5).
result New counterexamples to the Fischer-Marsden conjecture on compact vacuum static spaces.

New findings on community recovery in SBM with many communities.

problem Determining community recovery conditions in SBM with more than sqrt(n) communities.
method Constructing motifs and counting them to prove community recovery above the proposed threshold.
result Proving community recovery above the proposed threshold in SBM with K >= sqrt(n) communities.

We study the low-regularity (in-)extendibility of spacetimes within the synthetic-geometric framework of Lorentzian length spaces developed in [KS:17]. To this end, we introduce appropriate notions of geodesics and timelike geodesic completeness and prove a general inextendibility result. Our results shed new light on …

2018-04-27abs ↗pdf ↗

A new UU-test decides unimodality of datasets.

problem Deciding on the unimodality of a dataset for better data analysis.
method UU-test operates on the empirical cumulative density function (ecdf) to build a piecewise linear approximation that models the data as a Uniform Mixture Model.
result The UU-test provides a statistical model of the data in the form of a Uniform Mixture Model.

We perform return interval analysis of 1-min {\em{realized volatility}} defined by the sum of absolute high-frequency intraday returns for the Shanghai Stock Exchange Composite Index (SSEC) and 22 constituent stocks of SSEC. The scaling behavior and memory effect of the return intervals between successive realized vola…

2009-04-07abs ↗pdf ↗

Study generalizes Möbius energy to non-smooth sets in arbitrary dimensions.

problem Investigate Möbius-invariant energies on non-smooth subsets of arbitrary dimensions.
method Show local finite energy implies embedded Lipschitz submanifold, and low fractional Sobolev regularity guarantees finite energy.
result Local graph structure of low fractional Sobolev regularity on a set is sufficient to guarantee finite energy.

A new method combines federated learning and logistic regression for better credit scoring.

problem Improving credit scoring models while protecting data privacy.
method Projected gradient-based vertical federated learning (FL-LRBC) for logistic regression.
result Significant improvement in AUC and KS statistics due to data enrichment.

The paper improves reinforcement learning by estimating return distributions efficiently.

problem Estimating the complete return distribution in reinforcement learning.
method Distributional policy evaluation using the certainty-equivalence method.
result The method provides sample-efficient estimation of return distributions.

Efficiently recovers data corrupted by adversarial noise in structured settings.

problem Recovering clean data points from corrupted Gaussian data with low-rank noise and adversarial coordinate corruptions.
method Developed an efficient algorithm using a combinatorial approach to analyze Basis Pursuit (BP) method.
result Achieved nearly-optimal recovery of data points up to a ildeO(ks/d) ilde O(ks/d) error bound.

The aim of this paper is to extend the notion of pseudo harmonic morphism (introduced by Loubeau \cite {Lo}) to the case when the source manifold is an admissible Riemannian polyhedron. We define these maps to be harmonic in the sense of Eells-Fuglede \cite {EF} and pseudo-horizontally weakly conformal in our sense (se…

2004-09-28abs ↗pdf ↗

In the present paper we discuss an independent on the Grothendieck-Sato isomorphism approach to the Riemann-Roch-Hirzebruch formula for an arbitrary differential operator. Instead of the Grothendieck-Sato isomorphism, we use the Topological Quantum Mechanics (more or less equivalent to the well-known constructions with…

2004-01-28abs ↗pdf ↗

Novel autoencoder method approximates Koopman operator in low dimensions.

problem Challenges in approximating finite Koopman operators using data-driven methods.
method Mori-Zwanzig autoencoder (MZ-AE) for robust Koopman operator approximation.
result Improved predictive capability and robust long-term statistical performance.

We compare the star surgery operations introduced in [KS] to the generalized rational blow-down. We show that star surgery shares the properties that make rational blow-down useful for constructions of small exotic symplectic 4-manifolds. Then we show that star surgery operations provide a strictly more general class o…

2014-07-11abs ↗pdf ↗