Upload reports/literature_review.md
Browse files- reports/literature_review.md +152 -0
reports/literature_review.md
ADDED
|
@@ -0,0 +1,152 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# Literature Review: Oracle-Credit-Compute (OCC) Stack
|
| 2 |
+
|
| 3 |
+
## 1. Test-Time Compute Allocation
|
| 4 |
+
|
| 5 |
+
### Closest Prior Art
|
| 6 |
+
- **Snell et al. (2408.03314)**: Compute-optimal scaling strategies for LLMs. Showed that test-time compute can outperform 14× larger models when allocated adaptively. Key methods: PRM-guided beam search, lookahead, best-of-N.
|
| 7 |
+
- **Brown et al. (2407.21787)**: Coverage scales log-linearly with sample count. Repeated sampling is a legitimate inference-time scaling axis.
|
| 8 |
+
- **Muennighoff et al. (2501.19393, s1)**: Budget forcing achieves test-time scaling with only 1K SFT examples. Sequential scaling > parallel.
|
| 9 |
+
|
| 10 |
+
### What OCC Borrows
|
| 11 |
+
The insight that compute should be allocated *per-prompt* based on difficulty, not fixed globally.
|
| 12 |
+
|
| 13 |
+
### What OCC Changes
|
| 14 |
+
OCC makes compute allocation *agent-centric and credit-based* rather than prompt-centric. An agent must earn the right to consume more compute through verified impact, not just because the prompt is hard.
|
| 15 |
+
|
| 16 |
+
### What Is Novel
|
| 17 |
+
The credit/ledger abstraction for cross-agent, cross-task compute allocation. Prior work assumes a single model; OCC assumes multiple agents competing for shared resources.
|
| 18 |
+
|
| 19 |
+
---
|
| 20 |
+
|
| 21 |
+
## 2. GRPO / RLVR
|
| 22 |
+
|
| 23 |
+
### Closest Prior Art
|
| 24 |
+
- **DeepSeek-R1 (2501.12948)**: GRPO with rule-based rewards (accuracy + format). No neural reward model. AIME 71% → 86.7%.
|
| 25 |
+
- **DeepSeekMath**: GRPO origin, group relative baseline.
|
| 26 |
+
|
| 27 |
+
### What OCC Borrows
|
| 28 |
+
GRPO's rule-based reward design — avoiding neural reward models to prevent reward hacking.
|
| 29 |
+
|
| 30 |
+
### What OCC Changes
|
| 31 |
+
OCC uses the Impact Oracle as the reward source, making reward verifiable per-action and marginal rather than per-episode. The reward is also cost-adjusted.
|
| 32 |
+
|
| 33 |
+
### What Is Novel
|
| 34 |
+
Cost-adjusted GRPO rewards that penalize compute consumption directly. Standard GRPO rewards accuracy; OCC rewards accuracy per token-dollar.
|
| 35 |
+
|
| 36 |
+
---
|
| 37 |
+
|
| 38 |
+
## 3. Process Reward Models (PRMs)
|
| 39 |
+
|
| 40 |
+
### Closest Prior Art
|
| 41 |
+
- **Lightman et al. / PRM800K**: Human-annotated process supervision.
|
| 42 |
+
- **Wang et al. / Snell et al.**: Auto-constructed PRMs via Monte Carlo rollouts.
|
| 43 |
+
- **SPARK (2512.03244)**: Generator-verifier framework for PRM training.
|
| 44 |
+
- **GenPRM (2504.00891)**: Generative process reward model with CoT reasoning.
|
| 45 |
+
- **PRMBench (2501.03124)**: Fine-grained benchmark for PRMs.
|
| 46 |
+
|
| 47 |
+
### What OCC Borrows
|
| 48 |
+
The verifier layer — Impact Oracle is essentially a lightweight PRM for general tasks, not just math.
|
| 49 |
+
|
| 50 |
+
### What OCC Changes
|
| 51 |
+
Impact Oracle supports multiple modes (code, QA, debate) and produces structured JSON with cost-adjusted scores, confidence, and gaming detection. PRMs typically output step-level correctness only.
|
| 52 |
+
|
| 53 |
+
---
|
| 54 |
+
|
| 55 |
+
## 4. Calibration / Abstention
|
| 56 |
+
|
| 57 |
+
### Closest Prior Art
|
| 58 |
+
- **RLCR (2507.16806)**: RL with calibration rewards using Brier score.
|
| 59 |
+
- **ConfTuner (2508.18847)**: Tokenized Brier score loss for verbalized confidence.
|
| 60 |
+
- **MetaFaith (2505.24858)**: Prompt-based calibration improvement.
|
| 61 |
+
- **On Calibration of Modern Neural Networks (1706.04599)**: Temperature scaling baseline.
|
| 62 |
+
|
| 63 |
+
### What OCC Borrows
|
| 64 |
+
Brier score as a proper scoring rule for calibration-aware rewards.
|
| 65 |
+
|
| 66 |
+
### What OCC Changes
|
| 67 |
+
Calibration is a first-class reward component, not a post-hoc fix. Agents are explicitly rewarded for correct abstention and penalized for confident-wrong answers.
|
| 68 |
+
|
| 69 |
+
---
|
| 70 |
+
|
| 71 |
+
## 5. Multi-Agent Debate
|
| 72 |
+
|
| 73 |
+
### Closest Prior Art
|
| 74 |
+
- **Du et al. (2305.14325)**: Original multi-agent debate improves reasoning.
|
| 75 |
+
- **Debate-or-Vote (2508.17536)**: Majority voting drives most gains; debate alone is weaker.
|
| 76 |
+
- **M3MAD-Bench (2601.02854)**: Unified benchmark across domains and modalities.
|
| 77 |
+
- **Graph-GRPO (2603.02701)**: GRPO for multi-agent topology learning.
|
| 78 |
+
|
| 79 |
+
### What OCC Borrows
|
| 80 |
+
The multi-agent debate paradigm.
|
| 81 |
+
|
| 82 |
+
### What OCC Changes
|
| 83 |
+
Debate turns are not pre-allocated equally. The broker grants debate turns based on credit balance and prior marginal contribution. This addresses the "debate alone is weaker" finding by making it *selective*.
|
| 84 |
+
|
| 85 |
+
---
|
| 86 |
+
|
| 87 |
+
## 6. Credit Assignment / Agent Markets
|
| 88 |
+
|
| 89 |
+
### Closest Prior Art
|
| 90 |
+
- **LLM-guided credit assignment (2502.03723)**: LLM generates dense per-agent rewards.
|
| 91 |
+
- **SHARP (2602.08335)**: Shapley-based credit assignment.
|
| 92 |
+
- **Reward Design for Justifiable RL (2402.15826)**: Debate-based reward models.
|
| 93 |
+
|
| 94 |
+
### What OCC Borrows
|
| 95 |
+
Credit assignment as a distinct problem from outcome reward.
|
| 96 |
+
|
| 97 |
+
### What OCC Changes
|
| 98 |
+
Credits are *non-transferable, decaying, capability-scoped, and auditable*. Prior work uses transferable rewards (e.g., Shapley values can be redistributed). OCC explicitly prevents laundering.
|
| 99 |
+
|
| 100 |
+
---
|
| 101 |
+
|
| 102 |
+
## 7. Reward Hacking / Anti-Gaming
|
| 103 |
+
|
| 104 |
+
### Closest Prior Art
|
| 105 |
+
- **DeepSeek-R1**: Avoids neural RMs entirely due to reward hacking.
|
| 106 |
+
- **ODIN (2402.07319)**: Disentangled reward mitigates hacking in RLHF.
|
| 107 |
+
- **Reward Under Attack (2603.06621)**: PRMs are hackable via adversarial optimization.
|
| 108 |
+
- **Sycophancy to Subterfuge (2406.10162)**: LLMs generalize from simple gaming to complex reward tampering.
|
| 109 |
+
- **MO-GRPO (2509.22047)**: Multi-objective GRPO with variance-based normalization.
|
| 110 |
+
|
| 111 |
+
### What OCC Borrows
|
| 112 |
+
The recognition that reward hacking is the central risk in RL for LLMs.
|
| 113 |
+
|
| 114 |
+
### What OCC Changes
|
| 115 |
+
Multiple anti-gaming mechanisms are *built into the system*:
|
| 116 |
+
1. Rule-based oracle (no neural RM)
|
| 117 |
+
2. Non-transferable credits
|
| 118 |
+
3. Decay prevents hoarding
|
| 119 |
+
4. Gaming detection in oracle (spam, verbose padding, confidence manipulation)
|
| 120 |
+
5. Broker escalation on suspicious patterns
|
| 121 |
+
|
| 122 |
+
---
|
| 123 |
+
|
| 124 |
+
## 8. Capability-Based Access Control
|
| 125 |
+
|
| 126 |
+
### Closest Prior Art
|
| 127 |
+
- **AgentGuardian (2601.10440)**: Learning access control from execution traces.
|
| 128 |
+
- **SAGA (2504.21034)**: Security architecture with cryptographic tokens.
|
| 129 |
+
- **Progent (2504.11703)**: Privilege control with DSL.
|
| 130 |
+
|
| 131 |
+
### What OCC Borrows
|
| 132 |
+
Capability-based access as a security primitive.
|
| 133 |
+
|
| 134 |
+
### What OCC Changes
|
| 135 |
+
Rights are *earned dynamically* based on verified impact, not statically assigned. An agent can earn retrieval rights but not file-write rights.
|
| 136 |
+
|
| 137 |
+
---
|
| 138 |
+
|
| 139 |
+
## Summary: Novelty Assessment
|
| 140 |
+
|
| 141 |
+
| Component | Novelty Level | Justification |
|
| 142 |
+
|-----------|-------------|---------------|
|
| 143 |
+
| Impact Oracle | Incremental | Multi-mode PRM with cost-adjustment and gaming detection |
|
| 144 |
+
| Credit Ledger | Moderate | Non-transferable + decaying + capability-scoped + provenance |
|
| 145 |
+
| Resource Broker | Incremental | Dynamic capability-based rights tied to credits |
|
| 146 |
+
| Cost-adjusted GRPO reward | Moderate | GRPO rewards are usually not compute-cost-aware |
|
| 147 |
+
| Cross-agent compute allocation | Moderate | Prior work allocates per-prompt or per-model, not per-agent |
|
| 148 |
+
| Anti-gaming as system property | Moderate | Integrated spam/hoarding/transfer detection |
|
| 149 |
+
|
| 150 |
+
**Not novel**: The individual ideas (PRMs, GRPO, debate, calibration) are well-established. The novelty lies in *integration*: a unified system where compute allocation, verification, credit accounting, and RL rewards are coupled.
|
| 151 |
+
|
| 152 |
+
**Publishable contribution**: A minimal open-source framework demonstrating that credit-based compute allocation can reduce test-time compute by 30-70% at iso-accuracy in controlled simulations, with built-in anti-gaming mechanisms.
|