IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v40y2025i1d10.1007_s00180-024-01473-6.html
   My bibliography  Save this article

Degree selection methods for curve estimation via Bernstein polynomials

Author

Listed:
  • Juliana Freitas de Mello e Silva

    (Universidade Federal de Minas Gerais)

  • Sujit Kumar Ghosh

    (North Carolina State University)

  • Vinícius Diniz Mayrink

    (Universidade Federal de Minas Gerais)

Abstract

Bernstein Polynomial (BP) bases can uniformly approximate any continuous function based on observed noisy samples. However, a persistent challenge is the data-driven selection of a suitable degree for the BPs. In the absence of noise, asymptotic theory suggests that a larger degree leads to better approximation. However, in the presence of noise, which reduces bias, a larger degree also results in larger variances due to high-dimensional parameter estimation. Thus, a balance in the classic bias-variance trade-off is essential. The main objective of this work is to determine the minimum possible degree of the approximating BPs using probabilistic methods that are robust to various shapes of an unknown continuous function. Beyond offering theoretical guidance, the paper includes numerical illustrations to address the issue of determining a suitable degree for BPs in approximating arbitrary continuous functions.

Suggested Citation

  • Juliana Freitas de Mello e Silva & Sujit Kumar Ghosh & Vinícius Diniz Mayrink, 2025. "Degree selection methods for curve estimation via Bernstein polynomials," Computational Statistics, Springer, vol. 40(1), pages 1-26, January.
    • Handle: RePEc:spr:compst:v:40:y:2025:i:1:d:10.1007_s00180-024-01473-6
    DOI: 10.1007/s00180-024-01473-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00180-024-01473-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00180-024-01473-6?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 search for a different version of it.

    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:spr:compst:v:40:y:2025:i:1:d:10.1007_s00180-024-01473-6. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.