Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCercetare AI

analiza aiqbench

This research introduces a game-theoretic framework for fairly distributing credit among content creators whose intellectual property is utilized by AI models during inference. By leveraging the least core solution concept, the proposed algorithms optimize reward allocation stability while significantly reducing the number of LLM calls required compared to existing methods. The work addresses critical incentive alignment challenges in large-scale generative systems where multiple sources contribute to a single output.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

In-Context Credit Assignment via the Core

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2605.06920v2 Announce Type: replace-cross Abstract: We propose incentive-aligned mechanisms for in-context credit assignment: the task of assigning credit for AI-generated content among creators whose intellectual property appears in the context window. Our approach is based on the least core solution concept from cooperative game theory, which distributes value in a way that is as stable as possible by ensuring that no subset of creators is significantly under-compensated relative to the value they could generate on their own. We develop algorithms for approximating the least core, which leverage novel routines for constraint seeding and constraint separation. On a web retrieval credit assignment task, we find that our approaches approximate the least core using an order of magnitude fewer LLM calls compared to alternative methods.

Abstract:We propose incentive-aligned mechanisms for in-context credit assignment: the task of assigning credit for AI-generated content among creators whose intellectual property appears in the context window. Our approach is based on the least core solution concept from cooperative game theory, which distributes value in a way that is as stable as possible by ensuring that no subset of creators is significantly under-compensated relative to the value they could generate on their own. We develop algorithms for approximating the least core, which leverage novel routines for constraint seeding and constraint separation. On a web retrieval credit assignment task, we find that our approaches approximate the least core using an order of magnitude fewer LLM calls compared to alternative methods.

Computer Science and Game Theory (cs.GT); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)

arXiv:2605.06920 [cs.GT]

(or arXiv:2605.06920v2 [cs.GT] for this version)

https://doi.org/10.48550/arXiv.2605.06920 Focus to learn more arXiv-issued DOI via DataCite

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.

Text integral sub licența deschisă a publicației · 219 cuvinte

Subiecte conexe