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

Jie Cai 0002

dblp:95/3916-2 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
0009-0008-4107-5136ORCID · conflict

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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
2 papers
Graph learning · 48% Trustworthy machine learning · 38% Efficient and distributed learning · 14%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
distribution shift
0.812024
Multimodal Graph Neural Architecture Search under Distribution Shifts · AAAI 2024
Machine learning › Graph learning › graph neural network
graph neural architecture search
0.812024
Multimodal Graph Neural Architecture Search under Distribution Shifts · AAAI 2024
Machine learning › Trustworthy machine learning
out-of-distribution generalization
0.812024
Multimodal Graph Neural Architecture Search under Distribution Shifts · AAAI 2024
Machine learning › Graph learning › graph neural network training
continual graph learning
0.612022
Multimodal Continual Graph Learning with Neural Architecture Search · WWW 2022
Machine learning › Graph learning › graph neural network › graph neural network architecture
multimodal graph neural network
0.612022
Multimodal Continual Graph Learning with Neural Architecture Search · WWW 2022
Machine learning › Efficient and distributed learning › automated machine learning
neural architecture search
0.612022
Multimodal Continual Graph Learning with Neural Architecture Search · WWW 2022

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

sample weight estimation · 0.8multimodal graph representation decorrelation · 0.8neural architecture search · 0.6multimodal learning · 0.6group sparse regularization · 0.6
YearPublicationVenuePosition
2024 Multimodal Graph Neural Architecture Search under Distribution Shifts
abstract
Multimodal graph neural architecture search (MGNAS) has shown great success for automatically designing the optimal multimodal graph neural network (MGNN) architecture by leveraging multimodal representation, crossmodal information and graph structure in one unified framework. However, existing MGNAS fails to handle distribution shifts that naturally exist in multimodal graph data, since the searched architectures inevitably capture spurious statistical correlations under distribution shifts. To solve this problem, we propose a novel Out-of-distribution Generalized Multimodal Graph Neural Architecture Search (OMG-NAS) method which optimizes the MGNN architecture with respect to its performance on decorrelated OOD data. Specifically, we propose a multimodal graph representation decorrelation strategy, which encourages the searched MGNN model to output representations that eliminate spurious correlations through iteratively optimizing the feature weights and controller. In addition, we propose a global sample weight estimator that facilitates the sharing of optimal sample weights learned from existing architectures. This design promotes the effective estimation of the sample weights for candidate MGNN architectures to generate decorrelated multimodal graph representations, concentrating more on the truly predictive relations between invariant features and ground-truth labels. Extensive experiments on real-world multimodal graph datasets demonstrate the superiority of our proposed method over SOTA baselines.
Jie Cai 0002, Xin Wang 0019, Haoyang Li 0001, Ziwei Zhang 0001, Wenwu Zhu 0001
AAAI1
2022 Multimodal Continual Graph Learning with Neural Architecture Search
abstract
Continual graph learning is rapidly emerging as an important role in a variety of real-world applications such as online product recommendation systems and social media. While achieving great success, existing works on continual graph learning ignore the information from multiple modalities (e.g., visual and textual features) as well as the rich dynamic structural information hidden in the ever-changing graph data and evolving tasks. However, considering multimodal continual graph learning with evolving topological structures poses great challenges: i) it is unclear how to incorporate the multimodal information into continual graph learning and ii) it is nontrivial to design models that can capture the structure-evolving dynamics in continual graph learning. To tackle these challenges, in this paper we propose a novel Multimodal Structure-evolving Continual Graph Learning (MSCGL) model, which continually learns both the model architecture and the corresponding parameters for Adaptive Multimodal Graph Neural Network (AdaMGNN). To be concrete, our proposed MSCGL model simultaneously takes social information and multimodal information into account to build the multimodal graphs. In order for continually adapting to new tasks without forgetting the old ones, our MSCGL model explores a new strategy with joint optimization of Neural Architecture Search (NAS) and Group Sparse Regularization (GSR) across different tasks. These two parts interact with each other reciprocally, where NAS is expected to explore more promising architectures and GSR is in charge of preserving important information from the previous tasks. We conduct extensive experiments over two real-world multimodal continual graph scenarios to demonstrate the superiority of the proposed MSCGL model. Empirical experiments indicate that both the architectures and weight sharing across different tasks play important roles in affecting the model performances.
Jie Cai 0002, Xin Wang 0019, Chaoyu Guan, Yateng Tang, Bin Zhong, Wenwu Zhu 0001
WWW1