Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Online Minimization of Polarization and Disagreement via Low-Rank Matrix Bandits
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Sample Complexity of Linear Regression Models for Opinion Formation in Networks (AAAI 2025 · similarity 0.86)
- On Weak Regret Analysis for Dueling Bandits (NeurIPS 2024 · similarity 0.86)
- Fast Computation and Optimization for Opinion-Based Quantities of Friedkin-Johnsen Model (NeurIPS 2025 · similarity 0.86)
- On Interpolating Experts and Multi-Armed Bandits (ICML 2024 · similarity 0.86)
- Low-Rank Bandits via Tight Two-to-Infinity Singular Subspace Recovery (ICML 2024 · similarity 0.86)
- Variance-aware Regret Bounds for Stochastic Contextual Dueling Bandits (ICLR 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.