# Research

- Research Areas
- Impact Areas

2 Group Results matching all criteria

We are investigating decentralized technologies that affect social change.

#### Research Center

## Center for Deployable Machine Learning (CDML)

The MIT Center for Deployable Machine Learning (CDML) works towards creating AI systems that are robust, reliable and safe for real-world deployment.

21 Group Results

#### Research Center

## Center for Deployable Machine Learning (CDML)

The MIT Center for Deployable Machine Learning (CDML) works towards creating AI systems that are robust, reliable and safe for real-world deployment.

#### 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

## Computation Structures Group

Our mission is fostering the creation and development of high-performance, reliable and secure computing systems that are easy to interact with.

#### 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

## Computer-Aided Programming

We develop techniques and tools that exploit automated reasoning and large amounts of computing power to tackle challenging programming problems

#### 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

## Data Systems Group

We conduct research on all areas of database systems and information management.

#### 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

## Programming Languages and Software Engineering

We research programming languages, software engineering, and related work in human-computer interaction.

#### Research Group

## Programming Methodology Group

We develop innovative approaches for building software and for solving problems in modern parallel and distributed software systems.

#### 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

## Software Design Group

Our goal is to find better ways to make software, and ways to make software better.

#### 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.

25 Project Results

#### 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

## Algorithmic Aspects of Performance Engineering

The project concerns algorithmic solutions for writing fast codes.

#### Project

## Alloy

Alloy is a language for describing structures and a tool for exploring them. It has been used in a wide range of applications from finding holes in security mechanisms to designing telephone switching networks. Hundreds of projects have used Alloy for design analysis, for verification, for simulation, and as a backend for many other kinds of analysis and synthesis tools, and Alloy is currently being taught in courses worldwide.

#### 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

## Compression and Reordering for Parallel Graph Analytics

We plan to develop a suite of graph compression and reordering techniques as part of the Ligra parallel graph processing framework to reduce space usage and improve performance of graph algorithms.

#### 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 Civilizer

Data scientists universally report that they spend at least 80% of their time finding data sets of interest, accessing them, cleaning them and assembling them into a unified whole.

#### 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

## Data Warehouse Construction

Historically, DBMSs in the warehouse space partitioned their data across a shared nothing

cluster.

cluster.

#### Project

## Determining Wikipedia's Influence on Science

Wikipedia is one of the most widely accessed encyclopedia sites in the world, including by scientists. Our project aims to investigate just how far Wikipedia’s influence goes in shaping science.

#### 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.

## Suvrit Sra

#### Project

## Geometry and topology for scientific computing and shape analysis

Developing state-of-the-art tools that process 3D surfaces and volumes

#### Project

## Kami: A Modular Deductive Hardware Verification Platform

A framework to support implementing, specifying, verifying, and compiling hardware designs, modularly

#### Project

## Optimal transport for statistics and machine learning

Linking probability with geometry to improve the theory and practice of machine learning

#### Project

## Political Geometry: Establishing Fair Mathematical Standards for Political Redistricting

Gerrymandering is a direct threat to our democracy, undermining founding principles like equal protection under the law and eroding public confidence in elections.

#### Project

## Privacy-Preserving Decentralized Optimization

To enable privacy preservation in decentralized optimization, differential privacy is the most commonly used approach. However, under such scenario, the trade-off between accuracy (even efficiency) and privacy is inevitable. In this project, distributed numerical optimization scheme incorporated with lightweight cryptographic information sharing are explored. The affect on the convergence rate from network topology is considered.

#### Project

## Program Performance Prediction with Deep Learning

Predicting the number of clock cycles a processor takes to execute a block of assembly instructions in steady-state (the throughput) is important for both compiler designers and performance engineers.

However, building an analytical model to do so is especially complicated in modern x86-64 Complex Instruction Set Computer (CISC) machines with sophisticated processor microarchitectures in that it is tedious, error-prone, and must be performed from scratch for each processor generation.

Ithemal is the first tool that learns to predict the throughput of a set of instructions. It does so more accurately than state-of-the-art hand-written tools currently used in compiler backends and static machine code analyzers. In particular, Ithemal has less than half the error of state-of-the-art analytical models (LLVM's llvm-mca and Intel's IACA).

