- Rating
- 2
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes ASM-RISE, a framework for learning to acquire and interpret program evidence under explicit budget constraints. To address the problem that key semantic information in assembly programs is distributed across different code regions, the authors first construct a structured evidence acquisition environment and formulate assembly understanding as a question-specific program evidence acquisition task under budget constraints. They then develop a training framework combining supervised fine-tuning and agentic reinforcement learning, enabling the model to autonomously select the program evidence to acquire, adjust subsequent investigation actions based on intermediate observations, and complete semantic understanding tasks within a limited budget. The authors conduct extensive experiments covering multiple tasks across three model families, Qwen2.5-Coder, Qwen3, and DeepSeek-Coder, and evaluate the learning gains, adaptivity, budget sensitivity, and complementary capabilities of the models and their variants.
Critical strengths
-
Key semantic information in assembly programs may be distributed across different basic blocks, function calls, and data dependencies. How to effectively locate and acquire evidence relevant to the current question is a reasonable research problem with practical value.
-
The authors construct a unified structured evidence acquisition environment that explicitly defines different evidence types, operation scopes, interaction procedures, and budget constraints, and integrate trajectory supervision and agentic reinforcement learning into a unified training framework.
Critical weaknesses
-
One important contribution of this paper is the combination of SFT and agentic reinforcement learning to train the model's evidence acquisition and semantic understanding capabilities. However, existing studies have already explored reinforcement learning for multi-turn tool use and adaptive information acquisition, such as ToolRL, ReTool, and AutoSearch. The authors have not sufficiently clarified the incremental contributions of this work compared with existing methods.
-
The authors compare three Qwen policies to evaluate the value of adaptive evidence acquisition, but the analysis mainly focuses on performance results and lacks an analysis of the model's own investigation behavior. Although Section 3.4 presents an example of adaptive evidence acquisition, the experimental analysis remains insufficient. Additional experiments to validate the underlying mechanism could examine whether the model has truly learned to adaptively change its next investigation location based on newly acquired evidence, and whether such adjustments help the model acquire more useful evidence and improve the quality of its final answers. This would provide more direct support for the paper's central conclusion regarding adaptive evidence investigation. In addition, the budget is quantified using manually defined costs, without comparing actual tool usage, token consumption, or latency across methods. Although acknowledged in Section 6, reporting these statistics would help demonstrate the practical value of the budget constraints.
Questions for authors
-
Could the authors further compare ASM-RISE with existing methods such as ToolRL, ReTool, and AutoSearch, and clarify the incremental contributions of this work over these methods?
-
I noticed that the baseline results in Table 2, except for Qwen3, are identical to those reported in Table 2 of the ASMA-Tune paper. However, the two papers report these results using Recall@1 and MRR, respectively. Could the authors confirm whether these two metrics have been confused?
-
Could the authors provide additional experimental analyses of the model's own investigation behavior?
-
If possible, could the authors provide statistics on tool usage, token consumption, and inference latency across different policies, and further analyze the relationship between the proposed method's performance and its actual runtime costs?
Response to Reviewer 4EFq
Thank you for your thoughtful feedback. We have incorporated the additional experiments and clarifications into the revised manuscript, with changes in the main text highlighted in blue.
Full denotes A-RL; Original denotes Qwen3.5-122B-A10B-FP8; DS denotes DeepSeek-V4.1-Flash-1017; GLM denotes GLM-5.3-Flash.
Q1
ASM-RISE builds on SFT and tool-use RL. Its contribution is learning which static program view and location to inspect, and when the evidence suffices to answer. ToolRL studies rewards for tool selection/application; ReTool learns reasoning interleaved with code execution; AutoSearch learns retrieval depth. ASM-RISE instead combines typed, scoped program evidence, heterogeneous access prices, and an objective linking semantic quality to grounding, evidence utility, and cost (Section 2).
PlanOnceFrozen uses Full's weights and initial information to generate a question-conditioned plan before any tool outputs, then executes it without revision. This control and the reward ablations test adaptive acquisition and the evidence-aware objective (Section 5.5). Full exceeds QualityOnly under all three judges while reducing tokens by 25.1% and evidence cost by 19.9%. This method-level comparison clarifies our research focus, supported by controlled assembly experiments.
Q2
Thank you for catching this error. We apologize: an incorrectly defined metric-label variable displayed Recall@1, and we failed to catch it in the compiled manuscript. Our 0.3355 and the published ASMA-Tune reference of 0.257 are both MRR. ASMA-Tune's normalized Recall@1 is not the quantity used in this comparison. The revised Section 4.2 and Table 2 state MRR; Appendix D identifies the published aggregate.
Source: ASMA-Tune, Table 2 and Section 5.1.
Q3
PlanOnceFrozen uses Full's trained checkpoint, question, initial information, and test budget. It generates the complete tool-and-scope plan before seeing any tool outputs, then executes it without replanning. All methods use the same 200 tasks from 100 source functions at each budget in {1, 2, 3, 5}, with budgets weighted equally.
Each quality score is an integer grade from 0 to 4 divided by four. Failed answers remain in the fixed denominator with score zero; independent-judge scores are reported separately.
In the recorded observation replay, Full receives symbols including fgetws and system, inspects bb_22 (a buffer-capacity check), and identifies command-execution risk. PlanOnceFrozen executes its preselected CFG-summary and symbol requests, but its answer omits that risk.
A separate same-state control selects cfg_block at bb_22 when the first observation is visible, versus function-level cfg_summary when masked. This tests observation-dependent action selection; the matched comparison below measures overall quality. Figure 4 in the revised manuscript shows the traces and control; Appendix F gives case details.
Full exceeds PlanOnceFrozen by 0.1028/0.0787/0.1563 despite matched weights, initial information, and budget (Section 5.5; Appendix G.1). The complete reward also improves downstream retrieval: Full's MRR is 0.3355, versus 0.2774 for QualityOnly and 0.30514 for NoCost, with the retriever and candidate pools fixed (Appendix G.3).
The case starts from 40 of 90 assembly lines at budget 3. Full and PlanOnceFrozen receive GLM scores of 1.00 and 0.75, and DS scores of 0.75 and 0.50. The inspected block checks remaining buffer capacity, not command contents; the frozen answer mentions execution and stack-canary protection but omits injection risk.
The case costs 1.5 evidence units for Full and 1.0 for the plan.
Q4
Table 10 reports actual resource use:
Compared with PlanOnceFrozen, Full uses 29.4% more tokens and 4.5% more evidence cost, with 41.9% greater median recorded latency, alongside higher quality under every judge. Relative to QualityOnly, Full instead reduces tokens by 25.1% and cost by 19.9% while improving quality. Thus, adaptation buys higher quality, while the complete reward improves resource use within the adaptive setting. Cost sums the prices of executed evidence requests.
Against NoCost, Full also reduces tokens by 21.2% and evidence cost by 16.5%, with higher quality under all three judges.
Thank you again for your thoughtful feedback. We welcome any remaining questions about the revised results.