# Research

- Research Areas
- Impact Areas

16 Group Results matching all criteria

We are investigating decentralized technologies that affect social change.

#### Research Group

## Haystack Group

We are an interdisciplinary group of researchers blending approaches from human-computer interaction, social computing, databases, information management, and databases.

#### Research Group

## Multimodal Understanding Group

Our objective is to build techniques, software, and hardware that enable natural interaction with

computation.

computation.

#### Research Group

## Applied Computing Group

We design software for high performance computing, develop algorithms for numerical linear algebra, and research random matrix theory and its applications.

#### Research Group

## Cryptography and Information Security Group

We seek to develop techniques for securing tomorrow's global information infrastructure by exploring theoretical foundations, near-term practical applications, and long-range speculative research.

#### Research Group

## Geometric Data Processing Group

Our group studies geometric problems in computer graphics, computer vision, machine learning, optimization, and other disciplines.

#### Research Group

## Supertech Research Group

We investigate the technologies that support scalable high-performance computing, including hardware, software, and theory.

#### Research Group

## Complexity Theory Group

Our interests span quantum complexity theory, barriers to solving P versus NP, theoretical computer science with a focus on probabilistically checkable proofs (PCP), pseudo-randomness, coding theory, and algorithms.

#### Research Group

## Computational Connectomics Group

Our group’s goal is to create, based on such microscopic connectivity and functional data, new mathematical models explaining how neural tissue computes.

#### Research Group

## Quantum Information Science Group

Our research interests center around the capabilities and limits of quantum computers, and computational complexity theory more generally.

#### Research Group

## Multicore Algorithmics

We develop techniques for designing, implementing, and reasoning about multiprocessor algorithms, in particular concurrent data structures for multicore machines and the mathematical foundations of the computation models that govern their behavior.

#### Research Group

## Theory of Computation Group

Theory research at CSAIL covers a broad spectrum of topics, including algorithms, complexity theory, cryptography, distributed systems, parallel computing and quantum computing.

#### Research Group

## Theory of Distributed Systems Group

We work on a wide range of problems in distributed computing theory. We study algorithms and lower bounds for typical problems that arise in distributed systems---like resource allocation, implementing shared memory abstractions, and reliable communication.

#### Research Group

## Computation and Biology

Our lab focuses on designing algorithms to gain biological insights from advances in automated data collection and the subsequent large data sets drawn from them.

56 Project Results matching all criteria

#### Project

## Aspect-Augmented Adversarial Networks for Domain Adaptation

We propose a novel aspect-augmented adversarial network for cross-aspect and cross-domain adaptation tasks. The effectiveness of our approach suggests the potential application of adversarial networks to a broader range of NLP tasks for improved representation learning, such as machine translation and language generation.

#### Project

## Matrix Permanents and Linear Optics

We use tools from quantum physics to prove new results in classical complexity.

#### Project

## Deep Inverse Planning

Deep inverse planning for learning from high-dimensional demonstrations

#### Project

## Multi-Core Data Structures

We aim to develop data structures optimized for large-scale multi-core computers.

#### Project

## Distributed Computation in Ant Colonies

We are interested in applying insights from distributed computing theory to understand how ants and other social insects work together to perform complex tasks such as foraging for food, allocating tasks to workers, and choosing high quality nest sites.

#### Project

## Social Network Extraction from GPS Datasets with Coresets

We extract the underlying hidden relations from the given location-based datasets (e.g. GPS data) and we estimate (approximate) the hidden a social network in the data by using a particular data reduction algorithm (i.e., by using coresets).

#### Project

## Uhura: Personal Assistant that Manages Risk

Uhura is an autonomous system that collaborates with humans in planning and executing complex tasks, especially under over-subscribed and risky situations.

#### Project

## Reconstructing Neural Circuits from Mammalian Brain

We develop algorithms, systems and software architectures for automating reconstruction of accurate representations of neural tissue structures, such as nanometer-scale neurons' morphology and synaptic connections in the mammalian cortex.

#### Project

## Performance Engineering of Cache Profilers

Our goal is to develop lightweight tools that allow programmers to better understand the cache performance of their applications. Tasks include designing profilers, performance engineering existing ones, and exploring different metrics for cache interactions.

#### Project

## Generating Good Adversarial Examples for Neural Networks

Our goal is to better understand adversarial examples by 1) bounding the minimum perturbation that needs to be added to a regular input example to cause a given neural network to misclassify it, and 2) generating some adversarial input example with minimum perturbation.

