Balanced News Using Constrained Bandit-based Personalization
Sayash Kapoor, Vijay Keswani, Nisheeth K. Vishnoi, L. Elisa Celis

TL;DR
This paper introduces a news search engine prototype that uses constrained bandit algorithms to present balanced liberal and conservative articles, aiming to reduce polarization and filter bubble effects.
Contribution
It applies constrained bandit optimization to personalize news feeds with user-defined balance constraints, a novel approach in news personalization.
Findings
Effective balancing of news viewpoints demonstrated
Reduced polarization compared to traditional feeds
Flexible user constraints enable customizable content balance
Abstract
We present a prototype for a news search engine that presents balanced viewpoints across liberal and conservative articles with the goal of de-polarizing content and allowing users to escape their filter bubble. The balancing is done according to flexible user-defined constraints, and leverages recent advances in constrained bandit optimization. We showcase our balanced news feed by displaying it side-by-side with the news feed produced by a traditional (polarized) feed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Mobile Crowdsensing and Crowdsourcing · Ethics and Social Impacts of AI
