Paper recorded by Signals 4 on 2026-09-18 in cs.CL. Abstract reproduced from arXiv; link to the original below.
Published 2026-09-18 on arXiv · recorded by Signals 4 on 2026-09-21
Category: cs.CL · 自然语言处理 · first seen 2026-09-21
Most work in computational ethics treats annotator disagreement on moral content as noise to be voted away, collapsed into majority vote or the more permissive any-annotator rule the moment a single annotator flags an item. We argue this uncertainty should instead be modeled and learned from. We introduce Moral Entropy, a Bayesian framework that keeps a full posterior over the true label and dec