Papers › Adaptive Orchestration of Modular Generative Information Access Systems

Adaptive Orchestration of Modular Generative Information Access Systems

24 Apr 2025arXiv:2504.17454archive 2025-07-28

Mohanna Hoveyda, Harrie Oosterhuis, Arjen P. de Vries, Maarten de Rijke, Faegheh Hasibi

Advancements in large language models (LLMs) have driven the emergence of complex new systems to provide access to information, that we will collectively refer to as modular generative information access (GenIA) systems. They integrate a broad and evolving range of specialized components, including LLMs, retrieval models, and a heterogeneous set of sources and tools. While modularity offers flexibility, it also raises critical challenges: How can we systematically characterize the space of possible modules and their interactions? How can we automate and optimize interactions among these heterogeneous components? And, how do we enable this modular system to dynamically adapt to varying user query requirements and evolving module capabilities? In this perspective paper, we argue that the architecture of future modular generative information access systems will not just assemble powerful components, but enable a self-organizing system through real-time adaptive orchestration -- where components' interactions are dynamically configured for each user input, maximizing information relevance while minimizing computational overhead. We give provisional answers to the questions raised above with a roadmap that depicts the key principles and methods for designing such an adaptive modular system. We identify pressing challenges, and propose avenues for addressing them in the years ahead. This perspective urges the IR community to rethink modular system designs for developing adaptive, self-optimizing, and future-ready architectures that evolve alongside their rapidly advancing underlying technologies.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2504.17454")

Code

Syntology Ran 2 of 12 code samples harvested from 1 repository linked to this paper; 10 have no recorded run. Of those that ran: 1 ran · our draft was wrong; 1 ran with no contract checked.

By repository: official repository: 12 samples from 1 repository, 2 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

informagi/AQA officialmentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

12 samples harvested; 2 ran; 0 honoured the contract we drafted; 10 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
1ran
10unverified

Licence: 0 of the 12 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from informagi/AQA. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

answer_extractor informagi/AQA/Adaptive-RAG/evaluate.py official repository ran fingerprinted MIT (permissive) · 0114479cb31c26f0 · report
normalize_answer informagi/AQA/Adaptive-RAG/evaluate.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · 6a96435eba311b08 · report
calculate_acc informagi/AQA/Adaptive-RAG/AQA_final_eval.py official repository unverified MIT (permissive) · c746273259f00363 · report
calculate_reward informagi/AQA/CMAB_last.py official repository unverified MIT (permissive) · c7e26e248b583a96 · report
complexity_to_vector informagi/AQA/CMAB_last.py official repository unverified MIT (permissive) · 63fde517a4e8f9a7 · report
extract_answer informagi/AQA/AQA_dataset_organizer.py official repository unverified MIT (permissive) · 767285e542cae380 · report
find_answer_in_preloaded_data informagi/AQA/AQA_dataset_organizer.py official repository unverified MIT (permissive) · 9032287187f4aa88 · report
load_data informagi/AQA/CMAB_last.py official repository unverified MIT (permissive) · 6880ae0c1a16bc7f · report
load_data informagi/AQA/CMAB_last_swarm.py official repository unverified MIT (permissive) · 3fefd43e2b64de79 · report
load_predictions informagi/AQA/Adaptive-RAG/AQA_final_eval.py official repository unverified MIT (permissive) · fd0f6a22513811ab · report
majority_vote informagi/AQA/CMAB_last_swarm.py official repository unverified MIT (permissive) · 415284d931b57325 · report
preload_raw_data informagi/AQA/AQA_dataset_organizer.py official repository unverified MIT (permissive) · 07cb54ad3a7c9d02 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

SET

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections