Moment-Based Selection of Multiresponse Linear Mixed-Effects Models

• URL: http://arxiv.org/abs/2607.01971v1
• Date: Thu, 02 Jul 2026 10:07:33 GMT
• Title: Moment-Based Selection of Multiresponse Linear Mixed-Effects Models
• Abstract summary: We propose a stage-wise moment-based framework that exploits second-order cross-moment identities to select and estimate the random-effects covariance matrix and fixed-effects coefficients.<n>We establish finite-sample theoretical guarantees for the proposed procedure, including random-effects selection consistency and fixed-effects selection consistency under joint sub-Weibull errors.
• Score: 9.15183427789373
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose MOMENT (\textbf{MO}ment-Based \textbf{M}ixed-\textbf{E}ffects Selectio\textbf{N} and Es\textbf{T}imation), a stage-wise moment-based framework that exploits second-order cross-moment identities to select and estimate the random-effects covariance matrix and fixed-effects coefficients. By inducing sparsity through its diagonal under a positive semidefinite constraint, the random-effects selection problem reduces to a smooth constrained convex optimization problem that can be solved efficiently by projected gradient descent. We further establish finite-sample theoretical guarantees for the proposed procedure, including random-effects selection consistency and fixed-effects selection consistency under joint sub-Weibull errors. Simulation studies show that MOMENT performs competitively overall and can substantially outperform separate univariate analyses when responses are correlated. An application to the hemodialysis dataset demonstrates that the proposed method yields an interpretable and flexible approach for multivariate longitudinal data.

Related papers

• A Multi-stage Constrained Optimization Framework for Data-driven Problems [15.27508597551075]
  Variational autoencoders (VAEs) transform high-dimensional, often noisy data into a compact latent representation.<n>Three challenges persist in VAE-based constrained optimization.<n>We propose a Multi-stage Constrained Optimization Framework (MCOF)
  arXiv  Detail & Related papers  (2026-07-26T06:11:06Z)
• Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models [3.8370245746783027]
  We study inference in block models (SBMs) through the lens of optimal transport (OT)<n>We first establish that maximum likelihood variational inference (MLVI) can be interpreted as a semi-relaxed Gromov-Wasserstein (srGW) projection with entropic regularization.<n>We empirically show that such a regularized formulation yields estimators that simultaneously recover model parameters and select the number of parameters in a single optimization problem.
  arXiv  Detail & Related papers  (2026-05-27T13:44:43Z)
• Non-Parametric Rehearsal Learning via Conditional Mean Embeddings [88.89267783967263]
  We propose a non-parametric rehearsal learning approach for textitavoiding undesired future (AUF) problems.<n>Specifically, we use kernel machinery to reformulate the AUF objective into a unified representation that disentangles desirability modeling from action-induced distributional changes.
  arXiv  Detail & Related papers  (2026-05-09T15:30:52Z)
• Deflation-Free Optimal Scoring [0.0]
  Sparse Optimal Scoring (SOS) reformulates linear discriminant analysis to enable feature selection through elastic net regularization.<n>Most existing SOS methods use deflation-based strategies that compute discriminant vectors sequentially, which can propagate errors and produce suboptimal solutions.<n>We propose a novel approach that estimates all discriminant vectors simultaneously under an explicit global orthogonality constraint.
  arXiv  Detail & Related papers  (2026-04-28T13:59:39Z)
• Decision-Focused Federated Learning Under Heterogeneous Objectives and Constraints [45.88028371034407]
  We build on the well-known SPO+ approach and develop heterogeneity bounds for the SPO+ surrogate loss.<n>In the case of strongly convex feasible regions, sharper bounds are derived due to the stability.<n>We implement a FedAvg-style DFFL set of experiments on both polyhedral and strongly convex problems.
  arXiv  Detail & Related papers  (2026-04-21T22:22:39Z)
• Statistical Inference for Matching Decisions via Matrix Completion under Dependent Missingness [6.28693385008859]
  We propose an algorithm for non-optimal entry for three canonical mechanisms, i.e. one-to-one, one-sided matching with one-sided random arrival, and two-sided random arrival.<n>Our empirical experiments demonstrate that the proposed approach provides accurate estimation valid confidence intervals and efficient evaluation.
  arXiv  Detail & Related papers  (2025-10-30T13:31:32Z)
• Neural Optimal Transport Meets Multivariate Conformal Prediction [58.43397908730771]
  We propose a framework for conditional vectorile regression (CVQR)<n>CVQR combines neural optimal transport with quantized optimization, and apply it to predictions.
  arXiv  Detail & Related papers  (2025-09-29T19:50:19Z)
• Stochastic Optimization with Optimal Importance Sampling [49.484190237840714]
  We propose an iterative-based algorithm that jointly updates the decision and the IS distribution without requiring time-scale separation between the two.<n>Our method achieves the lowest possible variable variance and guarantees global convergence under convexity of the objective and mild assumptions on the IS distribution family.
  arXiv  Detail & Related papers  (2025-04-04T16:10:18Z)
• Assumption-Lean Post-Integrated Inference with Surrogate Control Outcomes [6.448728765953916]
  We introduce a robust post-integrated inference (PII) method that adjusts for latent heterogeneity using control outcomes.<n>We develop semiparametric inference on projected direct effect estimands, accounting for hidden mediators, confounders, and moderators.<n>The proposed doubly robust estimators are consistent and efficient under minimal assumptions and potential misspecification.
  arXiv  Detail & Related papers  (2024-10-07T12:52:38Z)
• Generalization Bounds of Surrogate Policies for Combinatorial Optimization Problems [53.03951222945921]
  We analyze smoothed (perturbed) policies, adding controlled random perturbations to the direction used by the linear oracle.<n>Our main contribution is a generalization bound that decomposes the excess risk into perturbation bias, statistical estimation error, and optimization error.<n>We illustrate the scope of the results on applications such as vehicle scheduling, highlighting how smoothing enables both tractable training and controlled generalization.
  arXiv  Detail & Related papers  (2024-07-24T12:00:30Z)
• Diffusion Models as Constrained Samplers for Optimization with Unknown Constraints [55.39203337683045]
  We propose to perform optimization within the data manifold using diffusion models.<n>Depending on the differentiability of the objective function, we propose two different sampling methods.<n>Our method achieves better or comparable performance with previous state-of-the-art baselines.
  arXiv  Detail & Related papers  (2024-02-28T03:09:12Z)
• Variational Learning for the Inverted Beta-Liouville Mixture Model and Its Application to Text Categorization [1.4174475093445236]
  finite invert Beta-Liouville mixture model (IBLMM) has recently gained some attention due to its positive data modeling capability. New function is proposed to replace the original variational object function in order to avoid intractable moment computation.
  arXiv  Detail & Related papers  (2021-12-29T03:03:44Z)
• Pseudo-Spherical Contrastive Divergence [119.28384561517292]
  We propose pseudo-spherical contrastive divergence (PS-CD) to generalize maximum learning likelihood of energy-based models. PS-CD avoids the intractable partition function and provides a generalized family of learning objectives.
  arXiv  Detail & Related papers  (2021-11-01T09:17:15Z)
• Asymptotic Analysis of an Ensemble of Randomly Projected Linear Discriminants [94.46276668068327]
  In [1], an ensemble of randomly projected linear discriminants is used to classify datasets. We develop a consistent estimator of the misclassification probability as an alternative to the computationally-costly cross-validation estimator. We also demonstrate the use of our estimator for tuning the projection dimension on both real and synthetic data.
  arXiv  Detail & Related papers  (2020-04-17T12:47:04Z)

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.