My research involves trying to quantify the fundamental limits and capabilities of computation. This involves questions like cryptography (can we build a code that is unbreakable?), algorithms (in what cases can we find better procedures to solve a problem than exhaustive search over all possiblities?), and computational complexity (can we sometimes prove that a problem … Continued
In September 2013, the New York Times disclosed the NSA’s “Campaign against Encryption.” Methods employed include inserting vulnerabilities into commercial encryption systems, working with Internet companies to compromise encryption and lobbying for crackable standards. The traditional picture of cryptography, in which Alice and Bob use encryption to thwart an adversary who, respectfully, only taps the … Continued
My work concerns theoretical computer science, which seeks to provide fundamental understanding of many settings of computer science. In last few years I have focused on machine learning. Many current machine learning algorithms lack provable guarantees on one or more of the following metrics: solution quality, sample complexity, running time. The goal of my work … Continued