How Fast Is a Neural "Winner-Take-All" When Deciding Between Many Noisy Options?
1,467 views · Published 14 February 2018 · 37:31 · Indexed 25 October 2026
Channel: Simons Institute for the Theory of Computing · 2018 · Education
Ila Fiete, University of Texas at Austin https://simons.berkeley.edu/talks/ila-fiete-2-14-18 Representation, Coding and Computation in Neural Circuits
More from this channel
-
35:16
Probabilistic Polynomials and Hamming Nearest Neighbors
-
15:16
Addition is Exponentially Harder than Counting for Shallow Monotone Circuits
-
55:22
Thinking Algorithmically About Impossibility
-
27:28
The Query Complexity of Correlated Equilibria
-
31:37
Robustness and Separation in Multidimensional Mechanism Design
-
33:01
Revenue Maximization in Interdependent Value Settings
-
34:31
Algorithmic Bayesian Mechanism Design
-
37:51
On Maximizing Revenue for Multi-Item Auctions