arXiv Analytics

Sign in

arXiv:1901.05744 [cs.LG]AbstractReferencesReviewsResources

The Oracle of DLphi

Weston Baines, Jan Blechschmidt, Mauricio J. del Razo Sarmina, Amnon Drory, Dennis Elbrächter, Nando Farchmin, Matteo Gambara, Silke Glas, Philipp Grohs, Peter Hinz, Danijel Kivaranovic, Christian Kümmerle, Gitta Kutyniok, Sebastian Lunz, Jan Macdonald, Ryan Malthaner, Gregory Naisat, Ariel Neufeld, Philipp Christian Petersen, Rafael Reisenhofer, Jun-Da Sheng, Laura Thesing, Philipp Trunschke, Johannes von Lindheim, David Weber, Melanie Weber

Published 2019-01-17Version 1

We present a novel technique based on deep learning and set theory which yields exceptional classification and prediction results. Having access to a sufficiently large amount of labelled training data, our methodology is capable of predicting the labels of the test data almost always even if the training data is entirely unrelated to the test data. In other words, we prove in a specific setting that as long as one has access to enough data points, the quality of the data is irrelevant.

Related articles: Most relevant | Search more
arXiv:1902.00033 [cs.LG] (Published 2019-01-31)
Compressed Diffusion
arXiv:2106.15662 [cs.LG] (Published 2021-06-29)
Exponential Weights Algorithms for Selective Learning
arXiv:2103.08493 [cs.LG] (Published 2021-03-15)
How Many Data Points is a Prompt Worth?