{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T06:51:07Z","timestamp":1782283867687,"version":"3.54.5"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP23K16948"],"award-info":[{"award-number":["JP23K16948"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"name":"JST, PRESTO","award":["JPMJPR22C8"],"award-info":[{"award-number":["JPMJPR22C8"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s10994-026-07055-5","type":"journal-article","created":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T09:19:16Z","timestamp":1778318356000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Data-Driven Projection Generation for Efficiently Solving Heterogeneous Quadratic Programming Problems"],"prefix":"10.1007","volume":"115","author":[{"given":"Tomoharu","family":"Iwata","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Futoshi","family":"Futami","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"7055_CR1","doi-asserted-by":"crossref","unstructured":"Akchen, Y.-C. & Mi\u0161i\u0107, V. V. (2024). Column-randomized linear programs: Performance guarantees and applications. Operations Research.","DOI":"10.1287\/opre.2020.0494"},{"key":"7055_CR2","unstructured":"Andersen, M., Dahl, J. & Vandenberghe, L. (2015). CVXOPT: Python software for convex optimization."},{"key":"7055_CR3","volume-title":"Neural network learning: Theoretical foundations","author":"M Anthony","year":"2009","unstructured":"Anthony, M., & Bartlett, P. L. (2009). Neural network learning: Theoretical foundations. Cambridge University Press."},{"issue":"4","key":"7055_CR4","doi-asserted-by":"publisher","first-page":"2229","DOI":"10.1287\/ijoc.2022.1181","volume":"34","author":"D Bertsimas","year":"2022","unstructured":"Bertsimas, D., & Stellato, B. (2022). Online mixed-integer optimization in milliseconds. INFORMS Journal on Computing, 34(4), 2229\u20132248.","journal-title":"INFORMS Journal on Computing"},{"key":"7055_CR5","first-page":"531","volume-title":"Financial services information systems","author":"MJ Best","year":"2000","unstructured":"Best, M. J., & Kale, J. K. (2000). Quadratic programming for large-scale portfolio optimization. Financial services information systems (pp. 531\u2013548). Auerbach Publications."},{"key":"7055_CR48","doi-asserted-by":"crossref","unstructured":"Ben-David, S., Blitzer, J., Crammer, K., Kulesza, A., Pereira, F., & Vaughan, J. W. (2010). A theory of learning from different domains. Machine Learning, 79(1), 151-175.","DOI":"10.1007\/s10994-009-5152-4"},{"key":"7055_CR6","first-page":"595","volume-title":"International conference on the integration of constraint programming, artificial intelligence, and operations research","author":"P Bonami","year":"2018","unstructured":"Bonami, P., Lodi, A., & Zarpellon, G. (2018). Learning a classification of mixed-integer quadratic programming problems. International conference on the integration of constraint programming, artificial intelligence, and operations research (pp. 595\u2013604). Springer."},{"issue":"2","key":"7055_CR7","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s10589-022-00422-7","volume":"84","author":"A Butler","year":"2023","unstructured":"Butler, A., & Kwon, R. H. (2023). Efficient differentiable quadratic programming layers: An ADMM approach. Computational Optimization and Applications, 84(2), 449\u2013476.","journal-title":"Computational Optimization and Applications"},{"key":"7055_CR8","unstructured":"Caron, S., Zaki, A., Otta, P., Arnstr\u00f6m, D., Carpentier, J., Yang, F, & Leziart, P.-A. (2025). qpbenchmark: Benchmark for quadratic programming solvers available in Python.\u00a0https:\/\/github.com\/qpsolvers\/qpbenchmark."},{"key":"7055_CR9","doi-asserted-by":"crossref","unstructured":"Chen, S., Saulnier, K., Atanasov, N., Lee, D. D., Kumar, V., Pappas, G. J. & Morari, M. (2018). Approximating explicit model predictive control using constrained neural networks.\u00a0Annual American control conference\u00a0(pp. 1520\u20131527). IEEE.","DOI":"10.23919\/ACC.2018.8431275"},{"key":"7055_CR10","unstructured":"Chen, Z., Chen, X., Liu, J., Wang, X. & Yin., W. (2025). Expressive power of graph neural networks for (mixed-integer) quadratic programs. International conference on machine learning."},{"issue":"1","key":"7055_CR11","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s10107-020-01517-x","volume":"183","author":"C D\u2019Ambrosio","year":"2020","unstructured":"D\u2019Ambrosio, C., Liberti, L., Poirion, P.-L., & Vu, K. (2020). Random projections for quadratic programs. Mathematical Programming, 183(1), 619\u2013647.","journal-title":"Mathematical Programming"},{"issue":"83","key":"7055_CR12","first-page":"1","volume":"17","author":"S Diamond","year":"2016","unstructured":"Diamond, S., & Boyd, S. (2016). CVXPY: A Python-embedded modeling language for convex optimization. Journal of Machine Learning Research, 17(83), 1\u20135.","journal-title":"Journal of Machine Learning Research"},{"key":"7055_CR13","unstructured":"Fey, M. & Lenssen, J. E. (2019). Fast graph representation learning with PyTorch Geometric. arXiv:1903.02428."},{"issue":"2","key":"7055_CR14","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1137\/21M1433678","volume":"32","author":"T Fuji","year":"2022","unstructured":"Fuji, T., Poirion, P.-L., & Takeda, A. (2022). Convexification with bounded gap for randomly projected quadratic optimization. SIAM Journal on Optimization, 32(2), 874\u2013899.","journal-title":"SIAM Journal on Optimization"},{"key":"7055_CR15","doi-asserted-by":"crossref","unstructured":"Gao, Q., Wang, F., Xue, N., Yu, J.-G. & Xia, G.-S. (2021). Deep graph matching under quadratic constraint. In Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition\u00a0(pp. 5069\u20135078).","DOI":"10.1109\/CVPR46437.2021.00503"},{"key":"7055_CR16","unstructured":"Getzelman, G. & Balaprakash, P. (2021). Learning to switch optimizers for quadratic programming. In Asian conference on machine learning\u00a0(pp. 1553\u20131568)."},{"issue":"2","key":"7055_CR17","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1002\/jae.3950010203","volume":"1","author":"J Geweke","year":"1986","unstructured":"Geweke, J. (1986). Exact inference in the inequality constrained normal linear regression model. Journal of Applied econometrics, 1(2), 127\u2013141.","journal-title":"Journal of Applied econometrics"},{"key":"7055_CR18","first-page":"21043","volume":"34","author":"J Ichnowski","year":"2021","unstructured":"Ichnowski, J., Jain, P., Stellato, B., Banjac, G., Luo, M., Borrelli, F., Gonzalez, J. E., Stoica, I., & Goldberg, K. (2021). Accelerating quadratic optimization with reinforcement learning. Advances in Neural Information Processing Systems, 34, 21043\u201321055.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"7055_CR19","unstructured":"Iwata, T. & Sakaue, S. (2025). Learning to generate projections for reducing dimensionality of heterogeneous linear programming problems. In International conference on machine learning."},{"key":"7055_CR20","unstructured":"Jung, H., Park, J. & Park, J. (2022). Learning context-aware adaptive solvers to accelerate quadratic programming. arXiv:2211.12443."},{"issue":"9","key":"7055_CR21","doi-asserted-by":"publisher","first-page":"3866","DOI":"10.1109\/TCYB.2020.2999556","volume":"50","author":"B Karg","year":"2020","unstructured":"Karg, B., & Lucia, S. (2020). Efficient representation and approximation of model predictive control laws via deep learning. IEEE Transactions on Cybernetics, 50(9), 3866\u20133878.","journal-title":"IEEE Transactions on Cybernetics"},{"key":"7055_CR22","doi-asserted-by":"crossref","unstructured":"King, E., Kotary, J., Fioretto, F. & Drgona, J. (2024). Metric learning to accelerate convergence of operator splitting methods for differentiable parametric programming. arXiv:2404.00882.","DOI":"10.1109\/CDC56724.2024.10886873"},{"key":"7055_CR23","unstructured":"Kingma, D. P. & Ba, J. L. (2015). Adam: A method for stochastic optimization. In International conference on learning representations."},{"key":"7055_CR24","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.laa.2021.06.010","volume":"626","author":"L Liberti","year":"2021","unstructured":"Liberti, L., Poirion, P.-L., & Vu, K. (2021). Random projections for conic programs. Linear Algebra and its Applications, 626, 204\u2013220.","journal-title":"Linear Algebra and its Applications"},{"key":"7055_CR25","unstructured":"Liu, C., Jiang, Z., Wang, R., Yan, J., Huang, L. & Lu, P. (2020). Revocable deep reinforcement learning with affinity regularization for outlier-robust graph matching. arXiv:2012.08950."},{"issue":"4","key":"7055_CR26","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1080\/00401706.1969.10490736","volume":"11","author":"N Mantel","year":"1969","unstructured":"Mantel, N. (1969). Restricted least squares regression and convex quadratic programming. Technometrics, 11(4), 763\u2013773.","journal-title":"Technometrics"},{"issue":"1\u20134","key":"7055_CR27","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1080\/10556789908805768","volume":"11","author":"I Maros","year":"1999","unstructured":"Maros, I., & M\u00e9sz\u00e1ros, C. (1999). A repository of convex quadratic programming problems. Optimization Methods and Software, 11(1\u20134), 671\u2013681.","journal-title":"Optimization Methods and Software"},{"issue":"2","key":"7055_CR28","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1111\/1468-0262.00296","volume":"70","author":"P Milgrom","year":"2002","unstructured":"Milgrom, P., & Segal, I. (2002). Envelope theorems for arbitrary choice sets. Econometrica, 70(2), 583\u2013601.","journal-title":"Econometrica"},{"key":"7055_CR29","volume-title":"Foundations of machine learning","author":"M Mohri","year":"2018","unstructured":"Mohri, M., Rostamizadeh, A., & Talwalkar, A. (2018). Foundations of machine learning (2nd ed.). The MIT Press.","edition":"2"},{"key":"7055_CR30","doi-asserted-by":"crossref","unstructured":"Morris, C., Ritzert, M., Fey, M., Hamilton, W. L., Lenssen, J. E., Rattan, G, & Grohe, M. (2019). Weisfeiler and Leman go neural: Higher-order graph neural networks. In AAAI conference on artificial intelligence\u00a0(pp. 4602\u20134609).","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"7055_CR31","unstructured":"Nguyen, A. T. & Nguyen, V. A. (2025). Provably data-driven projection method for quadratic programming. arXiv:2509.04524."},{"key":"7055_CR32","doi-asserted-by":"crossref","unstructured":"Nowak, A., Villar, S., Bandeira, A. S. & Bruna, J. (2018). Revised note on learning quadratic assignment with graph neural networks. In IEEE data science workshop\u00a0(pp. 1\u20135). IEEE.","DOI":"10.1109\/DSW.2018.8439919"},{"key":"7055_CR33","unstructured":"Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., Antiga, L., Desmaison, A., Kopf, A., Yang, E., DeVito, Z., Raison, M., Tejani, A., Chilamkurthy, S., Steiner, B., & Chintala, S. (2019). PyTorch: An imperative style, high-performance deep learning library. Advances in neural information processing systems."},{"key":"7055_CR34","doi-asserted-by":"crossref","unstructured":"Pei, C., Xu, Z., You, S., Sun, J. & Dai, R. (2023). Reinforcement learning-guided quadratically constrained quadratic programming for enhanced convergence and optimality. In IEEE conference on decision and control\u00a0(pp. 7293\u20137298). IEEE.","DOI":"10.1109\/CDC49753.2023.10383301"},{"issue":"1","key":"7055_CR35","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1109\/TCST.2005.860516","volume":"14","author":"JA Petersen","year":"2006","unstructured":"Petersen, J. A., & Bodson, M. (2006). Constrained quadratic programming techniques for control allocation. IEEE Transactions on Control Systems Technology, 14(1), 91\u201398.","journal-title":"IEEE Transactions on Control Systems Technology"},{"key":"7055_CR36","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.laa.2023.01.013","volume":"664","author":"P-L Poirion","year":"2023","unstructured":"Poirion, P.-L., Louren\u00e7o, B. F., & Takeda, A. (2023). Random projections of linear and semidefinite problems with linear inequalities. Linear Algebra and its Applications, 664, 24\u201360.","journal-title":"Linear Algebra and its Applications"},{"key":"7055_CR37","first-page":"1491","volume":"11","author":"I Rodriguez-Lujan","year":"2010","unstructured":"Rodriguez-Lujan, I., Huerta, R., Elkan, C., & Cruz, C. S. (2010). Quadratic programming feature selection. Journal of Machine Learning Research, 11, 1491\u20131516.","journal-title":"Journal of Machine Learning Research"},{"key":"7055_CR38","doi-asserted-by":"publisher","first-page":"12825","DOI":"10.52202\/079017-0408","volume":"37","author":"S Sakaue","year":"2024","unstructured":"Sakaue, S., & Oki, T. (2024). Generalization bound and learning methods for data-driven projections in linear programming. Advances in Neural Information Processing Systems, 37, 12825\u201312846.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"7055_CR39","unstructured":"Sambharya, R., Hall, G., Amos, B., & Stellato, B. (2023). End-to-end learning to warm-start for real-time quadratic optimization. In Learning for dynamics and control conference\u00a0(pp 220\u2013234)."},{"issue":"4","key":"7055_CR40","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s12532-020-00179-2","volume":"12","author":"B Stellato","year":"2020","unstructured":"Stellato, B., Banjac, G., Goulart, P., Bemporad, A., & Boyd, S. (2020). OSQP: An operator splitting solver for quadratic programs. Mathematical Programming Computation, 12(4), 637\u2013672.","journal-title":"Mathematical Programming Computation"},{"issue":"9","key":"7055_CR41","doi-asserted-by":"publisher","first-page":"3633","DOI":"10.1007\/s11263-024-02040-8","volume":"132","author":"H Tan","year":"2024","unstructured":"Tan, H., Wang, C., Wu, S., Zhang, X.-Y., Yin, F., & Liu, C.-L. (2024). Ensemble quadratic assignment network for graph matching. International Journal of Computer Vision, 132(9), 3633\u20133655.","journal-title":"International Journal of Computer Vision"},{"key":"7055_CR42","doi-asserted-by":"crossref","unstructured":"Vu, K., Poirion, P.-L., D\u2019Ambrosio, C. & Liberti, L. (2019). Random projections for quadratic programs over a euclidean ball. In International conference on integer programming and combinatorial optimization\u00a0(pp. 442\u2013452). Springer.","DOI":"10.1007\/978-3-030-17953-3_33"},{"key":"7055_CR43","doi-asserted-by":"publisher","DOI":"10.1017\/9781108627771","volume-title":"High-dimensional statistics: A non-asymptotic viewpoint","author":"MJ Wainwright","year":"2019","unstructured":"Wainwright, M. J. (2019). High-dimensional statistics: A non-asymptotic viewpoint. Cambridge University Press."},{"key":"7055_CR44","doi-asserted-by":"crossref","unstructured":"Wang, R., Yan, J., & Yang, X. (2020a). Combinatorial learning of robust deep graph matching: An embedding based approach. IEEE Transactions on Pattern Analysis and Machine Intelligence, 45(6), 6984\u20137000.","DOI":"10.1109\/TPAMI.2020.3005590"},{"key":"7055_CR45","doi-asserted-by":"crossref","unstructured":"Wang, T., Liu, H., Li, Y., Jin, Y., Hou, X. & Ling, H. (2020b). Learning combinatorial solver for graph matching. In Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition\u00a0(pp. 7568\u20137577).","DOI":"10.1109\/CVPR42600.2020.00759"},{"key":"7055_CR46","unstructured":"Wu, C., Chen, Q., Wang, A., Ding, T., Sun, R., Yang, W. & Shi, Q. (2024). On representing convex quadratically constrained quadratic programs via graph neural networks. arXiv:2411.13805."},{"issue":"4","key":"7055_CR47","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/S0167-8191(03)00021-8","volume":"29","author":"G Zanghirati","year":"2003","unstructured":"Zanghirati, G., & Zanni, L. (2003). A parallel solver for large quadratic programs in training support vector machines. Parallel Computing, 29(4), 535\u2013551.","journal-title":"Parallel Computing"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-026-07055-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-026-07055-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-026-07055-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T06:35:27Z","timestamp":1782282927000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-026-07055-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":48,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["7055"],"URL":"https:\/\/doi.org\/10.1007\/s10994-026-07055-5","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"18 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"123"}}