← Search

Roy Frostig

7 accepted papers

2022

Efficient and Modular Implicit Differentiation

NeurIPS 2022accept

Automatic differentiation (autodiff) has revolutionized machine learning. It allows to express complex computations by composing elementary ones in creative ways and removes the burden of computing their derivatives by hand. More recently, differentiation of optimization problem solutions has attra…

2022

Learning Model Predictive Controllers with Real-Time Attention for Real-World Navigation

CoRL 2022poster

Despite decades of research, existing navigation systems still face real-world challenges when deployed in the wild, e.g., in cluttered home environments or in human-occupied public spaces. To address this, we present a new class of implicit control policies combining the benefits of imitation lear…

Cited by 53SourceScholar
2019

The advantages of multiple classes for reducing overfitting from test set reuse

ICML 2019oral

Excessive reuse of holdout data can lead to overfitting. However, there is little concrete evidence of significant overfitting due to holdout reuse in popular multiclass benchmarks today. Known results show that, in the worst-case, revealing the accuracy of $k$ adaptively chosen classifiers on a dat…

Cited by 38SourcePDFScholar
2016

Estimation from Indirect Supervision with Linear Moments

ICML 2016poster

In structured prediction problems where we have indirect supervision of the output, maximum marginal likelihood faces two computational obstacles: non-convexity of the objective and intractability of even a single gradient computation. In this paper, we bypass both obstacles for a class of what we c…

Cited by 16SourcePDFScholar
2016

Principal Component Projection Without Principal Component Analysis

ICML 2016poster

We show how to efficiently project a vector onto the top principal components of a matrix, *without explicitly computing these components*. Specifically, we introduce an iterative algorithm that provably computes the projection using few calls to any black-box routine for ridge regression. By avoidi…

Cited by 39SourcePDFScholar
2016

Toward Deeper Understanding of Neural Networks: The Power of Initialization and a Dual View on Expressivity

NeurIPS 2016poster

We develop a general duality between neural networks and compositional kernel Hilbert spaces. We introduce the notion of a computation skeleton, an acyclic graph that succinctly describes both a family of neural networks and a kernel space. Random neural networks are generated from a skeleton throug…

Cited by 409SourcePDFScholar
2015

Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization

ICML 2015poster

We develop a family of accelerated stochastic algorithms that optimize sums of convex functions. Our algorithms improve upon the fastest running time for empirical risk minimization (ERM), and in particular linear least-squares regression, across a wide range of problem settings. To achieve this, we…

Cited by 177SourcePDFScholar