Skip to content

Latest commit

 

History

History
59 lines (59 loc) · 2.52 KB

2024-06-30-brandenberger24a.md

File metadata and controls

59 lines (59 loc) · 2.52 KB
title section abstract layout series publisher issn id month tex_title firstpage lastpage page order cycles bibtex_author author date address container-title volume genre issued pdf extras
Errors are Robustly Tamed in Cumulative Knowledge Processes
Original Papers
We study processes of societal knowledge accumulation, where the validity of a new unit of knowledge depends both on the correctness of its derivation and on the validity of the units it depends on. A fundamental question in this setting is: If a constant fraction of the new derivations is wrong, can investing a constant fraction, bounded away from one, of effort ensure that a constant fraction of knowledge in society is valid? Ben-Eliezer, Mikulincer, Mossel, and Sudan (ITCS 2023) introduced a concrete probabilistic model to analyze such questions and showed an affirmative answer to this question. Their study, however, focuses on the simple case where each new unit depends on just one existing unit, and units attach according to a {\em preferential attachment rule}. In this work, we consider much more general families of cumulative knowledge processes, where new units may attach according to varied attachment mechanisms and depend on multiple existing units. We also allow a (random) fraction of insertions of adversarial nodes. We give a robust affirmative answer to the above question by showing that for \textit{all} of these models, as long as many of the units follow simple heuristics for checking a bounded number of units they depend on, all errors will be eventually eliminated. Our results indicate that preserving the quality of large interdependent collections of units of knowledge is feasible, as long as careful but not too costly checks are performed when new units are derived/deposited.
inproceedings
Proceedings of Machine Learning Research
PMLR
2640-3498
brandenberger24a
0
Errors are Robustly Tamed in Cumulative Knowledge Processes
630
631
630-631
630
false
Brandenberger, Anna and Marcussen, Cassandra and Mossel, Elchanan and Sudan, Madhu
given family
Anna
Brandenberger
given family
Cassandra
Marcussen
given family
Elchanan
Mossel
given family
Madhu
Sudan
2024-06-30
Proceedings of Thirty Seventh Conference on Learning Theory
247
inproceedings
date-parts
2024
6
30