4 ms·
Amateur question: is there a point possible where a llm is using less compute power to calculate a certain formula compared to regular computation?
by holoduke 2y ago
Amateur question: is there a point possible where a llm is using less compute power to calculate a certain formula compared to regular computation?
- logicchains 2y agoWhen the LLM knows how to simplify/solve the formula and the person using it doesn't, it could be much more efficient than directly running the brute-force/inefficient version provided by the user. A simple example would be summing all numbers from 0 to a billion; if you ask o1 to do this, it uses the O(1) analytical solution, rather than the naive brute-force O(n) approach.
- stevesimmons 2y agoThough even in this case, it is enormously more efficient to simply sum the first billion integers rather than find an analytic solution via a 405b parameter LLM...
- piotr93 2y agoYes an llm could do it since it can predict the next token for pretty much anything. But what's the error margin you are ready to tolerate?