Next
Livestream will start soon!
Livestream has already ended.
Presentation has not been recorded yet!
  • title: Assemblies of Neurons Learn to Classify Well-Separated Distributions
      0:00 / 0:00
      • Report Issue
      • Settings
      • Playlists
      • Bookmarks
      • Subtitles
      • Playback rate
      • Quality
      • Settings
      • Debug information
      • Server sl-yoda-v2-stream-005-alpha.b-cdn.net
      • Subtitles size Medium
      • Bookmarks
      • Server
      • sl-yoda-v2-stream-005-alpha.b-cdn.net
      • sl-yoda-v2-stream-005-beta.b-cdn.net
      • 1034628162.rsc.cdn77.org
      • 1409346856.rsc.cdn77.org
      • Subtitles
      • Playback rate
      • Quality
      • Subtitles size
      • Large
      • Medium
      • Small
      • Mode
      • Video Slideshow
      • Audio Slideshow
      • Slideshow
      • Video
      My playlists
        Bookmarks
          00:00:00
            Assemblies of Neurons Learn to Classify Well-Separated Distributions
            • Settings
            • Sync diff
            • Quality
            • Settings
            • Server
            • Quality
            • Server

            Assemblies of Neurons Learn to Classify Well-Separated Distributions

            Jul 2, 2022

            Speakers

            MD

            Max Dabagia

            Speaker · 0 followers

            CHP

            Christos H. Papadimitriou

            Speaker · 0 followers

            SSV

            Santosh S. Vempala

            Speaker · 0 followers

            About

            An assembly is a large population of neurons whose synchronous firing represents a memory, concept, word, and other cognitive category. Assemblies are believed to provide a bridge between high-level cognitive phenomena and low-level neural activity. Recently, a computational system called the Assembly Calculus (AC), with a repertoire of biologically plausible operations on assemblies, has been shown capable of simulating arbitrary space-bounded computation, but also of simulating complex cogniti…

            Organizer

            C
            C

            COLT

            Account · 20 followers

            About COLT

            The conference is held annually since 1988 and has become the leading conference on Learning theory by maintaining a highly selective process for submissions. It is committed in high-quality articles in all theoretical aspects of machine learning and related topics.

            Like the format? Trust SlidesLive to capture your next event!

            Professional recording and live streaming, delivered globally.

            Sharing

            Recommended Videos

            Presentations on similar topic, category or speaker

            Learning Polynomials in Few Relevant Dimensions
            15:03

            Learning Polynomials in Few Relevant Dimensions

            Raghu Meka, …

            C
            C
            COLT 5 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            An O(m/eps^3.5)-Cost Algorithm for Semidefinite Programs with Diagonal Constraints
            12:34

            An O(m/eps^3.5)-Cost Algorithm for Semidefinite Programs with Diagonal Constraints

            Swati Padmanabhan, …

            C
            C
            COLT 5 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            Self-Consistency of the Fokker-Planck Equation
            18:23

            Self-Consistency of the Fokker-Planck Equation

            Zebang Shen, …

            C
            C
            COLT 3 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            From Nesterov's Estimate Sequence to Riemannian Acceleration
            13:21

            From Nesterov's Estimate Sequence to Riemannian Acceleration

            Kwangjun Ahn, …

            C
            C
            COLT 5 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            Gradient descent algorithms for Bures-Wasserstein barycenters
            14:12

            Gradient descent algorithms for Bures-Wasserstein barycenters

            Austin Stromme, …

            C
            C
            COLT 5 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            From Nesterov's Estimate Sequence to Riemannian Acceleration
            01:03

            From Nesterov's Estimate Sequence to Riemannian Acceleration

            Kwangjun Ahn, …

            C
            C
            COLT 5 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            Interested in talks like this? Follow COLT