A Taxation Perspective for Fair Re-ranking
- URL: http://arxiv.org/abs/2404.17826v1
- Date: Sat, 27 Apr 2024 08:21:29 GMT
- Title: A Taxation Perspective for Fair Re-ranking
- Authors: Chen Xu, Xiaopeng Ye, Wenjie Wang, Liang Pang, Jun Xu, Tat-Seng Chua,
- Abstract summary: We introduce a new fair re-ranking method named Tax-rank, which levies taxes based on the difference in utility between two items.
Our model Tax-rank offers a superior tax policy for fair re-ranking, theoretically demonstrating both continuity and controllability over accuracy loss.
- Score: 61.946428892727795
- License:
- Abstract: Fair re-ranking aims to redistribute ranking slots among items more equitably to ensure responsibility and ethics. The exploration of redistribution problems has a long history in economics, offering valuable insights for conceptualizing fair re-ranking as a taxation process. Such a formulation provides us with a fresh perspective to re-examine fair re-ranking and inspire the development of new methods. From a taxation perspective, we theoretically demonstrate that most previous fair re-ranking methods can be reformulated as an item-level tax policy. Ideally, a good tax policy should be effective and conveniently controllable to adjust ranking resources. However, both empirical and theoretical analyses indicate that the previous item-level tax policy cannot meet two ideal controllable requirements: (1) continuity, ensuring minor changes in tax rates result in small accuracy and fairness shifts; (2) controllability over accuracy loss, ensuring precise estimation of the accuracy loss under a specific tax rate. To overcome these challenges, we introduce a new fair re-ranking method named Tax-rank, which levies taxes based on the difference in utility between two items. Then, we efficiently optimize such an objective by utilizing the Sinkhorn algorithm in optimal transport. Upon a comprehensive analysis, Our model Tax-rank offers a superior tax policy for fair re-ranking, theoretically demonstrating both continuity and controllability over accuracy loss. Experimental results show that Tax-rank outperforms all state-of-the-art baselines in terms of effectiveness and efficiency on recommendation and advertising tasks.
Related papers
- Learning Optimal Tax Design in Nonatomic Congestion Games [63.89699366726275]
We study how to learn the optimal tax design to maximize the efficiency in nonatomic congestion games.
It is known that self-interested behavior among the players can alleviate the system's efficiency.
arXiv Detail & Related papers (2024-02-12T06:32:53Z) - A Theoretical Approach to Characterize the Accuracy-Fairness Trade-off
Pareto Frontier [42.18013955576355]
The accuracy-fairness trade-off has been frequently observed in the literature of fair machine learning.
This work seeks to develop a theoretical framework by characterizing the shape of the accuracy-fairness trade-off.
The proposed research enables an in-depth understanding of the accuracy-fairness trade-off, pushing current fair machine-learning research to a new frontier.
arXiv Detail & Related papers (2023-10-19T14:35:26Z) - Algorithmic Fairness and Vertical Equity: Income Fairness with IRS Tax
Audit Models [73.24381010980606]
This study examines issues of algorithmic fairness in the context of systems that inform tax audit selection by the IRS.
We show how the use of more flexible machine learning methods for selecting audits may affect vertical equity.
Our results have implications for the design of algorithmic tools across the public sector.
arXiv Detail & Related papers (2022-06-20T16:27:06Z) - Integrating Reward Maximization and Population Estimation: Sequential
Decision-Making for Internal Revenue Service Audit Selection [2.2182596728059116]
We introduce a new setting, optimize-and-estimate structured bandits.
This setting is inherent to many public and private sector applications.
We demonstrate its importance on real data from the United States Internal Revenue Service.
arXiv Detail & Related papers (2022-04-25T18:28:55Z) - Who Should Go First? A Self-Supervised Concept Sorting Model for
Improving Taxonomy Expansion [50.794640012673064]
As data and business scope grow in real applications, existing need to be expanded to incorporate new concepts.
Previous works on taxonomy expansion process the new concepts independently and simultaneously, ignoring the potential relationships among them and the appropriate order of inserting operations.
We propose TaxoOrder, a novel self-supervised framework that simultaneously discovers the local hypernym-hyponym structure among new concepts and decides the order of insertion.
arXiv Detail & Related papers (2021-04-08T11:00:43Z) - An Evolutionary Game Model for Understanding Fraud in Consumption Taxes [0.0]
This paper presents a computational evolutionary game model to study and understand fraud dynamics in the consumption tax system.
Players are cooperators if they correctly declare their value added tax (VAT), and are defectors otherwise.
Since transactions between companies must be declared by both the buyer and seller, a strategy adopted by one influences the other's payoff.
arXiv Detail & Related papers (2021-01-12T11:53:31Z) - L2R2: Leveraging Ranking for Abductive Reasoning [65.40375542988416]
The abductive natural language inference task ($alpha$NLI) is proposed to evaluate the abductive reasoning ability of a learning system.
A novel $L2R2$ approach is proposed under the learning-to-rank framework.
Experiments on the ART dataset reach the state-of-the-art in the public leaderboard.
arXiv Detail & Related papers (2020-05-22T15:01:23Z) - The AI Economist: Improving Equality and Productivity with AI-Driven Tax
Policies [119.07163415116686]
We train social planners that discover tax policies that can effectively trade-off economic equality and productivity.
We present an economic simulation environment that features competitive pressures and market dynamics.
We show that AI-driven tax policies improve the trade-off between equality and productivity by 16% over baseline policies.
arXiv Detail & Related papers (2020-04-28T06:57:18Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.