{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T15:35:48Z","timestamp":1785857748982,"version":"3.56.0"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Mathematical Research Impact-Centric Support","award":["MTR\/2021\/000787"],"award-info":[{"award-number":["MTR\/2021\/000787"]}]},{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Core Research Grant","award":["CRG\/2023\/001230"],"award-info":[{"award-number":["CRG\/2023\/001230"]}]},{"DOI":"10.13039\/501100001412","name":"Council of Scientific and Industrial Research, India","doi-asserted-by":"publisher","award":["09\/1022(13849)\/2022-EMR-I"],"award-info":[{"award-number":["09\/1022(13849)\/2022-EMR-I"]}],"id":[{"id":"10.13039\/501100001412","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1109\/tpami.2024.3465535","type":"journal-article","created":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T17:24:49Z","timestamp":1726853089000},"page":"149-160","source":"Crossref","is-referenced-by-count":36,"title":["RoBoSS: A Robust, Bounded, Sparse, and Smooth Loss Function for Supervised Learning"],"prefix":"10.1109","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5276-6935","authenticated-orcid":false,"given":"Mushir","family":"Akhtar","sequence":"first","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology Indore, Indore, Madhya Pradesh, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5727-3697","authenticated-orcid":false,"given":"M.","family":"Tanveer","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology Indore, Indore, Madhya Pradesh, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1877-4552","authenticated-orcid":false,"given":"Mohd.","family":"Arshad","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology Indore, Indore, Madhya Pradesh, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00994018"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2440-0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240406"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00115-1"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.178"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/ett.3820"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018628609742"},{"issue":"8","key":"ref8","first-page":"1823","article-title":"Classification with a reject option using a hinge loss","volume":"9","author":"Bartlett","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2919185"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103635"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2010.57"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1198\/016214507000000617"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0854"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1198\/016214503000000639"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2018.04.003"},{"key":"ref16","article-title":"An overview of gradient descent optimization algorithms","author":"Ruder","year":"2016"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2023.109987"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2024.110637"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2017.03.011"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109990"},{"key":"ref21","first-page":"189","article-title":"The representer theorem for Hilbert spaces: A necessary and sufficient condition","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Dinuzzo"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1198\/016214505000000907"},{"issue":"Nov","key":"ref23","first-page":"463","article-title":"Rademacher and Gaussian complexities: Risk bounds and structural results","volume":"3","author":"Bartlett","year":"2002","journal-title":"J. Mach. Learn. Res."},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00837"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36434-X_1"},{"key":"ref26","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Johnson"},{"key":"ref27","first-page":"5332","article-title":"Federated accelerated stochastic gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yuan"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(98)00116-6"},{"issue":"3","key":"ref29","article-title":"A method for unconstrained convex minimization problem with the rate of convergence o (1\/k2)","volume":"269","author":"Nesterov","year":"1983","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2024.102463"},{"key":"ref32","first-page":"255","article-title":"KEEL data-mining software tool: Data set repository, integration of algorithms and experimental analysis framework","volume":"17","author":"Derrac","year":"2015","journal-title":"J. Mult. Valued Log. Soft Comput"},{"key":"ref33","article-title":"UCI machine learning repository","author":"Dua","year":"2017"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.061907"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-022-07655-x"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TBME.2015.2496264"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2019.12.001"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/34\/10777928\/10685140.pdf?arnumber=10685140","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T20:10:33Z","timestamp":1736367033000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10685140\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":37,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2024.3465535","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}