mlsanityData to 14 Oct 2026

Universal Inference Meets Random Projections: A Scalable Test for Log-concavity

arXiv 2111.09254 ↗First posted 17 Nov 2021stat.ME cs.LG math.STcited by 3

Not on the map. Why?

Abstract (arXiv)

Shape constraints yield flexible middle grounds between fully nonparametric and fully parametric approaches to modeling distributions of data. The specific assumption of log-concavity is motivated by applications across economics, survival modeling, and reliability theory. However, there do not currently exist valid tests for whether the underlying density of given data is log-concave. The recent universal inference methodology provides a valid test. The universal test relies on maximum likelihood estimation (MLE), and efficient methods already exist for finding the log-concave MLE. This yields the first test of log-concavity that is provably valid in finite samples in any dimension, for which we also establish asymptotic consistency results. Empirically, we find that a random projections approach that converts the d-dimensional testing problem into many one-dimensional problems can yield high power, leading to a simple procedure that is statistically and computationally efficient.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 4 of its 45 references that are in the map. First posted on arXiv 17 Nov 2021.

Builds on

4 of 45 references.

References · 4

  1. 2019Universal Inferencecited by 44
  2. 2017Recent progress in log-concave density estimationcited by 15
  3. 2019Optimality of Maximum Likelihood for Log-Concave Density Estimation and Bounded Convex Regressioncited by 10
  4. 2021A new computational framework for log-concave density estimationcited by 4

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 0; 2025: 1.

3 papers.