#### Project

## Deterministic Algorithms for Robotic Task and Motion Planning

Our goal is to investigate deterministic algorithms for robotic task and motion planning.

#### Project

## Hidden Influencers, Risk and Causes of Infection

We aim to study the causes and transmission modes of infectious diseases among members of a community in the presence of hidden, asymptomatic spreaders of the pathogen.

#### Project

## Predicting Adverse Events Across Changing Electronic Health Record Systems

Transitioning machine learning models across electronic health record (EHR) versions can be improved by mapping different EHR encodings to a common vocabulary.

#### Project

## Safety Standards for Autonomous Vehicles

In this project, we aim to develop a framework that can ensure and certify the safety of an autonomous vehicle. By leveraging research from the area of formal verification, this framework aims to assess the safety, i.e., free of collisions, of a broad class of autonomous car controllers/planners for a given traffic model.

#### Project

## Algorithmic Aspects of Performance Engineering

The project concerns algorithmic solutions for writing fast codes.

#### Project

## Data Garbling: Computing on Encrypted Data

We are investigating the limits of computing on encrypted data, with a focus on the private outsourcing of computation over sensitive data.

#### Project

## Efficient Robust Estimation in High Dimensions

We are developing robust estimators for multivariate distributions which are both computationally efficient and near-optimal in terms of their accuracy. Our focus is on methods which are both theoretically sound and practically effective.

#### Project

## OpenTuner: An Extensible Framework for Program Autotuning

OpenTuner is a new framework for building domain-specific multi-objective program autotuners.

#### Project

## Better Models for Ride-Sharing

Traffic is not just a nuisance for drivers: It’s also a public health hazard and bad news for the economy.

#### Project

## Programming Abstractions for Dynamic Graph Analytics

We plan to develop a programming abstraction to enable programmers to write efficient parallel programs to process dynamic graphs.

#### Project

## Bridging Theory and Practice in Shared-Memory Parallel Algorithm Design

This project aims to design parallel algorithms for shared-memory machines that are efficient both in theory and also in practice.

#### Project

## Planning under uncertainty with complex dynamics

We focus on learning to compute near-optimal plans which leverage environmental contact to mitigate action uncertainty, in hopes of enabling inexpensive robotic manipulators to perform precise assembly tasks.

#### Project

## Driver-Friendly Bilateral Control for Suppressing Traffic Instabilities

Self-driving cars themselves can solve traffic problems even without global control.

37 People Results matching all criteria

## Josh Alman

Graduate Student

## Cenk Baykal

Graduate Student

## Martin Demaine

Robotics Engineer

## Joanne Hanley

Administrative Assistant II

## Siddhartha Jayanti

Graduate Student

## Gautam Kamath

Graduate Student

## Kenji Kawaguchi

Graduate Student

## William Kuszmaul

Graduate Student

## Lucas Liebenwein

Graduate Student

## Andrea Lincoln

Graduate Student

## Zelda Mariet

Graduate Student

## Slobodan Mitrovic

Postdoctoral Fellow

45 News Results matching all criteria

## Automated cryptocode generator is helping secure the web

System automatically writes optimized algorithms to encrypt data in Google Chrome browsers and web applications.

## CSAIL hosts first-ever TEDxMIT

Speakers — all women — discuss everything from gravitational waves to robot nurses

## Drag-and-drop data analytics

System lets nonspecialists use machine-learning models to make predictions for medical research, sales, and more.

## Autonomous boats can target and latch onto each other

Fleet of “roboats” could collect garbage or self-assemble into floating structures in Amsterdam’s many canals.

## From one brain scan, more information for medical artificial intelligence

System helps machine-learning models glean training information for diagnosing and treating brain conditions

## Q&A: Phillip Isola on the art and science of generative models

Image-translation pioneer discusses the past, present, and future of generative adversarial networks, or GANs.

## CSAIL's Daskalakis wins ACM Grace Murray Hopper Award

Constantinos (“Costis”) Daskalakis, an MIT professor and CSAIL principal investigator, has won the 2018 ACM Grace Murray Hopper Award.

## A novel data-compression technique for faster computer programs

Researchers free up more bandwidth by compressing “objects” within the memory hierarchy.

## Advance boosts efficiency of flash storage in data centers

New architecture promises to cut in half the energy and physical space required to store and manage user data.

