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

60119179238 · Jun 202019922001200920172026
48 results for Pearson's statistic

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.

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.

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.

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.

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.

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.

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.

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 ↗

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 ↗

This paper examines autocorrelation in major crypto markets, finding persistent correlations on short time frames.

problem Assessing the efficiency of major cryptocurrency markets through autocorrelation analysis.
method Pearson's autocorrelation coefficient, Ljung-Box test, rolling window analysis.
result Persistent autocorrelation on 5m and 1H time frames, disagreement on 1D and 1W time frames.

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.

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 ↗

The paper analyzes skewness and kurtosis measures for skew-elliptical distributions.

problem Examining skewness and kurtosis measures for skew-elliptical distributions.
method Deriving exact expressions for skewness and kurtosis measures for skew-elliptical distributions, constructing test statistics, and comparing measures through simulations and real data analysis.
result Exact expressions and test statistics for skewness and kurtosis measures for various skew-elliptical distributions.

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%.

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.

Paper introduces an online method for estimating the difference between two probability distributions.

problem Estimating the difference between two probability density functions using available data.
method Non-parametric online likelihood-ratio estimation using Pearson-divergence functional minimization.
result The proposed method provides efficient online updates and theoretical guarantees for performance.

A new method reduces feature screening cost from O(np)O(np) to O(np)O(\sqrt{n}p).

problem Eliminating non-informative features in ultrahigh-dimensional datasets.
method Adaptive subsampling method based on multi-armed bandit problem.
result The proposed method retains sure screening property and comparable performance to SIS.

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.

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 ↗

Paper optimizes statistical estimation for randomized smoothing to reduce adversarial robustness certification time.

problem Efficiently estimating robustness of points against adversarial attacks.
method Developed estimation procedures using confidence sequences and randomized Clopper-Pearson intervals.
result Achieved optimal sample complexities and stronger certificates with reduced computational burden.

Identifying statistical dependence between the features and the label is a fundamental problem in supervised learning. This paper presents a framework for estimating dependence between numerical features and a categorical label using generalized Gini distance, an energy distance in reproducing kernel Hilbert spaces (RK…

2019-06-05abs ↗pdf ↗

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.

Unified platform for statistical and machine learning in bioinformatics.

problem Workflow inefficiencies in using multiple tools for data analysis.
method Automated hyperparameter optimization, feature importance analysis, statistical tests.
result Accelerates biological discovery workflows with methodological soundness.

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.

Empirical evidence is given for a significant difference in the collective trend of the share prices during the stock index rising and falling periods. Data on the Dow Jones Industrial Average and its stock components are studied between 1991 and 2008. Pearson-type correlations are computed between the stocks and avera…

2010-05-03abs ↗pdf ↗

The statistical analysis of discrete data has been the subject of extensive statistical research dating back to the work of Pearson. In this survey we review some recently developed methods for testing hypotheses about high-dimensional multinomials. Traditional tests like the χ2χ^2 test and the likelihood ratio test ca…

2017-12-17abs ↗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 ↗