Search Results for author:
Found 20 papers, 8 papers with code
A Survey on Self-Supervised Pre-Training of Graph Foundation Models: A Knowledge-Based Perspective
Graph self-supervised learning is now a go-to method for pre-training graph foundation models, including graph neural networks, graph transformers, and more recent large language model (LLM)-based graph models.
Towards Efficient Replay in Federated Incremental Learning
Then, the client trains the local model with both the cached samples and the samples from the new task.
Flatten Long-Range Loss Landscapes for Cross-Domain Few-Shot Learning
To enhance the transferability and facilitate fine-tuning, we introduce a simple yet effective approach to achieve long-range flattening of the minima in the loss landscape.
Masked Graph Autoencoder with Non-discrete Bandwidths
Inspired by these understandings, we explore non-discrete edge masks, which are sampled from a continuous and dispersive probability distribution instead of the discrete Bernoulli distribution.
Decoupling Representation and Knowledge for Few-Shot Intent Classification and Slot Filling
Therefore, current works first train a model on source domains with sufficiently labeled data, and then transfer the model to target domains where only rarely labeled data is available.
Enhancing the Rationale-Input Alignment for Self-explaining Rationalization
Rationalization empowers deep learning models with self-explaining capabilities through a cooperative game, where a generator selects a semantically consistent subset of the input as a rationale, and a subsequent predictor makes predictions based on the selected rationale.
D-Separation for Causal Self-Explanation
Instead of attempting to rectify the issues of the MMI criterion, we propose a novel criterion to uncover the causal rationale, termed the Minimum Conditional Dependence (MCD) criterion, which is grounded on our finding that the non-causal features and the target label are \emph{d-separated} by the causal rationale.
Decoupled Rationalization with Asymmetric Learning Rates: A Flexible Lipschitz Restraint
However, such a cooperative game may incur the degeneration problem where the predictor overfits to the uninformative pieces generated by a not yet well-trained generator and in turn, leads the generator to converge to a sub-optimal model that tends to select senseless pieces.
MGR: Multi-generator Based Rationalization
Rationalization is to employ a generator and a predictor to construct a self-explaining NLP model in which the generator selects a subset of human-intelligible pieces of the input text to the following predictor.
CSGCL: Community-Strength-Enhanced Graph Contrastive Learning
Graph Contrastive Learning (GCL) is an effective way to learn generalized graph representations in a self-supervised manner, and has grown rapidly in recent years.
Structure Diagram Recognition in Financial Announcements
Accurately extracting structured data from structure diagrams in financial announcements is of great practical importance for building financial knowledge graphs and further improving the efficiency of various financial applications.
DaFKD: Domain-Aware Federated Knowledge Distillation
In this paper, we propose a new perspective that treats the local data in each client as a specific domain and design a novel domain knowledge aware federated distillation method, dubbed DaFKD, that can discern the importance of each model to the distillation sample, and thus is able to optimize the ensemble of soft predictions from diverse models.
Adaptive Low-Precision Training for Embeddings in Click-Through Rate Prediction
To this end, we formulate a novel quantization training paradigm to compress the embeddings from the training stage, termed low-precision training (LPT).
Margin-Based Few-Shot Class-Incremental Learning with Class-Level Overfitting Mitigation
Few-shot class-incremental learning (FSCIL) is designed to incrementally recognize novel classes with only few training samples after the (pre-)training on base classes with sufficient samples, which focuses on both base-class performance and novel-class generalization.
FR: Folded Rationalization with a Unified Encoder
Conventional works generally employ a two-phase model in which a generator selects the most important pieces, followed by a predictor that makes predictions based on the selected pieces.
Hierarchical Local-Global Transformer for Temporal Sentence Grounding
To address this issue, in this paper, we propose a novel Hierarchical Local-Global Transformer (HLGT) to leverage this hierarchy information and model the interactions between different levels of granularity and different modalities for learning more fine-grained multi-modal representations.
SNEAK: Synonymous Sentences-Aware Adversarial Attack on Natural Language Video Localization
Natural language video localization (NLVL) is an important task in the vision-language understanding area, which calls for an in-depth understanding of not only computer vision and natural language side alone, but more importantly the interplay between both sides.
Intermittent Pulling with Local Compensation for Communication-Efficient Federated Learning
A major bottleneck on the performance of distributed Stochastic Gradient Descent (SGD) algorithm for large-scale Federated Learning is the communication overhead on pushing local gradients and pulling global model.
Gradient Scheduling with Global Momentum for Non-IID Data Distributed Asynchronous Training
Distributed asynchronous offline training has received widespread attention in recent years because of its high performance on large-scale data and complex models.
AccUDNN: A GPU Memory Efficient Accelerator for Training Ultra-deep Neural Networks
Typically, Ultra-deep neural network(UDNN) tends to yield high-quality model, but its training process is usually resource intensive and time-consuming.
