- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper considers an online learning problem with square loss (hence called online least squares) in the “deterministic” setup where the learner is compared to a linear comparator class. A learning algorithm based on dyadic Gaussian exponential weighting is proposed and an upper bound on the regret is obtained. There is also a matching lower bound for the scalar case.
Critical strengths
The paper studies an interesting problem. An upper and a lower bound (though only matching for the scalar case) are proposed, and the proposed algorithm seems to be quite efficient.
Critical weaknesses
My biggest concern is that this paper is quite hard to follow, I give a few examples below
-
the paper discusses "segment-start cost" several times in prominent places (abstract/contribution section), but I failed to find a proper definition of this quantity and I don’t believe this is a well-known term. For me, it is only implicitly mentioned in Theorem A.2 and some other places in the Appendix.
-
in Section 4 where the algorithm is described. Three main parts (“lifetime schedule”, “conjugate core”, “representation gates”) are introduced. But these terms are not properly defined and explained. From the algorithm and other parts of section 4 I can partially infer what they mean. But the presentation overall is very confusing.
-
before Theorem 1, the parameter \sigma is introduced (which is later used in Theorem 1) in the sentence “set …. \sigma^2 I_d in the transfer theorem”. What is the transfer theorem? I can’t find it.
some other questions
-
when defining the regret, the comparator sequence takes the form u_t^Ta_t. How much do the results depend on the fact that the output of the comparator is a linear function of a?
-
I’m not sure if the paper has substantial novelty. It seems that the dyadic Gaussian EW is not new, and it has already been applied to the online learning problem. So it seems that the novelty mainly comes from the fact that the fast regret can be achieved with a more efficient algorithm (demonstrated in the numerical part)? I think it would be more useful to articulate the contribution more clearly, in the context of existing literature.
Questions for authors
see the weakness section
Author–Reviewer Discussion reminder
Dear reviewers,
Thank you all for your service to ICLR 2027. The author–reviewer discussion period is coming to an end. Could you please confirm if the authors' replies have resolved your questions?
Best regards,
AC