Richards Whitman, Seung H Sebastian, Pickard Galen
Computer Science and Artificial Intelligence Lab (CSAIL), Massachusetts Institute of Technology, Cambridge, MA 02139, USA.
Neural Netw. 2006 Oct;19(8):1161-7. doi: 10.1016/j.neunet.2006.06.006. Epub 2006 Sep 20.
A "Winner-take-all" network is a computational mechanism for picking an alternative with the largest excitatory input. This choice is far from optimal when there is uncertainty in the strength of the inputs, and when information is available about how alternatives may be related. For some time, the Social Choice community has recognized that many other procedures will yield more robust winners. The Borda Count and the pair-wise Condorcet tally are among the most favored. If biological systems strive to optimize information aggregation, then it is of interest to examine the complexity of networks that implement these procedures. We offer two biologically feasible implementations that are relatively simple modifications of classical recurrent networks.
“赢家通吃”网络是一种计算机制，用于选择具有最大兴奋性输入的备选方案。当输入强度存在不确定性，以及存在关于备选方案之间可能如何关联的信息时，这种选择远非最优。一段时间以来，社会选择领域已经认识到，许多其他程序会产生更稳健的赢家。博尔达计数法和成对孔多塞计票法是最受青睐的方法。如果生物系统努力优化信息聚合，那么研究实现这些程序的网络的复杂性就很有意义。我们提供了两种生物学上可行的实现方式，它们是对经典递归网络的相对简单的修改。
