Close Menu
geekfence.comgeekfence.com
    What's Hot

    Noledge launches sruu to drive digitalisation in the retail sector

    June 26, 2026

    The US Is About to Deport an Immigrant to the Center of the Ebola Crisis

    June 26, 2026

    Subsea resilience needs to move beyond cable count – here’s why (Reader Forum)

    June 26, 2026
    Facebook X (Twitter) Instagram
    • About Us
    • Contact Us
    Facebook Instagram
    geekfence.comgeekfence.com
    • Home
    • UK Tech News
    • AI
    • Big Data
    • Cyber Security
      • Cloud Computing
      • iOS Development
    • IoT
    • Mobile
    • Software
      • Software Development
      • Software Engineering
    • Technology
      • Green Technology
      • Nanotechnology
    • Telecom
    geekfence.comgeekfence.com
    Home»Artificial Intelligence»Unlocking dependable responses with Gemini Enterprise Agent Platform’s Agentic RAG
    Artificial Intelligence

    Unlocking dependable responses with Gemini Enterprise Agent Platform’s Agentic RAG

    AdminBy AdminJune 6, 2026No Comments3 Mins Read10 Views
    Facebook Twitter Pinterest LinkedIn Telegram Tumblr Email
    Unlocking dependable responses with Gemini Enterprise Agent Platform’s Agentic RAG
    Share
    Facebook Twitter LinkedIn Pinterest Email


    Experiments and results

    We evaluated agentic RAG on FramesQA, which is based on the FRAMES paper. An example multi-hop question is:

    “Of the top two most watched television season finales (as of June 2024), which finale ran the longest in length and by how much?”

    The RAG system needs to perform multiple steps to arrive at the correct answer. First, it has to identify that the two most watched finales are from the shows M*A*S*H and Cheers. Then, it has to find their running times, and calculate the length difference. In many RAG settings (Vanilla RAG or agentic RAG without sufficient context), we could end up in a situation where the model says something like:

    “Despite multiple scans, I found no explicit runtimes for M*A*S*H or Cheers. The documents provide viewership data, but not the duration in minutes or hours.”

    This does not answer the question.

    Fortunately, our agentic RAG can solve this by first searching for the TV shows, then using the Query Rewriter and Sufficient Context Agent to have a targeted search for the run time of M*A*S*H or Cheers. Then, Gemini can easily determine which finale ran the longest in length and by how much:

    “The M*A*S*H finale ran for 150 minutes, making it the longest of the top two. It was 52 minutes longer than the Cheers finale, which ran for approximately 98 minutes.”

    We ran an experiment to test this ability at scale (FramesQA has 824 queries along with a corpus containing 2,676 PDF documents). In the “Vanilla” RAG setting, we use Google’s RAG Engine (which has an advanced retrieval engine, LLM parser, and re-ranker). We compared this with our agentic RAG in two settings. In the single-corpus setting, we retrieve from the FramesQA documents. In the cross-corpus setting, we also include three other distracting datasets, where the Planner Agent must determine where to retrieve from. This cross-corpus setting mimics use cases where companies have databases managed by separate teams. We compute accuracy by using an LLM-as-a-judge to compare the system responses to the ground truth answers in the dataset.

    In the cross-corpus setting, our system nearly matches its single-corpus accuracy. Even when the Planner Agent must select the correct corpus out of 4 possibilities, we successfully route the search queries and answer 90.1% of questions correctly. Also, the latency of both single- and cross-corpus versions is about the same (within 3% on average). This demonstrates that our Agentic RAG system can reason over multiple, unrelated data sources, which opens up possibilities for more flexible retrieval scenarios.



    Source link

    Share. Facebook Twitter Pinterest LinkedIn Tumblr Email

    Related Posts

    Optimizing cloud economics with linear elastic caching

    June 26, 2026

    Scaling cybercrime disruption through innovation and AI

    June 25, 2026

    Exploring the societal impacts of AI | MIT News

    June 24, 2026

    Clustering Unstructured Text with LLM Embeddings and HDBSCAN

    June 23, 2026

    SpaceX wants to build AI data centers in space. Will it work?

    June 22, 2026

    DataRobot for Developers — integrating with the Google Antigravity CLI

    June 21, 2026
    Top Posts

    Understanding U-Net Architecture in Deep Learning

    November 25, 202556 Views

    Hard-braking events as indicators of road segment crash risk

    January 14, 202630 Views

    Redefining AI efficiency with extreme compression

    March 25, 202628 Views
    Don't Miss

    Noledge launches sruu to drive digitalisation in the retail sector

    June 26, 2026

    The Noledge Group, the financial management and ERP solution specialist, has announced the launch of…

    The US Is About to Deport an Immigrant to the Center of the Ebola Crisis

    June 26, 2026

    Subsea resilience needs to move beyond cable count – here’s why (Reader Forum)

    June 26, 2026

    Optimizing cloud economics with linear elastic caching

    June 26, 2026
    Stay In Touch
    • Facebook
    • Instagram
    About Us

    At GeekFence, we are a team of tech-enthusiasts, industry watchers and content creators who believe that technology isn’t just about gadgets—it’s about how innovation transforms our lives, work and society. We’ve come together to build a place where readers, thinkers and industry insiders can converge to explore what’s next in tech.

    Our Picks

    Noledge launches sruu to drive digitalisation in the retail sector

    June 26, 2026

    The US Is About to Deport an Immigrant to the Center of the Ebola Crisis

    June 26, 2026

    Subscribe to Updates

    Please enable JavaScript in your browser to complete this form.
    Loading
    • About Us
    • Contact Us
    • Disclaimer
    • Privacy Policy
    • Terms and Conditions
    © 2026 Geekfence.All Rigt Reserved.

    Type above and press Enter to search. Press Esc to cancel.