🤖 AI Summary
研究通过HC-RCQR方法解决分布式数据中存在异质性和拜占庭错误的问题，利用局部截距校准和坐标修剪及软阈值更新估计。
📝 Abstract
We study sparse composite quantile regression (CQR) for distributed data with heterogeneous honest sites and Byzantine workers. Honest sites share a common slope but may differ in their covariate distributions, error laws, and quantile intercepts. The proposed heterogeneity-calibrated robust CQR (HC-RCQR) profiles local intercepts and calibrates scores using an approximate inverse profile Hessian. Honest workers transmit the resulting vectors, whereas Byzantine workers may send arbitrary vectors. The server updates the estimate by coordinatewise trimming and soft thresholding. A scalar example shows how unequal honest-site curvatures allow intermediate Byzantine reports to survive trimming and how ideal calibration reduces their possible effect. We also establish nonidentification of the mean of unrestricted honest-site slopes when fault identities are unknown. Under suitable conditions, we establish conditional contraction and support-recovery guarantees. The bound separates score offset, sampling fluctuation, contamination, calibration error, and the Newton remainder. Simulations and a bike-demand study examine performance under heterogeneous data and adversarial messages.