כתבה
arXiv cs.LG ·
לימוד ריפוד מינימלי
Minimal Witness Reinforcement Learning
לימוד ריפוד מינימלי: פיתוח שיטה לזיהוי מספר מזערי של הסברים.
תקציר מקורי באנגליתarXiv:2610.07226v1 Announce Type: new Abstract: ``What are the irreducible conditions that are sufficient to produce an outcome?'' is one of the most common questions that recur across computation and science. Its answers, the minimal sufficient witnesses, are what we mean by explanations, mechanisms and reasons. These problems usually ask for multiple minimal witnesses, yet standard RL methods may reveal only one solution or redundant ones. We formalize this problem as minimal-witness identification and introduce Minimal-Witness Reinforcement Learning (MWRL). MWRL takes the union of the sets certified by successful proposals sampled from the policy and credits each proposal for the coverage the group union would lose without that proposal. This credit assignment, derived directly from the
קרא במקור המקורי
arxiv.org
פתח כתבה מקורית