Skip to content

Influence Diagnostics in High-dimensional M-estimation: Precise Asymptotics

Jul 2026 · 0 citations
Mathematics Computer Science

TL;DR

Evidence that influential samples tend to lie close to the decision boundary, thereby making contact with a standard data selection heuristic in active learning is provided.

Abstract

The impact of a given training point on a statistical model is classically measured through its leave-one-out influence, which quantifies the effect of its removal from the training set on the model accuracy. While the statistics of leave-one-out influences are well understood in the low-dimensional, large sample limit $n\to \infty, d=O(1)$, they become more intricate in high dimensions, as the influence of a given sample develops non-trivial dependencies on all other training samples. For convex M-estimation under Gaussian design, in the high-dimensional limit $n\asymp d$, we show that the distribution of the influences across the training set converges to a limiting measure which we sharply characterize. Building on these results, we provide evidence that influential samples tend to lie close to the decision boundary, thereby making contact with a standard data selection heuristic in active learning.

View source

Similar papers

Review Jul 2026

High-Dimensional Variance Estimation for the Generalized Regression Estimator

In survey sampling, the goal is to estimate finite population parameters such as totals, means, and proportions. At the estimation stage, it is common to have access to auxiliary information in the form of covariates known either in aggregate form or for each population unit. These covariates are often used, through mo...

Kalil Bouhadra, Mehdi Dagdoug · 0 citations
Preprint Jul 2026

A General U-Statistic Framework for High-Dimensional Multiple Change-Point Analysis

High-dimensional change-point analysis is essential in modern statistical inference. However, existing methods are often designed either for specific parameters (e.g., mean or variance) or for particular tasks (e.g., testing or estimation), making them difficult to generalize. Moreover, they typically rely on restricti...

Bin Liu, Yufeng Liu · 0 citations
Preprint Jul 2026

Amortized Inference for Sampling Distributions Where the Bootstrap Fails

A neural network is trained on simulated datasets drawn from a prior over a distribution family, using single independent draws of the root T_n - T(F) scored by the pinball loss, a proper scoring rule whose population minimizer is the posterior-predictive law of the root.

Akash Deep · 0 citations
Open access Jul 2026

Adaptive Wrapped Robust Canonical Correlation Analysis in High-Dimensional Data

Classical canonical correlation analysis becomes numerically unstable when the number of variables is large relative to the sample size and is sensitive to contamination in observations or individual cells. This study develops an integrated robust and regularized procedure that combines bounded cellwise wrapping, shrin...

Hasan Bulut, Müjgan Zobu, V. Saglam · 0 citations
Preprint Aug 2026

A Data-dependent Early Stopping Rule using Rademacher Complexity with L1-norm

This work introduces an analytic framework that estimates the optimal time of early stopping without the need for training and can be successfully applied to nonlinear neural networks, as illustrated in the classification MNIST example.

D. Hoang, B. Berret, O. Bruneau et al. · 0 citations

Related blog posts

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