IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v319y2024i2p484-493.html
   My bibliography  Save this article

Accelerated Double-Sketching Subspace Newton

Author

Listed:
  • Shang, Jun
  • Ye, Haishan
  • Chang, Xiangyu

Abstract

This paper proposes a second-order stochastic algorithm called Accelerated Double-Sketching Subspace Newton (ADSSN) to solve large-scale optimization problems with high dimensional feature spaces and substantial sample sizes. The proposed ADSSN has two computational superiority. First, ADSSN achieves a fast local convergence rate by exploiting Nesterov’s acceleration technique. Second, by taking full advantage of the double sketching strategy, ADSSN provides a lower computational cost for each iteration than competitive approaches. Moreover, these advantages hold for actually all sketching techniques, which enables practitioners to design custom sketching methods for specific applications. Finally, numerical experiments are carried out to demonstrate the efficiency of ADSSN compared with accelerated gradient descent and two single sketching counterparts.

Suggested Citation

  • Shang, Jun & Ye, Haishan & Chang, Xiangyu, 2024. "Accelerated Double-Sketching Subspace Newton," European Journal of Operational Research, Elsevier, vol. 319(2), pages 484-493.
    • Handle: RePEc:eee:ejores:v:319:y:2024:i:2:p:484-493
    DOI: 10.1016/j.ejor.2024.04.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724002613
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2024.04.002?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. Castro, Jordi & Escudero, Laureano F. & Monge, Juan F., 2023. "On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach," European Journal of Operational Research, Elsevier, vol. 310(1), pages 268-285.
    2. Torrealba, E.M.R. & Silva, J.G. & Matioli, L.C. & Kolossoski, O. & Santos, P.S.M., 2022. "Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 299(1), pages 46-59.
    3. Kallestad, Jakob & Hasibi, Ramin & Hemmati, Ahmad & Sörensen, Kenneth, 2023. "A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 309(1), pages 446-468.
    4. Sigrist, Fabio & Leuenberger, Nicola, 2023. "Machine learning for corporate default risk: Multi-period prediction, frailty correlation, loan portfolios, and tail probabilities," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1390-1406.
    5. Fouskakis, D., 2012. "Bayesian variable selection in generalized linear models using a combination of stochastic optimization methods," European Journal of Operational Research, Elsevier, vol. 220(2), pages 414-422.
    6. Yurii Nesterov, 2018. "Lectures on Convex Optimization," Springer Optimization and Its Applications, Springer, edition 2, number 978-3-319-91578-4, October.
    7. Gattermann-Itschert, Theresa & Thonemann, Ulrich W., 2021. "How training on multiple time slices improves performance in churn prediction," European Journal of Operational Research, Elsevier, vol. 295(2), pages 664-674.
    8. Polyak, B.T., 2007. "Newton's method and its use in optimization," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1086-1096, September.
    9. Shi, Zhenjun & Wang, Shengquan, 2011. "Nonmonotone adaptive trust region method," European Journal of Operational Research, Elsevier, vol. 208(1), pages 28-36, January.
    10. Rehfeldt, Daniel & Hobbie, Hannes & Schönheit, David & Koch, Thorsten & Möst, Dominik & Gleixner, Ambros, 2022. "A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models," European Journal of Operational Research, Elsevier, vol. 296(1), pages 60-71.
    11. Nazemi, Abdolreza & Baumann, Friedrich & Fabozzi, Frank J., 2022. "Intertemporal defaulted bond recoveries prediction via machine learning," European Journal of Operational Research, Elsevier, vol. 297(3), pages 1162-1177.
    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. Beyer Díaz, Stephanie & Coussement, Kristof & De Caigny, Arno, 2025. "From collaborative filtering to deep learning: Advancing recommender systems with longitudinal data in the financial services industry," European Journal of Operational Research, Elsevier, vol. 323(2), pages 609-625.
    2. Yen, Benjamin P.-C. & Luo, Yu, 2023. "Navigational guidance – A deep learning approach," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1179-1191.
    3. Shota Takahashi & Mituhiro Fukuda & Mirai Tanaka, 2022. "New Bregman proximal type algorithms for solving DC optimization problems," Computational Optimization and Applications, Springer, vol. 83(3), pages 893-931, December.
    4. A. Scagliotti & P. Colli Franzone, 2022. "A piecewise conservative method for unconstrained convex optimization," Computational Optimization and Applications, Springer, vol. 81(1), pages 251-288, January.
    5. Hu, Xiao & Kang, Siqin & Ren, Long & Zhu, Shaokeng, 2024. "Interactive preference analysis: A reinforcement learning framework," European Journal of Operational Research, Elsevier, vol. 319(3), pages 983-998.
    6. Ivorra, Benjamin & Mohammadi, Bijan & Manuel Ramos, Angel, 2015. "A multi-layer line search method to improve the initialization of optimization algorithms," European Journal of Operational Research, Elsevier, vol. 247(3), pages 711-720.
    7. Fu, Hao & Lam, William H.K. & Ma, Wei & Shi, Yuxin & Jiang, Rui & Sun, Huijun & Gao, Ziyou, 2025. "Modeling the residual queue and queue-dependent capacity in a static traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 192(C).
    8. Xin Jiang & Lieven Vandenberghe, 2022. "Bregman primal–dual first-order method and application to sparse semidefinite programming," Computational Optimization and Applications, Springer, vol. 81(1), pages 127-159, January.
    9. Borgonovo, Emanuele & Plischke, Elmar & Rabitti, Giovanni, 2024. "The many Shapley values for explainable artificial intelligence: A sensitivity analysis perspective," European Journal of Operational Research, Elsevier, vol. 318(3), pages 911-926.
    10. Merrick, James H. & Bistline, John E.T. & Blanford, Geoffrey J., 2024. "On representation of energy storage in electricity planning models," Energy Economics, Elsevier, vol. 136(C).
    11. Wang, Yuejing & Ye, Wuyi & Jiang, Ying & Liu, Xiaoquan, 2024. "Volatility prediction for the energy sector with economic determinants: Evidence from a hybrid model," International Review of Financial Analysis, Elsevier, vol. 92(C).
    12. Pascal Kundig & Fabio Sigrist, 2024. "A Spatio-Temporal Machine Learning Model for Mortgage Credit Risk: Default Probabilities and Loan Portfolios," Papers 2410.02846, arXiv.org, revised Jul 2025.
    13. Dursun Delen & Behrooz Davazdahemami & Elham Rasouli Dezfouli, 2024. "Predicting and Mitigating Freshmen Student Attrition: A Local-Explainable Machine Learning Framework," Information Systems Frontiers, Springer, vol. 26(2), pages 641-662, April.
    14. Felipe Lara & Raúl T. Marcavillaca & Phan Tu Vuong, 2025. "Characterizations, Dynamical Systems and Gradient Methods for Strongly Quasiconvex Functions," Journal of Optimization Theory and Applications, Springer, vol. 206(3), pages 1-25, September.
    15. Ma, Xuejiao & Che, Tianqi & Jiang, Qichuan, 2025. "A three-stage prediction model for firm default risk: An integration of text sentiment analysis," Omega, Elsevier, vol. 131(C).
    16. Matthias Bogaert & Lex Delaere, 2023. "Ensemble Methods in Customer Churn Prediction: A Comparative Analysis of the State-of-the-Art," Mathematics, MDPI, vol. 11(5), pages 1-28, February.
    17. G. Mena & K. Coussement & K. de Bock & A. de Caigny & S. Lessmann, 2024. "Exploiting Time-Varying RFM Measures for Customer Churn Prediction with Deep Neural Networks," Post-Print hal-04680677, HAL.
    18. Huiyi Cao & Kamil A. Khan, 2023. "General convex relaxations of implicit functions and inverse functions," Journal of Global Optimization, Springer, vol. 86(3), pages 545-572, July.
    19. Xin Yang & Lingling Xu, 2023. "Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems," Journal of Global Optimization, Springer, vol. 87(2), pages 939-964, November.
    20. Egor Gladin & Alexander Gasnikov & Pavel Dvurechensky, 2025. "Accuracy Certificates for Convex Minimization with Inexact Oracle," Journal of Optimization Theory and Applications, Springer, vol. 204(1), pages 1-23, January.

    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:ejores:v:319:y:2024:i:2:p:484-493. 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/locate/eor .

    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.