Efficient and effective tree-based and neural learning to rank
As information retrieval researchers, we not only develop algorithmic solutions to hard
problems, but we also insist on a proper, multifaceted evaluation of ideas. The literature on …
problems, but we also insist on a proper, multifaceted evaluation of ideas. The literature on …
A large-scale dataset of patient summaries for retrieval-based clinical decision support systems
Abstract Retrieval-based Clinical Decision Support (ReCDS) can aid clinical workflow by
providing relevant literature and similar patients for a given patient. However, the …
providing relevant literature and similar patients for a given patient. However, the …
Bridging dense and sparse maximum inner product search
Maximum inner product search (MIPS) over dense and sparse vectors have progressed
independently in a bifurcated literature for decades; the latter is better known as top-retrieval …
independently in a bifurcated literature for decades; the latter is better known as top-retrieval …
Efficient neural ranking using forward indexes and lightweight encoders
Dual-encoder-based dense retrieval models have become the standard in IR. They employ
large Transformer-based language models, which are notoriously inefficient in terms of …
large Transformer-based language models, which are notoriously inefficient in terms of …
Towards Effective and Efficient Sparse Neural Information Retrieval
Sparse representation learning based on Pre-trained Language Models has seen a growing
interest in Information Retrieval. Such approaches can take advantage of the proven …
interest in Information Retrieval. Such approaches can take advantage of the proven …
Unims-rag: A unified multi-source retrieval-augmented generation for personalized dialogue systems
Large Language Models (LLMs) has shown exceptional capabilities in many natual
language understanding and generation tasks. However, the personalization issue still …
language understanding and generation tasks. However, the personalization issue still …
Efficient inverted indexes for approximate retrieval over learned sparse representations
Learned sparse representations form an attractive class of contextual embeddings for text
retrieval. That is so because they are effective models of relevance and are interpretable by …
retrieval. That is so because they are effective models of relevance and are interpretable by …
An approximate algorithm for maximum inner product search over streaming sparse vectors
Maximum Inner Product Search or top-k retrieval on sparse vectors is well understood in
information retrieval, with a number of mature algorithms that solve it exactly. However, all …
information retrieval, with a number of mature algorithms that solve it exactly. However, all …
Rag-fusion: a new take on retrieval-augmented generation
Z Rackauckas - arXiv preprint arXiv:2402.03367, 2024 - arxiv.org
Infineon has identified a need for engineers, account managers, and customers to rapidly
obtain product information. This problem is traditionally addressed with retrieval-augmented …
obtain product information. This problem is traditionally addressed with retrieval-augmented …
A Knowledge Graph Embedding Model for Answering Factoid Entity Questions
P Jafarzadeh, F Ensan, M Ali Akbar Alavi… - ACM Transactions on …, 2024 - dl.acm.org
Factoid entity questions (FEQ), which seek answers in the form of a single entity from
knowledge sources such as DBpedia and Wikidata, constitute a substantial portion of user …
knowledge sources such as DBpedia and Wikidata, constitute a substantial portion of user …