- Rating
- 3
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper consdiers the Hadamard problem (maximum determinant binary matrix) focused on matrix sizes congruent with 3 modulo 4. The problem is of interest in the combinatorics and coding theory communities. The paper describes a reformulation of the problem as a sequence reconstruction by focusing on circulant matrices and setting up a sequence admissibility condition. The search for suitable sequences is implemented via reinforcement learning.
Critical strengths
The use of RL makes the paper tangentially relevant to ICLR. This approach to matrix construction allows for improvements over the state of the art, although it is not clear if the problem is fully solved.
The proposed approach is feasible for exhaustive search for small values of , and shows improvements over the state of the art results in the literature.
Critical weaknesses
The narrative on residual algebraic obstruction is not clearly laid out in the manuscript (only detailed in an appendix), but appears crucial to the work.
Some notation can be simplified, e.g., the Kronecker product of two column vectors can be written as a rank-one matrix .
Questions for authors
Can a definition of algebraically unobstructed residuals be given explicitly? Is it feasible to have it in the manuscript, or does it need to be relegated to an appendix? I was not able to find William Orrick's website or an archive of it. Can you be more explicit in your reference or provide an alternative source?
2 comments
Thank you.
Thank you for your response. I was expecting these issues to be easily addressed and my original assessment had taken this into account.
We thank the reviewer for a thorough review of our submission. Below we address the questions raised in the review.
Q1: Can a definition of algebraically unobstructed residuals be given explicitly?
We have added the definition directly in Section 3.1, where algebraically unobstructed was first introduced. Specifically, we define a residual r to be algebraically unobstructed if, for each divisor d>2 of m, there exists bd∈Kd whose field norm bd equals the projection of r into cyclotomic field Kd. We have also clarified that this formulation allows us to detect algebraic obstructions through finitely many local tests at each d, which are used for reward shaping later. The further details remain in Appendix E.
We thank the reviewer's suggestion of simplifying notation. We have replaced the Kronecker product j⊗j with jjT, and clarified several other notational conventions to improve clarity.
We also thank the reviewer for pointing out the access to William Orrick’s website. We have updated the citation to include an archived version of the website available through web.archive.org.
We hope that our reply addresses the questions you have highlighted in the review process.