Adaptive Estimation and Inference in Semi-parametric Heterogeneous Clustered Multitask Learning via Neyman Orthogonality

arXiv stat.ML / 5/5/2026

📰 NewsModels & Research

Key Points

  • The paper addresses clustered multitask learning where tasks share a latent cluster structure in their target parameters but have highly heterogeneous (even potentially infinite-dimensional) nuisance components.
  • It proposes an adaptive fused orthogonal estimator that combines Neyman-orthogonal losses with data-driven pairwise fusion penalties calibrated using task-specific pilot estimates.
  • The authors prove theoretical guarantees including exact recovery of the latent cluster assignments with high probability and pooled parametric convergence rates tied to cluster size.
  • They also establish asymptotic normality and show the method asymptotically matches the performance of an oracle that knows the true clustering in advance.
  • Experiments and a U.S. residential energy consumption application indicate the approach outperforms strong baselines and can reveal interpretable regional clustering in electricity price elasticity.

Abstract

We study clustered multitask learning in a semiparametric setting where tasks share a latent cluster structure in their target parameters but exhibit heterogeneous, potentially infinite-dimensional nuisance components. Such heterogeneity poses a major challenge for existing multitask learning methods, which typically rely on aligned feature spaces or homogeneous task structures. To address this challenge, we propose an adaptive fused orthogonal estimator that integrates Neyman-orthogonal losses with data-driven pairwise fusion penalties. Our framework leverages task-specific pilot estimates to calibrate the fusion penalties and combines adaptive aggregation with orthogonalization to mitigate the impact of nuisance-parameter estimation error. Theoretically, we show that the proposed estimator achieves exact recovery of the latent clustering with high probability and attains pooled parametric convergence rates proportional to cluster size. Moreover, we establish asymptotic normality and show that, asymptotically, our estimator matches the performance of an oracle procedure that knows the true clustering in advance. Empirically, we show that the proposed method consistently outperforms strong baselines in various simulation setups. A real-world application to U.S. residential energy consumption demonstrates the effectiveness of our approach in uncovering meaningful regional clustering in electricity price elasticity, showcasing the efficacy of our method.