Hypothesis Testing for Generalized Thurstone Models

• URL: http://arxiv.org/abs/2512.02912v1
• Date: Tue, 02 Dec 2025 16:32:42 GMT
• Title: Hypothesis Testing for Generalized Thurstone Models
• Authors: Anuran Makur, Japneet Singh,
• Abstract summary: We develop a hypothesis testing framework to determine whether pairwise comparison data is generated by an underlying model.<n>We propose a hypothesis test based on our separation distance, construct confidence intervals, establish time-uniform bounds on the probabilities of type I and II errors.<n>We validate our results through experiments on synthetic and real-world datasets.
• Score: 12.379142732634113
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we develop a hypothesis testing framework to determine whether pairwise comparison data is generated by an underlying \emph{generalized Thurstone model} $\mathcal{T}_F$ for a given choice function $F$. While prior work has predominantly focused on parameter estimation and uncertainty quantification for such models, we address the fundamental problem of minimax hypothesis testing for $\mathcal{T}_F$ models. We formulate this testing problem by introducing a notion of separation distance between general pairwise comparison models and the class of $\mathcal{T}_F$ models. We then derive upper and lower bounds on the critical threshold for testing that depend on the topology of the observation graph. For the special case of complete observation graphs, this threshold scales as $Θ((nk)^{-1/2})$, where $n$ is the number of agents and $k$ is the number of comparisons per pair. Furthermore, we propose a hypothesis test based on our separation distance, construct confidence intervals, establish time-uniform bounds on the probabilities of type I and II errors using reverse martingale techniques, and derive minimax lower bounds using information-theoretic methods. Finally, we validate our results through experiments on synthetic and real-world datasets.

Related papers

• Beyond likelihood ratio bias: Nested multi-time-scale stochastic approximation for likelihood-free parameter estimation [49.78792404811239]
  We study inference in simulation-based models where the analytical form of the likelihood is unknown.<n>We use a ratio-free nested multi-time-scale approximation (SA) method that simultaneously tracks the score and drives the parameter update.<n>We show that our algorithm can eliminate the original bias $Obig(sqrtfrac1Nbig)$ and accelerate the convergence rate from $Obig(beta_k+sqrtfracalpha_kNbig)$.
  arXiv  Detail & Related papers  (2024-11-20T02:46:15Z)
• Minimax Hypothesis Testing for the Bradley-Terry-Luce Model [6.5990719141691825]
  The Bradley-Terry-Luce (BTL) model is one of the most widely used models for ranking a collection of items or agents. We propose a hypothesis test that determines whether a given pairwise comparison dataset, with $k$ comparisons per pair of agents, originates from an underlying BTL model.
  arXiv  Detail & Related papers  (2024-10-10T20:28:05Z)
• Collaborative non-parametric two-sample testing [55.98760097296213]
  The goal is to identify nodes where the null hypothesis $p_v = q_v$ should be rejected. We propose the non-parametric collaborative two-sample testing (CTST) framework that efficiently leverages the graph structure. Our methodology integrates elements from f-divergence estimation, Kernel Methods, and Multitask Learning.
  arXiv  Detail & Related papers  (2024-02-08T14:43:56Z)
• Precise Error Rates for Computationally Efficient Testing [67.30044609837749]
  We revisit the question of simple-versus-simple hypothesis testing with an eye towards computational complexity.<n>An existing test based on linear spectral statistics achieves the best possible tradeoff curve between type I and type II error rates.
  arXiv  Detail & Related papers  (2023-11-01T04:41:16Z)
• Degree Heterogeneity in Higher-Order Networks: Inference in the Hypergraph $\oldsymbolβ$-Model [4.540236408836132]
  We study the hypergraph $boldsymbolbeta$-model with multiple layers, which allows for hyperedges of different sizes across the layers. We derive the rates of convergence of maximum likelihood (ML) estimates and establish their minimax rate optimality. We also consider the goodness-of-fit problem in the hypergraph $boldsymbolbeta$-model.
  arXiv  Detail & Related papers  (2023-07-06T07:23:06Z)
• Towards Faster Non-Asymptotic Convergence for Diffusion-Based Generative Models [49.81937966106691]
  We develop a suite of non-asymptotic theory towards understanding the data generation process of diffusion models. In contrast to prior works, our theory is developed based on an elementary yet versatile non-asymptotic approach.
  arXiv  Detail & Related papers  (2023-06-15T16:30:08Z)
• The Minimax Risk in Testing Uniformity of Poisson Data under Missing Ball Alternatives [8.285441115330944]
  We study the problem of testing the goodness of fit of occurrences of items from many categories to a Poisson distribution uniform over the categories.<n>We characterize the minimax risk for this problem as the expected number of samples $n$ and the number of categories $N$ go to infinity.
  arXiv  Detail & Related papers  (2023-05-29T14:26:42Z)
• Kernel-based off-policy estimation without overlap: Instance optimality beyond semiparametric efficiency [53.90687548731265]
  We study optimal procedures for estimating a linear functional based on observational data. For any convex and symmetric function class $mathcalF$, we derive a non-asymptotic local minimax bound on the mean-squared error.
  arXiv  Detail & Related papers  (2023-01-16T02:57:37Z)
• Composite Goodness-of-fit Tests with Kernels [21.31083353434396]
  We propose a kernel-based hypothesis tests for the challenging composite testing problem.<n>Our tests make use of minimum distance estimators based on the maximum mean discrepancy and the kernel Stein discrepancy.<n>As our main result, we show that we are able to estimate the parameter and conduct our test on the same data, while maintaining a correct test level.
  arXiv  Detail & Related papers  (2021-11-19T15:25:06Z)
• Hypothesis Testing for Equality of Latent Positions in Random Graphs [0.2741266294612775]
  We consider the hypothesis testing problem that two vertices $i$ and $j$th have the same latent positions, possibly up to scaling. We propose several test statistics based on the empirical Mahalanobis distances between the $i$th and $j$th rows of either the adjacency or the normalized Laplacian spectral embedding of the graph. Using these test statistics, we address the model selection problem of choosing between the standard block model and its degree-corrected variant.
  arXiv  Detail & Related papers  (2021-05-23T01:27:23Z)
• Good Classifiers are Abundant in the Interpolating Regime [64.72044662855612]
  We develop a methodology to compute precisely the full distribution of test errors among interpolating classifiers. We find that test errors tend to concentrate around a small typical value $varepsilon*$, which deviates substantially from the test error of worst-case interpolating model. Our results show that the usual style of analysis in statistical learning theory may not be fine-grained enough to capture the good generalization performance observed in practice.
  arXiv  Detail & Related papers  (2020-06-22T21:12:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.