Pith. sign in

REVIEW 3 cited by

Bandits for Online Calibration: An Application to Content Moderation on Social Media Platforms

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2211.06516 v1 pith:Z5ZFZT3U submitted 2022-11-11 cs.LG

Vashist Avadhanula , Omar Abdul Baki , Hamsa Bastani , Osbert Bastani , Caner Gocmen , Daniel Haimovich , Darren Hwang , Dima Karamshuk
show 12 more authors
Thomas Leeper Jiayuan Ma Gregory Macnamara Jake Mullett Christopher Palow Sung Park Varun S Rajagopal Kevin Schaeffer Parikshit Shah Deeksha Sinha Nicolas Stier-Moses Peng Xu
This is my paper · ORCID
classification cs.LG
keywords modelsriskcontentmetamoderationapproachcalibrationplatforms
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We describe the current content moderation strategy employed by Meta to remove policy-violating content from its platforms. Meta relies on both handcrafted and learned risk models to flag potentially violating content for human review. Our approach aggregates these risk models into a single ranking score, calibrating them to prioritize more reliable risk models. A key challenge is that violation trends change over time, affecting which risk models are most reliable. Our system additionally handles production challenges such as changing risk models and novel risk models. We use a contextual bandit to update the calibration in response to such trends. Our approach increases Meta's top-line metric for measuring the effectiveness of its content moderation strategy by 13%.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oracles

    cs.LG 2026-07 conditional novelty 7.0 of 10

    An OCO algorithm with only O(√T) static regret, pluggable as a preconditioner selector, recovers the classical O(1/√T) stationarity rate on smooth stochastic nonconvex problems and the O(T^{-2/7}) rate on nonsmooth ones.

  2. Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs

    cs.DS 2025-05 conditional novelty 7.0 of 10

    A new index policy, OaRC, for scheduling jobs with Markovian uncertain holding costs achieves asymptotically optimal regret that is independent of the state-space size.

  3. A Planning Framework for Adaptive Labeling

    cs.LG 2025-02 conditional novelty 6.0 of 10

    A planning framework for adaptive labeling where a smoothed auto-differential policy gradient (Smoothed-Autodiff) selects batches to minimize final posterior uncertainty, outperforming active-learning heuristics and R...

Pith tools