OpenAI·AI Engineer·Technical Phone Screen
- You have an LLM solving a math problem where the time to a correct answer follows a known heavy-tailed distribution. You can abort and restart at any time, with each attempt drawing independently from the same distribution. Can you design a restart strategy that achieves a lower expected total time than just letting a single attempt run to completion?
- For a single-threshold restart strategy where you abort and restart whenever elapsed time exceeds a fixed threshold T, derive the expected total time as a function of T and find the value of T that minimizes it.
- Design a strategy that strictly outperforms the best single-threshold policy in terms of worst-case performance. You can consider a deterministic schedule of multiple restart thresholds or a randomized restart policy.
“The setup took me a minute to internalize.”