Dasgupta, Sanjoy, Meirovitch, Yaron, Zheng, Xingyu, Bush, Inle, Lichtman, Jeff W, Navlakha, Saket (September 2024) A neural algorithm for computing bipartite matchings. Proceedings of the National Academy of Sciences of the United States of America, 121 (37). e2321032121. ISSN 0027-8424 (Public Dataset)
![[thumbnail of 10.1073.pnas.2321032121.pdf]](https://repository.cshl.edu/style/images/fileicons/application_pdf.png) |
PDF
10.1073.pnas.2321032121.pdf - Published Version Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (1MB) |
Abstract
Finding optimal bipartite matchings-e.g., matching medical students to hospitals for residency, items to buyers in an auction, or papers to reviewers for peer review-is a fundamental combinatorial optimization problem. We found a distributed algorithm for computing matchings by studying the development of the neuromuscular circuit. The neuromuscular circuit can be viewed as a bipartite graph formed between motor neurons and muscle fibers. In newborn animals, neurons and fibers are densely connected, but after development, each fiber is typically matched (i.e., connected) to exactly one neuron. We cast this synaptic pruning process as a distributed matching (or assignment) algorithm, where motor neurons "compete" with each other to "win" muscle fibers. We show that this algorithm is simple to implement, theoretically sound, and effective in practice when evaluated on real-world bipartite matching problems. Thus, insights from the development of neural circuits can inform the design of algorithms for fundamental computational problems.
Actions (login required)
 |
Administrator's edit/view item |