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

Brydon Eastman

dblp:336/3485 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 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.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%

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

TopicWeightPapersLastEvidence papers
Computational science and engineering › scientific machine learning › physics-informed machine learning
physics-informed neural networks
0.712023
Universal Physics-Informed Neural Networks: Symbolic Differential Operator Discovery with Sparse Data · ICML 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge discovery
equation discovery
0.212023
Universal Physics-Informed Neural Networks: Symbolic Differential Operator Discovery with Sparse Data · ICML 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning
symbolic regression
0.212023
Universal Physics-Informed Neural Networks: Symbolic Differential Operator Discovery with Sparse Data · ICML 2023

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

symbolic regression · 1.3physics-informed neural networks · 1.3AI Feynman · 1.3
YearPublicationVenuePosition
2023 Universal Physics-Informed Neural Networks: Symbolic Differential Operator Discovery with Sparse Data
abstract
In this work we perform symbolic discovery of differential operators in a situation where there is sparse experimental data. This small data regime in machine learning can be made tractable by providing our algorithms with prior information about the underlying dynamics. Physics Informed Neural Networks (PINNs) have been very successful in this regime (reconstructing entire ODE solutions using only a single point or entire PDE solutions with very few measurements of the initial condition). The Universal PINN approach (UPINN) adds a neural network that learns a representation of unknown hidden terms in the differential equation. The algorithm yields both a surrogate solution to the differential equation and a black-box representation of the hidden terms. These hidden term neural networks can then be converted into symbolic equations using symbolic regression techniques like AI Feynman. In order to achieve convergence of the neural networks, we provide our algorithms with (noisy) measurements of both the initial condition as well as (synthetic) experimental data obtained at later times. We demonstrate strong performance of UPINNs even when provided with very few measurements of noisy data in both the ODE and PDE regime.
Lena Podina, Brydon Eastman, Mohammad Kohandel
ICML2