ibm / re2g-ctx-encoder-nq

huggingface.co
Total runs: 32
24-hour runs: 0
7-day runs: 0
30-day runs: 0
Model's Last Updated: May 16 2023

Introduction of re2g-ctx-encoder-nq

Model Details of re2g-ctx-encoder-nq

Model Card for NQ Context Encoder in Re2G

Model Details

The approach of RAG, Multi-DPR, and KGI is to train a neural IR (Information Retrieval) component and further train it end-to-end through its impact in generating the correct output.

Training, Evaluation and Inference

The code for training, evaluation and inference is in our github in the re2g branch .

Usage

The best way to use the model is by adapting the dpr_apply.py

Citation
@inproceedings{glass-etal-2022-re2g,
    title = "{R}e2{G}: Retrieve, Rerank, Generate",
    author = "Glass, Michael  and
      Rossiello, Gaetano  and
      Chowdhury, Md Faisal Mahbub  and
      Naik, Ankita  and
      Cai, Pengshan  and
      Gliozzo, Alfio",
    booktitle = "Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
    month = jul,
    year = "2022",
    address = "Seattle, United States",
    publisher = "Association for Computational Linguistics",
    url = "https://aclanthology.org/2022.naacl-main.194",
    doi = "10.18653/v1/2022.naacl-main.194",
    pages = "2701--2715",
    abstract = "As demonstrated by GPT-3 and T5, transformers grow in capability as parameter spaces become larger and larger. However, for tasks that require a large amount of knowledge, non-parametric memory allows models to grow dramatically with a sub-linear increase in computational cost and GPU memory requirements. Recent models such as RAG and REALM have introduced retrieval into conditional generation. These models incorporate neural initial retrieval from a corpus of passages. We build on this line of research, proposing Re2G, which combines both neural initial retrieval and reranking into a BART-based sequence-to-sequence generation. Our reranking approach also permits merging retrieval results from sources with incomparable scores, enabling an ensemble of BM25 and neural initial retrieval. To train our system end-to-end, we introduce a novel variation of knowledge distillation to train the initial retrieval, reranker and generation using only ground truth on the target sequence output. We find large gains in four diverse tasks: zero-shot slot filling, question answering, fact checking and dialog, with relative gains of 9{\%} to 34{\%} over the previous state-of-the-art on the KILT leaderboard. We make our code available as open source.",
}
Model Description

The model creators note in the associated paper :

As demonstrated by GPT-3 and T5, transformers grow in capability as parameter spaces become larger and larger. However, for tasks that require a large amount of knowledge, non-parametric memory allows models to grow dramatically with a sub-linear increase in computational cost and GPU memory requirements. Recent models such as RAG and REALM have introduced retrieval into conditional generation. These models incorporate neural initial retrieval from a corpus of passages. We build on this line of research, proposing Re2G, which combines both neural initial retrieval and reranking into a BART-based sequence-to-sequence generation. Our reranking approach also permits merging retrieval results from sources with incomparable scores, enabling an ensemble of BM25 and neural initial retrieval. To train our system end-to-end, we introduce a novel variation of knowledge distillation to train the initial retrieval, reranker and generation using only ground truth on the target sequence output. We find large gains in four diverse tasks: zero-shot slot filling, question answering, fact checking and dialog, with relative gains of 9% to 34% over the previous state-of-the-art on the KILT leaderboard. We make our code available as open source.

Uses

Direct Use

This model can be used for the task of encoding a passage to a vector, this passage or context vector should then be indexed into an Approximate Nearest Neighbors index. It must be used in combination with a query or question encoder that encodes a question to a query vector to search the index.

Citation

BibTeX:

@inproceedings{glass-etal-2022-re2g,
    title = "{R}e2{G}: Retrieve, Rerank, Generate",
    author = "Glass, Michael  and
      Rossiello, Gaetano  and
      Chowdhury, Md Faisal Mahbub  and
      Naik, Ankita  and
      Cai, Pengshan  and
      Gliozzo, Alfio",
    booktitle = "Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
    month = jul,
    year = "2022",
    address = "Seattle, United States",
    publisher = "Association for Computational Linguistics",
    url = "https://aclanthology.org/2022.naacl-main.194",
    doi = "10.18653/v1/2022.naacl-main.194",
    pages = "2701--2715",
    abstract = "As demonstrated by GPT-3 and T5, transformers grow in capability as parameter spaces become larger and larger. However, for tasks that require a large amount of knowledge, non-parametric memory allows models to grow dramatically with a sub-linear increase in computational cost and GPU memory requirements. Recent models such as RAG and REALM have introduced retrieval into conditional generation. These models incorporate neural initial retrieval from a corpus of passages. We build on this line of research, proposing Re2G, which combines both neural initial retrieval and reranking into a BART-based sequence-to-sequence generation. Our reranking approach also permits merging retrieval results from sources with incomparable scores, enabling an ensemble of BM25 and neural initial retrieval. To train our system end-to-end, we introduce a novel variation of knowledge distillation to train the initial retrieval, reranker and generation using only ground truth on the target sequence output. We find large gains in four diverse tasks: zero-shot slot filling, question answering, fact checking and dialog, with relative gains of 9{\%} to 34{\%} over the previous state-of-the-art on the KILT leaderboard. We make our code available as open source.",
}
 

