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

Ruby Shrestha

dblp:354/8682 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—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.

Artificial intelligence
1 paper
Transfer learning and domain adaptation · 67% Deep learning architectures and training · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation
meta-learning
0.812024
DATS: Difficulty-Aware Task Sampler for Meta-Learning Physics-Informed Neural Networks · ICLR 2024
Machine learning › Deep learning architectures and training
physics-informed neural network
0.812024
DATS: Difficulty-Aware Task Sampler for Meta-Learning Physics-Informed Neural Networks · ICLR 2024
Machine learning › Transfer learning and domain adaptation › meta-learning
task sampling
0.812024
DATS: Difficulty-Aware Task Sampler for Meta-Learning Physics-Informed Neural Networks · ICLR 2024

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

physics-informed neural networks · 0.8meta-learning · 0.8
YearPublicationVenuePosition
2024 DATS: Difficulty-Aware Task Sampler for Meta-Learning Physics-Informed Neural Networks
abstract
Advancements in deep learning have led to the development of physics-informed neural networks (PINNs) for solving partial differential equations (PDEs) without being supervised by PDE solutions. While vanilla PINNs require training one network per PDE configuration, recent works have showed the potential to meta-learn PINNs across a range of PDE configurations. It is however known that PINN training is associated with different levels of difficulty, depending on the underlying PDE configurations or the number of residual sampling points available. Existing meta-learning approaches, however, treat all PINN tasks equally. We address this gap by introducing a novel difficulty-aware task sampler (DATS) for meta-learning of PINNs. We derive an optimal analytical solution to optimize the probability for sampling individual PINN tasks in order to minimize their validation loss across tasks. We further present two alternative strategies to utilize this sampling probability to either adaptively weigh PINN tasks, or dynamically allocate optimal residual points across tasks. We evaluated DATS against uniform and self-paced task-sampling baselines on two representative meta-PINN models, across four benchmark PDEs as well as three different residual point sampling strategies. The results demonstrated that DATS was able to improve the accuracy of meta-learned PINN solutions when reducing performance disparity across PDE configurations, at only a fraction of residual sampling budgets required by its baselines.
Maryam Toloubidokhti, Yubo Ye, Ryan Missel, Xiajun Jiang, Nilesh Kumar, Ruby Shrestha
ICLR6