Search Results for author:
Found 19 papers, 6 papers with code
Local Causal Discovery with Linear non-Gaussian Cyclic Models
Local causal discovery is of great practical significance, as there are often situations where the discovery of the global causal structure is unnecessary, and the interest lies solely on a single target variable.
Causal Representation Learning from Multiple Distributions: A General Setting
We show that under the sparsity constraint on the recovered graph over the latent variables and suitable sufficient change conditions on the causal influences, interestingly, one can recover the moralized graph of the underlying directed acyclic graph, and the recovered latent variables and their relations are related to the underlying causal model in a specific, nontrivial way.
A Versatile Causal Discovery Framework to Allow Causally-Related Hidden Variables
Most existing causal discovery methods rely on the assumption of no latent confounders, limiting their applicability in solving real-life problems.
A Comparative Study of AI-Generated (GPT-4) and Human-crafted MCQs in Programming Education
While there is a growing body of research in computing education on utilizing large language models (LLMs) in generation and engagement with coding exercises, the use of LLMs for generating programming MCQs has not been extensively explored.
Causal-learn: Causal Discovery in Python
Causal discovery aims at revealing causal relations from observational data, which is a fundamental task in science and engineering.
Partial Identifiability for Domain Adaptation
In general, without further assumptions, the joint distribution of the features and the label is not identifiable in the target domain.
Understanding Breast Cancer Survival: Using Causality and Language Models on Multi-omics Data
The need for more usable and explainable machine learning models in healthcare increases the importance of developing and utilizing causal discovery algorithms, which aim to discover causal relations by analyzing observational data.
Generalized Precision Matrix for Scalable Estimation of Nonparametric Markov Networks
A Markov network characterizes the conditional independence structure, or Markov property, among a set of random variables.
Learning Task-Aware Effective Brain Connectivity for fMRI Analysis with Graph Neural Networks
To better adapt GNNs for fMRI analysis, we propose TBDS, an end-to-end framework based on \underline{T}ask-aware \underline{B}rain connectivity \underline{D}AG (short for Directed Acyclic Graph) \underline{S}tructure generation for fMRI analysis.
Whole Page Unbiased Learning to Rank
To address the above challenges, we propose a Bias Agnostic whole-page unbiased Learning to rank algorithm, named BAL, to automatically find the user behavior model with causal discovery and mitigate the biases induced by multiple SERP features with no specific design.
On the Identifiability of Nonlinear ICA: Sparsity and Beyond
We show that under specific instantiations of such constraints, the independent latent sources can be identified from their nonlinear mixtures up to a permutation and a component-wise transformation, thus achieving nontrivial identifiability of nonlinear ICA without auxiliary variables.
Reliable Causal Discovery with Improved Exact Search and Weaker Assumptions
Many of the causal discovery methods rely on the faithfulness assumption to guarantee asymptotic correctness.
Source Free Unsupervised Graph Domain Adaptation
To address the non-trivial adaptation challenges in this practical scenario, we propose a model-agnostic algorithm called SOGA for domain adaptation to fully exploit the discriminative ability of the source model while preserving the consistency of structural proximity on the target graph.
Learning Elastic Embeddings for Customizing On-Device Recommenders
The core idea is to compose elastic embeddings for each item, where an elastic embedding is the concatenation of a set of embedding blocks that are carefully chosen by an automated search function.
Cold-start Sequential Recommendation via Meta Learner
As there is generally no side information in the setting of sequential recommendation task, previous cold-start methods could not be applied when only user-item interactions are available.
Heterogeneous Graph Collaborative Filtering
In this work, we propose to model user-item interactions as a heterogeneous graph which consists of not only user-item edges indicating their interaction but also user-user edges indicating their similarity.
DGTN: Dual-channel Graph Transition Network for Session-based Recommendation
These item transitions include potential collaborative information and reflect similar behavior patterns, which we assume may help with the recommendation for the target session.
Ranked #6 on
Session-Based Recommendations
on Diginetica
Long-tail Session-based Recommendation
Session-based recommendation focuses on the prediction of user actions based on anonymous sessions and is a necessary method in the lack of user historical data.
Balancing Multi-level Interactions for Session-based Recommendation
For mining the new data without breaking the equilibrium of the model between different interactions, we construct an intra-session graph and an inter-session graph for the current session.
