The harmonic decomposition of the Johnson graph is used to define an intrinsic Johnson--Sobolev scale and determine the exact dimensions of low-order interaction spaces and derive finite-sample risk bounds for harmonic projection and establish a nonasymptotic minimax characterization when the Johnson--Sobolev energy budget is controlled relative to the noise variance.
Abstract
We study regression with subsets as covariates. The response is an unknown function of the input subset, and observations consist of noisy evaluations at uniformly sampled subsets, each containing exactly \(k\) items from a ground set of size \(d\). This problem arises in combination screening, bundle preference modeling, and other settings in which outcomes depend on collections of prescribed size. The fixed-cardinality constraint couples the membership coordinates, so standard product-domain notions of interaction and smoothness cannot be imported unchanged. We use the harmonic decomposition of the Johnson graph to define an intrinsic Johnson--Sobolev scale and determine the exact dimensions of low-order interaction spaces. We derive finite-sample risk bounds for harmonic projection and establish a nonasymptotic minimax characterization when the Johnson--Sobolev energy budget is controlled relative to the noise variance. We also show that stable least squares removes the signal-dependent fluctuation of empirical projection when the empirical Gram matrix is sufficiently well conditioned. For arbitrary signal-to-noise ratios, a rank-deficiency analysis quantifies the components left unidentified by the random design. Together, the rank-deficiency analysis and a centered completion estimator yield minimax bounds that match up to constants whenever \(\min(k,d-k)\) and the smoothness order are fixed. Numerical experiments reported in the Supplementary Material illustrate estimation under different interaction profiles and distinguish the effects of observation noise, random-design fluctuation, and incomplete coverage.
Covariates missing not at random generally prevent point identification of regression coefficients without untestable restrictions. This paper studies linear regression when every missing covariate is restricted to a prespecified compact interval. The resulting population target is the set of best linear predictor coef...
We study preference elicitation under the Bradley-Terry-Luce (BTL) model where the true partworth vector is unknown and has to be estimated as a parameter with elicited preference information. The set of selected pairwise queries is non-uniform, deterministic, and arbitrary over a collection of alternatives, provided t...
Motivated by the computational challenges of large-scale Cox regression, we study stochastic minimization of LogSumExp objectives over large sets. Mini-batch normalizer estimates generally yield biased gradients. We instead use a softplus surrogate that introduces one auxiliary scalar per normalizer and admits unbiased...
We study additive regression under an unknown and potentially non product design distribution, allowing the number of covariates to grow with the sample size. We consider a coupled class that separately controls the smoothness of the marginal densities and of each additive component multiplied by the corresponding marg...
We study statistical inference for least squares estimators (LSEs) in additive monotone models under a general fixed lattice design. We establish joint limiting distributions for the LSEs and show that the estimators of different additive components are asymptotically independent. The form of the limiting distribution...
Let WN = X1 + X2 + \cdots + XN be a random sum, where N is a non-negative, integer-valued random variable independent of the sequence (Xj). This dissertation studies bounds for the stop-loss distance, |E(WN-k)+ - E(Y-k)+|, where Y follows either a normal or a Poisson distribution. We also present illustrative examples...
Punyapat Kammoo· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.