## Model learns how individual amino acids determine protein function

Technique could improve machine-learning tasks in protein design, drug testing, and other applications.

## “Particle robot” works as a cluster of simple units

Loosely connected disc-shaped “particles” can push and pull one another, moving en masse to transport objects.

## Achieving greater efficiency for fast data center operations

System better allocates time-sensitive data processing across cores to maintain quick user-response times.

## MIT CSAIL holds trustworthy AI event with Microsoft

Workshop explores technical directions for making AI safe, fair, and understandable

## Putting neural networks under the microscope

Researchers pinpoint the “neurons” in machine-learning systems that capture specific linguistic features during language-processing tasks.

## Engineers program marine robots to take calculated risks

Algorithm could help autonomous underwater vehicles explore risky but scientifically-rewarding environments.

## MIT hosts workshop on theoretical foundations of deep learning

Last week MIT’s Institute for Foundations of Data Science (MIFODS) held an interdisciplinary workshop aimed at tackling the underlying theory behind deep learning. Led by MIT professor Aleksander Madry, the event focused on a number of research discussions at the intersection of math, statistics, and theoretical computer science.

## An AI that "de-biases" algorithms

CSAIL’s “de-biasing” framework can make face-detection systems less racist

## Identifying artificial intelligence “blind spots”

Model identifies instances when autonomous systems have learned from examples that may cause dangerous errors in the real world.

## Democratizing data science

Tool for nonstatisticians automatically generates models that glean insights from complex datasets.

## Cambridge Mobile Telematics Raises $500M from SoftBank Vision Fund

Cambridge Mobile Telematics Raises $500M from SoftBank Vision Fund

## Teaching machines to see in 3-D

CSAIL’s approach uses algorithms and “2.5-D” sketches to let computers visualize images from any perspective

## Higher-res models for creating structures with complex features

Computer scientists often develop mathematical models to understand how animals move, enabling breakthroughs in designing things like microrobotic wings and artificial bone structures.

## Model helps robots navigate more like humans do

In simulations, robots move through new environments by exploring, observing, and drawing from learned experiences.

## Machine-learning system tackles speech and object recognition, all at once

Model learns to pick out objects within an image, using spoken descriptions.

16 Group Results

#### Research Group

## Applied Computing Group

We design software for high performance computing, develop algorithms for numerical linear algebra, and research random matrix theory and its applications.

#### Research Group

## Complexity Theory Group

Our interests span quantum complexity theory, barriers to solving P versus NP, theoretical computer science with a focus on probabilistically checkable proofs (PCP), pseudo-randomness, coding theory, and algorithms.

#### Research Group

## Computation and Biology

Our lab focuses on designing algorithms to gain biological insights from advances in automated data collection and the subsequent large data sets drawn from them.

#### Research Group

## Computational Connectomics Group

Our group’s goal is to create, based on such microscopic connectivity and functional data, new mathematical models explaining how neural tissue computes.

#### Research Group

## Cryptography and Information Security Group

We seek to develop techniques for securing tomorrow's global information infrastructure by exploring theoretical foundations, near-term practical applications, and long-range speculative research.

#### Research Group

## Decentralized Information Group

We are investigating decentralized technologies that affect social change.

#### Research Group

## Geometric Data Processing Group

Our group studies geometric problems in computer graphics, computer vision, machine learning, optimization, and other disciplines.

#### Research Group

## Haystack Group

We are an interdisciplinary group of researchers blending approaches from human-computer interaction, social computing, databases, information management, and databases.

#### Research Group

## Multicore Algorithmics

We develop techniques for designing, implementing, and reasoning about multiprocessor algorithms, in particular concurrent data structures for multicore machines and the mathematical foundations of the computation models that govern their behavior.

#### Research Group

## Multimodal Understanding Group

Our objective is to build techniques, software, and hardware that enable natural interaction with

computation.

computation.

#### Research Group

## Quantum Information Science Group

Our research interests center around the capabilities and limits of quantum computers, and computational complexity theory more generally.

#### Research Group

## Supertech Research Group

We investigate the technologies that support scalable high-performance computing, including hardware, software, and theory.

#### Research Group

## Theory of Computation Group

Theory research at CSAIL covers a broad spectrum of topics, including algorithms, complexity theory, cryptography, distributed systems, parallel computing and quantum computing.

#### Research Group

## Theory of Distributed Systems Group

