Meetings

CBMM Research Meeting: Nancy Lynch

May 11, 2018 - 4:00 pm
Venue:  MIT-46-5165 (MIBR Reading Room) Speaker/s:  Prof. Nancy Lynch, MIT CSAIL

Title: An Algorithmic Theory of Brain Networks

This talk will describe my recent work with Cameron Musco and Merav Parter, on studying neural networks from the perspective of the field of Distributed Algorithms.   In our project, we aim both to obtain interesting, elegant theoretical results, and also to draw relevant biological conclusions.

We base our work on simple Stochastic Spiking Neural Network (SSN) models, in which probabilistic neural components are organized into weighted directed graphs and execute in a synchronized fashion.  Our model captures the spiking behavior observed in real neural networks and reflects the widely accepted notion that spike responses, and neural computation in general, are inherently stochastic.  In most of our work so far, we have considered static networks, but the model would allow us to also consider learning by means of weight adjustments.

Specifically, we consider the implementation of various algorithmic primitives using stochastic SNNs.  We first consider a basic symmetry-breaking task that has been well studied in the computational neuroscience community:  the Winner-Take-All  (WTA)  problem.  WTA is believed to serve as a basic building block for many other tasks, such as learning, pattern recognition, and clustering.  In a simple version of the problem, we are given neurons with identical firing rates, and want to select a distinguished one.  Our main contribution is the explicit construction of a simple and efficient WTA network containing only two inhibitory neurons; our construction uses the stochastic behavior of SNNs in an essential way.  We give a complete proof of correctness and analysis of convergence time, using distributed algorithms proof methods.  In related results, we give an optimization of the simple two-inhibitor network that achieves better convergence time at the cost of more inhibitory neurons.  We also give lower bound results that show inherent limitations on the convergence time achievable with small numbers of inhibitory neurons.

We also consider the use of stochastic behavior in neural algorithms for Similarity Testing.   In this problem, the network is supposed to distinguish, with high reliability, between input vectors that are identical and input vectors that are significantly different.  We construct a compact stochastic network that solves the Similarity Testing problem, based on randomly sampling positions in the vectors. At the heart of our solution is the design of a compact and fast-converging neural Random Access Memory (neuro-RAM)  indexing mechanism.

In this talk, I will describe our SNN model and our work on Winner-Take-All, in some detail.  I will also summarize our work on Similarity Testing, discuss some important general issues such as compositionality, and suggest directions for future work.

 

Organizer:  Hector Penagos Kathleen Sullivan Frederico Azevedo Organizer Email:  cbmm-contact@mit.edu

CBMM Research Meeting: Two Talks from UMass Boston

Dec 1, 2017 - 4:00 pm
Wei Ding & Akram Bayat
Venue:  MIT-46-5165 (MIBR Reading Room) Speaker/s:  Akram Bayat (UMass Boston, Visual Attention Lab) Wei Ding (UMass Boston, Knowledge Discovery Lab)

Host: Mandana Sassanfar

Akram Bayat: From Motor Control to Scene Perception: Using Machine Learning to Study Human Behavior and Cognition

Abstract:

In this presentation, as part of my work at UMass Boston, two dimensions of implementing machine learning algorithms for solving two important real world problems are discussed. In the first part, we model human eye movements in order to identify different individuals during reading activity. As an important part of our pattern recognition process we extract multiple low-level features in the scan path including fixation features, saccadic features, pupillary response features, and spatial reading features.

While capturing eye movement during reading is desirable because it is a very common task, the text content influences the reading process, making it very challenging to obtain invariant features from eye-movement data. We address this issue with a novel idea for a user identification algorithm that benefits from extracting high level features that combines eye movements with syntactic and semantic word relationships in a text. The promising results of our identification method make eye-movement based identification an excellent approach for various applications such as personalized user interfaces.

The second part of my work focuses on scene perception and object recognition using deep convolutional neural networks. We investigate to which extent computer vision based systems for scene classification and object recognition resemble human mechanisms for scene perception. Employing global properties for scene classification, scene grammar, and top-down control of visual attention for object detection are three methodologies which we evaluate in humans and deep convolutional networks. We also evaluate the performance of deep object recognition networks (e.g., Faster R-CNN) under various conditions of image filtering in the frequency domain and compare it with the human visual system in terms of internal representation.  We then show that fine-tuning the Faster-RCNN to filtered data improves network performance over a range of spatial frequencies.

 

Wei Ding: REND: A Reinforced Network-Based Model for Clustering Sparse Data with Application to Cancer Subtype Discovery

