IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v83y2013i3p829-835.html

Does adding data always improve linear regression estimates?

Author

Listed:
  • den Boer, A.V.

Abstract

Intuitively one might expect that the quality of statistical estimates cannot worsen if they are based on more data. We show in a least-squares linear regression setting that this intuition is wrong. Adding data may worsen the quality of parameter estimates, and in fact may even cause a design sequence to lose strong consistency.

Suggested Citation

  • den Boer, A.V., 2013. "Does adding data always improve linear regression estimates?," Statistics & Probability Letters, Elsevier, vol. 83(3), pages 829-835.
  • Handle: RePEc:eee:stapro:v:83:y:2013:i:3:p:829-835
    DOI: 10.1016/j.spl.2012.12.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167715212004506
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.spl.2012.12.001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Lai, T. L. & Robbins, Herbert & Wei, C. Z., 1979. "Strong consistency of least squares estimates in multiple regression II," Journal of Multivariate Analysis, Elsevier, vol. 9(3), pages 343-361, September.
    2. Josef Broder & Paat Rusmevichientong, 2012. "Dynamic Pricing Under a General Parametric Choice Model," Operations Research, INFORMS, vol. 60(4), pages 965-980, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Arnoud V. den Boer & Bert Zwart, 2015. "Dynamic Pricing and Learning with Finite Inventories," Operations Research, INFORMS, vol. 63(4), pages 965-978, August.

    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. Arnoud V. den Boer & Bert Zwart, 2014. "Simultaneously Learning and Optimizing Using Controlled Variance Pricing," Management Science, INFORMS, vol. 60(3), pages 770-783, March.
    2. Jianyu Xu & Yining Wang & Xi Chen & Yu-Xiang Wang, 2025. "Dynamic Pricing with Adversarially-Censored Demands," Papers 2502.06168, arXiv.org, revised Jan 2026.
    3. William L. Cooper & Tito Homem-de-Mello & Anton J. Kleywegt, 2015. "Learning and Pricing with Models That Do Not Explicitly Incorporate Competition," Operations Research, INFORMS, vol. 63(1), pages 86-103, February.
    4. Xiao, Baichun & Yang, Wei, 2021. "A Bayesian learning model for estimating unknown demand parameter in revenue management," European Journal of Operational Research, Elsevier, vol. 293(1), pages 248-262.
    5. N. Bora Keskin & Assaf Zeevi, 2014. "Dynamic Pricing with an Unknown Demand Model: Asymptotically Optimal Semi-Myopic Policies," Operations Research, INFORMS, vol. 62(5), pages 1142-1167, October.
    6. Hamsa Bastani & David Simchi-Levi & Ruihao Zhu, 2022. "Meta Dynamic Pricing: Transfer Learning Across Experiments," Management Science, INFORMS, vol. 68(3), pages 1865-1881, March.
    7. Thomas Loots & Arnoud V. den Boer, 2023. "Data‐driven collusion and competition in a pricing duopoly with multinomial logit demand," Production and Operations Management, Production and Operations Management Society, vol. 32(4), pages 1169-1186, April.
    8. R. M. Balan & Ioana Schiopu-Kratina, 2004. "Asymptotic Results with Generalized Estimating Equations for Longitudinal data II," RePAd Working Paper Series lrsp-TRS398, Département des sciences administratives, UQO.
    9. Xuejun Zhao & Ruihao Zhu & William B. Haskell, 2022. "Learning to Price Supply Chain Contracts against a Learning Retailer," Papers 2211.04586, arXiv.org.
    10. Qi (George) Chen & Stefanus Jasin & Izak Duenyas, 2021. "Technical Note—Joint Learning and Optimization of Multi-Product Pricing with Finite Resource Capacity and Unknown Demand Parameters," Operations Research, INFORMS, vol. 69(2), pages 560-573, March.
    11. Norbert Christopeit & Michael Massmann, 2013. "A Note on an Estimation Problem in Models with Adaptive Learning," Tinbergen Institute Discussion Papers 13-151/III, Tinbergen Institute.
    12. Boxiao Chen & Xiuli Chao & Cong Shi, 2021. "Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 726-756, May.
    13. Adel Javanmard & Jingwei Ji & Renyuan Xu, 2024. "Multi-Task Dynamic Pricing in Credit Market with Contextual Information," Papers 2410.14839, arXiv.org, revised Dec 2025.
    14. Victor F. Araman & René A. Caldentey, 2022. "Diffusion Approximations for a Class of Sequential Experimentation Problems," Management Science, INFORMS, vol. 68(8), pages 5958-5979, August.
    15. Athanassios N. Avramidis & Arnoud V. Boer, 2021. "Dynamic pricing with finite price sets: a non-parametric approach," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(1), pages 1-34, August.
    16. Yuan-chin Chang, 2011. "Sequential estimation in generalized linear models when covariates are subject to errors," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 73(1), pages 93-120, January.
    17. Yining Wang & Boxiao Chen & David Simchi-Levi, 2021. "Multimodal Dynamic Pricing," Management Science, INFORMS, vol. 67(10), pages 6136-6152, October.
    18. Lalit Jain & Zhaoqi Li & Erfan Loghmani & Blake Mason & Hema Yoganarasimhan, 2024. "Effective Adaptive Exploration of Prices and Promotions in Choice-Based Demand Models," Marketing Science, INFORMS, vol. 43(5), pages 1002-1030, September.
    19. Huashuai Qu & Ilya O. Ryzhov & Michael C. Fu & Eric Bergerson & Megan Kurka & Ludek Kopacek, 2020. "Learning Demand Curves in B2B Pricing: A New Framework and Case Study," Production and Operations Management, Production and Operations Management Society, vol. 29(5), pages 1287-1306, May.
    20. Athanassios N. Avramidis, 2020. "A pricing problem with unknown arrival rate and price sensitivity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(1), pages 77-106, August.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:eee:stapro:v:83:y:2013:i:3:p:829-835. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    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.