551 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- ETH ZurichCH6 papers
- Walt Disney (Switzerland)CH5 papers
- Fudan UniversityCN3 papers
- California Institute of TechnologyUS2 papers
- Carnegie Mellon UniversityUS2 papers
- Columbia UniversityUS2 papers
- Dartmouth CollegeUS2 papers
- KTH Royal Institute of TechnologySE2 papers
- University of Colorado BoulderUS2 papers
- Adobe Systems (United States)US1 paper
- AMA Computer UniversityPH1 paper
- Apple (United States)US1 paper
6 papers · 1 filter
Exploiting the Hidden Tasks of GANs: Making Implicit Subproblems Explicit
Romann M. Weber
We present an alternative perspective on the training of generative adversarial networks (GANs), showing that the training step for a GAN generator decomposes into two implicit sub…
Deep Scattering: Rendering Atmospheric Clouds with Radiance-Predicting Neural Networks
Simon Kallweit, Thomas Müller, Brian McWilliams +2
We present a technique for efficiently synthesizing images of atmospheric clouds using a combination of Monte Carlo integration and neural networks. The intricacies of Lorenz-Mie s…
Determinantal Point Processes for Mini-Batch Diversification
Cheng Zhang, Hedvig Kjellstrom, Stephan Mandt
We study a mini-batch diversification scheme for stochastic gradient descent (SGD). While classical SGD relies on uniformly sampling data points to form a mini-batch, we propose a…
Coordinated Multi-Agent Imitation Learning
Hoang M. Le, Yisong Yue, Peter Carr +1
We study the problem of imitation learning from demonstrations of multiple coordinating agents. One key challenge in this setting is that learning a good model of coordination can…
Smooth Imitation Learning for Online Sequence Prediction
Hoang M. Le, Andrew Kang, Yisong Yue +1
We study the problem of smooth imitation learning for online sequence prediction, where the goal is to train a policy that can smoothly imitate demonstrated behavior in a dynamic a…
The Boundary Forest Algorithm for Online Supervised and Unsupervised Learning
Charles Mathy, Nate Derbinsky, José Bento +2
We describe a new instance-based learning algorithm called the Boundary Forest (BF) algorithm, that can be used for supervised and unsupervised learning. The algorithm builds a for…