We work on a wide range of problems in distributed computing theory. We study algorithms and lower bounds for typical problems that arise in distributed systems---like resource allocation, implementing shared memory abstractions, and reliable communication.

56 Project Results

#### Project

## A new way of handling all-to-all broadcast

We design a new all-to-all broadcasts scheme with significantly less communication cost using aggregate signatures.

#### Project

## A Simplified and Extensible Cilk Runtime for Research

CilkS is a new runtime system for the Cilk multithreaded programming environment which makes it easy to experiment with new algorithms, data structures, and programming linguistics.

#### Project

## Active Learning of Models for Planning

We aim to develop a systematic framework for robots to build models of the world and to use these to make effective and safe choices of actions to take in complex scenarios.

#### Project

## Algebraic Techniques for Algorithm Design

We work on improving the algorithms for algebraic problems like matrix multiplication, and using these to design algorithms for fundamental non-algebraic problems.

#### Project

## Algorithmic Aspects of Performance Engineering

The project concerns algorithmic solutions for writing fast codes.

#### Project

## An Algorithmic Theory of Brain Networks

We are developing an algorithmic theory for brain networks, based on simple synchronized stochastic graph-based neural network models.

#### Project

## Approximating the diameter of a directed graph

There is a family of approximation algorithms for computing the diameter of an undirected graph that give a time/accuracy trade-off and our goal is to extend these results to directed graphs.

#### Project

## Aspect-Augmented Adversarial Networks for Domain Adaptation

We propose a novel aspect-augmented adversarial network for cross-aspect and cross-domain adaptation tasks. The effectiveness of our approach suggests the potential application of adversarial networks to a broader range of NLP tasks for improved representation learning, such as machine translation and language generation.

#### Project

## Basing Cryptography on Structured Hardness

We aim to base a variety of cryptographic primitives on complexity theoretic assumptions. We focus on the assumption that there exist highly structured problems --- admitting so called "zero-knowledge" protocols --- that are nevertheless hard to compute

#### Project

## Bayesian Optimization for Global Optimization of Expensive Black-box Functions

We study the fundamentals of Bayesian optimization and develop efficient Bayesian optimization methods for global optimization of expensive black-box functions originated from a range of different applications.

#### Project

## Better Models for Ride-Sharing

Traffic is not just a nuisance for drivers: It’s also a public health hazard and bad news for the economy.

#### Project

## Bridging Theory and Practice in Shared-Memory Parallel Algorithm Design

This project aims to design parallel algorithms for shared-memory machines that are efficient both in theory and also in practice.

#### Project

## Coresets for Machine Learning Algorithms

Our goal is to design novel data compression techniques to accelerate popular machine learning algorithms in Big Data and streaming settings.

#### Project

## Data Garbling: Computing on Encrypted Data

We are investigating the limits of computing on encrypted data, with a focus on the private outsourcing of computation over sensitive data.

#### Project

## Deep Inverse Planning

Deep inverse planning for learning from high-dimensional demonstrations

#### Project

## Deterministic Algorithms for Robotic Task and Motion Planning

Our goal is to investigate deterministic algorithms for robotic task and motion planning.

#### Project

## Distributed Algorithms for Dynamic and Noisy Platforms

Distributed systems are now everywhere, for example, in wireless communication networks, distributed data-management systems, coordinated robots, transportation systems, and modern multiprocessors.

#### Project

## Distributed Co-prime Sampling Algorithms

To further parallelize co-prime sampling based sparse sensing, we introduce Diophantine Equation in different algebraic structures to build generalized lattice arrays.

With strong relationship to generalized Chinese Remainder Theorem, the geometry properties in the remainder code space, a special lattice space, are explored.

With strong relationship to generalized Chinese Remainder Theorem, the geometry properties in the remainder code space, a special lattice space, are explored.

#### Project

## Distributed Computation in Ant Colonies

We are interested in applying insights from distributed computing theory to understand how ants and other social insects work together to perform complex tasks such as foraging for food, allocating tasks to workers, and choosing high quality nest sites.

#### Project

## Distributed Robot Garden

The robot garden provides an aesthetically pleasing educational platform that can visualize computer science concepts and encourage young students to pursue programming and robotics.

#### Project

## Diversity-inducing Probability Measures

We aim to understand theory and applications of diversity-inducing probabilities (and, more generally, "negative dependence") in machine learning, and develop fast algorithms based on their mathematical properties.

#### Project

