Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Brody Huval

dblp:117/4058 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
5 papers
Deep learning architectures and training · 23% Autonomous driving · 22% Efficient and distributed learning · 20%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 50% GPUs and heterogeneous computing · 50%

Topics — the 13 heaviest of 17, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
cross-entropy loss
0.912025
Cut Your Losses in Large-Vocabulary Language Models · ICLR 2025
Machine learning › Efficient and distributed learning
memory-efficient training
0.912025
Cut Your Losses in Large-Vocabulary Language Models · ICLR 2025
Machine learning › Reinforcement learning › multi-agent reinforcement learning
self-play
0.912025
Robust Autonomy Emerges from Self-Play · ICML 2025
Robotics › Autonomous driving
perception and planning
0.312025
Robust Autonomy Emerges from Self-Play · ICML 2025
Machine learning › Efficient and distributed learning › distributed training
distributed deep learning
0.212013
Deep learning with COTS HPC systems · ICML (3) 2013
Computer vision › 3D vision
3d object recognition
0.112012
Convolutional-Recursive Deep Learning for 3D Object Classification · NIPS 2012
Machine learning › Representation and self-supervised learning › representation learning › compositional representation
compositional representation learning
0.112012
Semantic Compositionality through Recursive Matrix-Vector Spaces · EMNLP-CoNLL 2012
Knowledge, reasoning and agents › Knowledge representation and reasoning › semantic representation
compositional semantics
0.112012
Semantic Compositionality through Recursive Matrix-Vector Spaces · EMNLP-CoNLL 2012
Machine learning › Deep learning architectures and training
convolutional neural network
0.112012
Convolutional-Recursive Deep Learning for 3D Object Classification · NIPS 2012
Machine learning › Deep learning architectures and training
recursive neural network
0.112012
Convolutional-Recursive Deep Learning for 3D Object Classification · NIPS 2012
Computer vision › Image recognition and object detection › object recognition › multimodal object recognition
RGB-D object recognition
0.112012
Convolutional-Recursive Deep Learning for 3D Object Classification · NIPS 2012
GPUs and heterogeneous computing › multi-GPU computing
GPU cluster training
0.012013
Deep learning with COTS HPC systems · ICML (3) 2013
Natural language and speech › Language models and text generation
natural language understanding
0.012012
Semantic Compositionality through Recursive Matrix-Vector Spaces · EMNLP-CoNLL 2012

Methods — techniques the papers use, named apart from their topics

self-play · 0.9log-sum-exp · 0.9gradient sparsification · 0.9flash memory kernel · 0.9batched simulation · 0.9infiniband · 0.3MPI · 0.3recursive neural network · 0.3matrix-vector spaces · 0.1convolutional neural network · 0.1
YearPublicationVenuePosition
2025 Cut Your Losses in Large-Vocabulary Language Models
abstract
As language models grow ever larger, so do their vocabularies. This has shifted the memory footprint of LLMs during training disproportionately to one single layer: the cross-entropy in the loss computation. Cross-entropy builds up a logit matrix with entries for each pair of input tokens and vocabulary items and, for small models, consumes an order of magnitude more memory than the rest of the LLM combined. We propose Cut Cross-Entropy (CCE), a method that computes the cross-entropy loss without materializing the logits for all tokens into global memory. Rather, CCE only computes the logit for the correct token and evaluates the log-sum-exp over all logits on the fly. We implement a custom kernel that performs the matrix multiplications and the log-sum-exp reduction over the vocabulary in flash memory, making global memory consumption for the cross-entropy computation negligible. This has a dramatic effect. Taking the Gemma 2 (2B) model as an example, CCE reduces the memory footprint of the loss computation from 24 GB to 1 MB, and the total training-time memory consumption of the classifier head from 28 GB to 1 GB. To improve the throughput of CCE, we leverage the inherent sparsity of softmax and propose to skip elements of the gradient computation that have a negligible (i.e. below numerical precision) contribution to the gradient. Experiments demonstrate that the dramatic reduction in memory consumption is accomplished without sacrificing training speed or convergence.
Erik Wijmans, Brody Huval, Alexander Hertzberg, Vladlen Koltun, Philipp Krähenbühl
ICLR2
2025 Robust Autonomy Emerges from Self-Play
abstract
Self-play has powered breakthroughs in two-player and multi-player games. Here we show that self-play is a surprisingly effective strategy in another domain. We show that robust and naturalistic driving emerges entirely from self-play in simulation at unprecedented scale -- 1.6 billion km of driving. This is enabled by Gigaflow, a batched simulator that can synthesize and train on 42 years of subjective driving experience per hour on a single 8-GPU node. The resulting policy achieves state-of-the-art performance on three independent autonomous driving benchmarks. The policy outperforms the prior state of the art when tested on recorded real-world scenarios, amidst human drivers, without ever seeing human data during training. The policy is realistic when assessed against human references and achieves unprecedented robustness, averaging 17.5 years of continuous driving between incidents in simulation.
Marco F. Cusumano-Towner, David Hafner, Alexander Hertzberg, Brody Huval, Aleksei Petrenko, Eugene Vinitsky, Erik Wijmans, Taylor W. Killian, Stuart Bowers, Ozan Sener, Philipp Krähenbühl, Vladlen Koltun
ICML4
2013 Deep learning with COTS HPC systems
abstract
Scaling up deep learning algorithms has been shown to lead to increased performance in benchmark tasks and to enable discovery of complex high-level features. Recent efforts to train extremely large networks (with over 1 billion parameters) have relied on cloud-like computing infrastructure and thousands of CPU cores. In this paper, we present technical details and results from our own system based on Commodity Off-The-Shelf High Performance Computing (COTS HPC) technology: a cluster of GPU servers with Infiniband interconnects and MPI. Our system is able to train 1 billion parameter networks on just 3 machines in a couple of days, and we show that it can scale to networks with over 11 billion parameters using just 16 machines. As this infrastructure is much more easily marshaled by others, the approach enables much wider-spread research with extremely large neural networks.
Adam Coates 0002, Brody Huval, David J. Wu 0001, Bryan Catanzaro, Andrew Y. Ng
ICML (3)2
2012 Semantic Compositionality through Recursive Matrix-Vector Spaces
Richard Socher, Brody Huval, Christopher D. Manning, Andrew Y. Ng
EMNLP-CoNLL2
2012 Convolutional-Recursive Deep Learning for 3D Object Classification
abstract
Recent advances in 3D sensing technologies make it possible to easily record color and depth images which together can improve object recognition. Most current methods rely on very well-designed features for this new 3D modality. We in- troduce a model based on a combination of convolutional and recursive neural networks (CNN and RNN) for learning features and classifying RGB-D images. The CNN layer learns low-level translationally invariant features which are then given as inputs to multiple, fixed-tree RNNs in order to compose higher order fea- tures. RNNs can be seen as combining convolution and pooling into one efficient, hierarchical operation. Our main result is that even RNNs with random weights compose powerful features. Our model obtains state of the art performance on a standard RGB-D object dataset while being more accurate and faster during train- ing and testing than comparable architectures such as two-layer CNNs.
Richard Socher, Brody Huval, Bharath Putta Bath, Christopher D. Manning, Andrew Y. Ng
NIPS2