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.

Nick Richardson

dblp:99/2312 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
4since 2021 · last 2025
—ORCID · unresolved

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

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Systems, architecture and hardware · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 1

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
3 papers
Generative modeling · 73% Graph learning · 27%
Theoretical computer science
2 papers
Distributed computing theory · 47% Computational geometry · 41% Mathematical optimization · 12%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%
Computer graphics and multimedia
2 papers
Rendering · 57% Geometric modeling and processing · 43%

Topics — the 15 heaviest of 18, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
0.912025
Space Group Equivariant Crystal Diffusion · NeurIPS 2025
Machine learning › Generative modeling › diffusion model › geometric diffusion model
equivariant diffusion model
0.912025
Space Group Equivariant Crystal Diffusion · NeurIPS 2025
Machine learning › Graph learning
graph neural network
0.912025
Graph Neural Networks Gone Hogwild · ICLR 2025
Computational science and engineering › materials science › materials discovery
crystal structure generation
0.912025
Space Group Equivariant Crystal Diffusion · NeurIPS 2025
Computational science and engineering
materials informatics
0.912025
Space Group Equivariant Crystal Diffusion · NeurIPS 2025
Distributed computing theory
asynchronous computability
0.912025
Graph Neural Networks Gone Hogwild · ICLR 2025
Rendering
monte carlo rendering
0.812024
Fiber Monte Carlo · ICLR 2024
Geometric modeling and processing › computer-aided design › parametric design
parametric CAD
0.612022
Vitruvion: A Generative Model of Parametric CAD Sketches · ICLR 2022
Mathematical optimization › continuous optimization › convex optimization › first-order methods
gradient-based optimization
0.212024
Fiber Monte Carlo · ICLR 2024
Processor architecture and microarchitecture
branch prediction
0.012002
The iCOREtm 520 MHz synthesizable CPU core · DAC 2002
Processor architecture and microarchitecture
instruction-level parallelism
0.012002
The iCOREtm 520 MHz synthesizable CPU core · DAC 2002
Processor architecture and microarchitecture › pipelining
pipeline design
0.012002
The iCOREtm 520 MHz synthesizable CPU core · DAC 2002
Processor architecture and microarchitecture › microprocessor design
processor core design
0.012002
The iCOREtm 520 MHz synthesizable CPU core · DAC 2002
Processor architecture and microarchitecture › superscalar processor
superscalar execution
0.012002
The iCOREtm 520 MHz synthesizable CPU core · DAC 2002
Electronic design automation
logic synthesis
0.012002
The iCOREtm 520 MHz synthesizable CPU core · DAC 2002

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

transformer-based autoregressive sampling · 1.7implicit GNNs · 1.7equivariant vector field · 1.7energy GNNs · 1.7asynchronous optimization · 1.7SE(3)-invariant sampling · 1.7conditional monte carlo · 1.5automatic differentiation · 1.5generative modeling · 1.1logic synthesis · 0.0automatic place and route · 0.0
YearPublicationVenuePosition
2025 Graph Neural Networks Gone Hogwild
abstract
Graph neural networks (GNNs) appear to be powerful tools to learn state representations for agents in distributed, decentralized multi-agent systems, but generate catastrophically incorrect predictions when nodes update asynchronously during inference. This failure under asynchrony effectively excludes these architectures from many potential applications where synchrony is difficult or impossible to enforce, e.g., robotic swarms or sensor networks. In this work we identify ''implicitly-defined'' GNNs as a class of architectures which is provably robust to asynchronous ''hogwild'' inference, adapting convergence guarantees from work in asynchronous and distributed optimization. We then propose a novel implicitly-defined GNN architecture, which we call an energy GNN. We show that this architecture outperforms other GNNs from this class on a variety of synthetic tasks inspired by multi-agent systems.
Olga Solodova, Nick Richardson, Deniz Oktay, Ryan P. Adams
ICLR2
2025 Space Group Equivariant Crystal Diffusion
abstract
Accelerating inverse design of crystalline materials with generative models has significant implications for a range of technologies. Unlike other atomic systems, 3D crystals are invariant to discrete groups of isometries called the space groups. Crucially, these space group symmetries are known to heavily influence materials properties. We propose SGEquiDiff, a crystal generative model which naturally handles space group constraints with space group invariant likelihoods. SGEquiDiff consists of an SE(3)-invariant, telescoping discrete sampler of crystal lattices; permutation-invariant, transformer-based autoregressive sampling of Wyckoff positions, elements, and numbers of symmetrically unique atoms; and space group equivariant diffusion of atomic coordinates. We show that space group equivariant vector fields automatically live in the tangent spaces of the Wyckoff positions. SGEquiDiff achieves state-of-the-art performance on standard benchmark datasets as assessed by quantitative proxy metrics and quantum mechanical calculations. Our code is available at https://github.com/rees-c/sgequidiff.
Rees Chang, Angela Pak, Alex Guerra, Ni Zhan 0001, Nick Richardson, Elif Ertekin, Ryan P. Adams
NeurIPS5
2024 Fiber Monte Carlo
abstract
Integrals with discontinuous integrands are ubiquitous, arising from discrete structure in applications like topology optimization, graphics, and computational geometry. These integrals are often part of a forward model in an inverse problem where it is necessary to reason backwards about the parameters, ideally using gradient-based optimization. Monte Carlo methods are widely used to estimate the value of integrals, but this results in a non-differentiable approximation that is amenable to neither conventional automatic differentiation nor reparameterization-based gradient methods. This significantly disrupts efforts to integrate machine learning methods in areas that exhibit these discontinuities: physical simulation and robotics, design, graphics, and computational geometry. Although bespoke domain-specific techniques can handle special cases, a general methodology to wield automatic differentiation in these discrete contexts is wanting. We introduce a differentiable variant of the simple Monte Carlo estimator which samples line segments rather than points from the domain. We justify our estimator analytically as conditional Monte Carlo and demonstrate the diverse functionality of the method as applied to image stylization, topology optimization, and computational geometry.
Nick Richardson, Deniz Oktay, Yaniv Ovadia, James C. Bowden, Ryan P. Adams
ICLR1
2022 Vitruvion: A Generative Model of Parametric CAD Sketches
Ari Seff, Wenda Zhou, Nick Richardson, Ryan P. Adams
ICLR3
2003 NPSE: A High Performance Network Packet Search Engine
Naresh Soni, Nick Richardson, Lun Bin Huang, Suresh Rajgopal, George Vlantis
DATE2
2002 The iCOREtm 520 MHz synthesizable CPU core
abstract
This paper describes a new implementation of the ST20-C2 CPU architecture. The design involves an eight-stage pipeline with hardware support to execute up to three instructions in a cycle. Branch prediction is based on a 2-bit predictor scheme with a 1024-entry Branch History Table and a 64 entry Branch Target Buffer and a 4-entry Return Stack. The implementation of all blocks in the processor was based on synthesized logic generation and automatic place and route. The full design of the CPU from microarchitectural investigations to layout required approximately 8-man years. The CPU core, without the caches, has an area of approximately 1.5 mm2 in a 6-metal 0.18m CMOS process. The design operates up to 520 MHz at 1.8V, among the highest reported speeds for a synthesized CPU core [1].
Nick Richardson, Lun Bin Huang, Razak Hossain, Tommy Zounes, Naresh Soni, Julian Lewis
DAC1