However, building an analytical model to do so is especially complicated in modern x86-64 Complex Instruction Set Computer (CISC) machines with sophisticated processor microarchitectures in that it is tedious, error-prone, and must be performed from scratch for each processor generation.

Ithemal is the first tool that learns to predict the throughput of a set of instructions. It does so more accurately than state-of-the-art hand-written tools currently used in compiler backends and static machine code analyzers. In particular, Ithemal has less than half the error of state-of-the-art analytical models (LLVM's llvm-mca and Intel's IACA).

#### 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

## Random Graph with Applications in MPC

To explore how randomness in connectivity can improve the performance of secure multi-party computation (MPC) and the properties of communication graph to support MPC.

#### Project

## Reliable and Robust Machine Learning

We work towards a principled understanding of the current machine learning toolkit and making this toolkit be robust and reliable.

#### Project

## Security by Design for Cyberphysical Systems

An approach to reducing risks of attack on cyberphysical infrastructure (such as water purification plants and electric grids) with new software design and analysis techniques.

#### Project

## Solid: Social Linked Data

Solid aims to radically change the way Web applications work today, resulting in true data ownership as well as improved privacy.

33 People Results

## Cenk Baykal

Graduate Student

## Tej Chajed

Graduate Student

## Jamey Hicks

Research Affiliate

## Siddhartha Jayanti

Graduate Student

## Kenji Kawaguchi

Graduate Student

## Fredrik Berg Kjolstad

Graduate Student

## Lucas Liebenwein

Graduate Student

## Henry Lieberman

Research Scientist

## Slobodan Mitrovic

Postdoctoral Fellow

12 News Results

## Protecting sensitive metadata so it can’t be used for surveillance

System ensures hackers eavesdropping on large networks can’t find out who’s communicating and when they’re doing so.

## Deep learning with point clouds

Research aims to make it easier for self-driving cars, robotics, and other applications to understand the 3D world.

## CSAIL hosts first-ever TEDxMIT

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

## MIT CSAIL holds trustworthy AI event with Microsoft

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

## 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.

## Holding law-enforcement accountable for electronic surveillance

CSAIL system encourages government transparency using cryptography on a public log of wiretap requests.

## Building AI systems that make fair decisions

Harini Suresh, a PhD student at MIT CSAIL, studies how to make machine learning algorithms more understandable and less biased.

## Goldwasser, Micali, and Rivest win BBVA Foundation Frontiers of Knowledge Awards

This week it was announced that MIT professors and CSAIL principal investigators Shafi Goldwasser, Silvio Micali, Ronald Rivest, and former MIT professor Adi Shamir won this year’s BBVA Foundation Frontiers of Knowledge Awards in the Information and Communication Technologies category for their work in cryptography.

## Four from MIT named 2017 Association for Computer Machinery Fellows

Today four MIT faculty were named among the Association for Computer Machinery's 2017 Fellows for making “landmark contributions to computing.”

## Goldwasser gives briefing on cryptography to Congress

Last week CSAIL principal investigator Shafi Goldwasser spoke about cryptography and privacy as part of the annual congressional briefing of the American Mathematical Society (AMS) and the Mathematical Sciences Research Institute (MSRI).

## Faster big-data analysis

We live in the age of big data, but most of that data is “sparse.” Imagine, for instance, a massive table that mapped all of Amazon’s customers against all of its products, with a “1” for each product a given customer bought and a “0” otherwise. The table would be mostly zeroes.

## CSAIL's Daniel Jackson receives two ACM awards

This week the Association for Computer Machinery presented CSAIL principal investigator Daniel Jackson with the 2017 ACM SIGSOFT Outstanding Research Award for his pioneering work in software engineering. (This fall he also received the ACM SIGSOFT Impact Paper Award for his research method for finding bugs in code.)An EECS professor and associate director of CSAIL, Jackson was given the Outstanding Research Award for his “foundational contributions to software modeling, the creation of the modeling language Alloy, and the development of a widely used tool supporting model verification.”