Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

End-to-End Learning for Fair Multiobjective Optimization Under Uncertainty (2402.07772v1)

Published 12 Feb 2024 in cs.AI

Abstract: Many decision processes in artificial intelligence and operations research are modeled by parametric optimization problems whose defining parameters are unknown and must be inferred from observable data. The Predict-Then-Optimize (PtO) paradigm in machine learning aims to maximize downstream decision quality by training the parametric inference model end-to-end with the subsequent constrained optimization. This requires backpropagation through the optimization problem using approximation techniques specific to the problem's form, especially for nondifferentiable linear and mixed-integer programs. This paper extends the PtO methodology to optimization problems with nondifferentiable Ordered Weighted Averaging (OWA) objectives, known for their ability to ensure properties of fairness and robustness in decision models. Through a collection of training techniques and proposed application settings, it shows how optimization of OWA functions can be effectively integrated with parametric prediction for fair and robust optimization under uncertainty.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. Differentiable convex optimization layers. Advances in neural information processing systems, 32, 2019a.
  2. Differentiating through a cone program. arXiv preprint arXiv:1904.09043, 2019b.
  3. Optnet: Differentiable optimization as a layer in neural networks. In ICML, pages 136–145. JMLR. org, 2017.
  4. The limited multi-label projection layer. arXiv preprint arXiv:1906.08707, 2019.
  5. Amir Beck. First-order methods in optimization. SIAM, 2017.
  6. Learning with differentiable pertubed optimizers. Advances in neural information processing systems, 33:9508–9519, 2020.
  7. Fast differentiable sorting and ranking. In International Conference on Machine Learning, pages 950–959. PMLR, 2020.
  8. Dany Cajas. Owa portfolio optimization: A disciplined convex programming framework. Available at SSRN 3988927, 2021.
  9. Y. Chen and A. Zhou. Multiobjective portfolio optimization via pareto front evolution. Complex and Intelligent Systems, 8:4301–4317, 2022. doi:10.1007/s40747-022-00715-8. URL https://doi.org/10.1007/s40747-022-00715-8.
  10. Introduction to algorithms. MIT press, 2022.
  11. Optimizing generalized gini indices for fairness in rankings. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 737–747, 2022.
  12. Two-sided fairness in rankings via lorenz dominance. In M. Ranzato, A. Beygelzimer, Y. Dauphin, P.S. Liang, and J. Wortman Vaughan, editors, Advances in Neural Information Processing Systems, volume 34, pages 8596–8608. Curran Associates, Inc., 2021. URL https://proceedings.neurips.cc/paper_files/paper/2021/file/48259990138bc03361556fb3f94c5d45-Paper.pdf.
  13. Smart “predict, then optimize”. Management Science, 2021.
  14. Inequalities. Cambridge university press, 1952.
  15. Fairness and efficiency in multiportfolio optimization. Operations Research, 62(6):1285–1301, 2014. doi:10.1287/opre.2014.1310. URL https://doi.org/10.1287/opre.2014.1310.
  16. End-to-end learning for fair ranking systems. In Proceedings of the ACM Web Conference 2022, pages 3520–3530, 2022.
  17. Backpropagation of unrolled solvers with folded optimization. arXiv preprint arXiv:2301.12047, 2023.
  18. Guanghui Lan. The complexity of large-scale convex programming under a linear optimization oracle. arXiv preprint arXiv:1309.5550, 2013.
  19. Interior point solving for lp-based prediction+optimisation. In Advances in Neural Information Processing Systems (NeurIPS), 2020.
  20. Decision-focused learning: Foundations, state of the art, benchmark and future opportunities. arXiv preprint arXiv:2307.13565, 2023.
  21. Harry M Markowitz. Foundations of portfolio theory. The journal of finance, 46(2):469–477, 1991.
  22. From softmax to sparsemax: A sparse model of attention and multi-label classification. In International conference on machine learning, pages 1614–1623. PMLR, 2016.
  23. Nasdaq. Nasdaq end of day us stock prices. https://data.nasdaq.com/databases/EOD/documentation, 2022. Accessed: 2023-08-15.
  24. On solving linear programs with the ordered weighted averaging objective. European Journal of Operational Research, 148(1):80–91, 2003.
  25. Automatic differentiation in pytorch. In NIPS-W, 2017.
  26. Gradient estimation with stochastic softmax tricks. Advances in Neural Information Processing Systems, 33:5691–5704, 2020.
  27. Laurent Perron. Operations research and constraint programming at google. In Principles and Practice of Constraint Programming–CP 2011: 17th International Conference, CP 2011, Perugia, Italy, September 12-16, 2011. Proceedings 17, pages 2–2. Springer, 2011.
  28. Differentiation of blackbox combinatorial solvers. In International Conference on Learning Representations, 2019.
  29. Differentiation of blackbox combinatorial solvers. In International Conference on Learning Representations (ICLR), 2020.
  30. J Salas and V Yepes. Enhancing sustainability and resilience through multi-level infrastructure planning. International Journal of Environmental Research and Public Health, 17(3):962, 2020. doi:10.3390/ijerph17030962.
  31. Policy Learning for Fairness in Ranking, pages 1–1. Curran Associates Inc., Red Hook, NY, USA, 2019.
  32. Bo Tang and Elias B. Khalil. Multi-task predict-then-optimize. In Meinolf Sellmann and Kevin Tierney, editors, Learning and Intelligent Optimization, pages 506–522, Cham, 2023. Springer International Publishing. ISBN 978-3-031-44505-7.
  33. Multi-objective optimization of energy arbitrage in community energy storage systems using different battery technologies. Applied Energy, 239:356–372, 2019. ISSN 0306-2619. doi:https://doi.org/10.1016/j.apenergy.2019.01.227. URL https://www.sciencedirect.com/science/article/pii/S0306261919302478.
  34. Melding the data-decisions pipeline: Decision-focused learning for combinatorial optimization. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), volume 33, pages 1658–1665, 2019a.
  35. Melding the data-decisions pipeline: Decision-focused learning for combinatorial optimization. In AAAI, volume 33, pages 1658–1665, 2019b.
  36. Ronald R. Yager. On ordered weighted averaging aggregation operators in multicriteria decisionmaking. In Didier Dubois, Henri Prade, and Ronald R. Yager, editors, Readings in Fuzzy Sets for Intelligent Systems, pages 80–87. Morgan Kaufmann, 1993. ISBN 978-1-4832-1450-4. doi:https://doi.org/10.1016/B978-1-4832-1450-4.50011-0. URL https://www.sciencedirect.com/science/article/pii/B9781483214504500110.
  37. Ronald R. Yager and J. Kacprzyk. The Ordered Weighted Averaging Operators: Theory and Applications. Springer Publishing Company, Incorporated, 2012. ISBN 1461378060.
  38. Reducing disparate exposure in ranking: A learning to rank approach. In Proceedings of the web conference 2020, pages 2849–2855, 2020.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now