Search Results for author:
Found 9 papers, 6 papers with code
Harnessing the Power of LLMs in Practice: A Survey on ChatGPT and Beyond
This paper presents a comprehensive and practical guide for practitioners and end-users working with Large Language Models (LLMs) in their downstream natural language processing (NLP) tasks.
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.
Disentangled Graph Collaborative Filtering
Such uniform approach to model user interests easily results in suboptimal representations, failing to model diverse relationships and disentangle user intents in representations.
KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cache
This memory demand increases with larger batch sizes and longer context lengths.
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.
Was my Model Stolen? Feature Sharing for Robust and Transferable Watermarks
The main idea is to insert a watermark which is only known to defender into the protected model and the watermark will then be transferred into all stolen models.
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.
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.
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.