Runs of ibm re2g-ctx-encoder-nq on huggingface.co

32
Total runs
0
24-hour runs
0
3-day runs
0
7-day runs
0
30-day runs

More Information About re2g-ctx-encoder-nq huggingface.co Model

More re2g-ctx-encoder-nq license Visit here:

https://choosealicense.com/licenses/apache-2.0

re2g-ctx-encoder-nq huggingface.co

re2g-ctx-encoder-nq huggingface.co is an AI model on huggingface.co that provides re2g-ctx-encoder-nq's model effect (), which can be used instantly with this ibm re2g-ctx-encoder-nq model. huggingface.co supports a free trial of the re2g-ctx-encoder-nq model, and also provides paid use of the re2g-ctx-encoder-nq. Support call re2g-ctx-encoder-nq model through api, including Node.js, Python, http.

re2g-ctx-encoder-nq huggingface.co Url

https://huggingface.co/ibm/re2g-ctx-encoder-nq

ibm re2g-ctx-encoder-nq online free

re2g-ctx-encoder-nq huggingface.co is an online trial and call api platform, which integrates re2g-ctx-encoder-nq's modeling effects, including api services, and provides a free online trial of re2g-ctx-encoder-nq, you can try re2g-ctx-encoder-nq online for free by clicking the link below.

ibm re2g-ctx-encoder-nq online free url in huggingface.co:

https://huggingface.co/ibm/re2g-ctx-encoder-nq

re2g-ctx-encoder-nq install

re2g-ctx-encoder-nq is an open source model from GitHub that offers a free installation service, and any user can find re2g-ctx-encoder-nq on GitHub to install. At the same time, huggingface.co provides the effect of re2g-ctx-encoder-nq install, users can directly use re2g-ctx-encoder-nq installed effect in huggingface.co for debugging and trial. It also supports api for free installation.

re2g-ctx-encoder-nq install url in huggingface.co:

https://huggingface.co/ibm/re2g-ctx-encoder-nq

Url of re2g-ctx-encoder-nq

re2g-ctx-encoder-nq huggingface.co Url

Provider of re2g-ctx-encoder-nq huggingface.co

ibm
ORGANIZATIONS

Other API from ibm

huggingface.co

Total runs: 28.6K
Run Growth: 0
Growth Rate: 0.00%
Updated:November 12 2024
huggingface.co

Total runs: 17.7K
Run Growth: 0
Growth Rate: 0.00%
Updated:August 17 2024
huggingface.co

Total runs: 15.3K
Run Growth: 0
Growth Rate: 0.00%
Updated:September 25 2024
huggingface.co

Total runs: 11.6K
Run Growth: 0
Growth Rate: 0.00%
Updated:September 16 2024
huggingface.co

Total runs: 11.2K
Run Growth: 0
Growth Rate: 0.00%
Updated:March 05 2024
huggingface.co

Total runs: 2.2K
Run Growth: 0
Growth Rate: 0.00%
Updated:August 17 2024
huggingface.co

Total runs: 344
Run Growth: 0
Growth Rate: 0.00%
Updated:December 21 2022
huggingface.co

Total runs: 157
Run Growth: 0
Growth Rate: 0.00%
Updated:December 28 2023
huggingface.co

Total runs: 103
Run Growth: 0
Growth Rate: 0.00%
Updated:October 12 2022
huggingface.co

Total runs: 90
Run Growth: 0
Growth Rate: 0.00%
Updated:February 07 2023
huggingface.co

Total runs: 57
Run Growth: 0
Growth Rate: 0.00%
Updated:March 05 2024
huggingface.co

Total runs: 56
Run Growth: 0
Growth Rate: 0.00%
Updated:October 09 2024
huggingface.co

Total runs: 23
Run Growth: 0
Growth Rate: 0.00%
Updated:September 15 2023
huggingface.co

Total runs: 18
Run Growth: 0
Growth Rate: 0.00%
Updated:September 15 2023
huggingface.co

Total runs: 16
Run Growth: 0
Growth Rate: 0.00%
Updated:September 15 2023