Papers with FLAN
Beyond Scaling: Predicting Patent Approval with Domain-specific Fine-grained Claim Dependency Graph (2024.acl-long)
Copied to clipboard
| Challenge: | Scaling up language models has demonstrated predictable improvement and unprecedented abilities in many language tasks. |
| Approach: | They propose a fine-grained cLAim depeNdency graph that captures the dependencies within the patent data and extends the embedding-based state-of-the-art (SOTA) they then explore prompt-based methods to harness proprietary LLMs' potential, but find the best results close to random guessing, underlining the ineffectiveness of model scaling-up. |
| Outcome: | The proposed graph methods outperform the standard model scaling methods in the patent approval prediction task and show that they are cost-effective. |
Zero-Shot Learners for Natural Language Understanding via a Unified Multiple Choice Perspective (2022.emnlp-main)
Copied to clipboard
Ping Yang, Junjie Wang, Ruyi Gan, Xinyu Zhu, Lin Zhang, Ziwei Wu, Xinyu Gao, Jiaxing Zhang, Tetsuya Sakai
| Challenge: | Existing approaches to zero-shot learning are format-agnostic and can address new learning tasks without additional training. |
| Approach: | They propose a new paradigm for zero-shot learning that is format agnostic and compatible with any format and applicable to a list of language tasks. |
| Outcome: | The proposed model shows state-of-the-art performance on several benchmarks and produces satisfactory results on tasks such as text classification and commonsense reasoning. |
CommonIT: Commonality-Aware Instruction Tuning for Large Language Models via Data Partitions (2024.emnlp-main)
Copied to clipboard
| Challenge: | Current studies have focused on fine-tuning, but the use of instruction tuning is not as effective as fine-cuning. |
| Approach: | They propose a commonality-aware instruction tuning strategy to cluster instruction datasets into distinct groups with three proposed metrics Task, Embedding and Length. |
| Outcome: | The proposed strategy boosts an average improvement of 2.1% on the general domain and 5.2% on the special domain. |
Data-Efficient Finetuning Using Cross-Task Nearest Neighbors (2023.findings-acl)
Copied to clipboard
| Challenge: | Prior work shows training models on multitask data augmented with task descriptions transfers knowledge to new tasks. |
| Approach: | They propose to use unlabeled target-task data to train models on task descriptions . they use only 2% of the data from the P3 pool without labeled target task data . |
| Outcome: | The proposed model outperforms baseline models on 12 out of 14 datasets . it also provides better initialization than single model on target-task data . |
Contrastive Instruction Tuning (2024.findings-acl)
Copied to clipboard
| Challenge: | Current LLMs exhibit limited robustness to unseen instructions, generating inconsistent outputs when the same instruction is phrased with slightly varied forms or language styles. |
| Approach: | They propose a method which maximizes the similarity between the hidden representations of semantically equivalent instruction-instance pairs while minimizing the similarities between semantically different ones. |
| Outcome: | Experiments on the PromptBench benchmark show that Contrastive Instruction Tuning improves LLMs’ robustness to unseen instructions with variations across character, word, sentence, and semantic levels by +2.5% in accuracy. |
LogicAttack: Adversarial Attacks for Evaluating Logical Consistency of Natural Language Inference (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Recent advances in Large Language Models (LLMs) have demonstrated impressive performance on Natural Language Inference (NLI) tasks. |
| Approach: | They propose a method to attack NLI models using diverse logical forms of premise and hypothesis using propositional logic to generate effective adversarial attacks. |
| Outcome: | The proposed method achieves an average 53% Attack Success Rate (ASR) across multiple logic-based attacks. |