The Attention Market: Interpreting Online Fair Re-ranking as Manifold Optimization under Walrasian Equilibrium

• URL: http://arxiv.org/abs/2604.25577v1
• Date: Tue, 28 Apr 2026 12:43:57 GMT
• Title: The Attention Market: Interpreting Online Fair Re-ranking as Manifold Optimization under Walrasian Equilibrium
• Abstract summary: We reformulate fair re-ranking within an attentional market framework governed by a Walrasian Equilibrium.<n>We propose ManifoldRank, an efficient online fair re-ranking algorithm.
• Score: 63.76805218520176
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Fair re-ranking aims to promote long-tail items and enhance diversity within groups in information retrieval. While previous research on online fairness-aware re-ranking has shown promising outcomes, our comprehensive evaluation of online fair re-ranking methods over 20 settings reveals significant performance disparities among existing methods. To uncover the root causes of these inconsistencies, we reformulate fair re-ranking within an attentional market framework governed by a Walrasian Equilibrium, where the fairness is treated as a taxation cost. This market-based formulation is then coupled with manifold optimization, demonstrating that seeking this equilibrium is equivalent to performing gradient descent on a specific ranking manifold constructed by the market. Different re-ranking settings induce distinct manifold geometries, and these intrinsic geometric differences dictate the gradient landscapes and optimization trajectories. We propose ManifoldRank, an efficient online fair re-ranking algorithm. ManifoldRank adjusts gradients to align with the ranking manifold, considering various contextual settings. On the supply side, it incorporates a gradient adjustment based on different fairness requirements, accounting for associated costs. On the demand side, it empirically predicts an additional gradient adjustment term derived from the ranking scores. By integrating these two gradient adjustments, ManifoldRank effectively balances fairness and accuracy. Experimental results across multiple datasets confirm ManifoldRank's effectiveness.

Related papers

• Post-hoc Provider Fairness Adaptation via Hierarchical Exposure Alignment [54.58748721533078]
  Post-hoc Fairness Adaptation (PFA) is a lightweight framework that equips a frozen recommender with a fairness adapter.<n>It learns personalized additive score adjustments from user-item embeddings to steer provider exposure toward fairness.<n>PFA achieves substantial fairness gains with negligible accuracy loss, consistently outperforming strong baselines.
  arXiv  Detail & Related papers  (2026-05-02T16:32:52Z)
• Fairness-aware PageRank via Edge Reweighting [16.39169684970624]
  With the rising importance of AI, the question of fairness in link-analysis has gained traction.<n>We present a new approach for incorporating probabilities by reweighting transition in the underlying transition matrix.<n>We formulate of achieving fair probabilities by seeking to minimize the fairness loss.
  arXiv  Detail & Related papers  (2025-12-08T21:27:03Z)
• Understanding Accuracy-Fairness Trade-offs in Re-ranking through Elasticity in Economics [96.68144350976637]
  Fairness is an increasingly important factor in re-ranking tasks.<n>The accuracy-fairness trade-off parallels the coupling of the commodity tax transfer process.<n>We introduce the Elastic Fairness Curve (EF-Curve) as an evaluation framework.<n>We also propose ElasticRank, a fair re-ranking algorithm that employs elasticity calculations to adjust inter-item distances.
  arXiv  Detail & Related papers  (2025-04-21T09:41:08Z)
• Fair Pairs: Fairness-Aware Ranking Recovery from Pairwise Comparisons [2.056289813004423]
  We introduce the problem of fairness-aware ranking recovery from pairwise comparisons. We propose a group-conditioned accuracy measure which quantifies fairness of rankings recovered from pairwise comparisons.
  arXiv  Detail & Related papers  (2024-08-23T12:46:16Z)
• Bipartite Ranking Fairness through a Model Agnostic Ordering Adjustment [54.179859639868646]
  We propose a model agnostic post-processing framework xOrder for achieving fairness in bipartite ranking. xOrder is compatible with various classification models and ranking fairness metrics, including supervised and unsupervised fairness metrics. We evaluate our proposed algorithm on four benchmark data sets and two real-world patient electronic health record repositories.
  arXiv  Detail & Related papers  (2023-07-27T07:42:44Z)
• A Pre-processing Method for Fairness in Ranking [0.0]
  We propose a fair ranking framework that evaluates the order of training data in a pairwise manner. We show that our method outperforms the existing methods in the trade-off between accuracy and fairness over real-world datasets.
  arXiv  Detail & Related papers  (2021-10-29T02:55:32Z)
• PiRank: Learning To Rank via Differentiable Sorting [85.28916333414145]
  We propose PiRank, a new class of differentiable surrogates for ranking. We show that PiRank exactly recovers the desired metrics in the limit of zero temperature.
  arXiv  Detail & Related papers  (2020-12-12T05:07:36Z)
• Towards Model-Agnostic Post-Hoc Adjustment for Balancing Ranking Fairness and Algorithm Utility [54.179859639868646]
  Bipartite ranking aims to learn a scoring function that ranks positive individuals higher than negative ones from labeled data. There have been rising concerns on whether the learned scoring function can cause systematic disparity across different protected groups. We propose a model post-processing framework for balancing them in the bipartite ranking scenario.
  arXiv  Detail & Related papers  (2020-06-15T10:08:39Z)
• SetRank: A Setwise Bayesian Approach for Collaborative Ranking from Implicit Feedback [50.13745601531148]
  We propose a novel setwise Bayesian approach for collaborative ranking, namely SetRank, to accommodate the characteristics of implicit feedback in recommender system. Specifically, SetRank aims at maximizing the posterior probability of novel setwise preference comparisons. We also present the theoretical analysis of SetRank to show that the bound of excess risk can be proportional to $sqrtM/N$.
  arXiv  Detail & Related papers  (2020-02-23T06:40:48Z)

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.