I am a fifth-year PhD candidate at UC Berkeley advised by Jitendra Malik. My research interests are in machine learning, computer vision and algorithms. I received my bachelor's in computer science from the University of Toronto. I can be reached by e-mail at ke [dot] li [at] eecs [dot] berkeley [dot] edu.
Google Scholar | Twitter
Slides from my lecture at the CIFAR Deep Learning and Reinforcement Learning Summer School are available here.
I am interested in tackling fundamental problems in machine learning that cannot be solved using a straightforward application of conventional techniques. Below are the major areas that I contributed to:
- Generative Modelling (Slides) (Poster): Implicit probabilistic models like generative adversarial nets (GANs) and variational autoencoders (VAEs) have gained popularity in recent years and have delivered impressive advances in performance. While offering substantially more modelling flexibility than prescribed probabilistic models, implicit models in general induce intractable likelihood functions and therefore cannot be trained using maximum likelihood. On the other hand, alternative training objectives have known biases; for example, GANs suffer from the well-known issues of mode collapse/dropping, vanishing gradients and training instability, which could lead to a failure to learn the underlying data distribution. We developed a method that simultaneously overcomes all three issues and show equivalence to maximum likelihood under some conditions despite not requiring the evaluation of the likelihood itself or any derived quantities. This means that, for the first time, implicit probabilistic models can be trained to maximize likelihood.
Related papers: Implicit Maximum Likelihood Estimation | Super-Resolution via Conditional IMLE | Diverse Image Synthesis from Semantic Layouts via Conditional IMLE | On the Implicit Assumptions of GANs
- Learning to Optimize (Slides) (Poster): While machine learning has been applied to a wide range of domains, one domain that has conspicuously been left untouched is the design of tools that power machine learning itself. In this line of work, we ask the following question: is it possible to automate the design of algorithms used in machine learning? We introduced the first framework for learning a general-purpose iterative optimization algorithm automatically. The key idea is to treat the design of an optimization algorithm as a reinforcement learning/optimal control problem and view a particular update formula (and therefore a particular optimization algorithm) as a particular policy. Finding the optimal policy then corresponds to finding the best optimization algorithm. We parameterize the update formula using a neural net and train it using reinforcement learning to avoid the problem of compounding errors. This has inspired various subsequent work on meta-learning.
Related papers: Learning to Optimize | Learning to Optimize Neural Nets
- Fast Nearest Neighbour Search (Slides) (Poster): The method of k-nearest neighbours is widely used in machine learning, statistics, bioinformatics and database systems. Attempts at devising fast algorithms, however, have come up against a recurring obstacle: the curse of dimensionality. Almost all exact algorithms developed over the past 40 years exhibited a time complexity that is exponential in ambient or intrinsic dimensionality, and such persistent failure in overcoming the curse of dimensionality led to conjectures that doing so is impossible. We showed that, surprisingly, this is in fact possible — we developed an exact randomized algorithm whose query time complexity is linear in ambient dimensionality and sublinear in intrinsic dimensionality. The key insight is to avoid the popular strategy of space partitioning, which we argue gives rise to the curse of dimensionality. We demonstrated a speedup of 1-2 orders of magnitude over locality-sensitive hashing (LSH).
Related papers: Fast k-Nearest Neighbour Search via Dynamic Continuous Indexing | Fast k-Nearest Neighbour Search via Prioritized DCI
- Diverse Image Synthesis from Semantic Layouts via Conditional IMLE (Project Page) (Code)
Ke Li*, Tianhao Zhang*, Jitendra Malik
IEEE International Conference on Computer Vision (ICCV), 2019
- Non-Adversarial Image Synthesis with Generative Latent Nearest Neighbors (Code)
Yedid Hoshen, Ke Li, Jitendra Malik
IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2019
- On the Implicit Assumptions of GANs (Poster)
Ke Li, Jitendra Malik
NeurIPS Workshop on Critiquing and Correcting Trends in Machine Learning, 2018
- Super-Resolution via Conditional Implicit Maximum Likelihood Estimation (Project Page)
Ke Li*, Shichong Peng*, Jitendra Malik
- Implicit Maximum Likelihood Estimation (Project Page) (Reviews) (Slides) (Poster) (Code)
Ke Li, Jitendra Malik
Learning to Optimize
Fast Nearest Neighbour Search
- Trajectory Normalized Gradients for Distributed Optimization
Jianqiao Wangni, Ke Li, Jianbo Shi, Jitendra Malik
- Are All Training Examples Created Equal? An Empirical Study
Kailas Vodrahalli, Ke Li, Jitendra Malik
- Efficient Feature Learning using Perturb-and-MAP
Ke Li, Kevin Swersky, Richard Zemel
NIPS Workshop on Perturbations, Optimization and Statistics, 2013
CS 189: Introduction to Machine Learning (Summer 2018) — Instructor