Explore-Instruct: Enhancing Domain-Specific Instruction Coverage through Active Exploration

• URL: http://arxiv.org/abs/2310.09168v3
• Date: Tue, 24 Oct 2023 06:55:17 GMT
• Title: Explore-Instruct: Enhancing Domain-Specific Instruction Coverage through Active Exploration
• Authors: Fanqi Wan, Xinting Huang, Tao Yang, Xiaojun Quan, Wei Bi, Shuming Shi
• Abstract summary: Explore-Instruct is a novel approach to enhance the data coverage to be used in domain-specific instruction-tuning. Our data-centric analysis validates the effectiveness of this proposed approach in improving domain-specific instruction coverage. Our findings offer a promising opportunity to improve instruction coverage, especially in domain-specific contexts.
• Score: 64.58185031596169
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Instruction-tuning can be substantially optimized through enhanced diversity, resulting in models capable of handling a broader spectrum of tasks. However, existing data employed for such tuning often exhibit an inadequate coverage of individual domains, limiting the scope for nuanced comprehension and interactions within these areas. To address this deficiency, we propose Explore-Instruct, a novel approach to enhance the data coverage to be used in domain-specific instruction-tuning through active exploration via Large Language Models (LLMs). Built upon representative domain use cases, Explore-Instruct explores a multitude of variations or possibilities by implementing a search algorithm to obtain diversified and domain-focused instruction-tuning data. Our data-centric analysis validates the effectiveness of this proposed approach in improving domain-specific instruction coverage. Moreover, our model's performance demonstrates considerable advancements over multiple baselines, including those utilizing domain-specific data enhancement. Our findings offer a promising opportunity to improve instruction coverage, especially in domain-specific contexts, thereby advancing the development of adaptable language models. Our code, model weights, and data are public at \url{https://github.com/fanqiwan/Explore-Instruct}.

Related papers

• Empowering Domain-Specific Language Models with Graph-Oriented Databases: A Paradigm Shift in Performance and Model Maintenance [0.0]
  Our work is driven by the need to manage and process large volumes of short text documents inherent in specific application domains. By leveraging domain-specific knowledge and expertise, our approach aims to shape factual data within these domains. Our work underscores the transformative potential of the partnership of domain-specific language models and graph-oriented databases.
  arXiv  Detail & Related papers  (2024-10-04T19:02:09Z)
• Learning to Generalize Unseen Domains via Multi-Source Meta Learning for Text Classification [71.08024880298613]
  We study the multi-source Domain Generalization of text classification. We propose a framework to use multiple seen domains to train a model that can achieve high accuracy in an unseen domain.
  arXiv  Detail & Related papers  (2024-09-20T07:46:21Z)
• Enhancing Domain Adaptation through Prompt Gradient Alignment [16.618313165111793]
  We develop a line of works based on prompt learning to learn both domain-invariant and specific features. We cast UDA as a multiple-objective optimization problem in which each objective is represented by a domain loss. Our method consistently surpasses other prompt-based baselines by a large margin on different UDA benchmarks.
  arXiv  Detail & Related papers  (2024-06-13T17:40:15Z)
• DIGIC: Domain Generalizable Imitation Learning by Causal Discovery [69.13526582209165]
  Causality has been combined with machine learning to produce robust representations for domain generalization. We make a different attempt by leveraging the demonstration data distribution to discover causal features for a domain generalizable policy. We design a novel framework, called DIGIC, to identify the causal features by finding the direct cause of the expert action from the demonstration data distribution.
  arXiv  Detail & Related papers  (2024-02-29T07:09:01Z)
• Unsupervised Domain Adaptation Using Compact Internal Representations [23.871860648919593]
  A technique for tackling unsupervised domain adaptation involves mapping data points from both the source and target domains into a shared embedding space. We develop an additional technique which makes the internal distribution of the source domain more compact. We demonstrate that by increasing the margins between data representations for different classes in the embedding space, we can improve the model performance for UDA.
  arXiv  Detail & Related papers  (2024-01-14T05:53:33Z)
• DPOD: Domain-Specific Prompt Tuning for Multimodal Fake News Detection [15.599951180606947]
  Fake news using out-of-context images has become widespread and is a relevant problem in this era of information overload. We explore whether out-of-domain data can help to improve out-of-context misinformation detection of a desired domain. We propose a novel framework termed DPOD (Domain-specific Prompt-tuning using Out-of-Domain data)
  arXiv  Detail & Related papers  (2023-11-27T08:49:26Z)
• NormAUG: Normalization-guided Augmentation for Domain Generalization [60.159546669021346]
  We propose a simple yet effective method called NormAUG (Normalization-guided Augmentation) for deep learning. Our method introduces diverse information at the feature level and improves the generalization of the main path. In the test stage, we leverage an ensemble strategy to combine the predictions from the auxiliary path of our model, further boosting performance.
  arXiv  Detail & Related papers  (2023-07-25T13:35:45Z)
• Multi-scale Feature Alignment for Continual Learning of Unlabeled Domains [3.9498537297431167]
  generative feature-driven image replay in conjunction with a dual-purpose discriminator enables the generation of images with realistic features for replay. We present detailed ablation experiments studying our proposed method components and demonstrate a possible use-case of our continual UDA method for an unsupervised patch-based segmentation task.
  arXiv  Detail & Related papers  (2023-02-02T18:19:01Z)
• Learning to Combine: Knowledge Aggregation for Multi-Source Domain Adaptation [56.694330303488435]
  We propose a Learning to Combine for Multi-Source Domain Adaptation (LtC-MSDA) framework. In the nutshell, a knowledge graph is constructed on the prototypes of various domains to realize the information propagation among semantically adjacent representations. Our approach outperforms existing methods with a remarkable margin.
  arXiv  Detail & Related papers  (2020-07-17T07:52:44Z)
• Domain Adaptation for Semantic Parsing [68.81787666086554]
  We propose a novel semantic for domain adaptation, where we have much fewer annotated data in the target domain compared to the source domain. Our semantic benefits from a two-stage coarse-to-fine framework, thus can provide different and accurate treatments for the two stages. Experiments on a benchmark dataset show that our method consistently outperforms several popular domain adaptation strategies.
  arXiv  Detail & Related papers  (2020-06-23T14:47:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.