Efficient and effective tree-based and neural learning to rank

S Bruch, C Lucchese, FM Nardini - Foundations and Trends® …, 2023 - nowpublishers.com
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 …

A large-scale dataset of patient summaries for retrieval-based clinical decision support systems

Z Zhao, Q Jin, F Chen, T Peng, S Yu - Scientific data, 2023 - nature.com
Abstract Retrieval-based Clinical Decision Support (ReCDS) can aid clinical workflow by
providing relevant literature and similar patients for a given patient. However, the …

Bridging dense and sparse maximum inner product search

S Bruch, FM Nardini, A Ingber, E Liberty - ACM Transactions on …, 2024 - dl.acm.org
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 …

Efficient neural ranking using forward indexes and lightweight encoders

J Leonhardt, H Müller, K Rudra, M Khosla… - ACM Transactions on …, 2024 - dl.acm.org
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 …

Towards Effective and Efficient Sparse Neural Information Retrieval

T Formal, C Lassance, B Piwowarski… - ACM Transactions on …, 2024 - dl.acm.org
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 …

Unims-rag: A unified multi-source retrieval-augmented generation for personalized dialogue systems

H Wang, W Huang, Y Deng, R Wang, Z Wang… - arXiv preprint arXiv …, 2024 - arxiv.org
Large Language Models (LLMs) has shown exceptional capabilities in many natual
language understanding and generation tasks. However, the personalization issue still …

Efficient inverted indexes for approximate retrieval over learned sparse representations

S Bruch, FM Nardini, C Rulli, R Venturini - Proceedings of the 47th …, 2024 - dl.acm.org
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 …

An approximate algorithm for maximum inner product search over streaming sparse vectors

S Bruch, FM Nardini, A Ingber, E Liberty - ACM Transactions on …, 2023 - dl.acm.org
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 …

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 …

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 …