<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>RL학습 on TechLLM</title><link>https://techllm.github.io/tags/rl%ED%95%99%EC%8A%B5/</link><description>Recent content in RL학습 on TechLLM</description><generator>Hugo</generator><language>ko</language><lastBuildDate>Wed, 24 Jun 2026 15:15:00 +0900</lastBuildDate><atom:link href="https://techllm.github.io/tags/rl%ED%95%99%EC%8A%B5/index.xml" rel="self" type="application/rss+xml"/><item><title>법률 에이전트 검증 비용을 10분의 1로 — LangChain × Harvey 공동연구</title><link>https://techllm.github.io/posts/langchain-harvey-efficient-verifiers-legal-agents/</link><pubDate>Wed, 24 Jun 2026 15:15:00 +0900</pubDate><guid>https://techllm.github.io/posts/langchain-harvey-efficient-verifiers-legal-agents/</guid><description>Harvey의 LAB 벤치마크 2,348개 항목을 가지고 LangChain Labs가 직접 돌려본 결과. 검증을 묶음으로 던지고, Opus 4.7 대신 DeepSeek 같은 오픈 모델을 쓰니 비용이 한 자릿수까지 떨어졌습니다.</description></item></channel></rss>