arXiv AI By Xinyu Yang, Jiejun Tan, Chenlong Deng, Chenghao Zhang, Tongyu Wen, Zhicheng Dou

LegalEvolver: Agentic Legal Judgment Prediction via Rubric-Guided Self-Evolution

Read the original on arXiv AI →

LegalEvolver is a query‑optimization framework for legal judgment prediction that generates legally informative queries to improve retrieval quality. It uses heuristic query seeding, summarizes rollout experiences into rubrics, and applies rubric‑guided reinforcement learning for iterative self‑evolution. Experiments on large benchmarks show that evolving rubrics outperform fixed ones and that rubric guidance boosts performance beyond direct supervised fine‑tuning plus RL.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Computation and Language
Sep 22

Can LLMs Time Travel? Enhancing Temporal Consistency in Legal Agentic Search through Reinforcement Learning

arXiv:2605.25920v2 Announce Type: replace Abstract: While large language models (LLMs) augmented with agentic search capabilities show promise for legal reasoning, they overlook a fundamental constra...

By Wei Fan, Yining Zhou, Mufan Zhang, Yanbing Weng, Yiran HU, Tianshi Zheng, Baixuan Xu, Chunyang Li, Jianhui Yang, Haoran Li, Yangqiu Song
arXiv AI
Oct 2

Legal Research Bench: Measuring End-to-End Reliability in Long-Horizon Legal Research Agents

Legal Research Bench (LRB) is a new benchmark comprising 413 open-ended U.S. legal research questions, each paired with a gold answer, supporting authorities, and a binary grading rubric. The study evaluates thirteen advanced language‑model agents using web search, case‑law search, page parsing, and retrieval tools, scoring responses only when all required criteria are met and cited authorities verify. Results show that even the best model, Claude Opus 4.8, achieves full correctness on only 42.9% of questions, with performance varying by legal area and task complexity, and no clear link between more tool calls or inference cost and higher accuracy.

By Katrina Drozdov, Oliver Chen, Langston Nashold, Rayan Krishnan
arXiv AI
6d ago

Adaptive Query Routing: A Tier-Based Framework for Hybrid Retrieval Across Financial, Legal, and Medical Documents

The paper evaluates three retrieval strategies—Vector RAG, Tree Reasoning, and a new Adaptive Hybrid Retrieval (AHR)—on a small corpus of financial, legal, and medical documents, using a four‑tier query complexity benchmark and LLM‑as‑judge evaluation. Tree Reasoning achieves the highest overall score (0.900), but AHR excels on cross‑reference queries (0.850) and all methods tie on multi‑section queries (0.929). Vector RAG shows the lowest latency (1.61 s) and performs best on single multi‑document queries (0.900).

By Afshan Hashmi