Skip to content
Preprint

Cursive: The Trace from the Curse of Dimensionality

Sep 2026 · 0 citations · 27 references
Mathematics

TL;DR

This paper traces how the same design question has led to task-specific methods built from graphs, graph-based ranks, kernels, and dissimilarity profiles for testing, change-point detection, covariate-balance assessment, clustering, classification, and generative-model evaluation.

Abstract

Modern data are increasingly high-dimensional or non-Euclidean. As dimension grows, new statistical patterns can emerge in the relations among observations, while a conventional statistical summary may fail to retain the signal they carry. This paper names and organizes a research program around this observation, calling it Cursive. Cursive asks which relational information is lost when the summary is formed and how the analysis should be redesigned around that information. The canonical example is the generalized edge-count test, which keeps the two within-sample edge counts whose opposing deviations can cancel in the classical between-sample count. This paper traces how the same design question has led to task-specific methods built from graphs, graph-based ranks, kernels, and dissimilarity profiles for testing, change-point detection, covariate-balance assessment, clustering, classification, and generative-model evaluation.

View source

Similar papers

Preprint Sep 2026

Cluster-Based Dimensionality Reduction by Nonparametric Distributional Screening

The objective is not to construct a low-rank projection, but to retain an interpretable subset of the original coordinates that preserves the distributional information distinguishing the clusters that preserves the distributional information distinguishing the clusters.

S. Jha, Rishikesh Muralimohan, Praveen Athauda Arachchi et al. · 0 citations
Open access Aug 2026

Poisson subspace clustering: focusing on the essentials in count data

This work presents 3CPO, a clustering algorithm based on statistically solid modeling of count data, and proposes a simple iterative algorithm that maximizes the posterior probability to find good clustering solutions and discusses its properties.

Collin Leiber, K. Puolamäki, H. Mannila · 0 citations
#machine learning Preprint Sep 2026

Bracketing Uncertainty in Clustering Under the Manifold Hypothesis

Manifold-Based Clustering (MBC) is proposed, which returns an explicit bracket interval to quantify the underlying data uncertainty, and suggests that ambiguity in cluster number is often intrinsic, and should be quantified rather than resolved.

Savik Kinger, Luciano Dyballa, Steven W. Zucker · 1 citation
Sep 2026

Revisiting the Normalization of the Moran's I Index: A Correlation‐Based Approach With Inference

Moran's  index, the canonical measure of spatial autocorrelation, may take values outside the interval when arbitrary spatial weight matrices are used. This lack of boundedness complicates interpretation and may lead to misleading conclusions. We systematically evaluate seven approaches aimed at addressing this iss...

Yves Tillé, D. Giuliani, Maria Michela Dickson et al. · 0 citations
Preprint Aug 2026

Visualizing Uncertainty in Non-linear Projections with Ensembles

This paper proposes visualizing the median of multiple NLDR outputs rather than relying on individual projections and finds that taking the median of multiple projections performs comparably to individual runs on multiple quality metrics, while increasing perturbation emphasizes global over local structure.

Kai Nylund, M. Correll, Lace M. K. Padilla · 0 citations
Open access Sep 2026

Gap-Entropy Testing (GET): A Framework for Structural and Distributional Differences

The classical two-sample problem is framed as the detection of differences in marginal distributions, in terms of location, scale, or overall shape. In this paper, Gap–Entropy Testing (GET) is proposed, a novel nonparametric framework that extends the two-sample paradigm by adding a spacing-sensitive component to conve...

V. Karalis · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.