rerankers: A Lightweight Python Library to Unify Ranking Methods

• URL: http://arxiv.org/abs/2408.17344v2
• Date: Tue, 3 Sep 2024 10:50:17 GMT
• Title: rerankers: A Lightweight Python Library to Unify Ranking Methods
• Authors: Benjamin Clavié,
• Abstract summary: rerankers is a Python library which provides an easy-to-use interface to the most commonly used re-ranking approaches. rerankers unifies these methods into a single user-friendly interface, allowing practitioners and researchers alike to explore different methods.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper presents rerankers, a Python library which provides an easy-to-use interface to the most commonly used re-ranking approaches. Re-ranking is an integral component of many retrieval pipelines; however, there exist numerous approaches to it, relying on different implementation methods. rerankers unifies these methods into a single user-friendly interface, allowing practitioners and researchers alike to explore different methods while only changing a single line of Python code. Moreover ,rerankers ensures that its implementations are done with the fewest dependencies possible, and re-uses the original implementation whenever possible, guaranteeing that our simplified interface results in no performance degradation compared to more complex ones. The full source code and list of supported models are updated regularly and available at https://github.com/answerdotai/rerankers.

Related papers

• Rankify: A Comprehensive Python Toolkit for Retrieval, Re-Ranking, and Retrieval-Augmented Generation [15.31883349259767]
  Rankify is an open-source toolkit designed to unify retrieval, re-ranking, and RAG within a cohesive framework. It supports a wide range of retrieval techniques, including dense and sparse retrievers, while incorporating state-of-the-art re-ranking models. Rankify includes a collection of pre-retrieved datasets to facilitate benchmarking, available at Huggingface.
  arXiv  Detail & Related papers  (2025-02-04T16:33:25Z)
• PhotoHolmes: a Python library for forgery detection in digital images [0.9423257767158634]
  PhotoHolmes is an open-source library designed to easily run and benchmark forgery detection methods on digital images. PhotoHolmes includes a command-line interface (CLI) to easily run the methods implemented in the library on any suspicious image.
  arXiv  Detail & Related papers  (2024-12-19T15:47:31Z)
• A Surprisingly Simple yet Effective Multi-Query Rewriting Method for Conversational Passage Retrieval [14.389703823471574]
  We propose the use of a neural query rewriter to generate multiple queries and show how to integrate those queries in the passage retrieval pipeline efficiently. The main strength of our approach lies in its simplicity: it leverages how the beam search algorithm works and can produce multiple query rewrites at no additional cost.
  arXiv  Detail & Related papers  (2024-06-27T07:43:03Z)
• torchgfn: A PyTorch GFlowNet library [56.071033896777784]
  torchgfn is a PyTorch library that aims to address this need. It provides users with a simple API for environments and useful abstractions for samplers and losses.
  arXiv  Detail & Related papers  (2023-05-24T00:20:59Z)
• SequeL: A Continual Learning Library in PyTorch and JAX [50.33956216274694]
  SequeL is a library for Continual Learning that supports both PyTorch and JAX frameworks. It provides a unified interface for a wide range of Continual Learning algorithms, including regularization-based approaches, replay-based approaches, and hybrid approaches. We release SequeL as an open-source library, enabling researchers and developers to easily experiment and extend the library for their own purposes.
  arXiv  Detail & Related papers  (2023-04-21T10:00:22Z)
• Autoregressive Search Engines: Generating Substrings as Document Identifiers [53.0729058170278]
  Autoregressive language models are emerging as the de-facto standard for generating answers. Previous work has explored ways to partition the search space into hierarchical structures. In this work we propose an alternative that doesn't force any structure in the search space: using all ngrams in a passage as its possible identifiers.
  arXiv  Detail & Related papers  (2022-04-22T10:45:01Z)
• Solo-learn: A Library of Self-supervised Methods for Visual Representation Learning [83.02597612195966]
  solo-learn is a library of self-supervised methods for visual representation learning. Implemented in Python, using Pytorch and Pytorch lightning, the library fits both research and industry needs.
  arXiv  Detail & Related papers  (2021-08-03T22:19:55Z)
• Small-Text: Active Learning for Text Classification in Python [23.87081733039124]
  small-text is an easy-to-use active learning library for Python. It offers pool-based active learning for single- and multi-label text classification.
  arXiv  Detail & Related papers  (2021-07-21T19:23:56Z)
• Uncertainty Baselines: Benchmarks for Uncertainty & Robustness in Deep Learning [66.59455427102152]
  We introduce Uncertainty Baselines: high-quality implementations of standard and state-of-the-art deep learning methods on a variety of tasks. Each baseline is a self-contained experiment pipeline with easily reusable and extendable components. We provide model checkpoints, experiment outputs as Python notebooks, and leaderboards for comparing results.
  arXiv  Detail & Related papers  (2021-06-07T23:57:32Z)
• fastai: A Layered API for Deep Learning [1.7223564681760164]
  fastai is a deep learning library which provides practitioners with high-level components. It provides researchers with low-level components that can be mixed and matched to build new approaches.
  arXiv  Detail & Related papers  (2020-02-11T21:16:48Z)
• OPFython: A Python-Inspired Optimum-Path Forest Classifier [68.8204255655161]
  This paper proposes a Python-based Optimum-Path Forest framework, denoted as OPFython. As OPFython is a Python-based library, it provides a more friendly environment and a faster prototyping workspace than the C language.
  arXiv  Detail & Related papers  (2020-01-28T15:46:19Z)

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.