IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i7p1133-d1624030.html
   My bibliography  Save this article

Optimal Subsampling for Upper Expectation Parametric Regression

Author

Listed:
  • Zhaolei Liu

    (Zhongtai Securities Institute for Financial Studies, Shandong University, Jinan 250100, China)

Abstract

In classic regression analysis, the error term of the model typically conforms to the requirement of being independent and identically distributed. However, in the realm of big data, it is exceedingly common for the error term to exhibit varying distributions due to discrepancies in data collection timing and sources. In this article, we expand upon and refine the upper expectation parameter regression model, introducing a novel upper expectation loss form, which handles distribution heterogeneity via group-specific μ i , to ensure consistent and efficient parameter estimation. Furthermore, we establish the asymptotic properties of this estimation. To address the challenges posed by big data or the restrictions of privacy, we propose a method utilizing Poisson subsampling to devise a new loss function. Under certain assumptions, this method satisfies the condition of asymptotic normality. Additionally, based on the asymptotic properties, we determine the optimal sampling probability and introduce the optimal subsampling technique. Our sampling method surpasses uniform sampling, which reduces MSE by about 50 % compared to uniform sampling, and is straightforward to implement in practical scenarios. Subsequent simulation experiments and real-world examples further demonstrate the effectiveness of our approach.

Suggested Citation

  • Zhaolei Liu, 2025. "Optimal Subsampling for Upper Expectation Parametric Regression," Mathematics, MDPI, vol. 13(7), pages 1-24, March.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:7:p:1133-:d:1624030
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/7/1133/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/7/1133/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Vaart,A. W. van der, 2000. "Asymptotic Statistics," Cambridge Books, Cambridge University Press, number 9780521784504, June.
    2. HaiYing Wang & Min Yang & John Stufken, 2019. "Information-Based Optimal Subdata Selection for Big Data Linear Regression," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 114(525), pages 393-405, January.
    3. Peng, Shige, 2008. "Multi-dimensional G-Brownian motion and related stochastic calculus under G-expectation," Stochastic Processes and their Applications, Elsevier, vol. 118(12), pages 2223-2253, December.
    4. Haiying Wang & Yanyuan Ma, 2021. "Optimal subsampling for quantile regression in big data," Biometrika, Biometrika Trust, vol. 108(1), pages 99-112.
    5. HaiYing Wang & Rong Zhu & Ping Ma, 2018. "Optimal Subsampling for Large Sample Logistic Regression," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 113(522), pages 829-844, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Min Ren & Shengli Zhao & Mingqiu Wang & Xinbei Zhu, 2024. "Robust optimal subsampling based on weighted asymmetric least squares," Statistical Papers, Springer, vol. 65(4), pages 2221-2251, June.
    2. Yue Chao & Lei Huang & Xuejun Ma & Jiajun Sun, 2024. "Optimal subsampling for modal regression in massive data," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 87(4), pages 379-409, May.
    3. Jun Yu & Jiaqi Liu & HaiYing Wang, 2023. "Information-based optimal subdata selection for non-linear models," Statistical Papers, Springer, vol. 64(4), pages 1069-1093, August.
    4. Shanshan Wang & Wei Cao & Xiaoxue Hu & Hanyu Zhong & Weixi Sun, 2025. "A Selective Overview of Quantile Regression for Large-Scale Data," Mathematics, MDPI, vol. 13(5), pages 1-30, March.
    5. Tianzhen Wang & Haixiang Zhang, 2022. "Optimal subsampling for multiplicative regression with massive data," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 76(4), pages 418-449, November.
    6. Ziyang Wang & HaiYing Wang & Nalini Ravishanker, 2023. "Subsampling in Longitudinal Models," Methodology and Computing in Applied Probability, Springer, vol. 25(1), pages 1-29, March.
    7. Deng, Jiayi & Huang, Danyang & Ding, Yi & Zhu, Yingqiu & Jing, Bingyi & Zhang, Bo, 2024. "Subsampling spectral clustering for stochastic block models in large-scale networks," Computational Statistics & Data Analysis, Elsevier, vol. 189(C).
    8. Baolin Chen & Shanshan Song & Yong Zhou, 2024. "Estimation and testing of expectile regression with efficient subsampling for massive data," Statistical Papers, Springer, vol. 65(9), pages 5593-5613, December.
    9. Xiaohui Yuan & Yong Li & Xiaogang Dong & Tianqing Liu, 2022. "Optimal subsampling for composite quantile regression in big data," Statistical Papers, Springer, vol. 63(5), pages 1649-1676, October.
    10. Hanji He & Jianfeng He & Liwei Zhang, 2025. "Imbalanced data sampling design based on grid boundary domain for big data," Computational Statistics, Springer, vol. 40(1), pages 27-64, January.
    11. Huy N. Chau & J. Lars Kirkby & Dang H. Nguyen & Duy Nguyen & Nhu N. Nguyen & Thai Nguyen, 2024. "On the Inversion‐Free Newton's Method and Its Applications," International Statistical Review, International Statistical Institute, vol. 92(2), pages 284-321, August.
    12. Feifei Wang & Danyang Huang & Tianchen Gao & Shuyuan Wu & Hansheng Wang, 2022. "Sequential one‐step estimator by sub‐sampling for customer churn analysis with massive data sets," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 71(5), pages 1753-1786, November.
    13. Su, Miaomiao & Wang, Ruoyu & Wang, Qihua, 2022. "A two-stage optimal subsampling estimation for missing data problems with large-scale data," Computational Statistics & Data Analysis, Elsevier, vol. 173(C).
    14. Jun Yu & HaiYing Wang, 2022. "Subdata selection algorithm for linear model discrimination," Statistical Papers, Springer, vol. 63(6), pages 1883-1906, December.
    15. Xing Li & Yujing Shao & Lei Wang, 2024. "Optimal subsampling for $$L_p$$ L p -quantile regression via decorrelated score," TEST: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 33(4), pages 1084-1104, December.
    16. Duarte, Belmiro P.M. & Atkinson, Anthony C. & Oliveira, Nuno M.C., 2024. "Using hierarchical information-theoretic criteria to optimize subsampling of extensive datasets," LSE Research Online Documents on Economics 121641, London School of Economics and Political Science, LSE Library.
    17. J. Lars Kirkby & Dang H. Nguyen & Duy Nguyen & Nhu N. Nguyen, 2022. "Inversion-free subsampling Newton’s method for large sample logistic regression," Statistical Papers, Springer, vol. 63(3), pages 943-963, June.
    18. Amalan Mahendran & Helen Thompson & James M. McGree, 2023. "A model robust subsampling approach for Generalised Linear Models in big data settings," Statistical Papers, Springer, vol. 64(4), pages 1137-1157, August.
    19. Zhang, Haixiang & Wang, HaiYing, 2021. "Distributed subdata selection for big data via sampling-based approach," Computational Statistics & Data Analysis, Elsevier, vol. 153(C).
    20. Hector, Emily C. & Luo, Lan & Song, Peter X.-K., 2023. "Parallel-and-stream accelerator for computationally fast supervised learning," Computational Statistics & Data Analysis, Elsevier, vol. 177(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:7:p:1133-:d:1624030. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.