{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T04:41:05Z","timestamp":1773895265395,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":61,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T00:00:00Z","timestamp":1689638400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,19]]},"DOI":"10.1145\/3539618.3591714","type":"proceedings-article","created":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T00:22:59Z","timestamp":1689726179000},"page":"48-57","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning to Re-rank with Constrained Meta-Optimal Transport"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1729-1927","authenticated-orcid":false,"given":"Andr\u00e9s","family":"Hoyos-Idrobo","sequence":"first","affiliation":[{"name":"Rakuten Institute of Technology & Rakuten Group, Inc., Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Himan Abdollahpouri. 2019. Popularity bias in ranking and recommendation. In AAAI. 529--530.","DOI":"10.1145\/3306618.3314309"},{"key":"e_1_3_2_1_2_1","volume-title":"Ranking via sinkhorn propagation. arXiv preprint arXiv:1106.1925","author":"Adams Ryan Prescott","year":"2011","unstructured":"Ryan Prescott Adams and Richard S Zemel. 2011. Ranking via sinkhorn propagation. arXiv preprint arXiv:1106.1925 (2011)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Aman Agarwal Kenta Takatsu Ivan Zaitsev and Thorsten Joachims. 2019. A general framework for counterfactual learning-to-rank. In ACM SIGIR. 5--14.","DOI":"10.1145\/3331184.3331202"},{"key":"e_1_3_2_1_4_1","volume-title":"Tutorial on amortized optimization for learning to optimize over continuous domains. arXiv preprint arXiv:2202.00665","author":"Amos Brandon","year":"2022","unstructured":"Brandon Amos. 2022. Tutorial on amortized optimization for learning to optimize over continuous domains. arXiv preprint arXiv:2202.00665 (2022)."},{"key":"e_1_3_2_1_5_1","volume-title":"Meta optimal transport. arXiv preprint arXiv:2206.05262","author":"Amos Brandon","year":"2022","unstructured":"Brandon Amos, Samuel Cohen, Giulia Luise, and Ievgen Redko. 2022. Meta optimal transport. arXiv preprint arXiv:2206.05262 (2022)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Abolfazl Asudeh HV Jagadish Julia Stoyanovich and Gautam Das. 2019. Designing fair ranking schemes. In SIGMOD. 1259--1276.","DOI":"10.1145\/3299869.3300079"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Asia J Biega Krishna P Gummadi and Gerhard Weikum. 2018. Equity of attention: Amortizing individual fairness in rankings. In ACM SIGIR. 405--414.","DOI":"10.1145\/3209978.3210063"},{"key":"e_1_3_2_1_8_1","volume-title":"Lattice theory","author":"Birkhoff Garrett","unstructured":"Garrett Birkhoff. 1940. Lattice theory. Vol. 25. American Mathematical Soc."},{"key":"e_1_3_2_1_9_1","first-page":"147","article-title":"Tres observaciones sobre el algebra lineal","volume":"5","author":"Birkhoff Garrett","year":"1946","unstructured":"Garrett Birkhoff. 1946. Tres observaciones sobre el algebra lineal. Univ. Nac. Tucuman, Ser. A, Vol. 5 (1946), 147--154.","journal-title":"Univ. Nac. Tucuman, Ser. A"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Sebastian Bruch Shuguang Han Michael Bendersky and Marc Najork. 2020. A stochastic treatment of learning to rank scoring functions. In ACM WSDM. 61--69.","DOI":"10.1145\/3336191.3371844"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Zhe Cao Tao Qin Tie-Yan Liu Ming-Feng Tsai and Hang Li. 2007. Learning to rank: from pairwise approach to listwise approach. In ICML. 129--136.","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_12_1","volume-title":"Ranking with fairness constraints. arXiv preprint arXiv:1704.06840","author":"Celis L Elisa","year":"2017","unstructured":"L Elisa Celis, Damian Straszak, and Nisheeth K Vishnoi. 2017. Ranking with fairness constraints. arXiv preprint arXiv:1704.06840 (2017)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Olivier Chapelle and Ya Zhang. 2009. A dynamic bayesian network click model for web search ranking. In WWW. 1--10.","DOI":"10.1145\/1526709.1526711"},{"key":"e_1_3_2_1_14_1","unstructured":"Kate Crawford. 2017. The trouble with bias. In NeurIPS invited speaker."},{"key":"e_1_3_2_1_15_1","volume-title":"NeurIPS","volume":"26","author":"Cuturi Marco","year":"2013","unstructured":"Marco Cuturi. 2013. Sinkhorn distances: Lightspeed computation of optimal transport. NeurIPS, Vol. 26 (2013)."},{"key":"e_1_3_2_1_16_1","volume-title":"NeurIPS","volume":"32","author":"Cuturi Marco","year":"2019","unstructured":"Marco Cuturi, Olivier Teboul, and Jean-Philippe Vert. 2019. Differentiable ranking and sorting using optimal transport. NeurIPS, Vol. 32 (2019)."},{"key":"e_1_3_2_1_17_1","first-page":"1","article-title":"CVXPY: A Python-embedded modeling language for convex optimization","volume":"17","author":"Diamond Steven","year":"2016","unstructured":"Steven Diamond and Stephen Boyd. 2016. CVXPY: A Python-embedded modeling language for convex optimization. JMLR, Vol. 17, 83 (2016), 1--5.","journal-title":"JMLR"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Fernando Diaz Bhaskar Mitra Michael D Ekstrand Asia J Biega and Ben Carterette. 2020. Evaluating stochastic rankings with expected exposure. In ACM CIKM. 275--284.","DOI":"10.1145\/3340531.3411962"},{"key":"e_1_3_2_1_19_1","volume-title":"Optimizing generalized Gini indices for fairness in rankings. ACM SIGIR","author":"Do Virginie","year":"2022","unstructured":"Virginie Do and Nicolas Usunier. 2022. Optimizing generalized Gini indices for fairness in rankings. ACM SIGIR (2022), 737--747."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2018.05.017"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2016.02.023"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781638280415"},{"key":"e_1_3_2_1_23_1","first-page":"1","article-title":"POT","volume":"22","author":"Flamary R\u00e9mi","year":"2021","unstructured":"R\u00e9mi Flamary, Nicolas Courty, Alexandre Gramfort, Mokhtar Z. Alaya, Aur\u00e9lie Boisbunon, Stanislas Chambon, Laetitia Chapel, Adrien Corenflos, Kilian Fatras, Nemo Fournier, L\u00e9o Gautheron, Nathalie T.H. Gayraud, Hicham Janati, Alain Rakotomamonjy, Ievgen Redko, Antoine Rolet, Antony Schutz, Vivien Seguy, Danica J. Sutherland, Romain Tavenard, Alexander Tong, and Titouan Vayer. 2021. POT: Python Optimal Transport. JMLR, Vol. 22, 78 (2021), 1--8. http:\/\/jmlr.org\/papers\/v22\/20-451.html","journal-title":"Python Optimal Transport. JMLR"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/230538.230561"},{"key":"e_1_3_2_1_25_1","unstructured":"Andreea Gane Tamir Hazan and Tommi Jaakkola. 2014. Learning with maximum a-posteriori perturbation models. In AISTATS. PMLR 247--256."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2019.102138"},{"key":"e_1_3_2_1_27_1","volume-title":"Fairness of Exposure in Light of Incomplete Exposure Estimation. ACM SIGIR","author":"Heuss Maria","year":"2022","unstructured":"Maria Heuss, Fatemeh Sarvi, and Maarten de Rijke. 2022. Fairness of Exposure in Light of Incomplete Exposure Estimation. ACM SIGIR (2022), 759--769."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Rolf Jagerman and Maarten de Rijke. 2020. Accelerated Convergence for Counterfactual Learning to Rank. In ACM SIGIR. 469--478.","DOI":"10.1145\/3397271.3401069"},{"key":"e_1_3_2_1_29_1","volume-title":"Categorical reparameterization with gumbel-softmax. ICLR","author":"Jang Eric","year":"2017","unstructured":"Eric Jang, Shixiang Gu, and Ben Poole. 2017. Categorical reparameterization with gumbel-softmax. ICLR (2017)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Thorsten Joachims. 2002. Optimizing search engines using clickthrough data. In ACM SIGIR. 133--142.","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_31_1","unstructured":"Matthew Kay Cynthia Matuszek and Sean A Munson. 2015. Unequal representation and gender stereotypes in image search results for occupations. In CHI. 3819--3828."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Till Kletti Jean-Michel Renders and Patrick Loiseau. 2022. Introducing the Expohedron for Efficient Pareto-optimal Fairness-Utility Amortizations in Repeated Rankings. In ACM WSDM. 498--507.","DOI":"10.1145\/3488560.3498490"},{"key":"e_1_3_2_1_33_1","volume-title":"Pascal Van Hentenryck, and Ziwei Zhu","author":"Kotary James","year":"2022","unstructured":"James Kotary, Ferdinando Fioretto, Pascal Van Hentenryck, and Ziwei Zhu. 2022. End-to-End Learning for Fair Ranking Systems. In WWW. 3520--3530."},{"key":"e_1_3_2_1_34_1","volume-title":"The Hungarian method for the assignment problem. Naval research logistics quarterly","author":"Kuhn Harold W","year":"1955","unstructured":"Harold W Kuhn. 1955. The Hungarian method for the assignment problem. Naval research logistics quarterly, Vol. 2, 1--2 (1955), 83--97."},{"key":"e_1_3_2_1_35_1","unstructured":"Ilya Loshchilov and Frank Hutter. 2018. Decoupled Weight Decay Regularization. In ICLR."},{"key":"e_1_3_2_1_36_1","volume-title":"The concrete distribution: A continuous relaxation of discrete random variables. ICLR","author":"Maddison Chris J","year":"2017","unstructured":"Chris J Maddison, Andriy Mnih, and Yee Whye Teh. 2017. The concrete distribution: A continuous relaxation of discrete random variables. ICLR (2017)."},{"key":"e_1_3_2_1_37_1","volume-title":"Learning latent permutations with gumbel-sinkhorn networks. ICLR","author":"Mena Gonzalo","year":"2018","unstructured":"Gonzalo Mena, David Belanger, Scott Linderman, and Jasper Snoek. 2018. Learning latent permutations with gumbel-sinkhorn networks. ICLR (2018)."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Harrie Oosterhuis. 2021. Computationally efficient optimization of plackett-luce ranking models for relevance and fairness. In ACM SIGIR. 1023--1032.","DOI":"10.1145\/3404835.3462830"},{"key":"e_1_3_2_1_39_1","unstructured":"Sandeep Pandey Sourashis Roy Christopher Olston Junghoo Cho and Soumen Chakrabarti. 2005. Shuffling a Stacked Deck: The Case for Partially Randomized Ranking of Search Engine Results. In VLDB. 781--792."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Rama Kumar Pasumarthi Honglei Zhuang Xuanhui Wang Michael Bendersky and Marc Najork. 2020. Permutation equivariant document interaction network for neural learning to rank. In ACM SIGIR. 145--148.","DOI":"10.1145\/3409256.3409819"},{"key":"e_1_3_2_1_41_1","volume-title":"PyTorch: An Imperative Style","author":"Paszke Adam","unstructured":"Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala. 2019. PyTorch: An Imperative Style, High-Performance Deep Learning Library. In NeurIPS. 8024--8035."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000073"},{"key":"e_1_3_2_1_43_1","volume-title":"Context-aware learning to rank with self-attention. arXiv preprint arXiv:2005.10084","author":"Pobrotyn Przemys\u0142aw","year":"2020","unstructured":"Przemys\u0142aw Pobrotyn, Tomasz Bartczak, Miko\u0142aj Synowiec, Rados\u0142aw Bia\u0142obrzeski, and Jaros\u0142aw Bojar. 2020. Context-aware learning to rank with self-attention. arXiv preprint arXiv:2005.10084 (2020)."},{"key":"e_1_3_2_1_44_1","volume-title":"Xuanhui Wang, Michael Bendersky, and Marc Najork.","author":"Qin Zhen","year":"2020","unstructured":"Zhen Qin, Le Yan, Honglei Zhuang, Yi Tay, Rama Kumar Pasumarthi, Xuanhui Wang, Michael Bendersky, and Marc Najork. 2020. Are Neural Rankers still Outperformed by Gradient Boosted Decision Trees?. In ICLR."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Filip Radlinski Robert Kleinberg and Thorsten Joachims. 2008. Learning diverse rankings with multi-armed bandits. In ICML. 784--791.","DOI":"10.1145\/1390156.1390255"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000019"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Fatemeh Sarvi Maria Heuss Mohammad Aliannejadi Sebastian Schelter and Maarten de Rijke. 2022. Understanding and Mitigating the Effect of Outliers in Fair Ranking. In ACM WSDM. 861--869.","DOI":"10.1145\/3488560.3498441"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Ashudeep Singh and Thorsten Joachims. 2018. Fairness of exposure in rankings. In ACM SIGIR. 2219--2228.","DOI":"10.1145\/3219819.3220088"},{"key":"e_1_3_2_1_49_1","volume-title":"NeurIPS","volume":"32","author":"Singh Ashudeep","year":"2019","unstructured":"Ashudeep Singh and Thorsten Joachims. 2019. Policy learning for fairness in ranking. NeurIPS, Vol. 32 (2019)."},{"key":"e_1_3_2_1_50_1","first-page":"11896","article-title":"Fairness in ranking under uncertainty","volume":"34","author":"Singh Ashudeep","year":"2021","unstructured":"Ashudeep Singh, David Kempe, and Thorsten Joachims. 2021. Fairness in ranking under uncertainty. NeurIPS, Vol. 34 (2021), 11896--11908.","journal-title":"NeurIPS"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1967.21.343"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"crossref","unstructured":"Yi Su Magd Bayoumi and Thorsten Joachims. 2022. Optimizing Rankings for Recommendation in Matching Markets. In WWW. 328--338.","DOI":"10.1145\/3485447.3511961"},{"key":"e_1_3_2_1_53_1","volume-title":"NeurIPS","volume":"30","author":"Vaswani Ashish","year":"2017","unstructured":"Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, \u0141ukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. NeurIPS, Vol. 30 (2017)."},{"key":"e_1_3_2_1_54_1","unstructured":"Paul Vicol Jonathan Lorraine David Duvenaud and Roger Grosse. 2021. Implicit Regularization in Overparameterized Bilevel Optimization. In ICML."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Lequn Wang and Thorsten Joachims. 2021. User Fairness Item Fairness and Diversity for Rankings in Two-Sided Markets. In ACM SIGIR. 23--41.","DOI":"10.1145\/3471158.3472260"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Xuanhui Wang Cheng Li Nadav Golbandi Michael Bendersky and Marc Najork. 2018. The lambdaloss framework for ranking metric optimization. In ACM CIKM. 1313--1322.","DOI":"10.1145\/3269206.3271784"},{"key":"e_1_3_2_1_57_1","volume-title":"Joint Multisided Exposure Fairness for Recommendation. ACM SIGIR","author":"Wu Haolun","year":"2022","unstructured":"Haolun Wu, Bhaskar Mitra, Chen Ma, Fernando Diaz, and Xue Liu. 2022. Joint Multisided Exposure Fairness for Recommendation. ACM SIGIR (2022), 703--714."},{"key":"e_1_3_2_1_58_1","unstructured":"Omry Yadan. 2019. Hydra - A framework for elegantly configuring complex applications. Github. https:\/\/github.com\/facebookresearch\/hydra"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"crossref","unstructured":"Himank Yadav Zhengxiao Du and Thorsten Joachims. 2021. Policy-gradient training of fair and unbiased ranking functions. In ACM SIGIR. 1044--1053.","DOI":"10.1145\/3404835.3462953"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"crossref","unstructured":"Meike Zehlike Francesco Bonchi Carlos Castillo Sara Hajian Mohamed Megahed and Ricardo Baeza-Yates. 2017. Fa*ir: A fair top-k ranking algorithm. In ACM CIKM. 1569--1578.","DOI":"10.1145\/3132847.3132938"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"crossref","unstructured":"Meike Zehlike and Carlos Castillo. 2020. Reducing disparate exposure in ranking: A learning to rank approach. In WWW. 2849--2855.","DOI":"10.1145\/3366424.3380048"}],"event":{"name":"SIGIR '23: The 46th International ACM SIGIR Conference on Research and Development in Information Retrieval","location":"Taipei Taiwan","acronym":"SIGIR '23","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3539618.3591714","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3539618.3591714","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:00Z","timestamp":1750178820000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3539618.3591714"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,18]]},"references-count":61,"alternative-id":["10.1145\/3539618.3591714","10.1145\/3539618"],"URL":"https:\/\/doi.org\/10.1145\/3539618.3591714","relation":{},"subject":[],"published":{"date-parts":[[2023,7,18]]},"assertion":[{"value":"2023-07-18","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}