PuzzLing Machines: A Challenge on Learning From Small Data
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Documents
- PuzzLing Machines
Final published version, 357 KB, PDF document
Deep neural models have repeatedly proved excellent at memorizing surface patterns from large datasets for various ML and NLP benchmarks. They struggle to achieve human-like thinking, however, because they lack the skill of iterative reasoning upon knowledge. To expose this problem in a new light, we introduce a challenge on learning from small data, PuzzLing Machines, which consists of Rosetta Stone puzzles from Linguistic Olympiads for high school students. These puzzles are carefully designed to contain only the minimal amount of parallel text necessary to deduce the form of unseen expressions. Solving them does not require external information (e.g., knowledge bases, visual signals) or linguistic expertise, but meta-linguistic awareness and deductive skills. Our challenge contains around 100 puzzles covering a wide range of linguistic phenomena from 81 languages. We show that both simple statistical algorithms and state-of-the-art deep neural models perform inadequately on this challenge, as expected. We hope that this benchmark, available at https://ukplab.github.io/PuzzLing-Machines/, inspires further efforts towards a new paradigm in NLP-one that is grounded in human-like reasoning and understanding.
Original language | English |
---|---|
Title of host publication | Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics |
Publisher | Association for Computational Linguistics |
Publication date | 2020 |
Pages | 1241-1254 |
DOIs | |
Publication status | Published - 2020 |
Event | 58th Annual Meeting of the Association-for-Computational-Linguistics (ACL) - Duration: 5 Jul 2020 → 10 Jul 2020 |
Conference
Conference | 58th Annual Meeting of the Association-for-Computational-Linguistics (ACL) |
---|---|
Periode | 05/07/2020 → 10/07/2020 |
Number of downloads are based on statistics from Google Scholar and www.ku.dk
ID: 255553840