오픈뉴스백과
세계의 오늘한국의 오늘피드
뉴스
AI 브리핑전체 뉴스진영별 의제회사정부과학학술용어사전뉴스로 배우기
커뮤니티제보
...

오픈뉴스백과

집단지성 기반 뉴스 검증 플랫폼. 다양한 시각으로 뉴스를 이해합니다.

서비스

세계의 오늘한국의 오늘뉴스정부과학학술용어사전소개

법적 고지

개인정보처리방침이용약관콘텐츠 이용 안내

문의

이메일 문의

본 플랫폼에서 제공하는 뉴스 콘텐츠의 저작권은 각 언론사에 있으며, 무단 복제 및 배포를 금지합니다.

RSS 피드를 통해 수집된 콘텐츠는 각 원저작자의 라이선스 조건을 따릅니다. 오픈 라이선스(CC-BY 등) 콘텐츠는 해당 라이선스에 따라 출처를 표기합니다.

오픈뉴스백과는 뉴스 집계 및 검증 플랫폼으로, 개별 기사의 내용에 대한 책임은 해당 언론사에 있습니다.

이용자가 작성한 피드백, 팩트체크, 독자 제보 등의 콘텐츠에 대한 책임은 해당 작성자에게 있습니다.

콘텐츠 제거 요청: contact@opennewspedia.com

© 2026 오픈뉴스백과 (OpenNewsPedia). All rights reserved.

세계의 오늘
미디어 커버리지1건1개 미디어
arXiv CS.AI
학술
기타

Metric Match: A Subset Selection Approach to Evaluating LLM Judge Reliability

arXiv CS.AI
조회 0
CC BY
이 매체는 공공·자유 라이선스로 본문을 직접 표시합니다.
Computer Science > Artificial Intelligence [Submitted on 12 Jun 2026] Title:Metric Match: A Subset Selection Approach to Evaluating LLM Judge Reliability View PDF HTML (experimental)Abstract:LLM judges are used to reduce the need for costly human labor in evaluating open-ended text generation. However, the reliability of these judges depends critically on their alignment with human raters -- a property that itself depends on costly human annotations. In this work, we develop a method (Metric Match) for estimating correlation-based reliability metrics of LLM judges from limited annotations. Metric Match selects a subset of samples for human annotation such that the subset matches the population reliability metric with respect to acquired synthetic labels. We empirically show that Metric Match achieves a win-rate of 0.838 against random subset selection across four different correlation metrics and 15 datasets, with an 18.7% decrease in average estimation error and reduces annotation needs by 32.5%. We provide a cost model and highlight a medical case study where our method saves $1,041.67 compared to random selection for expert annotation. Further, we shift our task from reliability estimation to reliability classification of whether a given judge is above a deployment threshold, outperforming random selection with Metric Match. All project code is publicly available, and we additionally provide an installable package for ease of use. References & Citations Loading... Bibliographic and Citation Tools Bibliographic Explorer (What is the Explorer?) Connected Papers (What is Connected Papers?) Litmaps (What is Litmaps?) scite Smart Citations (What are Smart Citations?) Code, Data and Media Associated with this Article alphaXiv (What is alphaXiv?) CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub (What is DagsHub?) Gotit.pub (What is GotitPub?) Hugging Face (What is Huggingface?) ScienceCast (What is ScienceCast?) Demos Recommenders and Search Tools Influence Flower (What are Influence Flowers?) CORE Recommender (What is CORE?) arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
전문 보기

이 뉴스, 독자들은 어떻게 느꼈나요?

첫 반응을 남겨보세요

로그인하면 감정 반응에 참여할 수 있어요.

관련 뉴스

관련 뉴스 제보는 로그인 후 가능합니다.

'research' 카테고리 뉴스

A Definition of Good Explanations and the Challenges Explaining LLM Outputs

arXiv CS.AI

Dr-DCI: Scaling Direct Corpus Interaction via Dynamic Workspace Expansion

arXiv CS.AI

Relational Structural Causal Models

arXiv CS.AI

arXiv의 다른 기사

Semantics-Enhanced Retrieval-Augmented Time Series Forecasting

arXiv CS.AI

AI Engram: In Search of Memory Traces in Artificial Intelligence

arXiv CS.AI

OSGuard: A Benchmark for Safety in Computer-Use Agents

arXiv CS.AI

피드백

피드백을 남기려면 로그인해 주세요.