{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:47:03Z","timestamp":1750308423851,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,11]],"date-time":"2021-07-11T00:00:00Z","timestamp":1625961600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Good Systems"},{"name":"Micron Foundation"},{"name":"Wipro"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,11]]},"DOI":"10.1145\/3471158.3472248","type":"proceedings-article","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T20:38:17Z","timestamp":1630442297000},"page":"43-52","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Pareto Solutions vs Dataset Optima: Concepts and Methods for Optimizing Competing Objectives with Constraints in Retrieval"],"prefix":"10.1145","author":[{"given":"Soumyajit","family":"Gupta","sequence":"first","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]},{"given":"Gurpreet","family":"Singh","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]},{"given":"Anubrata","family":"Das","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]},{"given":"Matthew","family":"Lease","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,8,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.10.025"},{"volume-title":"Convex optimization","author":"Boyd Stephen","key":"e_1_3_2_1_2_1","unstructured":"Stephen Boyd , Stephen P Boyd , and Lieven Vandenberghe . 2004. Convex optimization . Cambridge university press . Stephen Boyd, Stephen P Boyd, and Lieven Vandenberghe. 2004. Convex optimization. Cambridge university press."},{"key":"e_1_3_2_1_3_1","volume-title":"Fairness in Machine Learning: A Survey. arXiv preprint arXiv:2010.04053","author":"Caton Simon","year":"2020","unstructured":"Simon Caton and Christian Haas . 2020. Fairness in Machine Learning: A Survey. arXiv preprint arXiv:2010.04053 ( 2020 ). Simon Caton and Christian Haas. 2020. Fairness in Machine Learning: A Survey. arXiv preprint arXiv:2010.04053 (2020)."},{"key":"e_1_3_2_1_4_1","unstructured":"Fran\u00e7ois Chollet. 2015. keras. https:\/\/github.com\/fchollet\/keras.  Fran\u00e7ois Chollet. 2015. keras. https:\/\/github.com\/fchollet\/keras."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390446"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04417-5_17"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(89)80025-2"},{"key":"e_1_3_2_1_8_1","series-title":"SIAM journal on optimization","volume-title":"Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems","author":"Das Indraneel","year":"1998","unstructured":"Indraneel Das and John E Dennis . 1998. Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems . SIAM journal on optimization , Vol. 8 , 3 ( 1998 ), 631--657. Indraneel Das and John E Dennis. 1998. Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM journal on optimization, Vol. 8, 3 (1998), 631--657."},{"key":"e_1_3_2_1_9_1","volume-title":"A survey on pareto-based eas to solve multi-objective optimization problems. Soft Computing for Problem Solving","author":"Dutta Saykat","year":"2019","unstructured":"Saykat Dutta and Kedar Nath Das . 2019. A survey on pareto-based eas to solve multi-objective optimization problems. Soft Computing for Problem Solving ( 2019 ), 807--820. Saykat Dutta and Kedar Nath Das. 2019. A survey on pareto-based eas to solve multi-objective optimization problems. Soft Computing for Problem Solving (2019), 807--820."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-004-5902-6"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2019.8790298"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341981.3344215"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2015.03.022"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-014-1152-5"},{"volume-title":"Phase equilibria, phase diagrams and phase transformations: their thermodynamic basis","author":"Hillert Mats","key":"e_1_3_2_1_15_1","unstructured":"Mats Hillert . 2007. Phase equilibria, phase diagrams and phase transformations: their thermodynamic basis . Cambridge university press . Mats Hillert. 2007. Phase equilibria, phase diagrams and phase transformations: their thermodynamic basis .Cambridge university press."},{"key":"e_1_3_2_1_16_1","volume-title":"Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980","author":"Kingma Diederik P","year":"2014","unstructured":"Diederik P Kingma and Jimmy Ba . 2014 . Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014). Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3346998"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357838"},{"key":"e_1_3_2_1_19_1","volume-title":"A general inner approximation algorithm for nonconvex mathematical programs. Operations research","author":"Marks Barry R","year":"1978","unstructured":"Barry R Marks and Gordon P Wright . 1978. A general inner approximation algorithm for nonconvex mathematical programs. Operations research , Vol. 26 , 4 ( 1978 ), 681--683. Barry R Marks and Gordon P Wright. 1978. A general inner approximation algorithm for nonconvex mathematical programs. Operations research, Vol. 26, 4 (1978), 681--683."},{"key":"e_1_3_2_1_20_1","volume-title":"Survey of multi-objective optimization methods for engineering. Structural and multidisciplinary optimization","author":"Timothy Marler R","year":"2004","unstructured":"R Timothy Marler and Jasbir S Arora . 2004. Survey of multi-objective optimization methods for engineering. Structural and multidisciplinary optimization , Vol. 26 , 6 ( 2004 ), 369--395. R Timothy Marler and Jasbir S Arora. 2004. Survey of multi-objective optimization methods for engineering. Structural and multidisciplinary optimization, Vol. 26, 6 (2004), 369--395."},{"key":"e_1_3_2_1_21_1","volume-title":"The normalized normal constraint method for generating the Pareto frontier. Structural and multidisciplinary optimization","author":"Messac Achille","year":"2003","unstructured":"Achille Messac , Amir Ismail-Yahaya , and Christopher A Mattson . 2003. The normalized normal constraint method for generating the Pareto frontier. Structural and multidisciplinary optimization , Vol. 25 , 2 ( 2003 ), 86--98. Achille Messac, Amir Ismail-Yahaya, and Christopher A Mattson. 2003. The normalized normal constraint method for generating the Pareto frontier. Structural and multidisciplinary optimization, Vol. 25, 2 (2003), 86--98."},{"key":"e_1_3_2_1_22_1","volume-title":"Multi-gradient descent for multi-objective recommender systems. arXiv preprint arXiv:2001.00846","author":"Milojkovic Nikola","year":"2019","unstructured":"Nikola Milojkovic , Diego Antognini , Giancarlo Bergamin , Boi Faltings , and Claudiu Musat . 2019. Multi-gradient descent for multi-objective recommender systems. arXiv preprint arXiv:2001.00846 ( 2019 ). Nikola Milojkovic, Diego Antognini, Giancarlo Bergamin, Boi Faltings, and Claudiu Musat. 2019. Multi-gradient descent for multi-objective recommender systems. arXiv preprint arXiv:2001.00846 (2019)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.2307\/2552799"},{"volume-title":"Pareto optimality, game theory and equilibria","author":"Pardalos Panos M","key":"e_1_3_2_1_24_1","unstructured":"Panos M Pardalos , Athanasios Migdalas , and Leonidas Pitsoulis . 2008. Pareto optimality, game theory and equilibria . Vol. 17 . Springer Science & Business Media . Panos M Pardalos, Athanasios Migdalas, and Leonidas Pitsoulis. 2008. Pareto optimality, game theory and equilibria. Vol. 17. Springer Science & Business Media."},{"key":"e_1_3_2_1_25_1","volume-title":"Manuale di economica politica, societa editrice libraria. milan. English translation as Manual of Political Economy","author":"Pareto Vilfredo","year":"1906","unstructured":"Vilfredo Pareto . 1906. Manuale di economica politica, societa editrice libraria. milan. English translation as Manual of Political Economy , Kelley , New York ( 1906 ). Vilfredo Pareto. 1906. Manuale di economica politica, societa editrice libraria. milan. English translation as Manual of Political Economy, Kelley, New York (1906)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.17654\/AS049060453"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3297280.3297442"},{"key":"e_1_3_2_1_28_1","volume-title":"A Hybrid 2-stage Neural Optimization for Pareto Front Extraction. arXiv preprint arXiv:2101.11684","author":"Singh Gurpreet","year":"2021","unstructured":"Gurpreet Singh , Soumyajit Gupta , Matthew Lease , and Clint Dawson . 2021. A Hybrid 2-stage Neural Optimization for Pareto Front Extraction. arXiv preprint arXiv:2101.11684 ( 2021 ). Gurpreet Singh, Soumyajit Gupta, Matthew Lease, and Clint Dawson. 2021. A Hybrid 2-stage Neural Optimization for Pareto Front Extraction. arXiv preprint arXiv:2101.11684 (2021)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2989219"},{"key":"e_1_3_2_1_30_1","volume-title":"A saddle-point characterization of Pareto optima. Mathematical programming","author":"Rooyen M Van","year":"1994","unstructured":"M Van Rooyen , X Zhou , and Sanjo Zlobec . 1994. A saddle-point characterization of Pareto optima. Mathematical programming , Vol. 67 , 1 ( 1994 ), 77--88. M Van Rooyen, X Zhou, and Sanjo Zlobec. 1994. A saddle-point characterization of Pareto optima. Mathematical programming, Vol. 67, 1 (1994), 77--88."},{"key":"e_1_3_2_1_31_1","unstructured":"Wikipedia. [n.d.]. Stars and bars (combinatorics). https:\/\/en.wikipedia.org\/wiki\/Stars_and_bars_(combinatorics).  Wikipedia. [n.d.]. Stars and bars (combinatorics). https:\/\/en.wikipedia.org\/wiki\/Stars_and_bars_(combinatorics)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3109859.3109887"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Yi Zhang. 2005. Bayesian graphical models for adaptive information filtering.  Yi Zhang. 2005. Bayesian graphical models for adaptive information filtering.","DOI":"10.1145\/1113343.1113358"}],"event":{"name":"ICTIR '21: The 2021 ACM SIGIR International Conference on the Theory of Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Virtual Event Canada","acronym":"ICTIR '21"},"container-title":["Proceedings of the 2021 ACM SIGIR International Conference on Theory of Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3471158.3472248","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3471158.3472248","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:30Z","timestamp":1750268970000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3471158.3472248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,11]]},"references-count":33,"alternative-id":["10.1145\/3471158.3472248","10.1145\/3471158"],"URL":"https:\/\/doi.org\/10.1145\/3471158.3472248","relation":{},"subject":[],"published":{"date-parts":[[2021,7,11]]},"assertion":[{"value":"2021-08-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}