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.
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.
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.
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.
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.
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.
Data often has geometric structure which can enable better inference; this project aims to scale up geometry-aware techniques for use in machine learning settings with lots of data, so that this structure may be utilized in practice.
Almost every object we use is developed with computer-aided design (CAD). While CAD programs are good for creating designs, using them to actually improve existing designs can be difficult and time-consuming.
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.
Visual recognition is affected by changes in visual appearance (pose, scale, rotation) that do not affect a scene’s semantic category. We introduce a method for using sets of traNational Science Foundationorming examples, to learn representations that are robust to these changes.
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.
ACM, the Association for Computing Machinery announced this week that MIT CSAIL PhD student ‘19 Jiajun Wu was selected for an honorable mention for his dissertation “Learning to See the Physical World.”
This week it was announced that MIT professor Armando Solar-Lezama has received a prestigious NSF award for junior faculty, to go towards a new project that could impact scientific discovery in domains as diverse as organic chemistry, RNA splicing and cognitive science.
A new MIT study finds “health knowledge graphs,” which show relationships between symptoms and diseases and are intended to help with clinical diagnosis, can fall short for certain conditions and patient populations. The results also suggest ways to boost their performance.