# Research

- Research Areas
- Impact Areas

6 Group Results matching all criteria

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

#### Community of Research

## Computing & Society Community of Research

This community is interested in understanding and affecting the interaction between computing systems and society through engineering, computer science and public policy research, education, and public engagement.

#### Community of Research

## Vertical AI Community of Research

This CoR takes a unified approach to cover the full range of research areas required for success in artificial intelligence, including hardware, foundations, software systems, and applications.

#### Community of Research

## Theory of Computation Community of Research

The goal of the Theory of Computation CoR is to study the fundamental strengths and limits of computation as well as how these interact with mathematics, computer science, and other disciplines.

9 Project Results matching all criteria

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

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

## Practical Secure Computation

Our goal is to bridge theory and practice to create infrastructure that allow computation and multi-party computation without compromising privacy.

## Danny Feldman

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

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

## Return of the Byzantine Generals

This project studies new solutions to the Byzantine General Problem and its applications in distributed systems and cryptography.

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

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

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

28 Group Results

#### Research Group

## Advanced Network Architecture Group

The challenge that motivates the ANA group is to foster a healthy future for the Internet. The interplay of private sector investment, public sector regulation and public interest advocacy, as well as the global diversity in drivers and aspirations, makes for an uncertain future.

#### Research Group

## Algorithms Group

We devise new mathematical tools to tackle the increasing difficulty and importance of problems we pose to computers.

#### Research Group

## Anyscale Learning for All ALFA

Our vision is data-driven machine learning systems that advance the quality of healthcare, the understanding of cyber arms races and the delivery of online education.

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

#### Community of Research

## Cognitive AI Community of Research

This CoR aims to develop AI technology that synthesizes symbolic reasoning, probabilistic reasoning for dealing with uncertainty in the world, and statistical methods for extracting and exploiting regularities in the world, into an integrated picture of intelligence that is informed by computational insights and by cognitive science.

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

#### Community of Research

## Computing & Society Community of Research

This community is interested in understanding and affecting the interaction between computing systems and society through engineering, computer science and public policy research, education, and public engagement.

#### Research Group

## Cryptography and Information Security Group

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

## Internet Policy Research Initiative

Our mission is to work with policy makers and cybersecurity technologists to increase the trustworthiness and effectiveness of interconnected digital systems.

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

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

80 Project Results

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

## Suvrit Sra

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

#### Project

## Fast Lightweight Autonomy

The goal of the FLA program is to explore non-traditional perception and autonomy methods that could enable a new class of algorithms for minimalistic high-speed navigation in cluttered environments.

## Jake Ware

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

## Geometry and topology for scientific computing and shape analysis

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

#### Project

## Helping robots learn using demonstrations

Help robots learn faster by providing demonstrations when they need help

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

## High-Performance Parallel Clustering

We are designing new parallel algorithms, optimizations, and frameworks for clustering large-scale graph and geometric data.

#### Project

## Is the Casino using a Riffle Shuffle?

Our goal in this project is to understand how one can test if a particular dealer's shuffles follow a certain pattern. We have developed a theoretical framework for the same and wish to understand its performance in practice.

#### Project

## Keeping America Safe: Toward More Secure Networks for Critical Sectors

Report warns of hacking risk to electric grid, oil pipelines, and other critical infrastructure

#### Project

## Keys Under Doormats

Our report argues that giving the government special access to data poses major security risks

#### Project

## Leader Election in the SINR Model with Arbitrary Power Control

We study the leader election problem in a theoretical wireless network setting. We show that it can be solved in two communication rounds.

## Magnus Halldorsson

## Stephan Holzer

#### Project

## Matrix Permanents and Linear Optics

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

#### Project

## Multi-Core Data Structures

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

#### Project

## OpenTuner: An Extensible Framework for Program Autotuning

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

#### Project

## Optimal transport for statistics and machine learning

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

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

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

## Poirot: Secure Protocol Implementation by Design

Even formally verified protocols that have been faithfully implemented have been found to have security vulnerabilities. A new framework eliminates such vulnerabilities by design.

58 People Results

## Anish Athalye

Graduate Student

## Cenk Baykal

Graduate Student

## Henry Corrigan-Gibbs

Assistant Professor

## Martin Demaine

Robotics Engineer

## R. David Edelman

Director, Project on Technology, Economy & National Security

## Noah Golowich

Graduate Student

## Joanne Hanley

Administrative Assistant II

## Dhiraj Holden

Graduate Student

## Siddhartha Jayanti

Graduate Student

## Kenji Kawaguchi

Graduate Student

## William Kuszmaul

Graduate Student

## David Lazar

Graduate Student