Abstract:

We will discuss a new algorithm, called Reinforced Network-Based Model for Clustering Sparse Data (REND), for finding unknown groups of similar data objects in sparse and largely non-overlapping feature space where a network structure among features can be observed. REND is an autoencoder neural network alternative to non-negative matrix factorization (NMF). NMF has made significant advancements in various clustering tasks with great practical success. The use of neural networks over NMF allows the implementation of non-negative model variants with multi-layered, arbitrarily non-linear structures, which is much needed to handle nonlinearity in complex real data. However, standard neural networks cannot achieve its full potential when data is sparse and the sample size is hundreds of orders of magnitude smaller than the dimension of the feature space. To address these issues, we present a model consisting of integrated layers of reinforced network smoothing and an sparse autoencoder. The architecture of hidden layers incorporates existing network dependency in the feature space. The reinforced network layers smooth sparse data over the network structure. Most importantly, through backpropagation, the weights of the reinforced smoothing layers are simultaneously constrained by the remaining sparse autoencoder layers that set the target values to be equal to the inputs. Our approach integrates physically meaningful feature dependencies into model design and efficiently clusters sparse data through integrated smoothing and sparse autoencoder learning. Empirical results demonstrate that REND achieves improved accuracy and render physically meaningful clustering results.

Speaker Bio:

Wei Ding received her Ph.D. degree in Computer Science from the University of Houston in 2008. She is an Associate Professor of Computer Science at the University of Massachusetts Boston. Her research interests include data mining, machine learning, artificial intelligence, computational semantics, and with applications to health sciences, astronomy, geosciences, and environmental sciences. She has published more than 122 referred research papers, 1 book, and has 2 patents. She is an Associate Editor of the ACM Transaction on Knowledge Discovery from Data (TKDD), Knowledge and Information Systems (KAIS) and an editorial board member of the Journal of Information System Education (JISE), the Journal of Big Data, and the Social Network Analysis and Mining Journal. Her research projects are sponsored by NSF, NIH, NASA, and DOE. She is an IEEE senior member and an ACM senior member.

Organizer:  Joel Oller Organizer Email:  cbmm-contact@mit.edu

CBMM next phase: 4 modules

Oct 6, 2017 - 4:00 pm
Venue:  MIT Building 46-3002 (Singleton Auditorium) Speaker/s:  CBMM PIs

We will introduce the 4 proposed modules for CBMM's renewal. CBMM PIs will present and discuss their research plans and goals at CBMM for the next 5 years. The talks session will be followed by a reception/party (6pm-8pm) to celebrate the renewal by NSF.

Contact for details: Guy Ben-Yosef, gby@mit.edu

Organizer:  Joel Oller Organizer Email:  cbmm-contact@mit.edu

CBMM Postdoc Meeting: On the road to understanding human and machine performance in object recognition

Jun 23, 2017 - 2:00 pm
Address:  43 Vassar St. Cambridge, MA 02139 MIT Bldg. 46-5165 Speaker/s:  Andrei Barbu

Title: On the road to understanding human and machine performance in object recognition

Abstract: According to current benchmarks machine performance on common object detection tasks approaches or even surpasses that of humans. Yet everyone's experience running object detectors indicates this is far from true. This has had an unfortunate effect on the community where because of saturation on such tasks we see little improvement recently and significant media hype. We'll talk about why this is and how to really know if machines are as good as humans. I'll present some early results. We're also looking for collaborations to make this as useful and scientifically meaningful as possible.

Organizer:  Joel Oller Organizer Email:  cbmm-contact@mit.edu

CBMM Postdoc Meeting: EAC Poster Session Planning and NSF STC Site Visit review

Mar 3, 2017 - 3:00 pm
Venue:  Harvard NW 343 Address:  52 Oxford Street, Cambridge, MA 02138

We will be meeting to discuss our center’s upcoming External Advisory Committee (EAC) Meeting (March 23rd & 24th) and NSF STC Site Visit (May 15th-17th.) CBMM Research Thrust Leaders will discuss overall goals for these events, as well as coordinate the respective poster sessions.

Organizer:  Georgios Evangelopoulos Organizer Email:  gevang@mit.edu

NSF STC Site Visit

May 15, 2017 - 8:00 am
NSF logo
Venue:  McGovern Institute for Brain Research Address:  43 Vassar St, Cambridge Ma, 02139

This meeting is invitation only.

Organizer:  Kathleen Sullivan Organizer Email:  cbmm-contact@mit.edu

Pages

Subscribe to Meetings