Search Results for author:
Found 34 papers, 24 papers with code
Interpretable deep learning illuminates multiple structures fluorescence imaging: a path toward trustworthy artificial intelligence in microscopy
Live-cell imaging of multiple subcellular structures is essential for understanding subcellular dynamics.
Deblur4DGS: 4D Gaussian Splatting from Blurry Monocular Video
Recent 4D reconstruction methods have yielded impressive results but rely on sharp videos as supervision.
UniHR: Hierarchical Representation Learning for Unified Knowledge Graph Link Prediction
Experimental results across 7 datasets from 3 types of KGs demonstrate that our UniHR outperforms baselines designed for one specific kind of KG, indicating strong generalization capability of HiDR form and the effectiveness of HiSL module.
DisenGCD: A Meta Multigraph-assisted Disentangled Graph Learning Framework for Cognitive Diagnosis
To tackle the issues, this paper suggests a meta multigraph-assisted disentangled graph learning framework for CD (DisenGCD), which learns three types of representations on three disentangled graphs: student-exercise-concept interaction, exercise-concept relation, and concept dependency graphs, respectively.
Baichuan Alignment Technical Report
Baichuan-Instruct is an internal model, while Qwen2-Nova-72B and Llama3-PBM-Nova-70B are instruct versions of the Qwen2-72B and Llama-3-70B base models, optimized through Baichuan Alignment.
Facilitating Multi-turn Function Calling for LLMs via Compositional Instruction Tuning
While current research on function calling by LLMs primarily focuses on single-turn interactions, this paper addresses the overlooked necessity for LLMs to engage in multi-turn function calling--critical for handling compositional, real-world queries that require planning with functions but not only use functions.
Croppable Knowledge Graph Embedding
Knowledge Graph Embedding (KGE) is a common method for Knowledge Graphs (KGs) to serve various artificial intelligence tasks.
SF-GNN: Self Filter for Message Lossless Propagation in Deep Graph Neural Network
In SF-GNN, we define two representations for each node, one is the node representation that represents the feature of the node itself, and the other is the message representation specifically for propagating messages to neighbor nodes.
Learning to Plan for Retrieval-Augmented Large Language Models from Knowledge Graphs
LLMs fine-tuned with this data have improved planning capabilities, better equipping them to handle complex QA tasks that involve retrieval.
Dataset Distillation via Adversarial Prediction Matching
This ensures the memory efficiency of our method and provides a flexible tradeoff between time and memory budgets, allowing us to distil ImageNet-1K using a minimum of only 6. 5GB of GPU memory.
Negative Sampling with Adaptive Denoising Mixup for Knowledge Graph Embedding
Most existing negative sampling methods assume that non-existent triples with high scores are high-quality negative triples.
A Comprehensive Study on Knowledge Graph Embedding over Relational Patterns Based on Rule Learning
Though KGE models' capabilities are analyzed over different relational patterns in theory and a rough connection between better relational patterns modeling and better performance of KGC has been built, a comprehensive quantitative analysis on KGE models over relational patterns remains absent so it is uncertain how the theoretical support of KGE to a relational pattern contributes to the performance of triples associated to such a relational pattern.
Lion: Adversarial Distillation of Proprietary Large Language Models
The practice of transferring knowledge from a sophisticated, proprietary large language model (LLM) to a compact, open-source LLM has garnered considerable attention.
NeuralKG-ind: A Python Library for Inductive Knowledge Graph Representation Learning
Since the dynamic characteristics of knowledge graphs, many inductive knowledge graph representation learning (KGRL) works have been proposed in recent years, focusing on enabling prediction over new entities.
Modality-Aware Negative Sampling for Multi-modal Knowledge Graph Embedding
Negative sampling (NS) is widely used in knowledge graph embedding (KGE), which aims to generate negative triples to make a positive-negative contrast during training.
Structure Pretraining and Prompt Tuning for Knowledge Graph Transfer
Through experiments, we justify that the pretrained KGTransformer could be used off the shelf as a general and effective KRF module across KG-related tasks.
Generalizing to Unseen Elements: A Survey on Knowledge Extrapolation for Knowledge Graphs
In this paper, we use a set of general terminologies to unify these methods and refer to them collectively as Knowledge Extrapolation.
Entity-Agnostic Representation Learning for Parameter-Efficient Knowledge Graph Embedding
In our proposed model, Entity-Agnostic Representation Learning (EARL), we only learn the embeddings for a small set of entities and refer to them as reserved entities.
Analogical Inference Enhanced Knowledge Graph Embedding
And in AnKGE, we train an analogy function for each level of analogical inference with the original element embedding from a well-trained KGE model as input, which outputs the analogical object embedding.
Boosting Accuracy and Robustness of Student Models via Adaptive Adversarial Distillation
Thus, recent studies concern about adversarial distillation (AD) that aims to inherit not only prediction accuracy but also adversarial robustness of a robust teacher model under the paradigm of robust optimization.
Tele-Knowledge Pre-training for Fault Analysis
In this work, we share our experience on tele-knowledge pre-training for fault analysis, a crucial task in telecommunication applications that requires a wide range of knowledge normally found in both machine log data and product documents.
Relational Message Passing for Fully Inductive Knowledge Graph Completion
Subgraph reasoning with message passing is a promising and popular solution.
Meta-Learning Based Knowledge Extrapolation for Knowledge Graphs in the Federated Setting
We study the knowledge extrapolation problem to embed new components (i. e., entities and relations) that come with emerging knowledge graphs (KGs) in the federated setting.
NeuralKG: An Open Source Library for Diverse Representation Learning of Knowledge Graphs
NeuralKG is an open-source Python-based library for diverse representation learning of knowledge graphs.
Knowledge Graph Embedding in E-commerce Applications: Attentive Reasoning, Explanations, and Transferable Rules
We first identity three important desiderata for e-commerce KG systems: 1) attentive reasoning, reasoning over a few target relations of more concerns instead of all; 2) explanation, providing explanations for a prediction to help both users and business operators understand why the prediction is made; 3) transferable rules, generating reusable rules to accelerate the deployment of a KG to new systems.
Meta-Knowledge Transfer for Inductive Knowledge Graph Embedding
In this paper, to achieve inductive knowledge graph embedding, we propose a model MorsE, which does not learn embeddings for entities but learns transferable meta-knowledge that can be used to produce entity embeddings.
Principled Representation Learning for Entity Alignment
Embedding-based entity alignment (EEA) has recently received great attention.
Explaining Knowledge Graph Embedding via Latent Rule Learning
KGExplainer is a multi-hop reasoner learning latent rules for link prediction and is encouraged to behave similarly to KGEs during prediction through knowledge distillation.
Towards Principled Representation Learning for Entity Alignment
In this paper, we define a typical paradigm abstracted from the existing methods, and analyze how the representation discrepancy between two potentially-aligned entities is implicitly bounded by a predefined margin in the scoring function for embedding learning.
FedE: Embedding Knowledge Graphs in Federated Setting
Knowledge graphs (KGs) consisting of triples are always incomplete, so it's important to do Knowledge Graph Completion (KGC) by predicting missing triples.
DualDE: Dually Distilling Knowledge Graph Embedding for Faster and Cheaper Reasoning
In DualDE, we propose a soft label evaluation mechanism to adaptively assign different soft label and hard label weights to different triples, and a two-stage distillation approach to improve the student's acceptance of the teacher.
PaStaNet: Toward Human Activity Knowledge Engine
In light of this, we propose a new path: infer human part states first and then reason out the activities based on part-level semantics.
Ranked #3 on
Human-Object Interaction Detection
on HICO
Meta Relational Learning for Few-Shot Link Prediction in Knowledge Graphs
Link prediction is an important way to complete knowledge graphs (KGs), while embedding-based methods, effective for link prediction in KGs, perform poorly on relations that only have a few associative triples.
HAKE: Human Activity Knowledge Engine
To address these and promote the activity understanding, we build a large-scale Human Activity Knowledge Engine (HAKE) based on the human body part states.
Ranked #2 on
Human-Object Interaction Detection
on HICO
(using extra training data)
