{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:18:03Z","timestamp":1743016683316,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030585730"},{"type":"electronic","value":"9783030585747"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-58574-7_28","type":"book-chapter","created":{"date-parts":[[2020,11,12]],"date-time":"2020-11-12T16:19:07Z","timestamp":1605197947000},"page":"464-480","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Truncated Inference for Latent Variable Optimization Problems: Application to Robust Estimation and Learning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2840-6187","authenticated-orcid":false,"given":"Christopher","family":"Zach","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7562-7180","authenticated-orcid":false,"given":"Huu","family":"Le","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,13]]},"reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-15552-9_3","volume-title":"Computer Vision \u2013 ECCV 2010","author":"S Agarwal","year":"2010","unstructured":"Agarwal, S., Snavely, N., Seitz, S.M., Szeliski, R.: Bundle adjustment in the large. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010. LNCS, vol. 6312, pp. 29\u201342. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15552-9_3"},{"key":"28_CR2","unstructured":"Almeida, L.B.: A learning rule for asynchronous perceptrons with feedback in a combinatorial environment. In: Artificial Neural Networks: Concept Learning, pp. 102\u2013111 (1990)"},{"issue":"3","key":"28_CR3","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1137\/S1052623497331063","volume":"10","author":"DP Bertsekas","year":"2000","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Gradient convergence in gradient methods with errors. SIAM J. Optim. 10(3), 627\u2013642 (2000)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"28_CR4","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/s10957-012-0134-2","volume":"156","author":"CL Byrne","year":"2013","unstructured":"Byrne, C.L.: Alternating minimization as sequential unconstrained minimization: a survey. J. Optim. Theory Appl. 156(3), 554\u2013566 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"28_CR5","unstructured":"Clanuwat, T., Bober-Irizar, M., Kitamoto, A., Lamb, A., Yamamoto, K., Ha, D.: Deep learning for classical japanese literature. arXiv preprint arXiv:1812.01718 (2018)"},{"key":"28_CR6","unstructured":"Csisz\u00e1r, I., Tusn\u00e1dy, G.E.: Information geometry and alternating minimization procedures. In: Statistics and Decisions (1984)"},{"issue":"1","key":"28_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Stat. Soc.: Ser. B (Methodol.) 39(1), 1\u201322 (1977)","journal-title":"J. Roy. Stat. Soc.: Ser. B (Methodol.)"},{"key":"28_CR8","doi-asserted-by":"publisher","unstructured":"Devolder, O., Glineur, F., Nesterov, Y.: First-order methods of smooth convex optimization with inexact oracle. Math. Program. 146, 37\u201375 (2013). https:\/\/doi.org\/10.1007\/s10107-013-0677-5","DOI":"10.1007\/s10107-013-0677-5"},{"issue":"1","key":"28_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10957-016-0999-6","volume":"171","author":"P Dvurechensky","year":"2016","unstructured":"Dvurechensky, P., Gasnikov, A.: Stochastic intermediate gradient method for convex problems with stochastic inexact oracle. J. Optim. Theory Appl. 171(1), 121\u2013145 (2016)","journal-title":"J. Optim. Theory Appl."},{"issue":"9","key":"28_CR10","doi-asserted-by":"publisher","first-page":"1627","DOI":"10.1109\/TPAMI.2009.167","volume":"32","author":"PF Felzenszwalb","year":"2009","unstructured":"Felzenszwalb, P.F., Girshick, R.B., McAllester, D., Ramanan, D.: Object detection with discriminatively trained part-based models. IEEE Trans. Pattern Anal. Mach. Intell. 32(9), 1627\u20131645 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"28_CR11","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/34.120331","volume":"14","author":"D Geman","year":"1992","unstructured":"Geman, D., Reynolds, G.: Constrained restoration and the recovery of discontinuities. IEEE Trans. Pattern Anal. Mach. Intell. 14(3), 367\u2013383 (1992)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"28_CR12","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1198\/0003130042836","volume":"58","author":"DR Hunter","year":"2004","unstructured":"Hunter, D.R., Lange, K.: A tutorial on MM algorithms. Am. Stat. 58(1), 30\u201337 (2004)","journal-title":"Am. Stat."},{"key":"28_CR13","unstructured":"Krizhevsky, A., Hinton, G.: Learning multiple layers of features from tiny images. Technical report, Citeseer (2009)"},{"issue":"1","key":"28_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10618600.2000.10474858","volume":"9","author":"K Lange","year":"2000","unstructured":"Lange, K., Hunter, D.R., Yang, I.: Optimization transfer using surrogate objective functions. J. Comput. Graph. Stat. 9(1), 1\u201320 (2000)","journal-title":"J. Comput. Graph. Stat."},{"issue":"11","key":"28_CR15","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P., et al.: Gradient-based learning applied to document recognition. Proc. IEEE 86(11), 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"issue":"1","key":"28_CR16","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00939948","volume":"72","author":"ZQ Luo","year":"1992","unstructured":"Luo, Z.Q., Tseng, P.: On the convergence of the coordinate descent method for convex differentiable minimization. J. Optim. Theory Appl. 72(1), 7\u201335 (1992)","journal-title":"J. Optim. Theory Appl."},{"key":"28_CR17","unstructured":"Mairal, J.: Optimization with first-order surrogate functions. In: International Conference on Machine Learning, pp. 783\u2013791 (2013)"},{"key":"28_CR18","unstructured":"Mairal, J.: Stochastic majorization-minimization algorithms for large-scale optimization. In: Advances in Neural Information Processing Systems, pp. 2283\u20132291 (2013)"},{"issue":"2","key":"28_CR19","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1137\/140957639","volume":"25","author":"J Mairal","year":"2015","unstructured":"Mairal, J.: Incremental majorization-minimization optimization with application to large-scale machine learning. SIAM J. Optim. 25(2), 829\u2013855 (2015)","journal-title":"SIAM J. Optim."},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Movellan, J.R.: Contrastive Hebbian learning in the continuous hopfield model. In: Connectionist Models, pp. 10\u201317. Elsevier (1991)","DOI":"10.1016\/B978-1-4832-1448-1.50007-X"},{"key":"28_CR21","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-94-011-5014-9_12","volume-title":"Learning in Graphical Models","author":"RM Neal","year":"1998","unstructured":"Neal, R.M., Hinton, G.E.: A view of the EM algorithm that justifies incremental, sparse, and other variants. In: Jordan, M.I. (ed.) Learning in Graphical Models, pp. 355\u2013368. Springer, Dordrecht (1998). https:\/\/doi.org\/10.1007\/978-94-011-5014-9_12"},{"key":"28_CR22","unstructured":"Parizi, S.N., He, K., Aghajani, R., Sclaroff, S., Felzenszwalb, P.: Generalized majorization-minimization. In: International Conference on Machine Learning, pp. 5022\u20135031 (2019)"},{"issue":"19","key":"28_CR23","doi-asserted-by":"publisher","first-page":"2229","DOI":"10.1103\/PhysRevLett.59.2229","volume":"59","author":"FJ Pineda","year":"1987","unstructured":"Pineda, F.J.: Generalization of back-propagation to recurrent neural networks. Phys. Rev. Lett. 59(19), 2229 (1987)","journal-title":"Phys. Rev. Lett."},{"issue":"2","key":"28_CR24","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10107-016-1021-7","volume":"157","author":"M Razaviyayn","year":"2016","unstructured":"Razaviyayn, M., Sanjabi, M., Luo, Z.Q.: A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks. Math. Program. 157(2), 515\u2013545 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"28_CR25","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","volume":"20","author":"F Scarselli","year":"2008","unstructured":"Scarselli, F., Gori, M., Tsoi, A.C., Hagenbuchner, M., Monfardini, G.: The graph neural network model. IEEE Trans. Neural Netw. 20(1), 61\u201380 (2008)","journal-title":"IEEE Trans. Neural Netw."},{"key":"28_CR26","doi-asserted-by":"publisher","first-page":"24","DOI":"10.3389\/fncom.2017.00024","volume":"11","author":"B Scellier","year":"2017","unstructured":"Scellier, B., Bengio, Y.: Equilibrium propagation: bridging the gap between energy-based models and backpropagation. Front. Comput. Neurosci. 11, 24 (2017)","journal-title":"Front. Comput. Neurosci."},{"issue":"1","key":"28_CR27","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"SJ Wright","year":"2015","unstructured":"Wright, S.J.: Coordinate descent algorithms. Math. Program. 151(1), 3\u201334 (2015). https:\/\/doi.org\/10.1007\/s10107-015-0892-3","journal-title":"Math. Program."},{"key":"28_CR28","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1214\/aos\/1176346060","volume":"11","author":"CJ Wu","year":"1983","unstructured":"Wu, C.J.: On the convergence properties of the EM algorithm. Ann. Stat. 11, 95\u2013103 (1983)","journal-title":"Ann. Stat."},{"key":"28_CR29","unstructured":"Xiao, H., Rasul, K., Vollgraf, R.: Fashion-MNIST: a novel image dataset for benchmarking machine learning algorithms. arXiv preprint arXiv:1708.07747 (2017)"},{"issue":"2","key":"28_CR30","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1162\/089976603762552988","volume":"15","author":"X Xie","year":"2003","unstructured":"Xie, X., Seung, H.S.: Equivalence of backpropagation and contrastive Hebbian learning in a layered network. Neural Comput. 15(2), 441\u2013454 (2003)","journal-title":"Neural Comput."},{"key":"28_CR31","doi-asserted-by":"crossref","unstructured":"Xu, C., Lin, Z., Zhao, Z., Zha, H.: Relaxed majorization-minimization for non-smooth and non-convex optimization. In: Thirtieth AAAI Conference on Artificial Intelligence (2016)","DOI":"10.1609\/aaai.v30i1.10074"},{"key":"28_CR32","doi-asserted-by":"crossref","unstructured":"Yu, C.N.J., Joachims, T.: Learning structural SVMs with latent variables. In: Proceedings of the 26th Annual International Conference on Machine Learning, pp. 1169\u20131176 (2009)","DOI":"10.1145\/1553374.1553523"},{"issue":"4","key":"28_CR33","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1162\/08997660360581958","volume":"15","author":"AL Yuille","year":"2003","unstructured":"Yuille, A.L., Rangarajan, A.: The concave-convex procedure. Neural Comput. 15(4), 915\u2013936 (2003)","journal-title":"Neural Comput."},{"key":"28_CR34","doi-asserted-by":"crossref","unstructured":"Zach, C., Bourmaud, G.: Descending, lifting or smoothing: secrets of robust cost optimization. In: Proceedings of ECCV (2018)","DOI":"10.1007\/978-3-030-01258-8_34"},{"key":"28_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1007\/978-3-319-10602-1_50","volume-title":"Computer Vision \u2013 ECCV 2014","author":"C Zach","year":"2014","unstructured":"Zach, C.: Robust bundle adjustment revisited. In: Fleet, D., Pajdla, T., Schiele, B., Tuytelaars, T. (eds.) ECCV 2014. LNCS, vol. 8693, pp. 772\u2013787. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10602-1_50"},{"key":"28_CR36","unstructured":"Zach, C., Estellers, V.: Contrastive learning for lifted networks. In: British Machine Vision Conference (2019)"},{"key":"28_CR37","doi-asserted-by":"crossref","unstructured":"Zhang, H., Zhou, P., Yang, Y., Feng, J.: Generalized majorization-minimization for non-convex optimization. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence, pp. 4257\u20134263. AAAI Press (2019)","DOI":"10.24963\/ijcai.2019\/591"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58574-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T00:10:11Z","timestamp":1731370211000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58574-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030585730","9783030585747"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58574-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"13 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Computer Vision","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Glasgow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eccv2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eccv2020.eu\/","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":"OpenReview","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5025","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":"1360","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":"27% - 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","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":"7","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":"The conference was held virtually due to the COVID-19 pandemic. From the ECCV Workshops 249 full papers, 18 short papers, and 21 further contributions were published out of a total of 467 submissions.","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)"}}]}}