## Driver-Friendly Bilateral Control for Suppressing Traffic Instabilities

Self-driving cars themselves can solve traffic problems even without global control.

#### Project

## Efficient Robust Estimation in High Dimensions

We are developing robust estimators for multivariate distributions which are both computationally efficient and near-optimal in terms of their accuracy. Our focus is on methods which are both theoretically sound and practically effective.

37 People Results

## Josh Alman

Graduate Student

## Cenk Baykal

Graduate Student

## Martin Demaine

Robotics Engineer

## Joanne Hanley

Administrative Assistant II

## Siddhartha Jayanti

Graduate Student

## Gautam Kamath

Graduate Student

## Kenji Kawaguchi

Graduate Student

## William Kuszmaul

Graduate Student

## Lucas Liebenwein

Graduate Student

## Andrea Lincoln

Graduate Student

## Zelda Mariet

Graduate Student

## Slobodan Mitrovic

Postdoctoral Fellow

45 News Results

## Automated cryptocode generator is helping secure the web

System automatically writes optimized algorithms to encrypt data in Google Chrome browsers and web applications.

## CSAIL hosts first-ever TEDxMIT

Speakers — all women — discuss everything from gravitational waves to robot nurses

## Drag-and-drop data analytics

System lets nonspecialists use machine-learning models to make predictions for medical research, sales, and more.

## Autonomous boats can target and latch onto each other

Fleet of “roboats” could collect garbage or self-assemble into floating structures in Amsterdam’s many canals.

## From one brain scan, more information for medical artificial intelligence

System helps machine-learning models glean training information for diagnosing and treating brain conditions

## Q&A: Phillip Isola on the art and science of generative models

Image-translation pioneer discusses the past, present, and future of generative adversarial networks, or GANs.

## CSAIL's Daskalakis wins ACM Grace Murray Hopper Award

Constantinos (“Costis”) Daskalakis, an MIT professor and CSAIL principal investigator, has won the 2018 ACM Grace Murray Hopper Award.

## A novel data-compression technique for faster computer programs

Researchers free up more bandwidth by compressing “objects” within the memory hierarchy.

## Advance boosts efficiency of flash storage in data centers

New architecture promises to cut in half the energy and physical space required to store and manage user data.

## Model learns how individual amino acids determine protein function

Technique could improve machine-learning tasks in protein design, drug testing, and other applications.

## “Particle robot” works as a cluster of simple units

Loosely connected disc-shaped “particles” can push and pull one another, moving en masse to transport objects.

## Achieving greater efficiency for fast data center operations

System better allocates time-sensitive data processing across cores to maintain quick user-response times.

## MIT CSAIL holds trustworthy AI event with Microsoft

Workshop explores technical directions for making AI safe, fair, and understandable

## Putting neural networks under the microscope

Researchers pinpoint the “neurons” in machine-learning systems that capture specific linguistic features during language-processing tasks.

## Engineers program marine robots to take calculated risks

Algorithm could help autonomous underwater vehicles explore risky but scientifically-rewarding environments.

## MIT hosts workshop on theoretical foundations of deep learning

Last week MIT’s Institute for Foundations of Data Science (MIFODS) held an interdisciplinary workshop aimed at tackling the underlying theory behind deep learning. Led by MIT professor Aleksander Madry, the event focused on a number of research discussions at the intersection of math, statistics, and theoretical computer science.

## An AI that "de-biases" algorithms

CSAIL’s “de-biasing” framework can make face-detection systems less racist

## Identifying artificial intelligence “blind spots”

Model identifies instances when autonomous systems have learned from examples that may cause dangerous errors in the real world.

## Democratizing data science

Tool for nonstatisticians automatically generates models that glean insights from complex datasets.

## Cambridge Mobile Telematics Raises $500M from SoftBank Vision Fund

Cambridge Mobile Telematics Raises $500M from SoftBank Vision Fund

## Teaching machines to see in 3-D

CSAIL’s approach uses algorithms and “2.5-D” sketches to let computers visualize images from any perspective

## Higher-res models for creating structures with complex features

Computer scientists often develop mathematical models to understand how animals move, enabling breakthroughs in designing things like microrobotic wings and artificial bone structures.

## Model helps robots navigate more like humans do

In simulations, robots move through new environments by exploring, observing, and drawing from learned experiences.

## Machine-learning system tackles speech and object recognition, all at once

Model learns to pick out objects within an image, using spoken descriptions.