A way to quantify this doesn't immediately come to my mind. Maybe reasonable metrics would be: 1. What % misleading/false posts are flagged 2. What % of those flagged are given meaningful context/corrections that are accurate. It seems there's circular logic of first determining truth with 1, and then maybe something to do with a "trust"/quality poll with 2. I suspect a good measurement would be very similar to the actual community notes implementation, since both of those are the goal of the system [1]. [1] https://arxiv.org/abs/2210.15723
Birdwatch: Crowd Wisdom and Bridging Algorithms can Inform Understanding and Reduce the Spread of Misinformation
Stefan Wojcik, Sophie Hilgard, Nick Judd
Show all 8 authors
Delia Mocanu, Stephen Ragain, M. B. Fallin Hunzaker, Keith Coleman, Jay Baxter
2022 · arXiv
- HN score
- 0
- Mentions
- 6
- Readers
- 4
- Months
- 4
From the abstract
We present an approach for selecting objectively informative and subjectively helpful annotations to social media posts. We draw on data from on an online environment where contributors annotate misinformation and simultaneously rate the contributions of others. Our algorithm uses a matrix-factorization (MF) based approach to identify annotations that appeal broadly across heterogeneous user groups - sometimes referred to as "bridging-based ranking." We pair these data with a survey experiment in which individuals are randomly assigned to see annotations to posts. We find that annotations selected by the algorithm improve key indicators compared with overall average and crowd-generated baselines. Further, when deployed on Twitter, people who saw annotations selected through this bridging-based approach were significantly less likely to reshare social media posts than those who did not see the annotations.
Metadata: arXiv. Abstracts retain their original authors’ rights.
In the conversation
Original HN comments, with labels from simple text rules. A label describes the whole comment and may miss context or irony. Read the discussion to make up your own mind. About the labels
6 selected excerpts · 6 total mentions
Hmm sorry don't have anything. I recall hearing about some international research project that was used as input when creating the Twitter community notes but can't find it anymore. Interesting graphical tools exist nowadays to navigate the citation web and I guess one could try to backpropagate from this paper by Twitter employees, (Wojcik 2022):: https://arxiv.org/abs/2210.15723 Example navigation tool: https://www.connectedpapers.com/main/f983a4e27b457a502fba322...
A list of recent papers by Twitter-affiliated authors would be helpful, but as far as I can tell arxiv.org doesn't support that type of search. Here is the mentioned "Birdwatch" paper: https://arxiv.org/abs/2210.15723
Hi! Birdwatch ML Engineer here-- these context notes are from Birdwatch. They are written and rated by users, and the notes are only added as context to Tweets if they are rated highly enough by multiple raters who have tended to disagree in the past. The core algorithm is open source as well as all of the data, and there is lots of public documentation about it too: https://twitter.github.io/birdwatch/ https://twitter.com/birdwatch/status/1585794012052611076?s=2... https://arxiv.org/pdf/2210.15723.pdf
> Community notes are just opinions of random people on internet It's much more complicated than that. Here's the white paper: https://arxiv.org/abs/2210.15723
Here's the Community Notes whitepaper [1], for how it all works. Previous discussion [2]. [1] Birdwatch: Crowd Wisdom and Bridging Algorithms can Inform Understanding and Reduce the Spread of Misinformation, https://arxiv.org/abs/2210.15723 [2] https://news.ycombinator.com/item?id=33478845
Keep following the thread.
More in AlgorithmsMore from the same topics.
Copy-and-Patch Compilation: A fast compilation algorithm for high-level languages and bytecode
Haoran Xu, Fredrik Kjolstad
Fast compilation is important when compilation occurs at runtime, such as query compilers in modern database systems and WebAssembly virtual machines in modern browsers.
Categorizing Variants of Goodhart's Law
David Manheim, Scott Garrabrant
There are several distinct failure modes for overoptimization of systems on the basis of metrics.
Dancing links
Donald E. Knuth
The author presents two tricks to accelerate depth-first search algorithms for a class of combinatorial puzzle problems, such as tiling a tray by a fixed set of polyominoes.
Inherent Trade-Offs in the Fair Determination of Risk Scores
Jon Kleinberg, Sendhil Mullainathan, Manish Raghavan
Recent discussion in the public sphere about algorithmic classification has involved tension between competing notions of what it means for a probabilistic classification to be fair to different groups.