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

255176101 · Jun 202019922001200920172026
48 results for Spearman correlation

New Hermite series estimator for Spearman rank correlation in non-stationary data.

problem Estimating time-varying Spearman rank correlation efficiently.
method Hermite series based sequential estimator for both stationary and non-stationary settings.
result Competitive performance compared to existing algorithms in simulations and real data.

We study the problem of rank aggregation: given a set of ranked lists, we want to form a consensus ranking. Furthermore, we consider the case of extreme lists: i.e., only the rank of the best or worst elements are known. We impute missing ranks by the average value and generalise Spearman's ρto extreme ranks. Our main …

2014-10-16abs ↗pdf ↗

Standardizes weighted ranking correlation coefficients to maintain zero expected value.

problem Measuring correlation between weighted rankings of items.
method Develops a standardization function g(·) that transforms coefficients to zero expected value under randomness.
result A general standardization function g(Γ) that preserves the domain [-1,1] and reduces to the identity for coefficients already satisfying zero-expected-value property.

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.

Study examines stock price correlations between Indonesian holding companies and their subsidiaries.

problem Understanding stock price relationships between holding companies and their subsidiaries.
method Spearman correlation analysis over 2013-2022, focusing on MNC Group and Emtek Group.
result Varying degrees of correlation between holding companies and their subsidiaries, with some showing inverse relationships.

A new sparse benchmark metabench identifies key abilities from large benchmarks.

problem Redundancy and compression in existing benchmarks.
method Data from 5000+ LLMs to identify most informative items, distilling a sparse benchmark.
result Sparse benchmark metabench captures underlying abilities with high accuracy.

ChatGPT predicts stock market movements based on Bloomberg headlines, showing a positive correlation over short to medium terms.

problem Predicting stock market movements using news headlines.
method Used a two-stage prompt approach with a dataset of Bloomberg market summaries from 2010 to 2023.
result ChatGPT's sentiment scores correlate positively with future equity market returns over short to medium terms, with a negative correlation over longer horizons.

Nonparametric correlations such as Spearman's rank correlation and Kendall's tau correlation are widely applied in scientific and engineering fields. This paper investigates the problem of computing nonparametric correlations on the fly for streaming data. Standard batch algorithms are generally too slow to handle real…

2017-12-05abs ↗pdf ↗

This paper fills in local bounds for Spearman's footrule and Gini's gamma measures of association.

problem Local bounds for bivariate copulas with respect to Spearman's footrule and Gini's gamma measures.
method Computing quasi-copulas that are not copulas for certain values of the measures.
result Presented local bounds for Spearman's footrule and Gini's gamma measures.

Novel fusion of autoencoders predicts sleepiness from speech.

problem Predicting sleepiness from speech recordings.
method Attention-based and recurrent sequence to sequence autoencoders for unsupervised representation learning.
result Fusion of autoencoders' representations achieves higher correlation with sleepiness scales.

Developers of text-to-speech synthesizers (TTS) often make use of human raters to assess the quality of synthesized speech. We demonstrate that we can model human raters' mean opinion scores (MOS) of synthesized speech using a deep recurrent neural network whose inputs consist solely of a raw waveform. Our best models …

2016-11-28abs ↗pdf ↗

We propose a semiparametric approach, named nonparanormal skeptic, for estimating high dimensional undirected graphical models. In terms of modeling, we consider the nonparanormal family proposed by Liu et al (2009). In terms of estimation, we exploit nonparametric rank-based correlation coefficient estimators includin…

2012-06-27abs ↗pdf ↗

This paper proposes a new class of copulas which characterize the set of all twice continuously differentiable copulas. We show that our proposed new class of copulas is a new generalized copula family that include not only asymmetric copulas but also all smooth copula families available in the current literature. Spea…

2012-10-08abs ↗pdf ↗

We investigate the relative information content of six measures of dependence between two random variables XX and YY for large or extreme events for several models of interest for financial time series. The six measures of dependence are respectively the linear correlation ρv+ρ^+_v and Spearman's rho ρs(v)ρ_s(v) conditio…

2002-03-07abs ↗pdf ↗

Proposes clustering as a new evaluation method for clinical knowledge embedding.

problem Traditional Link Prediction evaluation protocol loses information and harms model accuracy.
method Proposes Clustering Evaluation Protocol as an alternative.
result Experimental results show the proposed protocol can potentially replace Link Prediction.

This paper proves a generalization bound for complex-valued neural networks scaling with spectral complexity.

problem Ensuring the performance of complex-valued neural networks on unseen data.
method Theoretical derivation using Maurey Sparsification Lemma and Dudley Entropy Integral, empirical validation on various datasets.
result The spectral complexity of weight matrices is a significant factor in the generalization ability of complex-valued neural networks.

Forest tree species mapped with high accuracy using satellite data.

