Search Results for author:
Found 21 papers, 12 papers with code
LLM Maybe LongLM: Self-Extend LLM Context Window Without Tuning
To achieve this goal, we propose SelfExtend to extend the context window of LLMs by constructing bi-level attention information: the grouped attention and the neighbor attention.
Towards Mitigating Dimensional Collapse of Representations in Collaborative Filtering
Here we propose a non-contrastive learning objective, named nCL, which explicitly mitigates dimensional collapse of representations in collaborative filtering.
Chasing Fairness in Graphs: A GNN Architecture Perspective
To this end, we aim to achieve fairness via a new GNN architecture.
CODA: Temporal Domain Generalization via Concept Drift Simulator
In real-world applications, machine learning models often become obsolete due to shifts in the joint distribution arising from underlying temporal trends, a phenomenon known as the "concept drift".
GrowLength: Accelerating LLMs Pretraining by Progressively Growing Training Length
Our method progressively increases the training length throughout the pretraining phase, thereby mitigating computational costs and enhancing efficiency.
Graph Mixup with Soft Alignments
We conduct systematic experiments to show that S-Mixup can improve the performance and generalization of graph neural networks (GNNs) on various graph classification tasks.
Winner-Take-All Column Row Sampling for Memory Efficient Adaptation of Language Model
While the model parameters do contribute to memory usage, the primary memory bottleneck during training arises from storing feature maps, also known as activations, as they are crucial for gradient calculation.
Editable Graph Neural Network for Node Classifications
However, model editing for graph neural networks (GNNs) is rarely explored, despite GNNs' widespread applicability.
Data-centric Artificial Intelligence: A Survey
Artificial Intelligence (AI) is making a profound impact in almost every domain.
Chasing Fairness Under Distribution Shift: A Model Weight Perturbation Approach
Motivated by these sufficient conditions, we propose robust fairness regularization (RFR) by considering the worst case within the model weight perturbation ball for each sensitive attribute group.
Retiring $Δ$DP: New Distribution-Level Metrics for Demographic Parity
Unfortunately, in this paper, we reveal that the fairness metric $\Delta DP$ can not precisely measure the violation of demographic parity, because it inherently has the following drawbacks: i) zero-value $\Delta DP$ does not guarantee zero violation of demographic parity, ii) $\Delta DP$ values can vary with different classification thresholds.
Adaptive Risk-Aware Bidding with Budget Constraint in Display Advertising
In this work, we explicitly factor in the uncertainty of estimated ad impression values and model the risk preference of a DSP under a specific state and market environment via a sequential decision process.
Towards Generating Adversarial Examples on Mixed-type Data
The existence of adversarial attacks (or adversarial examples) brings huge concern about the machine learning (ML) model's safety issues.
DIVISION: Memory Efficient Training via Dual Activation Precision
Activation compressed training provides a solution towards reducing the memory cost of training deep neural networks~(DNNs).
G-Mixup: Graph Data Augmentation for Graph Classification
To this end, we propose $\mathcal{G}$-Mixup to augment graphs for graph classification by interpolating the generator (i. e., graphon) of different classes of graphs.
BED: A Real-Time Object Detection System for Edge Devices
DNNs have been an effective tool for data processing and analysis.
Geometric Graph Representation Learning via Maximizing Rate Reduction
Learning discriminative node representations benefits various downstream tasks in graph analysis such as community detection and node classification.
FMP: Toward Fair Graph Message Passing against Topology Bias
Despite recent advances in achieving fair representations and predictions through regularization, adversarial debiasing, and contrastive learning in graph neural networks (GNNs), the working mechanism (i. e., message passing) behind GNNs inducing unfairness issue remains unknown.
G-Mixup: Graph Augmentation for Graph Classification
To this end, we propose $\mathcal{G}$-Mixup to augment graphs for graph classification by interpolating the generator (i. e., graphon) of different classes of graphs.
An Information Fusion Approach to Learning with Instance-Dependent Label Noise
Instance-dependent label noise (IDN) widely exists in real-world datasets and usually misleads the training of deep neural networks.
Generalized Demographic Parity for Group Fairness
We show the understanding of GDP from the probability perspective and theoretically reveal the connection between GDP regularizer and adversarial debiasing.
