DEVLOG #23 - Random search was harder to beat than I expected
SL-LLM-R uses a structured search to find possible repairs after model mistakes, and I compare it against random repair ideas. I expected random search to be an easy baseline to beat, but it was surprisingly competitive under the same budget. The structured search still has to prove that its extra complexity is actually worth using.
Comments 0
No comments yet. Be the first!
Sign in to join the conversation.