stat.MLMar 2, 2024

High-Dimensional Tail Index Regression

Authors: Yuya Sasaki, Jing Tao, Yulong Wang

Organizations: Department of Economics, Vanderbilt University, VU Station B #351819, 2301 Vanderbilt Place, Nashville, TN 37235-1819 · Department of Economics, University of Washington, Box 353330, Savery 305, University of Washington, Seattle, WA 98195-3330 · Department of Economics, Lehigh University, Bethlehem, PA 18015

Abstract

Motivated by the empirical observation of power-law distributions in the credits (e.g., ``likes'') of viral posts on social media, we introduce a high-dimensional tail index regression model and propose methods for estimation and inference of its parameters. First, we propose a regularized estimator, establish its consistency, and derive its convergence rate. Second, we construct a debiased version of the regularized estimator to facilitate inference and prove its asymptotic normality. Monte Carlo simulation studies corroborate our theoretical findings. We apply these methods (1) to the text analysis of viral posts on X (formerly Twitter) and (2) to the analysis of abnormally high health expenditures.

Figures & tables

Appendix figures & tables2 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

Aug 14, 2026

Partially Observed Sparse Graphs: The Unknown Sampling Rate is a Tail Index

A large graph is often available only in part: a crawl stopped by its budget, a panel, a partial dump. When the sampled fraction ss is known by design the total edge count follows from e^=es/s2\hat e=e_s/s^2 and no model is needed. We treat the case where ss is unknown and the population size is known. Our main result is a reduction: under a sparse exchangeable (graphex) model the expected non-isolated fraction obeys ns/n1→s1+σn_s/n_1\to s^{1+σ}, so the sampling rate becomes estimable once the tail index σσ is, and substituting it back gives es(n1/ns)2/(1+σ)e_s(n_1/n_s)^{2/(1+σ)} -- the same estimator, with the design quantity inferred. Estimating global edge cardinality in a sparse graph is therefore, in expectation, tail-index estimation, and the quadratic graphon estimator is the case σ=0σ=0: it fails by an identity rather than by a fit (260%260\% median error against 27%27\%). We bound the finite-size error of the substitution and show the reduction is modular in the tail-index estimator --- filled with a published closed-form one it reaches 21.7%21.7\% over 1313 networks and 3939 sampling budgets with no fitting at all. Fitting a full graphex additionally returns the degree distribution at any size and a generative object, in a representation where sparsity is a coordinate and the interpolation path is dictated rather than chosen. Two limits are exact: rank-one graphexes have transitivity fixed by the degree profile, so high-clustering graphs lie outside the class; and under snowball or random-walk crawls every method here fails, the design-based oracle worst of all (7.8%7.8\% to 588%588\%).
Jul 29, 2026

Breaking the Curse with BAND: Nonparametric Distribution Estimation in High Dimensions

Minimax-optimal rates for multivariate distribution estimation are known to suffer from the curse of dimensionality. We propose a sparse Bayesian network approach in which each conditional probability is estimated using sparsity-aware conditional mean methods. The resulting estimator, BAyesian Network Distribution regression (BAND), handles mixed data types in high-dimensional time series and achieves polynomial total variation convergence rates while allowing the feature dimension to grow polynomially with the sample size. These rates are substantially faster than the classical optimal rates for multivariate histogram density estimators that lack sparsity. Empirical evaluations show that BAND performs competitively for data sampling and confidence region forecasting against a range of state-of-the-art benchmarks.
Nov 15, 2026

The Manifold-Index Model: provably and efficiently avoiding the statistical and computational curse of dimensionality

We study vector-valued regression with predictors filling a tube around an unknown mm-dimensional manifold M\mathcal{M} in RD\mathbb{R}^D. In the Manifold-Index Model, the mean response is F=f∘ΠMF=f\circΠ_{\mathcal{M}}, where ΠMΠ_{\mathcal{M}} is the nearest-point projection onto M\mathcal{M} and f:M→Rpf:\mathcal{M}\to\mathbb{R}^p is a possibly non-injective link function. Multiscale ANisotropic lOcal Regression (MANOR) estimates tangent planes by multiscale PCA of predictors with similar responses, then refines them by pooling outer products of local slopes. The neighborhoods narrow tangentially while retaining complete normal fibers. We assume a Lipschitz link differential and bounded response noise. For p≥mp\ge m, under our geometric and sampling conditions, nn independent observations give mean tangent-space error of order n−2/(m+4)n^{-2/(m+4)} and integrated squared prediction error at the mm-dimensional nonparametric rate n−4/(m+4)n^{-4/(m+4)}, up to logarithmic factors. In a scaling regime with fixed intrinsic dimension, model and scale parameters, and ratio of manifold volume to the mm-th power of its reach, the required sample size grows polynomially in D+pD+p, and computation is polynomial in nn, DD and pp. Numerical experiments on curves with non-monotone links and surfaces with vector-valued responses compare observed convergence rates with the theoretical bounds; a Langevin dynamics example tests prediction of hitting probabilities under an approximate manifold-index model.