- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes ML-QTrack, a learning-guided global optimization framework for charged-particle track reconstruction in high-energy physics. The method combines metric-learning-based candidate graph construction, LightGBM-based graph purification, and trajectory-level Quadratic Unconstrained Binary Optimization. A post-optimization refinement stage further resolves duplicate and fragmented trajectories. Experiments on the TrackML benchmark show that ML-QTrack achieves 98.1% reconstruction efficiency and a 6.87% fake rate in the full-event, full-detector setting, substantially reducing the fake rate compared with an HGNN-based baseline. The paper also provides component ablations, comparisons across different detector configurations, and runtime analyses demonstrating second-scale event reconstruction.
Critical strengths
S1. The combination of learning-based graph purification and global optimization is well motivated. ML-QTrack addresses the complementary limitations of learning-based tracking and combinatorial optimization. Using LightGBM to reduce the candidate hypothesis space before QUBO optimization provides a practical approach to improving computational efficiency while preserving reconstruction quality.
S2. The experimental results are encouraging under realistic full-detector conditions. ML-QTrack achieves 98.1% reconstruction efficiency and reduces the fake rate from 36.71% to 6.87% compared with HGNN in Table 4. The results are particularly interesting because the method operates on full events covering both barrel and endcap detector regions, rather than relying only on simplified detector configurations.
Critical weaknesses
W1. The contribution of the trajectory-level refinement stage is not sufficiently examined. Section 3.3 introduces a post-optimization refinement procedure to resolve duplicate trajectories and reconnect fragmented segments. However, the ablation in Table 1 mainly focuses on graph purification and global optimization, without separately evaluating the refinement stage. Since duplicate suppression and fragment recovery can directly affect reconstruction efficiency and fake rate, it is unclear how much of the final improvement comes from QUBO optimization versus this additional post-processing procedure. An ablation comparing reconstruction results before and after trajectory refinement would help clarify their individual contributions.
W2. The solution quality of the QUBO optimization is not sufficiently evaluated. Section 3.2 employs simulated bifurcation to solve the trajectory-level QUBO problem, while Appendix D specifies a fixed configuration of 300 iterations and 10 parallel trajectories. However, the paper does not examine how closely the resulting solutions approximate the QUBO optimum or how reconstruction performance changes with the solver's computational budget. Although Table 1 demonstrates improvements over greedy selection, it remains unclear whether the reported performance is limited by the QUBO formulation or the heuristic solver. An analysis of solution quality and convergence under different solver budgets would help clarify the effectiveness and reliability of the proposed global optimization approach.
Questions for authors
Q1. What is the individual contribution of the trajectory-level refinement stage? Could the authors report reconstruction efficiency and fake rate before and after duplicate merging and fragment recovery?
Q2. How sensitive are the reconstruction results to the simulated bifurcation solver's iteration count and number of parallel trajectories? Could the authors provide convergence analyses or compare solution quality against a stronger solver on smaller QUBO instances?
Quantifying Trajectory Refinement Contributions and bSB Solution Quality
We thank the reviewer for recognizing our learning-guided QUBO approach. We have added controlled refinement ablations and solver-quality experiments to address both concerns.
Q1. Contribution of trajectory refinement
Revision (§§3.3 and 4.3, Table 1). We compare reconstruction before and after refinement, keeping purification and QUBO selection fixed. Truth-assisted duplicate-hit removal serves as a diagnostic control.
On full inputs, refinement improves efficiency by 14.31 percentage points and reduces the fake rate by 24.17 points, while gains after deduplication are much smaller (+0.29 / −0.31 points). This indicates that same-layer hit multiplicity contributes substantially to the ambiguities addressed by refinement.
QUBO globally selects inter-layer triplet hypotheses, whereas refinement resolves duplicate and fragmented trajectories not directly modeled by QUBO. Under identical refinement settings, QUBO outperforms Greedy both before (83.40% / 30.28% vs. 74.86% / 37.12%) and after refinement (97.71% / 6.11% vs. 94.24% / 7.53%), demonstrating complementary contributions. Appendix H details the recovery criteria; the ablation measures the combined refinement stage.
Q2. Solver-budget sensitivity and solution quality
Revision (Appendix F). We added budget sensitivity experiments on 20 fixed event-level QUBOs and exact-optimum comparisons on 400 connected components. Both use truth-assisted deduplication without refinement to isolate QUBO optimization.
Solver-budget sensitivity. Candidate graphs, QUBO coefficients, decoding, and evaluation remain fixed.
neal, 10 readsIncreasing iterations from 100 to 300 substantially improves energy and reconstruction quality. From 300 to 1000, mean energy decreases by another 45.2, but efficiency improves by only 0.04 points and fake rate by 0.09 points. Batch sizes yield comparable tracking performance. Thus, 300 iterations offer a practical quality–budget trade-off, although further optimization remains possible.
The
nealcontrol achieves slightly higher efficiency but worse fake rate and QUBO energy than bSB300. Its computational budget is not matched, so this is an alternative-solver reference rather than a claim of universal superiority.Exact-optimum comparison. We exhaustively enumerated 400 complete QUBO connected components, selecting the 20 largest eligible components (at most 20 variables) per event. Complete components preserve all couplings.
neal, 10 readsIncreasing the bSB budget raises exact-optimum success from 71.5% to 90.3%, compared with 56.0% for
neal. These results establish solution quality on tractable components, not global optimality for full-event QUBOs.Together, the experiments support bSB with 300 iterations and 10 parallel trajectories as a practical configuration, while showing that larger budgets improve optimization quality with diminishing reconstruction gains.