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

285785113 · May 202619922001200920172026
48 results for Pearson diffusion

Study benchmarks TSC algorithms in distinguishing diffusions using the likelihood ratio test.

problem Benchmarking optimality of TSC algorithms in distinguishing diffusion processes.
method Proposes to benchmark TSC algorithms using the likelihood ratio test (LRT).
result LRT benchmarks are computationally efficient and can be applied to various time series types.

We compute exact values respectively bounds of "distances" - in the sense of (transforms of) power divergences and relative entropy - between two discrete-time Galton-Watson branching processes with immigration GWI for which the offspring as well as the immigration is arbitrarily Poisson-distributed (leading to arbitra…

2010-05-20abs ↗pdf ↗

A novel unified Bayesian framework for network detection is developed, under which a detection algorithm is derived based on random walks on graphs. The algorithm detects threat networks using partial observations of their activity, and is proved to be optimum in the Neyman-Pearson sense. The algorithm is defined by a …

2013-11-21abs ↗pdf ↗

The paper extends Pearson correlation to multi-variables, useful for noise measurement and feature selection.

problem The standard Pearson correlation coefficient is limited to two variables and doesn't meet the needs for multi-variable analysis.
method The authors use random matrix theory to extend Pearson's correlation coefficient to an arbitrary number of variables.
result The extended correlation coefficient is useful for gauging noise and selecting features, particularly in classification.

Model predicts epileptic seizures with high accuracy using EEG signals.

problem Predicting epileptic seizures with high accuracy for diagnosis and treatment.
method Pearson's product-moment correlation coefficient with a linear classifier on generalized Gaussian modeling.
result 100% effectiveness for sensitivity and specificity greater than 83%.

Adapts Neyman-Pearson classification for both source and target distribution shifts.

problem Minimizing errors while controlling both Type-I and Type-II errors under distribution shifts.
method Derives an adaptive procedure that guarantees improved error rates and adapts to uninformative sources.
result Automatic adaptation to uninformative sources avoids negative transfer.

Combines cost-sensitive and Neyman-Pearson paradigms for better binary classification.

problem Asymmetric binary classification problems with unequal error severities.
method Develops TUBE-CS algorithm to bridge cost-sensitive and Neyman-Pearson paradigms.
result High-probability control of population type I error.

New RDPC dissimilarity measure improves time series clustering.

problem Improving time series clustering methods for diverse data.
method Combining weighted Pearson correlation with largest element-wise differences.
result RDPC outperforms existing methods in complex datasets.

Characterizes distribution-free rates in unbalanced classification problems.

problem Minimizing error under two different distributions in unbalanced settings.
method Characterizes minimax rates over all pairs of distributions using a geometric condition.
result Identifies a dichotomy between hard and easy classes based on a three-points-separation condition.

This study uses local Gaussian correlation to analyze stock return tails, revealing more sensitive network properties.

problem Misleading results from Pearson correlation in financial networks.
method Local Gaussian correlation coefficient for capturing nonlinear dependence and heavy-tailed distributions.
result Local Gaussian correlation network among negative tails is more sensitive to stock market risks.

The Pearson distance between a pair of random variables X,YX,Y with correlation ρxyρ_{xy}, namely, 1-ρxyρ_{xy}, has gained widespread use, particularly for clustering, in areas such as gene expression analysis, brain imaging and cyber security. In all these applications it is implicitly assumed/required that the distance …

2019-08-15abs ↗pdf ↗

The paper tackles Neyman-Pearson classification control issues.

problem Neyman-Pearson classification's control constraint is hard to satisfy in finite samples.
method Developed refined learning procedures under two accuracy control strategies.
result Proposed methods achieve desired control levels in finite samples.

USP test improves on Pearson's chi-squared and GG-test for independence.

problem Deficiencies in Pearson's chi-squared and GG-test for independence.
method USP test based on UU-statistic estimator of population dependence measure.
result USP test controls size, handles small cell counts, and detects minimal violations of independence.

Unified framework for Bayes-optimal classifiers under group fairness.

problem Mitigating disparate impacts from algorithmic predictions in high-stakes decision-making.
method Unified framework based on Neyman-Pearson argument for deriving Bayes-optimal classifiers under group fairness constraints.
result Proposes FairBayes method that directly controls disparity and achieves optimal fairness-accuracy tradeoff.

Develops NPMC method for noisy labels, improving multiclass classification accuracy.

problem Asymmetric misclassification costs and label noise in multiclass classification.
method Empirical likelihood approach using exponential tilting density ratio model.
result Root n consistent and asymptotically normal estimators for clean labels and noise mechanism.

Develops algorithms for multi-class Neyman-Pearson classification with cost sensitivity.

problem Asymmetric misclassification costs in multi-class classification problems.
method Establishes connection with cost-sensitive learning, proposes two algorithms, extends NP oracle properties.
result Proposes algorithms with theoretical guarantees for multi-class Neyman-Pearson classification.

The paper develops approximations for Pearson's chi-square statistic and applies them to confidence intervals.

problem Finding confidence intervals for strictly convex functions of discrete distribution weights.
method Non-asymptotic local normal approximation for multinomial probabilities, deriving bounds and coupling inequalities.
result Developed methods to find confidence intervals for negative entropy of discrete distributions.

Most existing binary classification methods target on the optimization of the overall classification risk and may fail to serve some real-world applications such as cancer diagnosis, where users are more concerned with the risk of misclassifying one specific class than the other. Neyman-Pearson (NP) paradigm was introd…

2015-08-13abs ↗pdf ↗

Enhanced metrics for multiclass classification improve on existing methods.

problem Lack of decisive poor classification results in existing multiclass metrics.
method Introduces three new metrics derived from multivariate Pearson correlation coefficients.
result New metrics decisively indicate poor classification results.

A large body of research into semantic textual similarity has focused on constructing state-of-the-art embeddings using sophisticated modelling, careful choice of learning signals and many clever tricks. By contrast, little attention has been devoted to similarity measures between these embeddings, with cosine similari…

2019-05-19abs ↗pdf ↗

Stock price movement reveals complex interdependencies that are simplified through linear correlation.

problem Exploring the spectral dynamics of the Indonesian capital market using structural network representations.
method Combining three dependency estimators (Pearson, MI adaptive binning, and MI-kNN) with two graph filtering schemes (MST and PMFG) and four community decoders.
result MI adaptive binning is shown to be more proportional than kNN for detecting residual information.

A neural network for online NP classification with reduced complexity.

problem Online nonlinear Neyman-Pearson classification.
method Single hidden layer feedforward neural network (SLFN) initialized with random Fourier features (RFFs). Uses stochastic gradient descent for sequential learning.
result Expedited online adaptation and powerful nonlinear Neyman-Pearson modeling.

This paper uses rank correlation methods to construct MSTs from financial returns, finding them more stable and robust.

problem Stability and robustness of MSTs constructed from financial correlation matrices.
method Pearson, Spearman, and Kendall's ττ rank correlation methods applied to daily financial returns.
result Rank MSTs are more stable and robust than MSTs constructed using Pearson correlation.

The paper studies statistical properties of CART regression trees.

problem Understanding the statistical properties of CART regression trees.
method The paper constructs a prior distribution on split points and solves a nonlinear optimization problem to bound the Pearson correlation between the optimal decision stump and response data.
result CART with cost-complexity pruning achieves an optimal complexity/goodness-of-fit tradeoff when the depth scales with the logarithm of the sample size.

Motivated by problems of anomaly detection, this paper implements the Neyman-Pearson paradigm to deal with asymmetric errors in binary classification with a convex loss. Given a finite collection of classifiers, we combine them and obtain a new classifier that satisfies simultaneously the two following properties with …

2011-02-28abs ↗pdf ↗

Optimal selective classification using likelihood ratios improves model reliability.

problem Enhancing predictive model reliability by allowing uncertain predictions.
method Neyman--Pearson lemma applied to likelihood ratios for optimal selection.
result Neyman--Pearson-informed methods outperform existing baselines under covariate shifts.

Paper establishes a formula linking model performance to insurance loss ratio.

problem Improving model performance does not always lead to proportional improvements in loss ratio.
method Derives a closed-form formula connecting Pearson correlation to expected loss ratio.
result Model improvements have diminishing marginal returns in reducing loss ratio.

The gain-loss asymmetry, observed in the inverse statistics of stock indices is present for logarithmic return levels that are over 2%2\%, and it is the result of the non-Pearson type auto-correlations in the index. These non-Pearson type correlations can be viewed also as functionally dependent daily volatilities, ext…

2016-08-16abs ↗pdf ↗

Network analysis reveals changing cryptocurrency market leaders.

problem Understanding evolving cryptocurrency market leaders and their influence.
method Hourly-resolution data and Kendall's Tau correlation for network analysis.
result Pearson's correlation underestimates market dynamics; FTT and FTX were key during the 2021 bull run.

In the problem of domain adaptation for binary classification, the learner is presented with labeled examples from a source domain, and must correctly classify unlabeled examples from a target domain, which may differ from the source. Previous work on this problem has assumed that the performance measure of interest is…

2018-10-03abs ↗pdf ↗

Recently the interest of researchers has shifted from the analysis of synchronous relationships of financial instruments to the analysis of more meaningful asynchronous relationships. Both of those analyses are concentrated only on Pearson's correlation coefficient and thus intraday lead-lag relationships associated wi…

2014-02-16abs ↗pdf ↗