{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:13:55Z","timestamp":1742969635881,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031301049"},{"type":"electronic","value":"9783031301056"}],"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-30105-6_18","type":"book-chapter","created":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T20:31:55Z","timestamp":1681331515000},"page":"212-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["HMC-PSO: A Hamiltonian Monte Carlo and\u00a0Particle Swarm Optimization-Based Optimizer"],"prefix":"10.1007","author":[{"given":"Omatharv Bharat","family":"Vaidya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rithvik Terence","family":"DSouza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soma","family":"Dhavala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Snehanshu","family":"Saha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swagatam","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,13]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","unstructured":"Mohapatra, R., Saha, S., Coello, C.A.C., Bhattacharya, A., Dhavala, S.S., Saha, S.: AdaSwarm: Augmenting gradient-based optimizers in Deep Learning with Swarm Intelligence. IEEE Trans. Emerg. Top. Comput. Intell. 6(2), 329\u2013340 (2022). https:\/\/doi.org\/10.1109\/TETCI.2021.3083428","DOI":"10.1109\/TETCI.2021.3083428"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Agarwal, N., Anil, R., Hazan, E., Zhang, C.: Disentangling adaptive gradient methods from learning rates. ArXiv. https:\/\/doi.org\/10.48550\/arXiv.2002.11803","DOI":"10.48550\/arXiv.2002.11803"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Brooks, S., Gelman, A., Jones, G., Meng, X.-L. (eds.) Handbook of Markov Chain Monte Carlo (1st ed.). Chapman and Hall\/CRC (2011). https:\/\/doi.org\/10.1201\/b10905","DOI":"10.1201\/b10905"},{"key":"18_CR4","doi-asserted-by":"publisher","DOI":"10.2200\/S00110ED1V01Y200804CEM020","author":"SM Mikki","year":"2008","unstructured":"Mikki, S.M., Kishk, A.A.: Particle swarm optimizaton: a physics- based approach. Morgan Claypool (2008). https:\/\/doi.org\/10.2200\/S00110ED1V01Y200804CEM020","journal-title":"Morgan Claypool"},{"key":"18_CR5","unstructured":"Welling, M., Teh, Y.W.: Bayesian learning via stochastic gradient langevin dynamics. In: Proceedings of the 28th International Conference on Machine Learning, pp. 681-688 (2011). https:\/\/dl.acm.org\/doi\/abs\/10.5555\/3104482.3104568"},{"key":"18_CR6","doi-asserted-by":"publisher","unstructured":"Yokoi, S., Sato, I.: Bayesian interpretation of SGD as Ito process. ArXiv, vol. abs\/1206.1901 (2012). https:\/\/doi.org\/10.48550\/arXiv.1911.09011","DOI":"10.48550\/arXiv.1911.09011"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/IJCNN52387.2021.9534221","volume":"2021","author":"UN Jivani","year":"2021","unstructured":"Jivani, U.N., Vaidya, O.B., Bhattacharya, A., Saha, S.: A swarm variant for the schr\u00f6dinger solver. Int. Joint Conf. Neural Netw. (IJCNN) 2021, 1\u20138 (2021). https:\/\/doi.org\/10.1109\/IJCNN52387.2021.9534221","journal-title":"Int. Joint Conf. Neural Netw. (IJCNN)"},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014). https:\/\/doi.org\/10.48550\/arXiv.1412.6980","DOI":"10.48550\/arXiv.1412.6980"},{"key":"18_CR9","doi-asserted-by":"publisher","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21, 1087\u20131092 (1953). https:\/\/doi.org\/10.1063\/1.1699114","DOI":"10.1063\/1.1699114"},{"key":"18_CR10","doi-asserted-by":"publisher","unstructured":"Duane, S., Kennedy, A.D., Pendleton, B.J., Roweth, D.: Hybrid monte carlo. Phys. Lett. B 195(2), 216\u2013222 (1987). ISSN: 0370\u20132693. https:\/\/doi.org\/10.1016\/0370-2693(87)91197-X","DOI":"10.1016\/0370-2693(87)91197-X"},{"key":"18_CR11","doi-asserted-by":"publisher","unstructured":"Neal, R.M.: MCMC using Hamiltonian dynamics. ArXiv, vol. abs\/1911.09011 (2019). https:\/\/doi.org\/10.48550\/arXiv.1206.1901","DOI":"10.48550\/arXiv.1206.1901"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1198\/106186005X25727","volume":"14","author":"C Guihenneuc-Jouyaux","year":"2005","unstructured":"Guihenneuc-Jouyaux, C., Rousseau, J.: Laplace expansions in Markov chain monte Carlo algorithms. J. Comput. Graph. Stat. 14, 75\u201394 (2005)","journal-title":"J. Comput. Graph. Stat."},{"key":"18_CR13","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/978-3-030-92310-5_63","volume-title":"Neural Information Processing","author":"P Prudhvi Raj","year":"2021","unstructured":"Prudhvi Raj, P., Saha, S., Srinivasa, G.: Solving the\u00a0N-Queens and\u00a0Golomb Ruler problems using DQN and\u00a0an\u00a0approximation of\u00a0the\u00a0convergence. In: Mantoro, T., Lee, M., Ayu, M.A., Wong, K.W., Hidayanto, A.N. (eds.) ICONIP 2021. CCIS, vol. 1517, pp. 545\u2013553. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92310-5_63"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30105-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T20:35:19Z","timestamp":1681331719000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30105-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031301049","9783031301056"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30105-6_18","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":"13 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Delhi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iconip2022.apnns.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"810","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":"359","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":"44% - 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":"2.65","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":"3","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":"ICONIP 2022 consists of a two-volume set, LNCS & CCIS, which includes 146 and 213 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)"}}]}}