IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v36y2021i1d10.1007_s00180-020-01022-x.html
   My bibliography  Save this article

Adaptive spline fitting with particle swarm optimization

Author

Listed:
  • Soumya D. Mohanty

    (The University of Texas Rio Grande Valley)

  • Ethan Fahnestock

    (The University of Rochester)

Abstract

In fitting data with a spline, finding the optimal placement of knots can significantly improve the quality of the fit. However, the challenging high-dimensional and non-convex optimization problem associated with completely free knot placement has been a major roadblock in using this approach. We present a method that uses particle swarm optimization (PSO) combined with model selection to address this challenge. The problem of overfitting due to knot clustering that accompanies free knot placement is mitigated in this method by explicit regularization, resulting in a significantly improved performance on highly noisy data. The principal design choices available in the method are delineated and a statistically rigorous study of their effect on performance is carried out using simulated data and a wide variety of benchmark functions. Our results demonstrate that PSO-based free knot placement leads to a viable and flexible adaptive spline fitting approach that allows the fitting of both smooth and non-smooth functions.

Suggested Citation

  • Soumya D. Mohanty & Ethan Fahnestock, 2021. "Adaptive spline fitting with particle swarm optimization," Computational Statistics, Springer, vol. 36(1), pages 155-191, March.
    • Handle: RePEc:spr:compst:v:36:y:2021:i:1:d:10.1007_s00180-020-01022-x
    DOI: 10.1007/s00180-020-01022-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00180-020-01022-x
    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-020-01022-x?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.

    References listed on IDEAS

    as
    1. M. P. Wand, 2000. "A Comparison of Regression Spline Smoothing Procedures," Computational Statistics, Springer, vol. 15(4), pages 443-462, December.
    2. Zhou S. & Shen X., 2001. "Spatially Adaptive Regression Splines and Accurate Knot Selection Schemes," Journal of the American Statistical Association, American Statistical Association, vol. 96, pages 247-259, March.
    3. Francisco J. Solis & Roger J.-B. Wets, 1981. "Minimization by Random Search Techniques," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 19-30, February.
    4. Gerda Claeskens & Tatyana Krivobokova & Jean D. Opsomer, 2009. "Asymptotic properties of penalized spline estimators," Biometrika, Biometrika Trust, vol. 96(3), pages 529-544.
    5. Yang, Lianqiang & Hong, Yongmiao, 2017. "Adaptive penalized splines for data smoothing," Computational Statistics & Data Analysis, Elsevier, vol. 108(C), pages 70-83.
    6. Tatyana Krivobokova, 2013. "Smoothing parameter selection in two frameworks for penalized splines," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 75(4), pages 725-741, September.
    7. Scheipl, Fabian & Kneib, Thomas, 2009. "Locally adaptive Bayesian P-splines with a Normal-Exponential-Gamma prior," Computational Statistics & Data Analysis, Elsevier, vol. 53(10), pages 3533-3552, August.
    8. Xiao Wang & Pang Du & Jinglai Shen, 2013. "Smoothing splines with varying smoothing parameter," Biometrika, Biometrika Trust, vol. 100(4), pages 955-970.
    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. Yang, Lianqiang & Hong, Yongmiao, 2017. "Adaptive penalized splines for data smoothing," Computational Statistics & Data Analysis, Elsevier, vol. 108(C), pages 70-83.
    2. Feng, Yuanhua & Härdle, Wolfgang Karl, 2020. "A data-driven P-spline smoother and the P-Spline-GARCH models," IRTG 1792 Discussion Papers 2020-016, Humboldt University of Berlin, International Research Training Group 1792 "High Dimensional Nonstationary Time Series".
    3. Fabio Centofanti & Antonio Lepore & Alessandra Menafoglio & Biagio Palumbo & Simone Vantini, 2023. "Adaptive smoothing spline estimator for the function-on-function linear regression model," Computational Statistics, Springer, vol. 38(1), pages 191-216, March.
    4. Fengler, Matthias R. & Hin, Lin-Yee, 2015. "A simple and general approach to fitting the discount curve under no-arbitrage constraints," Finance Research Letters, Elsevier, vol. 15(C), pages 78-84.
    5. Dimitrova, Dimitrina S. & Kaishev, Vladimir K. & Lattuada, Andrea & Verrall, Richard J., 2023. "Geometrically designed variable knot splines in generalized (non-)linear models," Applied Mathematics and Computation, Elsevier, vol. 436(C).
    6. Kagerer, Kathrin, 2013. "A short introduction to splines in least squares regression analysis," University of Regensburg Working Papers in Business, Economics and Management Information Systems 472, University of Regensburg, Department of Economics.
    7. Takuma Yoshida, 2016. "Asymptotics and smoothing parameter selection for penalized spline regression with various loss functions," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 70(4), pages 278-303, November.
    8. Georgios Gioldasis & Antonio Musolesi & Michel Simioni, 2020. "Model uncertainty, nonlinearities and out-of-sample comparison: evidence from international technology diffusion," Working Papers hal-02790523, HAL.
    9. Amato, Umberto & Antoniadis, Anestis & De Feis, Italia & Goude, Yannig & Lagache, Audrey, 2021. "Forecasting high resolution electricity demand data with additive models including smooth and jagged components," International Journal of Forecasting, Elsevier, vol. 37(1), pages 171-185.
    10. C. P. Stephens & W. Baritompa, 1998. "Global Optimization Requires Global Information," Journal of Optimization Theory and Applications, Springer, vol. 96(3), pages 575-588, March.
    11. Cao, Jiguo & Ramsay, James O., 2009. "Generalized profiling estimation for global and adaptive penalized spline smoothing," Computational Statistics & Data Analysis, Elsevier, vol. 53(7), pages 2550-2562, May.
    12. Yaeji Lim & Hee-Seok Oh & Ying Kuen Cheung, 2019. "Multiscale Clustering for Functional Data," Journal of Classification, Springer;The Classification Society, vol. 36(2), pages 368-391, July.
    13. J. Redondo & J. Fernández & I. García & P. Ortigosa, 2009. "A robust and efficient algorithm for planar competitive location problems," Annals of Operations Research, Springer, vol. 167(1), pages 87-105, March.
    14. Bremhorst, Vincent & Lambert, Philippe, 2013. "Flexible estimation in cure survival models using Bayesian P-splines," LIDAM Discussion Papers ISBA 2013039, Université catholique de Louvain, Institute of Statistics, Biostatistics and Actuarial Sciences (ISBA).
    15. Sonja Greven & Ciprian Crainiceanu, 2013. "On likelihood ratio testing for penalized splines," AStA Advances in Statistical Analysis, Springer;German Statistical Society, vol. 97(4), pages 387-402, October.
    16. Hvattum, Lars Magnus & Glover, Fred, 2009. "Finding local optima of high-dimensional functions using direct search methods," European Journal of Operational Research, Elsevier, vol. 195(1), pages 31-45, May.
    17. Blöchl, Andreas, 2014. "Trend Estimation with Penalized Splines as Mixed Models for Series with Structural Breaks," Discussion Papers in Economics 18446, University of Munich, Department of Economics.
    18. Ciprian Crainiceanu & David Ruppert & Raymond Carroll, 2004. "Spatially Adaptive Bayesian P-Splines with Heteroscedastic Errors," Johns Hopkins University Dept. of Biostatistics Working Paper Series 1061, Berkeley Electronic Press.
    19. Carlos E. Melo & Oscar O. Melo & Jorge Mateu, 2018. "A distance-based model for spatial prediction using radial basis functions," AStA Advances in Statistical Analysis, Springer;German Statistical Society, vol. 102(2), pages 263-288, April.
    20. Dillenburger, Steven P. & Cochran, Jeffery K. & Cammarano, Vincent R., 2013. "Minimizing supply airdrop collateral damage risk," Socio-Economic Planning Sciences, Elsevier, vol. 47(1), pages 9-19.

    More about this item

    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:spr:compst:v:36:y:2021:i:1:d:10.1007_s00180-020-01022-x. 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: 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.