- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The author proposed a variable selection algorithm using a greedy algorithm and applied it to this time series prediction. From the experimental results, it can be seen that this method is quite good. However, in terms of the author's writing and presentation style, there is still room for improvement.
Critical strengths
- The author used the greedy algorithm to construct the optimization function, which is great.
- The experimental results indicate that this method significantly improves the efficiency of variable utilization.
Critical weaknesses
- Algorithm 1 in the main text describes the complete version of iterating through all actions one by one, but in reality, it runs a shortlist version of 4 actions per round, with multiple scores mixed together, making it impossible for readers to reproduce according to the main text.
- Although optimizing the problem into a greedy algorithm is good, the essence of the problem may not be a greedy algorithm problem, but a combinatorial optimization problem. Search only adds without subtracting, without deleting, swapping, or restarting. If you make a mistake in the early stages, you can never change it back.
- The pre-screening of Equation (18) only retains variables that are linearly related to the residuals, while the paper is most looking for variables that are not useful individually but are useful in combination. These types of variables will be screened out in the first step.
Questions for authors
- Can the author clearly write down the actual algorithm? The current algorithm itself and its actual implementation cannot be understood, and the author has not provided the code for implementation.
- If the optimal solution is to choose B first and then choose C, but according to the principle of greed, it may choose A first and then choose B, and then find that C has a negative effect. This algorithm cannot avoid this problem, we cannot determine whether greed can reach a relatively optimal state, and the author does not compare where the upper bound of the algorithm is.