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

Trend · papers per month

1234 · Oct 201919922001200920172026
48 results for Kendall's $τ$

New estimators reduce computation for Kendall's tau and conditional Kendall's tau matrices under structural assumptions.

problem Efficient estimation of Kendall's tau and conditional Kendall's tau matrices for large dimensions.
method Averaging pairwise estimates over blocks or conditional estimates, exploiting structural assumptions.
result Improved estimators with reduced computational cost and similar error level.

Kendall transformation converts continuous data into categorical vectors for robust information theory.

problem Handling small number of observations and preserving ranking in continuous data.
method Kendall transformation converts ordered features into categorical vectors of pairwise order relations.
result Kendall transformation makes information theory methods applicable to continuous data robustly.

We propose new positive definite kernels for permutations. First we introduce a weighted version of the Kendall kernel, which allows to weight unequally the contributions of different item pairs in the permutations depending on their ranks. Like the Kendall kernel, we show that the weighted version is invariant to rela…

2018-02-23abs ↗pdf ↗

Improved portfolio optimization using Kendall-like correlation coefficients.

problem Accurate estimation of eigenvectors in data-poor regimes for portfolio optimization.
method Developed generalized correlation coefficients based on Kendall's rank correlation.
result Markowitz portfolios with lower out-of-sample risk using these coefficients.

A new algorithm for parallel transport on shape spaces is presented and compared to existing methods.

problem Statistical analysis of shape data, especially in time series and optimization.
method Pole ladder algorithm for parallel transport on Kendall shape spaces, compared to integration methods.
result The pole ladder algorithm is a more efficient method for parallel transport.

We show how the problem of estimating conditional Kendall's tau can be rewritten as a classification task. Conditional Kendall's tau is a conditional dependence parameter that is a characteristic of a given pair of random variables. The goal is to predict whether the pair is concordant (value of 11) or discordant (val…

2018-06-23abs ↗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 ↗

Permutation-valued features arise in a variety of applications, either in a direct way when preferences are elicited over a collection of items, or an indirect way in which numerical ratings are converted to a ranking. To date, there has been relatively limited study of regression, classification, and testing problems …

2016-03-25abs ↗pdf ↗

High-dimensional data models, often with low sample size, abound in many interdisciplinary studies, genomics and large biological systems being most noteworthy. The conventional assumption of multinormality or linearity of regression may not be plausible for such models which are likely to be statistically complex due …

2008-05-21abs ↗pdf ↗

Study measures uncertainty in MST identification across different correlation networks.

problem Uncertainty in MST identification across various correlation-based market networks.
method Developed a framework using random variable networks (RVN) to measure uncertainty of MST identification.
result FDR is the most appropriate measure for MST identification reliability.

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 ↗

Framework clusters noisy MTS with robust fuzzy clustering, improving accuracy over existing methods.

problem Challenges in clustering multivariate time series due to non-stationary dependencies, noise, and state boundaries.
method Spectral fuzzy clustering using Kendall's tau-based canonical coherence for frequency-specific monotonic relationships.
result Framework outperforms existing methods in clustering noisy, high-dimensional MTS.

Study eigenvalue estimates on Kähler and quaternion Kähler manifolds.

problem Estimating first eigenvalues in Kähler and quaternion Kähler manifolds.
method Using Kendall-Cranston coupling to analyze eigenvalues.
result Eigenvalue estimates in terms of dimension, diameter, and curvature.

In this paper we develop the theory of parametric polynomial regression in Riemannian manifolds and Lie groups. We show application of Riemannian polynomial regression to shape analysis in Kendall shape space. Results are presented, showing the power of polynomial regression on the classic rat skull growth data of Book…

2012-01-11abs ↗pdf ↗

We construct short retractions of a CAT(1) space to its small convex subsets. This construction provides an alternative geometric description of an analytic tool introduced by Wilfrid Kendall. Our construction uses a tractrix flow which can be defined as a gradient flow for a family of functions of certain type. In an …

2020-02-22abs ↗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.

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.

New method for summarizing ranking distributions using consensus ranking distributions.

problem Summarizing ranking distributions efficiently and accurately.
method Introducing consensus ranking distributions and a top-down tree-structured statistical algorithm.
result Optimal distortion can be expressed as a function of pairwise probabilities, enabling efficient learning methods.

IGNIS uses neural networks to estimate copula parameters robustly.

problem Pathological properties of Archimedean copulas make traditional estimators brittle.
method Unified neural estimation framework with multi-input architecture and softplus output layer.
result Accurate and stable estimates for real-world datasets.

We review the main "omnibus procedures" for goodness-of-fit testing for copulas: tests based on the empirical copula process, on probability integral transformations, on Kendall's dependence function, etc, and some corresponding reductions of dimension techniques. The problems of finding asymptotic distribution-free te…

2012-11-19abs ↗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 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.

New analysis shows interpretability doesn't guarantee steering utility in LLMs.

problem Does higher interpretability lead to better steering utility in large language models?
method Trained 90 SAEs across three LLMs, evaluated interpretability and steering utility, used Kendall's rank coefficients for analysis.
result Interpretability is only weakly associated with steering utility, and features selected by Delta Token Confidence improve steering performance.

We relate the existence problem of harmonic maps into S2S^2 to the convex geometry of S2S^2. On one hand, this allows us to construct new examples of harmonic maps of degree 0 from compact surfaces of arbitrary genus into S2S^2. On the other hand, we produce new example of regions that do not contain closed geodesics (…

2019-10-30abs ↗pdf ↗

Copula is a powerful tool to model multivariate data. We propose the modelling of intraday financial returns of multiple assets through copula. The problem originates due to the asynchronous nature of intraday financial data. We propose a consistent estimator of the correlation coefficient in case of Elliptical copula …

2019-04-23abs ↗pdf ↗

We introduce a new method for estimating the parameter of the bivariate Clayton copulas within the framework of Algorithmic Inference. The method consists of a variant of the standard boot-strapping procedure for inferring random parameters, which we expressly devise to bypass the two pitfalls of this specific instance…

2019-10-07abs ↗pdf ↗

The optimal ranking score between precision and recall is rarely F1 and can be found using specific methods.

problem Finding a meaningful and optimal compromise between precision and recall scores.
method Established a shortest path between precision- and recall-induced rankings, framed the problem as an optimization problem, and provided theoretical tools to find the optimal β.
result F1 and its skew-insensitive version are not optimal tradeoffs between precision and recall scores.

We formulate coherence modeling as a regression task and propose two novel methods to combine techniques from our setup with pairwise approaches. The first of our methods is a model that we call "first-next," which operates similarly to selection sorting but conditions decision-making on information about already-sorte…

2018-12-06abs ↗pdf ↗