4 ms·
As well. Someday costed opcodes and sharded redundancy for all of this; > No search needed because the problem is discrete and small. If an algorithm selects
by westurner 3mo ago
As well. Someday costed opcodes and sharded redundancy for all of this;
> No search needed because the problem is discrete and small.
If an algorithm selects according to rank, there's a cost/score/fitness/survival/error function (that assumes or imposes a distance metric to make a metric space).
Awhile back I had to match exterior paint to printed paint swatches and I'm stereotypically not good at colors, so finally I arrived at just A/B; this one or this one and discard.
- jarodrh 3mo ago> As well. Someday costed opcodes and sharded redundancy for all of this; Hmm, noted. > If an algorithm selects according to rank, there's a cost/score/fitness/survival/error function. - Yes, what I'm saying is that frugon has a small enough candidate pool that it can all be evaluated at the same time. It doesn't need to search through it. > Awhile back I had to match exterior paint to printed paint swatches and I'm stereotypically not good at colors, so finally I arrived at just A/B; this one or this one and discard. - This is exactly the shape the judge prompt takes in frugon. See: src/frugon/measure.py Then search: JUDGE_PROMPT_TEMPLATE