ArXiv TLDR

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

🐦 Tweet
2604.25577

Chen Xu, Wei Chu, Wenyu Hu, Fengran Mo, Jun Xu + 1 more

cs.IR

TLDR

This paper reformulates fair re-ranking as manifold optimization in an attentional market, proposing ManifoldRank for consistent online performance.

Key contributions

  • Reformulates fair re-ranking as manifold optimization within an attentional market with Walrasian Equilibrium.
  • Identifies that different re-ranking settings induce distinct manifold geometries, dictating optimization landscapes.
  • Introduces ManifoldRank, an online algorithm balancing fairness and accuracy via gradient adjustments on the ranking manifold.

Why it matters

Existing online fair re-ranking methods are inconsistent. This paper provides a novel theoretical framework, interpreting fair re-ranking as manifold optimization in an attentional market. Its ManifoldRank algorithm offers a robust solution for consistent fairness and accuracy, addressing a key challenge in information retrieval.

Original 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.

📬 Weekly AI Paper Digest

Get the top 10 AI/ML arXiv papers from the week — summarized, scored, and delivered to your inbox every Monday.