Do as I can, not as I get
- URL: http://arxiv.org/abs/2306.10345v2
- Date: Sun, 14 Jan 2024 08:01:24 GMT
- Title: Do as I can, not as I get
- Abstract summary: This paper proposes a model called TMR to mine valuable information from simulated data environments.
We intend to complete the submission of this paper.
- Score: 46.21061496634747
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This paper proposes a model called TMR to mine valuable information from
simulated data environments. We intend to complete the submission of this
paper.
Related papers
- A Comprehensive Survey of Reward Models: Taxonomy, Applications, Challenges, and Future [26.99066977066666]
Reward Model (RM) has demonstrated impressive potential for enhancing Large Language Models (LLM)<n>We provide a comprehensive overview of relevant research, exploring perspectives of preference collection, reward modeling, and usage.<n>This paper is dedicated to providing beginners with a comprehensive introduction to RMs and facilitating future studies.
arXiv Detail & Related papers (2025-04-12T16:07:36Z) - The Journey, Not the Destination: How Data Guides Diffusion Models [75.19694584942623]
Diffusion models trained on large datasets can synthesize photo-realistic images of remarkable quality and diversity.
We propose a framework that: (i) provides a formal notion of data attribution in the context of diffusion models, and (ii) allows us to counterfactually validate such attributions.
arXiv Detail & Related papers (2023-12-11T08:39:43Z) - Assessing Privacy Risks in Language Models: A Case Study on
Summarization Tasks [65.21536453075275]
We focus on the summarization task and investigate the membership inference (MI) attack.
We exploit text similarity and the model's resistance to document modifications as potential MI signals.
We discuss several safeguards for training summarization models to protect against MI attacks and discuss the inherent trade-off between privacy and utility.
arXiv Detail & Related papers (2023-10-20T05:44:39Z) - Generating Query Focused Summaries without Fine-tuning the
Transformer-based Pre-trained Models [0.6124773188525718]
Fine-tuning the Natural Language Processing (NLP) models for each new data set requires higher computational time associated with increased carbon footprint and cost.
In this paper, we try to omit the fine-tuning steps and investigate whether the Marginal Maximum Relevance (MMR)-based approach can help the pre-trained models to obtain query-focused summaries directly from a new data set that was not used to pre-train the models.
As indicated by the experimental results, our MMR-based approach successfully ranked and selected the most relevant sentences as summaries and showed better performance than the individual pre-trained models.
arXiv Detail & Related papers (2023-03-10T22:40:15Z) - How "Multi" is Multi-Document Summarization? [15.574673241564932]
It is expected that both reference summaries in MDS datasets, as well as system summaries, would indeed be based on dispersed information.
We propose an automated measure for evaluating the degree to which a summary is disperse''
Our results show that certain MDS datasets barely require combining information from multiple documents, where a single document often covers the full summary content.
arXiv Detail & Related papers (2022-10-23T10:20:09Z) - Incorporating Relevance Feedback for Information-Seeking Retrieval using
Few-Shot Document Re-Ranking [56.80065604034095]
We introduce a kNN approach that re-ranks documents based on their similarity with the query and the documents the user considers relevant.
To evaluate our different integration strategies, we transform four existing information retrieval datasets into the relevance feedback scenario.
arXiv Detail & Related papers (2022-10-19T16:19:37Z) - Multi-Document Summarization with Centroid-Based Pretraining [35.8335939654861]
In Multi-Document Summarization (MDS), the input can be modeled as a set of documents, and the output is its summary.
We introduce a novel pretraining objective, which involves selecting the ROUGE-based centroid of each document cluster as a proxy for its summary.
Our objective thus does not require human written summaries and can be utilized for pretraining on a dataset consisting solely of document sets.
arXiv Detail & Related papers (2022-08-01T17:28:02Z) - Coreference Reasoning in Machine Reading Comprehension [100.75624364257429]
We show that coreference reasoning in machine reading comprehension is a greater challenge than was earlier thought.
We propose a methodology for creating reading comprehension datasets that better reflect the challenges of coreference reasoning.
This allows us to show an improvement in the reasoning abilities of state-of-the-art models across various MRC datasets.
arXiv Detail & Related papers (2020-12-31T12:18:41Z) - Learning from missing data with the Latent Block Model [0.5735035463793007]
We propose a co-clustering model, based on the Latent Block Model, that aims to take advantage of Missing Not At Random data.
A variational expectation-maximization algorithm is derived to perform inference and a model selection criterion is presented.
arXiv Detail & Related papers (2020-10-23T08:11:43Z) - Partially Conditioned Generative Adversarial Networks [75.08725392017698]
Generative Adversarial Networks (GANs) let one synthesise artificial datasets by implicitly modelling the underlying probability distribution of a real-world training dataset.
With the introduction of Conditional GANs and their variants, these methods were extended to generating samples conditioned on ancillary information available for each sample within the dataset.
In this work, we argue that standard Conditional GANs are not suitable for such a task and propose a new Adversarial Network architecture and training strategy.
arXiv Detail & Related papers (2020-07-06T15:59:28Z) - MT-Adapted Datasheets for Datasets: Template and Repository [0.0]
We are taking the standardized model proposed by Gebru et al. for documenting the popular machine translation datasets of the EuroParl and News-Commentary.
Within this documentation process, we have adapted the original to the particular case of data consumers within the Machine Translation area.
arXiv Detail & Related papers (2020-05-27T04:56:08Z)
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.