Genetic Algorithm, in Reverse Mode
Today I would like to discuss running genetic algorithm… backwards. Yes, this is possible. Occasionally it is practical, when you need not the best, but the worst solution to a problem. And I think there…
Understanding Black-box Predictions via Influence Functions
How can we explain the predictions of a black-box model? In this paper, we use influence functions — a classic technique from robust statistics — to trace a model’s prediction through the learning algorithm and back to…
Dynamic Program Analysis-based Approach for Algorithm Recognition and Program Repair
In this talk, I will describe techniques for recognizing the high-level algorithmic idea of a program and its applications in feedback generation for introductory programming education. Both techniques are based on dynamic program analysis, in…
Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time
Sampling integers with Gaussian distribution is a fundamental problem that arises in almost every application of lattice cryptography, and it can be both time consuming and challenging to implement. Most previous work has focused on…