{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:08:29Z","timestamp":1743059309812,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031434204"},{"type":"electronic","value":"9783031434211"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43421-1_28","type":"book-chapter","created":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T20:37:24Z","timestamp":1694983044000},"page":"472-488","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Alpha Elimination: Using Deep Reinforcement Learning to\u00a0Reduce Fill-In During Sparse Matrix Decomposition"],"prefix":"10.1007","author":[{"given":"Arpan","family":"Dasgupta","sequence":"first","affiliation":[]},{"given":"Pawan","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,18]]},"reference":[{"issue":"4","key":"28_CR1","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1137\/S0895479894278952","volume":"17","author":"PR Amestoy","year":"1996","unstructured":"Amestoy, P.R., Davis, T.A., Duff, I.S.: An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17(4), 886\u2013905 (1996)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"28_CR2","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1006\/jcph.2002.7176","volume":"182","author":"M Benzi","year":"2002","unstructured":"Benzi, M.: Preconditioning techniques for large linear systems: a survey. J. Comput. Phys. 182(2), 418\u2013477 (2002)","journal-title":"J. Comput. Phys."},{"issue":"4","key":"28_CR3","doi-asserted-by":"publisher","first-page":"1996","DOI":"10.1137\/090757575","volume":"33","author":"\u00dcV \u00c7ataly\u00fcrek","year":"2011","unstructured":"\u00c7ataly\u00fcrek, \u00dc.V., Aykanat, C., Kayaaslan, E.: Hypergraph partitioning-based fill-reducing ordering for symmetric matrices. SIAM J. Sci. Comput. 33(4), 1996\u20132023 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"28_CR4","unstructured":"Contributors, S.: SpConv: spatially sparse convolution library. https:\/\/github.com\/traveller59\/spconv (2022)"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-981-15-8697-2_6","volume-title":"Computer Vision, Pattern Recognition, Image Processing, and Graphics","author":"S Das","year":"2020","unstructured":"Das, S., Katyan, S., Kumar, P.: Domain decomposition based preconditioned solver for bundle adjustment. In: Babu, R.V., Prasanna, M., Namboodiri, V.P. (eds.) Computer Vision, Pattern Recognition, Image Processing, and Graphics, pp. 64\u201375. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-8697-2_6"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Das, S., Katyan, S., Kumar, P.: A deflation based fast and robust preconditioner for bundle adjustment. In: Proceedings of the IEEE\/CVF Winter Conference on Applications of Computer Vision (WACV), pp. 1782\u20131789 (2021)","DOI":"10.1109\/WACV48630.2021.00182"},{"issue":"3","key":"28_CR7","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1145\/1024074.1024080","volume":"30","author":"TA Davis","year":"2004","unstructured":"Davis, T.A., Gilbert, J.R., Larimore, S.I., Ng, E.G.: Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. (TOMS) 30(3), 377\u2013380 (2004)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"7930","key":"28_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1038\/s41586-022-05172-4","volume":"610","author":"A Fawzi","year":"2022","unstructured":"Fawzi, A., et al.: Discovering faster matrix multiplication algorithms with reinforcement learning. Nature 610(7930), 47\u201353 (2022)","journal-title":"Nature"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations. JHU Press (2013)","DOI":"10.56021\/9781421407944"},{"issue":"7873","key":"28_CR10","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1038\/s41586-021-03819-2","volume":"596","author":"J Jumper","year":"2021","unstructured":"Jumper, J., et al.: Highly accurate protein structure prediction with AlphaFold. Nature 596(7873), 583\u2013589 (2021)","journal-title":"Nature"},{"key":"28_CR11","unstructured":"Karypis, G., Kumar, V.: METIS: a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices. Technical report (1997)"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Katyan, S., Das, S., Kumar, P.: Two-grid preconditioned solver for bundle adjustment. In: 2020 IEEE Winter Conference on Applications of Computer Vision (WACV), pp. 3588\u20133595 (2020)","DOI":"10.1109\/WACV45572.2020.9093265"},{"key":"28_CR13","unstructured":"Kaya, O., Kayaaslan, E., U\u00e7ar, B., Duff, I.S.: Fill-in reduction in sparse matrix factorizations using hypergraphs. Ph.D. thesis, INRIA (2014)"},{"issue":"35","key":"28_CR14","doi-asserted-by":"publisher","first-page":"1244","DOI":"10.21105\/joss.01244","volume":"4","author":"SP Kolodziej","year":"2019","unstructured":"Kolodziej, S.P., et al.: The SuiteSparse matrix collection website interface. J. Open Source Softw. 4(35), 1244 (2019)","journal-title":"J. Open Source Softw."},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Kumar, P.: Communication optimal least squares solver. In: 2014 IEEE International Conference on High Performance Computing and Communications, 2014 IEEE 6th International Symposium on Cyberspace Safety and Security, 2014 IEEE 11th International Conference on Embedded Software and Systems (HPCC, CSS, ICESS), pp. 316\u2013319 (2014)","DOI":"10.1109\/HPCC.2014.55"},{"issue":"5","key":"28_CR16","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1080\/00207160.2013.821115","volume":"91","author":"P Kumar","year":"2014","unstructured":"Kumar, P.: Aggregation based on graph matching and inexact coarse grid solve for algebraic two grid. Int. J. Comput. Math. 91(5), 1061\u20131081 (2014)","journal-title":"Int. J. Comput. Math."},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Kumar, P.: Multithreaded direction preserving preconditioners. In: 2014 IEEE 13th International Symposium on Parallel and Distributed Computing, pp. 148\u2013155 (2014)","DOI":"10.1109\/ISPDC.2014.23"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Kumar, P.: Multilevel communication optimal least squares. In: Procedia Computer Science, International Conference On Computational Science, ICCS 2015, vol. 51, pp. 1838\u20131847 (2015)","DOI":"10.1016\/j.procs.2015.05.410"},{"key":"28_CR19","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-319-40132-4_10","volume-title":"Recent Advances in Computational Optimization","author":"P Kumar","year":"2016","unstructured":"Kumar, P.: Fast preconditioned solver for truncated saddle point problem in nonsmooth Cahn\u2013Hilliard model. In: Fidanova, S. (ed.) Recent Advances in Computational Optimization. SCI, vol. 655, pp. 159\u2013177. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40132-4_10"},{"issue":"1","key":"28_CR20","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1080\/00207160.2014.998208","volume":"93","author":"P Kumar","year":"2016","unstructured":"Kumar, P., Grigori, L., Nataf, F., Niu, Q.: On relaxed nested factorization and combination preconditioning. Int. J. Comput. Math. 93(1), 179\u2013199 (2016)","journal-title":"Int. J. Comput. Math."},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Kumar, P., Markidis, S., Lapenta, G., Meerbergen, K., Roose, D.: High performance solvers for implicit particle in cell simulation. In: Procedia Computer Science, 2013 International Conference on Computational Science, ICCS, vol. 18, pp. 2251\u20132258 (2013)","DOI":"10.1016\/j.procs.2013.05.396"},{"key":"28_CR22","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-36803-5_16","volume-title":"Applied Parallel and Scientific Computing","author":"P Kumar","year":"2013","unstructured":"Kumar, P., Meerbergen, K., Roose, D.: Multi-threaded nested filtering factorization preconditioner. In: Manninen, P., \u00d6ster, P. (eds.) Applied Parallel and Scientific Computing, pp. 220\u2013234. Springer, Berlin Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36803-5_16"},{"issue":"1","key":"28_CR23","first-page":"1334","volume":"17","author":"S Levine","year":"2016","unstructured":"Levine, S., Finn, C., Darrell, T., Abbeel, P.: End-to-end training of deep visuomotor policies. J. Mach. Learn. Res. 17(1), 1334\u20131373 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"4\u20135","key":"28_CR24","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1177\/0278364917710318","volume":"37","author":"S Levine","year":"2018","unstructured":"Levine, S., Pastor, P., Krizhevsky, A., Ibarz, J., Quillen, D.: Learning hand-eye coordination for robotic grasping with deep learning and large-scale data collection. Int. J. Robot. Res. 37(4\u20135), 421\u2013436 (2018)","journal-title":"Int. J. Robot. Res."},{"key":"28_CR25","unstructured":"Li, K., Malik, J.: Learning to optimize. arXiv preprint arXiv:1606.01885 (2016)"},{"issue":"2","key":"28_CR26","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1137\/0713020","volume":"13","author":"WH Liu","year":"1976","unstructured":"Liu, W.H., Sherman, A.H.: Comparative analysis of the Cuthill-Mckee and the reverse Cuthill-Mckee ordering algorithms for sparse matrices. SIAM J. Numer. Anal. 13(2), 198\u2013213 (1976)","journal-title":"SIAM J. Numer. Anal."},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"Mehta, K., Mahajan, A., Kumar, P.: Effects of spectral normalization in multi-agent reinforcement learning. In: IEEE International Joint Conference on Neural Networks, IJCNN, pp. 148\u2013155 (2023)","DOI":"10.1109\/IJCNN54540.2023.10191226"},{"key":"28_CR28","doi-asserted-by":"crossref","unstructured":"Mehta, K., Mahajan, A., Kumar, P.: Marl-jax: Multi-agent reinforcement leaning framework for social generalization. In: ECML PKDD, pp. 148\u2013155 (2023)","DOI":"10.1007\/978-3-031-43430-3_19"},{"issue":"7540","key":"28_CR29","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih, V., et al.: Human-level control through deep reinforcement learning. Nature 518(7540), 529\u2013533 (2015)","journal-title":"Nature"},{"key":"28_CR30","doi-asserted-by":"crossref","unstructured":"Munos, R., et al.: From bandits to Monte-Carlo tree search: the optimistic principle applied to optimization and planning. Found. Trends\u00ae Mach. Learn. 7(1), 1\u2013129 (2014)","DOI":"10.1561\/2200000038"},{"issue":"1","key":"28_CR31","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s00211-010-0298-3","volume":"116","author":"Q Niu","year":"2010","unstructured":"Niu, Q., Grigori, L., Kumar, P., Nataf, F.: Modified tangential frequency filtering decomposition and its fourier analysis. Numer. Math. 116(1), 123\u2013148 (2010)","journal-title":"Numer. Math."},{"key":"28_CR32","doi-asserted-by":"crossref","unstructured":"Silver, D., et al.: Mastering the game of go with deep neural networks and tree search. Nature 529(7587), 484\u2013489 (2016)","DOI":"10.1038\/nature16961"},{"key":"28_CR33","unstructured":"Silver, D., et al.: Mastering chess and shogi by self-play with a general reinforcement learning algorithm. arXiv preprint arXiv:1712.01815 (2017)"},{"key":"28_CR34","doi-asserted-by":"crossref","unstructured":"Sinha, A., Azad, U., Singh, H.: Qubit routing using graph neural network aided Monte Carlo tree search. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, pp. 9935\u20139943 (2022)","DOI":"10.1609\/aaai.v36i9.21231"},{"key":"28_CR35","unstructured":"Tesauro, G., Das, R., Chan, H., Kephart, J., Levine, D., Rawson, F., Lefurgy, C.: Managing power consumption and performance of computing systems using reinforcement learning. In: Advances in Neural Information Processing Systems, vol. 20 (2007)"},{"key":"28_CR36","unstructured":"Zoph, B., Le, Q.V.: Neural architecture search with reinforcement learning. arXiv preprint arXiv:1611.01578 (2016)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases: Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43421-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T20:45:32Z","timestamp":1694983532000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43421-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031434204","9783031434211"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43421-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This work concerns algorithm development for sparse matrix factorization. To the best of our knowledge, we declare that there are no immediate or far reaching ethical considerations.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Considerations"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"829","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"196","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.63","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Applied Data Science Track: 239 submissions, 58 accepted papers; Demo Track: 31 submissions, 16 accepted papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}