{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T09:21:02Z","timestamp":1772788862733,"version":"3.50.1"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tsp.2021.3082467","type":"journal-article","created":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T15:24:03Z","timestamp":1621610643000},"page":"3190-3205","source":"Crossref","is-referenced-by-count":8,"title":["Conservative Stochastic Optimization With Expectation Constraints"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1509-7899","authenticated-orcid":false,"given":"Zeeshan","family":"Akhtar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8807-2695","authenticated-orcid":false,"given":"Amrit","family":"Bedi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4508-0062","authenticated-orcid":false,"given":"Ketan","family":"Rajawat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Uci machine learning repository","author":"asuncion","year":"2019"},{"key":"ref38","article-title":"Conservative stochastic optimization with expectation constraints","author":"akhtar","year":"2020"},{"key":"ref33","article-title":"Stochastic first-order methods for convex and nonconvex functional constrained optimization","author":"boob","year":"2019"},{"key":"ref32","article-title":"Stochastic compositional gradient descent under compositional constraints","author":"thomdapu","year":"2020"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2939468"},{"key":"ref30","article-title":"Stochastic approximation proximal method of multipliers for convex stochastic programming","author":"zhang","year":"2019"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-009-9522-7"},{"key":"ref36","first-page":"71","article-title":"Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes","author":"shamir","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref35","first-page":"156","article-title":"An efficient stochastic approximation algorithm for stochastic saddle point problems","author":"nemirovski","year":"2005"},{"key":"ref34","first-page":"15210","article-title":"Momentum-based variance reduction in non-convex sgd","author":"cutkosky","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2018.8503240"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"ref12","first-page":"521","article-title":"Projection-free online learning","author":"hazan","year":"2012","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref13","first-page":"1263","article-title":"Variance-reduced and projection-free stochastic optimization","author":"hazan","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref14","first-page":"1","article-title":"Stochastic conditional gradient methods: From convex minimization to submodular maximization","volume":"21","author":"mokhtari","year":"2020","journal-title":"J Mach Learn Res"},{"key":"ref15","first-page":"427","article-title":"Revisiting Frank-Wolfe: Projection-free sparse convex optimization","author":"jaggi","year":"2013","journal-title":"Proc 30th Int Conf Int Conf Mach Learn"},{"key":"ref16","first-page":"962","article-title":"Fairness constraints: Mechanisms for fair classification","author":"zafar","year":"2017","journal-title":"Proc Artif Intell Statist"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/050622328"},{"key":"ref18","article-title":"Semi-supervised learning, ser. adaptive computation and machine learning","author":"chapelle","year":"2006"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2019.2902493"},{"key":"ref28","article-title":"Optimal convergence for stochastic optimization with multiple expectation constraints","author":"basu","year":"2019"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2007.909833"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-020-00179-x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2015.2397344"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2792430"},{"key":"ref29","first-page":"494","article-title":"Stochastic gradient descent with only one projection","author":"mahdavi","year":"2012","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8461449"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0434-y"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2604302"},{"key":"ref9","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","author":"johnson","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref1","article-title":"Conservative stochastic optimization: $\\mathcal {O}(t^{(-1\/2)})$ optimality gap with zero constraint violation","author":"akhtar","year":"2021","journal-title":"IEEE ACC"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.21314\/JOR.2000.038"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1007\/s10618-017-0506-1","article-title":"Measuring discrimination in algorithmic decision making","volume":"31","author":"\u017eliobait?","year":"2017","journal-title":"Data Mining Knowl Discov"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2008.05.003"},{"key":"ref24","first-page":"1428","article-title":"Online convex optimization with stochastic constraints","author":"yu","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref41","article-title":"Conditional gradient methods for convex optimization with function constraints","author":"lan","year":"2020"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2894803"},{"key":"ref26","first-page":"2503","article-title":"Trading regret for efficiency: Online convex optimization with long term constraints","volume":"13","author":"mahdavi","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref25","article-title":"Subgradient methods for risk-sensitive optimization","author":"madavan","year":"2019"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9307529\/09439069.pdf?arnumber=9439069","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:38Z","timestamp":1652194238000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9439069\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/tsp.2021.3082467","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}