
LLC: Accurate, Multipurpose Learnt Lowdimensional Binary Codes
Learning binary representations of instances and classes is a classical ...
read it

Robust and Differentially Private Mean Estimation
Differential privacy has emerged as a standard requirement in a variety ...
read it

How Important is the TrainValidation Split in MetaLearning?
Metalearning aims to perform fast adaptation on a new task through lear...
read it

PCPG: Policy Cover Directed Exploration for Provable Policy Gradient Learning
Direct policy gradient methods for reinforcement learning are a successf...
read it

Information Theoretic Regret Bounds for Online Nonlinear Control
This work studies the problem of sequential control in an unknown, nonli...
read it

FLAMBE: Structural Complexity and Representation Learning of Low Rank MDPs
In order to deal with the curse of dimensionality in reinforcement learn...
read it

Robust Metalearning for Mixed Linear Regression with Small Batches
A common challenge faced in practical supervised learning, such as medic...
read it

PACT: Privacy Sensitive Protocols and Mechanisms for Mobile Contact Tracing
The global health threat from COVID19 has been controlled in a number o...
read it

Optimal Regularization Can Mitigate Double Descent
Recent empirical and theoretical studies have shown that many learning a...
read it

The Implicit and Explicit Regularization Effects of Dropout
Dropout is a widelyused regularization technique, often required to obt...
read it

Provable Representation Learning for Imitation Learning via Bilevel Optimization
A common strategy in modern learning systems is to learn a representatio...
read it

Metalearning for mixed linear regression
In modern supervised learning, there are a large number of tasks, but ma...
read it

Soft Threshold Weight Reparameterization for Learnable Sparsity
Sparsity in Deep Neural Networks (DNNs) is studied extensively with the ...
read it

MetaLearning with Implicit Gradients
A core capability of intelligent systems is the ability to quickly learn...
read it

On the Optimality of Sparse ModelBased Planning for Markov Decision Processes
This work considers the sample complexity of obtaining an ϵoptimal poli...
read it

Online MetaLearning
A central capability of intelligent systems is the ability to continuous...
read it

Plan Online, Learn Offline: Efficient Learning and Exploration via ModelBased Control
We propose a plan online and learn offline (POLO) framework for the sett...
read it

Provably Correct Automatic Subdifferentiation for Qualified Programs
The Cheap Gradient Principle (Griewank 2008)  the computational cost ...
read it

Stochastic subgradient method converges on tame functions
This work considers the question: what convergence guarantees does the s...
read it

Variance Reduction for Policy Gradient with ActionDependent Factorized Baselines
Policy gradient methods have enjoyed great success in deep reinforcement...
read it

Variance Reduction Methods for Sublinear Reinforcement Learning
This work considers the problem of provably optimal reinforcement learni...
read it

Leverage Score Sampling for Faster Accelerated Regression and ERM
Given a matrix A∈R^n× d and a vector b ∈R^d, we show how to compute an ϵ...
read it

Learning Overcomplete HMMs
We study the problem of learning overcomplete HMMsthose that have man...
read it

Prediction with a Short Memory
We consider the problem of predicting the next observation given a seque...
read it

Convergence Rates of Active Learning for Maximum Likelihood Estimation
An active learner is given a class of models, a large set of unlabeled e...
read it

A Linear Dynamical System Model for Text
Low dimensional representations of words allow accurate NLP models to be...
read it

When are Overcomplete Topic Models Identifiable? Uniqueness of Tensor Tucker Decompositions with Structured Sparsity
Overcomplete latent representations have been very popular for unsupervi...
read it

(weak) Calibration is Computationally Hard
We show that the existence of a computationally efficient calibration al...
read it

An Optimal Algorithm for Linear Bandits
We provide the first algorithm for online bandit linear optimization who...
read it

Efficient Learning of Generalized Linear and Single Index Models with Isotonic Regression
Generalized Linear Models (GLMs) and Single Index Models (SIMs) provide ...
read it

Learning from Logged Implicit Exploration Data
We provide a sound and consistent foundation for the use of nonrandom ex...
read it
Sham Kakade
is this you? claim profile
Washington Research Foundation Data Science Chair, with a joint appointment in both the Computer Science & Engineering and Statistics departments at the University of Washington.