Search Results for author:
Found 13 papers, 2 papers with code
MLDGG: Meta-Learning for Domain Generalization on Graphs
Subsequently, a representation learner is designed to disentangle domain-invariant semantic and domain-specific variation information in node embedding by leveraging causal reasoning for semantic identification, further enhancing generalization.
GDDA: Semantic OOD Detection on Graphs under Covariate Shift via Score-Based Diffusion Models
In this work, we address both types of shifts simultaneously and introduce a novel challenge for OOD detection on graphs: graph-level semantic OOD detection under covariate shift.
Learning Fair Invariant Representations under Covariate and Correlation Shifts Simultaneously
Achieving the generalization of an invariant classifier from training domains to shifted test domains while simultaneously considering model fairness is a substantial and complex challenge in machine learning.
Review-LLM: Harnessing Large Language Models for Personalized Review Generation
Finally, we feed the prompt text into LLMs, and use Supervised Fine-Tuning (SFT) to make the model generate personalized reviews for the given user and target item.
FADE: Towards Fairness-aware Augmentation for Domain Generalization via Classifier-Guided Score-based Diffusion Models
Traditional methods for addressing fairness have failed in domain generalization due to their lack of consideration for distribution shifts.
Graphs Generalization under Distribution Shifts
Traditional machine learning methods heavily rely on the independent and identically distribution assumption, which imposes limitations when the test distribution deviates from the training distribution.
Graph Bayesian Optimization for Multiplex Influence Maximization
In this problem, the seed set is a combination of influential users and information.
Supervised Algorithmic Fairness in Distribution Shifts: A Survey
Supervised fairness-aware machine learning under distribution shifts is an emerging field that addresses the challenge of maintaining equitable and unbiased predictions when faced with changes in data distributions from source to target domains.
Adaptive End-to-End Metric Learning for Zero-Shot Cross-Domain Slot Filling
In practice, these dominant pipeline models may be limited in computational efficiency and generalization capacity because of non-parallel inference and context-free discrete label embeddings.
Towards Counterfactual Fairness-aware Domain Generalization in Changing Environments
This approach effectively separates environmental information and sensitive attributes from the embedded representation of classification features.
Adaptation Speed Analysis for Fairness-aware Causal Models
In aligning p with p*, several factors can affect the adaptation rate, including the causal dependencies between variables in p. In real-life scenarios, however, we have to consider the fairness of the training process, and it is particularly crucial to involve a sensitive variable (bias) present between a cause and an effect variable.
Contrastive Representation Learning Based on Multiple Node-centered Subgraphs
As the basic element of graph-structured data, node has been recognized as the main object of study in graph representation learning.
Stacked Kernel Network
Similar to DNNs, a SKN is composed of multiple layers of hidden units, but each parameterized by a RKHS function rather than a finite-dimensional vector.
