about
Can a Fruit Fly Learn Word Embeddings? (arxiv.org)
3 points by cscurmudgeon on Aug 4, 2021 | hide | past | pdf | discuss on HN

In plain words: A math version of a fruit fly brain circuit spreads word-context patterns across many units, then suppresses most to leave an on/off code. These codes matched standard word-embedding methods on similarity, sense, and classification tasks using a fraction of the training time and memory.

Abstract

The mushroom body of the fruit fly brain is one of the best studied systems in neuroscience. At its core it consists of a population of Kenyon cells, which receive inputs from multiple sensory modalities. These cells are inhibited by the anterior paired lateral neuron, thus creating a sparse high dimensional representation of the inputs. In this work we study a mathematical formalization of this network motif and apply it to learning the correlational structure between words and their context in a corpus of unstructured text, a common natural language processing (NLP) task. We show that this network can learn semantic representations of words and can generate both static and context-dependent word embeddings. Unlike conventional methods (e.g., BERT, GloVe) that use dense representations for word embedding, our algorithm encodes semantic meaning of words and their context in the form of sparse binary hash codes. The quality of the learned representations is evaluated on word similarity analysis, word-sense disambiguation, and document classification. It is shown that not only can the fruit fly network motif achieve performance comparable to existing methods in NLP, but, additionally, it uses only a fraction of the computational resources (shorter training time and smaller memory footprint).

Yuchen Liang, Chaitanya K. Ryali, Benjamin Hoover, Leopold Grinberg, Saket Navlakha, Mohammed J. Zaki, Dmitry Krotov
arXiv:2101.06887 · cs.CL, cs.LG, cs.NE, q-bio.NC, stat.ML · submitted Jan 18, 2021 · updated Mar 14, 2021
abstract · pdf · html · Accepted for publication at ICLR 2021

add comment on HN
Also discussed: Mar 2021 (2 points, 0 comments) · Jan 2021 (2 points, 0 comments)