problem Classifying dominant tree species in Swedish forests.
method Extreme gradient boosting model with Bayesian optimization, combining Sentinel-1/2 satellite data and field observations.
result Overall accuracy of 85%, F1 score of 0.82, Matthews correlation coefficient of 0.81.

Paper proposes Coalitional BAE to improve explainability of unsupervised deep learning models.

problem Improving explainability of Autoencoder's predictions.
method Introduces Coalitional BAE, inspired by agent-based system theory, to reduce correlation in explanations.
result Improved quality of explanations using Coalitional BAE on publicly available datasets.

Several tasks in machine learning are evaluated using non-differentiable metrics such as mean average precision or Spearman correlation. However, their non-differentiability prevents from using them as objective functions in a learning framework. Surrogate and relaxation methods exist but tend to be specific to a given…

2019-04-08abs ↗pdf ↗

We introduce a new family of minmax rank aggregation problems under two distance measures, the Kendall τ and the Spearman footrule. As the problems are NP-hard, we proceed to describe a number of constant-approximation algorithms for solving them. We conclude with illustrative applications of the aggregation methods on…

2017-01-28abs ↗pdf ↗

New method for robust financial portfolio analysis.

problem Challenges in modeling financial portfolio dependence structure.
method Nonparametric Angles-based Correlation (NAbC) method.
result Valid inferences and flexible scenarios for portfolio analysis.

In this paper, we propose a semiparametric approach, named nonparanormal skeptic, for efficiently and robustly estimating high dimensional undirected graphical models. To achieve modeling flexibility, we consider Gaussian Copula graphical models (or the nonparanormal) as proposed by Liu et al. (2009). To achieve estima…

2012-02-10abs ↗pdf ↗

Eliciting semantic similarity between concepts in the biomedical domain remains a challenging task. Recent approaches founded on embedding vectors have gained in popularity as they risen to efficiently capture semantic relationships The underlying idea is that two words that have close meaning gather similar contexts. …

2018-11-28abs ↗pdf ↗

Study detects SLI in children from spontaneous narrative transcripts.

problem Detecting Specific Language Impairment (SLI) in children.
method Three-stage pipeline: feature extraction, dimensionality reduction, and classification.
result 97.13% accuracy in identifying SLI from transcripts.

Paper introduces differentiable sorting and ranking with O(nlogn)O(n \log n) time complexity.

problem Non-differentiability of sorting and ranking operations in machine learning.
method Differentiable proxies constructed as projections onto the permutahedron and reduction to isotonic optimization.
result First differentiable sorting and ranking operators with O(nlogn)O(n \log n) time and O(n)O(n) space complexity.

Unified framework detects overfitting in crash classification models.

problem Evaluation metrics fail to detect overfitting in crash classification models.
method Random Matrix Theory and Heavy-Tailed Self-Regularization framework applied to various model types.
result Power-law exponent α reliably distinguishes well-regularized from overfit models.

Improved DeepONet variants using Transformer cross-conditioning enhance PDE solution efficiency.

problem Solving partial differential equations efficiently and accurately.
method Transformer-inspired DeepONet variants with bidirectional cross-conditioning.
result Improved efficiency and accuracy compared to modified DeepONet, with variant effectiveness tied to PDE characteristics.

New method evaluates AI stock prediction systems based on decision-making processes.

problem Lack of evaluation for AI systems' decision-making processes.
method Scores intermediate decision process using large language models and closed-loop reinforcement learning feedback.
result Composite behavioral score correlates with Sharpe ratio and reduces prediction error.

NLR models often perform worse than LR for outlying input data in environmental sciences.

problem NLR models often give poor predictions for input data outside the training domain.
method Screened input data for outliers, using linear extrapolation for outliers based on NLR within the non-outlier domain.
result NLROR_{\mathrm{OR}} approach reduces poor extrapolation and tends to outperform NLR and LR for outliers.

The paper introduces a framework to select efficient datasets for preserving model rankings.

problem Efficient evaluation of machine learning models on small, representative datasets.
method Bootstrap aggregation, clustering, design criteria, random baselines, and greedy farthest-first (FAFI).
result Several selection strategies improve rank preservation compared to random subsets, especially in time series classification.

Paper introduces MVS to detect non-Markovian observations in reinforcement learning.

problem Real-world sensors violate Markov property, leading to suboptimal reinforcement learning performance.
method Uses prediction-based Markov Violation Score (MVS) combining random forest and ridge regression.
result MVS detects non-Markovian structure in observation trajectories, quantifying its impact.

A geometric account explains why 'The Dress' is ambiguous, predicting observable signatures in image processing.

problem Understanding and predicting ambiguity in image processing, particularly in intrinsic image decomposition.
method Geometric analysis of intrinsic image decomposition, focusing on the discontinuous switch in prior-mode sections.
result Predicted signatures in albedo Jacobian and Fernet curvature can be observed in various models and datasets.