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

Jayden Parker Vap

dblp:319/0401 · also Jay Vap · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0003-0416-1699ORCID · reported

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

Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.

Network and information security
1 paper
Security and privacy of machine learning · 50% Privacy and data protection · 50%
Artificial intelligence
1 paper
Deep learning architectures and training · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
neural operator
0.912025
Building Flexible Physics-Informed Neural Networks with Fast Fourier Transform Analysis · HPDC 2025
Machine learning › Deep learning architectures and training
physics-informed neural network
0.912025
Building Flexible Physics-Informed Neural Networks with Fast Fourier Transform Analysis · HPDC 2025
Security and privacy of machine learning › privacy-preserving inference
attribute inference defense
0.612022
Learning Privacy-Preserving Graph Convolutional Network with Partially Observed Sensitive Attributes · WWW 2022
Privacy and data protection › privacy-preserving data processing
graph data privacy
0.612022
Learning Privacy-Preserving Graph Convolutional Network with Partially Observed Sensitive Attributes · WWW 2022
Security and privacy of machine learning
graph neural network privacy
0.612022
Learning Privacy-Preserving Graph Convolutional Network with Partially Observed Sensitive Attributes · WWW 2022
Privacy and data protection › privacy-preserving data sharing
sensitive attribute protection
0.612022
Learning Privacy-Preserving Graph Convolutional Network with Partially Observed Sensitive Attributes · WWW 2022
Computational science and engineering
differential equations
0.312025
Building Flexible Physics-Informed Neural Networks with Fast Fourier Transform Analysis · HPDC 2025

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

fourier layer neural operator · 1.7fast fourier transform · 1.7graph neural network · 0.6
YearPublicationVenuePosition
2025 Building Flexible Physics-Informed Neural Networks with Fast Fourier Transform Analysis
abstract
Physics-Informed Neural Networks (PINNs) allow incorporating differential equations to model a system's behavior, and are well able to fit easily differentiable solutions with low-frequency components. They, however, fall short when attempting to learn high-frequency regions or boundary layers. This paper addresses one approach to fixing this by the addition of a Fourier Layer Neural Operator (FNO) to improve accuracy by better fitting regions with high frequency oscillations. We use as an example an underdamped RLC circuit, which resembles that of a boundary layer. The PINN architecture is built to be generalized over other applications, making it a flexible design for further expansion, especially for multiple layers of GPUs.
Reem Shehayib, Jayden Parker Vap, Peter M. Kogge
HPDC2
2022 Learning Privacy-Preserving Graph Convolutional Network with Partially Observed Sensitive Attributes
abstract
Recent studies have shown Graph Neural Networks (GNNs) are extremely vulnerable to attribute inference attacks. To tackle this challenge, existing privacy-preserving GNNs research assumes that the sensitive attributes of all users are known beforehand. However, due to different privacy preferences, some users (i.e., private users) may prefer not to reveal sensitive information that others (i.e., non-private users) would not mind disclosing. For example, in social networks, male users are typically less sensitive to their age information than female users. The age disclosure of male users can lead to the age information of female users in the network exposed. This is partly because social media users are connected, the homophily property and message-passing mechanism of GNNs can exacerbate individual privacy leakage. In this work, we study a novel and practical problem of learning privacy-preserving GNNs with partially observed sensitive attributes.
Lu Cheng 0001, Jayden Parker Vap, Mike Borowczak
WWW3