{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T19:14:22Z","timestamp":1779390862401,"version":"3.53.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"French National Agency","award":["ANR-17-CE33-0002"],"award-info":[{"award-number":["ANR-17-CE33-0002"]}]},{"name":"French National Agency","award":["ANR-11-IDEX-0004-02"],"award-info":[{"award-number":["ANR-11-IDEX-0004-02"]}]},{"name":"IDRIS","award":["AD011013183"],"award-info":[{"award-number":["AD011013183"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Affective Comput."],"published-print":{"date-parts":[[2023,10,1]]},"DOI":"10.1109\/taffc.2022.3178524","type":"journal-article","created":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T15:42:02Z","timestamp":1654184522000},"page":"2876-2888","source":"Crossref","is-referenced-by-count":12,"title":["Multi-Order Networks for Action Unit Detection"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1123-9346","authenticated-orcid":false,"given":"Gauthier","family":"Tallec","sequence":"first","affiliation":[{"name":"Sorbonne Université, CNRS, Institut des Systémes Intelligents et de Robotique, ISIR, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arnaud","family":"Dapogny","sequence":"additional","affiliation":[{"name":"Datakalab, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7802-3673","authenticated-orcid":false,"given":"K\u00e9vin","family":"Bailly","sequence":"additional","affiliation":[{"name":"Sorbonne Université, CNRS, Institut des Systémes Intelligents et de Robotique, ISIR, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780195179644.001.0001"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2781233"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.579"},{"key":"ref4","first-page":"5413","article-title":"Maximizing subset accuracy with recurrent neural networks in multi-label classification","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Nam"},{"key":"ref5","first-page":"2873","article-title":"Recurrent neural network for text classification with multi-task learning","volume-title":"Proc. 25th Int. Joint Conf. Artif. Intell.","author":"Liu"},{"key":"ref6","article-title":"Order matters: Sequence to sequence for sets","volume-title":"Proc. 4th Int. Conf. Learn. Representations","author":"Vinyals"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.369"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/FG.2017.136"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01261-8_43"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-020-01378-z"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TAFFC.2019.2948635"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01258-8_19"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00620"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33018594"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01219"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00759"},{"key":"ref17","first-page":"14338","article-title":"Knowledge augmented deep neural networks for joint facial expression and action unit recognition","volume":"33","author":"Cui","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2016.07.028"},{"issue":"36","key":"ref19","article-title":"EMFACS-7: Emotional facial action coding system","volume":"2","author":"Friesen","year":"1983","journal-title":"Unpublished Manuscript, Univ. California San Francisco"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2019.8802914"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.433"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAFFC.2021.3135516"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10599-4_7"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178814"},{"key":"ref25","article-title":"An overview of multi-task learning in deep neural networks","author":"Ruder","year":"2017"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00332"},{"key":"ref27","article-title":"DARTS: Differentiable architecture search","volume-title":"Proc. 7th Int. Conf. Learn. Representations","author":"Liu"},{"key":"ref28","article-title":"Beyond shared hierarchies: Deep multitask learning through soft layer ordering","volume-title":"Proc. 6th Int. Conf. Learn. Representations","author":"Meyerson"},{"key":"ref29","article-title":"Adashare: Learning what to share for efficient deep multi-task learning","volume":"33","author":"Sun","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref30","first-page":"235","article-title":"Integrated perception with recurrent multi-task neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Bilen"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P15-1166"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P16-2038"},{"issue":"1","key":"ref33","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"Srivastava","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref34","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. 3rd Int. Conf. Learn. Representations","author":"Kingma"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/FG.2018.00020"},{"key":"ref36","article-title":"Decoupled weight decay regularization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Loshchilov"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.324"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2791608"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01258-8_19"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01219"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/FG.2019.8756519"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.01034"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.74"}],"container-title":["IEEE Transactions on Affective Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5165369\/10330166\/09787392.pdf?arnumber=9787392","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:50:18Z","timestamp":1760982618000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9787392\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,1]]},"references-count":43,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/taffc.2022.3178524","relation":{},"ISSN":["1949-3045","2371-9850"],"issn-type":[{"value":"1949-3045","type":"electronic"},{"value":"2371-9850","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,1]]}}}