activity
20122020
most citedTune: A Research Platform for Distributed Model Selection and Training

599 citations · 1.6k across the 13 of their papers we have counts for

collaborators

14 papers

cs.DC2020

Hoplite: Efficient and Fault-Tolerant Collective Communication for Task-Based Distributed Systems

Siyuan Zhuang, Zhuohan Li, Danyang Zhuo +5

Task-based distributed frameworks (e.g., Ray, Dask, Hydro) have become increasingly popular for distributed applications that contain asynchronous and dynamic workloads, including…

cs.LG2019★ 18 cited

Policy Gradient Search: Online Planning and Expert Iteration without Search Trees

Thomas Anthony, Robert Nishihara, Philipp Moritz +2

Monte Carlo Tree Search (MCTS) algorithms perform simulation-based search to improve policies online. During search, the simulation policy is adapted to explore the most promising…

cs.LG2018★ 599 cited

Tune: A Research Platform for Distributed Model Selection and Training

Richard Liaw, Eric Liang, Robert Nishihara +3

Modern machine learning algorithms are increasingly computationally demanding, requiring specialized hardware and distributed computation to achieve high performance in a reasonabl…

cs.AI2017★ 328 cited

RLlib: Abstractions for Distributed Reinforcement Learning

Eric Liang, Richard Liaw, Philipp Moritz +6

Reinforcement learning (RL) algorithms involve the deep nesting of highly irregular computation patterns, each of which typically exhibits opportunities for distributed computation…

cs.DC2017★ 252 cited

Ray: A Distributed Framework for Emerging AI Applications

Philipp Moritz, Robert Nishihara, Stephanie Wang +8

The next generation of AI applications will continuously interact with the environment and learn from these interactions. These applications impose new and demanding systems requir…

cs.DC2017★ 14 cited

Real-Time Machine Learning: The Missing Pieces

Robert Nishihara, Philipp Moritz, Stephanie Wang +7

Machine learning applications are increasingly deployed not only to serve predictions using static models, but also as tightly-integrated components of feedback loops involving dyn…

stat.ML2016

Discovering Causal Signals in Images

David Lopez-Paz, Robert Nishihara, Soumith Chintala +2

This paper establishes the existence of observable footprints that reveal the "causal dispositions" of the object categories appearing in collections of images. We achieve this goa…

stat.ML2015★ 74 cited

SparkNet: Training Deep Networks in Spark

Philipp Moritz, Robert Nishihara, Ion Stoica +1

Training deep networks is a time-consuming process, with networks for object recognition often requiring multiple days to train. For this reason, leveraging the resources of a clus…

stat.ML2015

No Regret Bound for Extreme Bandits

Robert Nishihara, David Lopez-Paz, Léon Bottou

Algorithms for hyperparameter optimization abound, all of which work well under different and often unverifiable assumptions. Motivated by the general challenge of sequentially cho…

math.OC2015★ 164 cited

A Linearly-Convergent Stochastic L-BFGS Algorithm

Philipp Moritz, Robert Nishihara, Michael I. Jordan

We propose a new stochastic L-BFGS algorithm and prove a linear convergence rate for strongly convex and smooth functions. Our algorithm draws heavily from a recent stochastic vari…

math.OC2015★ 147 cited

A General Analysis of the Convergence of ADMM

Robert Nishihara, Laurent Lessard, Benjamin Recht +2

We provide a new proof of the linear convergence of the alternating direction method of multipliers (ADMM) when one of the objective terms is strongly convex. Our proof is based on…

math.OC2014★ 14 cited

On the Convergence Rate of Decomposable Submodular Function Minimization

Robert Nishihara, Stefanie Jegelka, Michael I. Jordan

Submodular functions describe a variety of discrete problems in machine learning, signal processing, and computer vision. However, minimizing submodular functions poses a number of…

stat.ML2013★ 16 cited

Detecting Parameter Symmetries in Probabilistic Models

Robert Nishihara, Thomas Minka, Daniel Tarlow

Probabilistic models often have parameters that can be translated, scaled, permuted, or otherwise transformed without changing the model. These symmetries can lead to strong correl…

stat.CO2012★ 1 cited

Parallel MCMC with Generalized Elliptical Slice Sampling

Robert Nishihara, Iain Murray, Ryan P. Adams

Probabilistic models are conceptually powerful tools for finding structure in data, but their practical effectiveness is often limited by our ability to perform inference in them.…