2 ms·

> Oracle routing is a method for measuring the best theoretical performance by running the task through each model and then picking the cheapest correct option

> Oracle routing is a method for measuring the best theoretical performance by running the task through each model and then picking the cheapest correct option (the cost/performance ceiling). Their "router" is an oracle reference point where they choose the lower cost model after running both and therefore knowing who passed the test. The cost savings part is only Fireworks theorizing what would happen if an equivalent predicting router exists. That's a big if.

robthompson2018 4mo ago
The way they published this is baffling to me... surely you can try to implement some router and then see how well it does. Using an Oracles makes the whole writeup so much less interesting.
- Lalabadie 4mo ago
  But then that becomes an article about the performance of your draft router. This one is about the fact that there's this level of optimization potential.
  - slickytail 4mo ago
    [dead]
andsoitis 4mo ago
> running the task through each model and then picking the cheapest correct option What system knows what the correct option is and how does it know it?
- crazylogger 4mo ago
  Certainly sounds like a "P vs NP" style conjecture that shouldn't be possible in practice, save for certain generalizations, such as "this is a cybersecurity task, we know Fable will refuse (and score zero), so we just route to K3".
  - beng-nl 4mo ago
    I agree: it feels to me that judging this implies knowing whether there is a solution at all (or a solution available per model, example: whether either model will answer it given known guardrails), which is as powerful as answering the question in the first place (the router can answer the decision problem, which can polynomially be transformed into getting a specific solution). It reminds me of someone I met at a poster session who had an incredible project: his ai could include a confidence score with its answer, and he had evidence that x% confident answers were in fact correct x% of the time. That also gave me the gut feeling of that being impossible (in the general case) as it implies more powerful capability than the ai answering the question, in an oracle like way.
  - nickysielicki 4mo ago
    P vs NP?! What?
- asimpletune 4mo ago
  [dead]

robthompson2018 4mo ago

The way they published this is baffling to me... surely you can try to implement some router and then see how well it does. Using an Oracles makes the whole writeup so much less interesting.

Lalabadie 4mo ago
But then that becomes an article about the performance of your draft router. This one is about the fact that there's this level of optimization potential.
- slickytail 4mo ago
  [dead]

andsoitis 4mo ago

> running the task through each model and then picking the cheapest correct option What system knows what the correct option is and how does it know it?

crazylogger 4mo ago
Certainly sounds like a "P vs NP" style conjecture that shouldn't be possible in practice, save for certain generalizations, such as "this is a cybersecurity task, we know Fable will refuse (and score zero), so we just route to K3".
- beng-nl 4mo ago
  I agree: it feels to me that judging this implies knowing whether there is a solution at all (or a solution available per model, example: whether either model will answer it given known guardrails), which is as powerful as answering the question in the first place (the router can answer the decision problem, which can polynomially be transformed into getting a specific solution). It reminds me of someone I met at a poster session who had an incredible project: his ai could include a confidence score with its answer, and he had evidence that x% confident answers were in fact correct x% of the time. That also gave me the gut feeling of that being impossible (in the general case) as it implies more powerful capability than the ai answering the question, in an oracle like way.
- nickysielicki 4mo ago
  P vs NP?! What?
asimpletune 4mo ago
[dead]