<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
  <title>DREAM Lab blog (UIUC)</title>
  <link>https://dream.ischool.illinois.edu/blogs.html</link>
  <atom:link href="https://dream.ischool.illinois.edu/feed.xml" rel="self" type="application/rss+xml"/>
  <description>Plain-language explainers of research from the DREAM Lab at the University of Illinois Urbana-Champaign.</description>
  <language>en</language>
  <lastBuildDate>Mon, 05 Oct 2026 12:00:00 +0000</lastBuildDate>
  <item>
    <title>RAG That Learns Over Time: Source Learning for LLM Agents</title>
    <link>https://dream.ischool.illinois.edu/blogs/rag_that_learns_over_time.html</link>
    <guid>https://dream.ischool.illinois.edu/blogs/rag_that_learns_over_time.html</guid>
    <pubDate>Mon, 05 Oct 2026 12:00:00 +0000</pubDate>
    <category>Agentic AI</category>
    <description>SourceLearn builds RAG that learns over time: a persistent source model beat Hybrid RAG by up to 22.6 points, best in 13 of 15 settings.</description>
  </item>
  <item>
    <title>Agent Primitives: Reusable Latent Building Blocks for Multi-Agent Systems</title>
    <link>https://dream.ischool.illinois.edu/blogs/agent_primitives.html</link>
    <guid>https://dream.ischool.illinois.edu/blogs/agent_primitives.html</guid>
    <pubDate>Fri, 10 Jul 2026 12:00:00 +0000</pubDate>
    <category>Agentic AI</category>
    <description>Agent Primitives (ICML 2026): reusable latent building blocks for LLM multi-agent systems, composed by an Organizer and connected via KV-cache communication.</description>
  </item>
  <item>
    <title>The Hidden Cost of Prompt Injection Defense</title>
    <link>https://dream.ischool.illinois.edu/blogs/security_fidelity_tradeoff.html</link>
    <guid>https://dream.ischool.illinois.edu/blogs/security_fidelity_tradeoff.html</guid>
    <pubDate>Thu, 09 Jul 2026 12:00:00 +0000</pubDate>
    <category>LLM security</category>
    <description>Prompt injection defenses are scored on attack success, which hides lost content. SecFid (ICML 2026 Spotlight) measures both security and fidelity.</description>
  </item>
  <item>
    <title>How to Test Whether Your Product Descriptions Influence AI Shopping Recommendations</title>
    <link>https://dream.ischool.illinois.edu/blogs/test_product_descriptions_ai_recommendations.html</link>
    <guid>https://dream.ischool.illinois.edu/blogs/test_product_descriptions_ai_recommendations.html</guid>
    <pubDate>Sat, 13 Jun 2026 12:00:00 +0000</pubDate>
    <category>LLM search</category>
    <description>A step-by-step protocol for testing whether product descriptions change AI shopping recommendations, using the CORE method and ProductBench.</description>
  </item>
  <item>
    <title>CORE: Controlling Output Rankings in Generative Engines for LLM-based Search</title>
    <link>https://dream.ischool.illinois.edu/blogs/controlling_output_rankings_core.html</link>
    <guid>https://dream.ischool.illinois.edu/blogs/controlling_output_rankings_core.html</guid>
    <pubDate>Sat, 13 Jun 2026 12:00:00 +0000</pubDate>
    <category>LLM search</category>
    <description>Project page for CORE: controlling output rankings in generative engines for LLM-based search, with the ProductBench benchmark and results on four LLMs.</description>
  </item>
  <item>
    <title>CORE Explained: How to Improve Visibility in LLM-Based Search (Step by Step)</title>
    <link>https://dream.ischool.illinois.edu/blogs/core_explained.html</link>
    <guid>https://dream.ischool.illinois.edu/blogs/core_explained.html</guid>
    <pubDate>Sat, 13 Jun 2026 12:00:00 +0000</pubDate>
    <category>LLM search</category>
    <description>A step-by-step explainer of CORE, our method for studying how retrieved content changes rankings in LLM-based search, with definitions and FAQ.</description>
  </item>
  <item>
    <title>SEO vs GEO vs CORE: Techniques for Visibility in LLM-Based Search</title>
    <link>https://dream.ischool.illinois.edu/blogs/comparing_llm_search_visibility.html</link>
    <guid>https://dream.ischool.illinois.edu/blogs/comparing_llm_search_visibility.html</guid>
    <pubDate>Sat, 13 Jun 2026 12:00:00 +0000</pubDate>
    <category>LLM search</category>
    <description>A comparison of SEO, generative engine optimization (GEO), and our CORE method for how content is ranked in LLM-based search, written by the CORE authors.</description>
  </item>
  <item>
    <title>When More Reasoning is Actually Less: The Science Behind Optimal Thinking in LLMs</title>
    <link>https://dream.ischool.illinois.edu/blogs/when_more_reasoning_is_actually_less.html</link>
    <guid>https://dream.ischool.illinois.edu/blogs/when_more_reasoning_is_actually_less.html</guid>
    <pubDate>Mon, 01 Dec 2025 12:00:00 +0000</pubDate>
    <category>LLM reasoning</category>
    <description>Why more chain-of-thought can hurt LLM accuracy: the inverted U-curve, three failure modes of reasoning, and the case for adaptive reasoning.</description>
  </item>
  <item>
    <title>From Parameter Learning to Prompt Learning: The Evolution of Prompt Optimization</title>
    <link>https://dream.ischool.illinois.edu/blogs/evolution_of_prompt_optimization.html</link>
    <guid>https://dream.ischool.illinois.edu/blogs/evolution_of_prompt_optimization.html</guid>
    <pubDate>Sat, 01 Nov 2025 12:00:00 +0000</pubDate>
    <category>Prompt optimization</category>
    <description>How prompt optimization mirrors the history of neural network training, from perturbation methods to gradient-based techniques, and what may come next.</description>
  </item>
  <item>
    <title>1000 Ideas for Your Next Trustworthy Machine Learning Paper</title>
    <link>https://dream.ischool.illinois.edu/blogs/thousand_ideas_trustworthy_ML.html</link>
    <guid>https://dream.ischool.illinois.edu/blogs/thousand_ideas_trustworthy_ML.html</guid>
    <pubDate>Sun, 01 Oct 2023 12:00:00 +0000</pubDate>
    <category>Trustworthy ML</category>
    <description>Three universal frameworks for generating trustworthy ML research ideas across robustness, adversarial security, interpretability, and fairness.</description>
  </item>
</channel>
</rss>
