- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper proposes an original idea: can we use an evolution framework to have LLMs write Python functions that converge to a best estimate for various timeseries-related tasks. They use OpenEvolve, various LLMs, handwritten prompts, and 3 different tasks: temporal point processes, Markov Jump Processes, time series imputation.
The approach sounds interesting (at least to me), the experimental design is sound, the paper is clearly written with good figures and a lot of data, and the findings are convincing. In my assessment, it is a solid paper, but I am not sure it is significant and substantial enough to warrant publication at ICLR. More comments below.
Critical strengths
- interesting approach (wrapping LLMs in an evolution search loop), which seems extendable to a broader class of problems
- compelling results, especially pertaining to the MJP
- good presentation overall, and the authors clearly care about making their contribution useful to the community; for example, I appreciate Appendix I: Applying EVIL to a New Problem.
Critical weaknesses
The main weakness I see is that I am not sure the setting of time series prediction/interpolation makes a very strong case for the more general, and in my view more interesting, framework of LLM-guided evolutionary search. In particular, the authors present a lot of results, and very detailed experiments (which is good), but I regret that they don't discuss in more depth the broader implications of their methodology and findings. The conclusion is just a few lines. In its current form, this paper seems more suited for a workshop (more narrow in scope) than for the general ICLR conference.
Questions for authors
See weaknesses. Also, could you clarify your setup, as described in Appendix K? I don't understand how the "weighted ensemble" of LLMs is created and assessed.