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

Anthony Gruber

dblp:344/5580 · DBLP profile ↗
← Back
2ranked-venue papers
2as 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 · 2 · 2 first-author · 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
2 papers
Graph learning · 75% Deep learning architectures and training · 25%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
physics-informed neural network
0.912025
Efficiently Parameterized Neural Metriplectic Systems · ICLR 2025
Computational science and engineering
scientific machine learning
0.912025
Efficiently Parameterized Neural Metriplectic Systems · ICLR 2025
Machine learning › Graph learning › graph neural network
deep graph neural network
0.712023
Reversible and irreversible bracket-based dynamics for deep graph neural networks · NeurIPS 2023
Machine learning › Graph learning
graph neural network
0.712023
Reversible and irreversible bracket-based dynamics for deep graph neural networks · NeurIPS 2023
Machine learning › Graph learning › graph neural network › deep graph neural network
over-smoothing mitigation
0.712023
Reversible and irreversible bracket-based dynamics for deep graph neural networks · NeurIPS 2023
Machine learning › Graph learning › graph neural network › graph neural network architecture
physics-informed graph neural networks
0.712023
Reversible and irreversible bracket-based dynamics for deep graph neural networks · NeurIPS 2023

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

metriplectic operator parameterization · 1.7energy conservation · 1.7structure-preserving dynamical systems · 0.7hamiltonian dynamics · 0.7diffusion · 0.7
YearPublicationVenuePosition
2025 Efficiently Parameterized Neural Metriplectic Systems
abstract
Metriplectic systems are learned from data in a way that scales quadratically in both the size of the state and the rank of the metriplectic operators. In addition to being provably energy-conserving and entropy-stable, the proposed neural metriplectic systems (NMS) approach includes approximation results that demonstrate its ability to accurately learn metriplectic dynamics from data, along with an error estimate that indicates its potential for generalization to unseen timescales when the approximation error is low. Examples are provided to illustrate performance both with full state information available and when entropic variables are unknown, confirming that the NMS approach exhibits superior accuracy and scalability without compromising on model expressivity.
Anthony Gruber, Kookjin Lee, Haksoo Lim, Noseong Park, Nathaniel Trask
ICLR1
2023 Reversible and irreversible bracket-based dynamics for deep graph neural networks
abstract
Recent works have shown that physics-inspired architectures allow the training of deep graph neural networks (GNNs) without oversmoothing. The role of these physics is unclear, however, with successful examples of both reversible (e.g., Hamiltonian) and irreversible (e.g., diffusion) phenomena producing comparable results despite diametrically opposed mechanisms, and further complications arising due to empirical departures from mathematical theory. This work presents a series of novel GNN architectures based upon structure-preserving bracket-based dynamical systems, which are provably guaranteed to either conserve energy or generate positive dissipation with increasing depth. It is shown that the theoretically principled framework employed here allows for inherently explainable constructions, which contextualize departures from theory in current architectures and better elucidate the roles of reversibility and irreversibility in network performance. Code is available at the Github repository \url{https://github.com/natrask/BracketGraphs}.
Anthony Gruber, Kookjin Lee, Nathaniel Trask
NeurIPS1