- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper investigates efficient continual code retrieval, where different versions of the same code may share reusable representations and indexing structures. The authors introduce CODECONTINUUM-R, a benchmark that simulates code changes. Building on the observation that sparse representations naturally exhibit high neuron overlap across code revisions, they introduce two regularization objectives to encourage shared active neurons and consistent activation ordering across versions. Experiments on Jina-Code and Qwen3-Embedding backbones demonstrate that the proposed method improves representation stability, reduces index memory consumption, and enhances multi-stage retrieval under limited routing budgets, while largely preserving retrieval accuracy.
Critical strengths
Using a Sparse AutoEncoder for retrieval is quite popular recently. This paper provides a good perspective on how version changes of the same code block affect SAE's activated neurons. The paper highlights the potential of exploiting sparse representation consistency to improve indexing efficiency in continuously evolving codebases.
Critical weaknesses
One critical concern for me is the application scenarios for this paper. In this paper, the author assumes that the old and new versions of the same code will exist in the codebase at the same time. But in software development, developers often overwrite the old code.
Questions for authors
During rebuttal, I expect the authors to justify the application scenarios of their studied research questions. Once convincing, I will definitely increase my score.
3 comments
I thank the authors for their responses, and I am sorry for the late reply. My concern for the application scenario is well addressed. Thus, I will raise my score.
Dear Reviewer Eb9E:
We sincerely thank you for your thoughtful feedback and for taking the time to reconsider our work. We are glad that our clarification has addressed your concern regarding the practical application scenarios. We greatly appreciate your constructive comments and support.
Authors
We thank Reviewer
Eb9Efor recognizing the value of sparse representation consistency and its indexing benefits. We acknowledge the concern that developers often overwrite previous implementations. We clarify that our work targets revision-retaining retrieval, including multi-branch, multi-release, and historical code search, supported by real-world Git revisions and system-level indexing evaluations.W1 & Q1: What are the practical application scenarios that justify the coexistence of multiple code versions in real-world software development?
A1: We thank the reviewer for raising this important concern. We agree that developers often overwrite old code in the working tree. However, our work targets retrieval settings where multiple revisions need to remain accessible, particularly:
Our experiments support this setting::
Table I: Sparse Representation Reuse Across Real-World Git Revisions.
Table II: Storage Efficiency and Retrieval Performance of Revision-Aware Indexing with Seismic.
We have clarified these application scenarios and the scope of our assumptions in Sections 1 and 2.1 of the revised paper. We further highlight the practical indexing benefits in Section 5.3, supported by real-world Git revision analysis (Appendix D.3, Table 16) and Seismic-based system evaluation (Appendix E.3, Table 19).
We sincerely thank Reviewer
Eb9Efor the valuable feedback. We have provided additional clarifications that directly address the points raised, and have incorporated these improvements into the revised submission. If the reviewer finds the revisions helpful, we would greatly appreciate a reconsideration of the rating. We are truly grateful for your time and thoughtful evaluation.