Datasets:
Five figures: the latency frontier, the per-type matrix, knapsack, the advantage chart, and cost
Browse files- README.md +29 -1
- accuracy-vs-cost-11.png +3 -0
- advantage.png +3 -0
- by-decision-type.png +2 -2
- knapsack.png +3 -0
README.md
CHANGED
|
@@ -58,7 +58,7 @@ All nine systems on all 1,710 questions, 90 per decision type.
|
|
| 58 |
| `deepseek-v4.1-flash` | 0.511 | ~4 | ~800 ms |
|
| 59 |
| `deepseek-v4-pro` | 0.470 | ~4 | ~900 ms |
|
| 60 |
| `this-that-model-1.0` | 0.406 | 0 | 30.9 ms |
|
| 61 |
-
| `laya-typed-decisions` | 0.310 | 0 | **
|
| 62 |
| chance | 0.258 | — | — |
|
| 63 |
|
| 64 |
## By decision type
|
|
@@ -87,6 +87,34 @@ All nine systems on all 1,710 questions, 90 per decision type.
|
|
| 87 |
| `but_for_cause` | 0.200 | 1.000 | 1.000 | 0.944 | 1.000 | 0.967 | 0.711 | 0.733 | 0.411 | 0.467 |
|
| 88 |
| `value_of_information` | 0.050 | 1.000 | 1.000 | 1.000 | 0.844 | 1.000 | 0.944 | 0.922 | 0.689 | 0.033 |
|
| 89 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 90 |
## What the table says that the ranking does not
|
| 91 |
|
| 92 |
**One decision type defeats almost everything.** On `knapsack_subset` — choose the group that fits
|
|
|
|
| 58 |
| `deepseek-v4.1-flash` | 0.511 | ~4 | ~800 ms |
|
| 59 |
| `deepseek-v4-pro` | 0.470 | ~4 | ~900 ms |
|
| 60 |
| `this-that-model-1.0` | 0.406 | 0 | 30.9 ms |
|
| 61 |
+
| `laya-typed-decisions` | 0.310 | 0 | **28.5 ms** |
|
| 62 |
| chance | 0.258 | — | — |
|
| 63 |
|
| 64 |
## By decision type
|
|
|
|
| 87 |
| `but_for_cause` | 0.200 | 1.000 | 1.000 | 0.944 | 1.000 | 0.967 | 0.711 | 0.733 | 0.411 | 0.467 |
|
| 88 |
| `value_of_information` | 0.050 | 1.000 | 1.000 | 1.000 | 0.844 | 1.000 | 0.944 | 0.922 | 0.689 | 0.033 |
|
| 89 |
|
| 90 |
+
## One decision type defeats almost everything
|
| 91 |
+
|
| 92 |
+

|
| 93 |
+
|
| 94 |
+
`knapsack_subset` asks for the group of items that fits a budget and maximises value. Greedy
|
| 95 |
+
selection fails on it about half the time, so it cannot be answered by taking the best-looking
|
| 96 |
+
option. Eight of the nine systems land between 0.067 and 0.267 against a chance rate of 0.084. The
|
| 97 |
+
ninth is 1.88 B parameters and returns no tokens.
|
| 98 |
+
|
| 99 |
+
## Where a small model wins and where it does not
|
| 100 |
+
|
| 101 |
+

|
| 102 |
+
|
| 103 |
+
Each bar is `this-that-model-1.1` minus the better of `claude-opus-5` and `gpt-5.6` on that decision
|
| 104 |
+
type. Four types go the small model's way, two are a tie at 1.000, and three more are inside a tenth.
|
| 105 |
+
The nine that go the other way are worth as much attention: judging that a state does not contain
|
| 106 |
+
enough to decide (−0.389) and iterating a cascade to its fixed point (−0.300) are where the gap is
|
| 107 |
+
widest.
|
| 108 |
+
|
| 109 |
+
## What one decision costs
|
| 110 |
+
|
| 111 |
+

|
| 112 |
+
|
| 113 |
+
The horizontal axis is not like for like and the chart says so: a hosted system's figure is its
|
| 114 |
+
published price, which must cover serving and margin; ours is electricity at 80 W and $0.30/kWh for
|
| 115 |
+
the 30.9 ms the card is busy. Read the distance as one order of magnitude rather than five. What it
|
| 116 |
+
does show is that one of these is a rounding error on a machine you already own.
|
| 117 |
+
|
| 118 |
## What the table says that the ranking does not
|
| 119 |
|
| 120 |
**One decision type defeats almost everything.** On `knapsack_subset` — choose the group that fits
|
accuracy-vs-cost-11.png
ADDED
|
Git LFS Details
|
advantage.png
ADDED
|
Git LFS Details
|
by-decision-type.png
CHANGED
|
Git LFS Details
|
|
Git LFS Details
|
knapsack.png
ADDED
|
Git LFS Details
|