Pith. sign in

REVIEW 1 cited by

Can a Fruit Fly Learn Word Embeddings?

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2101.06887 v2 pith:RWYDW6F7 submitted 2021-01-18 cs.CL cs.LGcs.NEq-bio.NCstat.ML

Can a Fruit Fly Learn Word Embeddings?

classification cs.CL cs.LGcs.NEq-bio.NCstat.ML
keywords wordfruitnetworkrepresentationswordscellscontextembeddings
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original 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).

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. From Classification to Regression: Using a Fruitfly to Solve Equations

    cs.LG 2026-07 conditional novelty 5.0

    Nonlinear maps are approximated by softmax-weighted reconstruction from a finite library of representative patterns and their stored responses, with demos on Lotka–Volterra, Lorenz, 1D fits, and 1D Poisson.