SearcharxivSearch

arXiv subjects

Shuchang Wang

Publications and source records attributed to Shuchang Wang.

3 recordsLinked to original sources

Hierarchical Feature-level Reverse Propagation for Post-Training Neural Networks

End-to-end neural networks have become a dominant paradigm in autonomous driving, where reliable deployment requires controllable post-training adaptation and improved transparency of model updates. In this paper, we propose Feature-level Reverse Propagation for Post-Training (FR-PT), a hierarchical framework that provides explicit intermediate supervision for upstream modules by reconstructing label-conditioned features backward through frozen downstream networks. For the first time, we formulate feature reconstruction via the Computation Consistency Principle (CCP) and Minimum Deviation Principle (MDP), and develop efficient operator-specific reverse computation algorithms with MDP-centered Tikhonov regularization to handle numerically unstable inverse problems. Specifically, FR-PT incorporates circular convolution theorem-based solvers for scalable convolutional reconstruction, nearest embedding for constructing continuous output targets from categorical labels, and iterative reverse propagation for composite residual and Transformer-style blocks. Extensive experiments on image classification and autonomous driving tasks demonstrate effective and stable adaptation across diverse architectures. Among 85 post-training settings, FR-PT achieves statistically significant improvements over task-level baselines in 63 cases, while the matched backpropagation reference outperforms reconstruction-supervised configurations in only 4 cases. Additional efficiency, conditioning, and favorable-condition analyses characterize the reliability and limitations of reconstructed targets, while feature-response analyses further demonstrate their diagnostic value. Code is available at https://github.com/Dingni2000/FR-PT .

cs.CV

A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems

Search-based software engineering (SBSE) addresses critical optimization challenges in software engineering, including the next release problem (NRP) and feature selection problem (FSP). While traditional heuristic approaches and integer linear programming (ILP) methods have demonstrated efficacy for small to medium-scale problems, their scalability to large-scale instances remains unknown. Here, we introduce quantum annealing (QA) as a subroutine to tackling multi-objective SBSE problems, leveraging the computational potential of quantum systems. We propose two QA-based algorithms tailored to different problem scales. For small-scale problems, we reformulate multi-objective optimization (MOO) as single-objective optimization (SOO) using penalty-based mappings for quantum processing. For large-scale problems, we employ a decomposition strategy guided by maximum energy impact (MEI), integrating QA with a steepest descent method to enhance local search efficiency. Applied to NRP and FSP, our approaches are benchmarked against the heuristic NSGA-II and the ILP-based $ε$-constraint method. Experimental results reveal that while our methods produce fewer non-dominated solutions than $ε$-constraint, they achieve significant reductions in execution time. Moreover, compared to NSGA-II, our methods deliver more non-dominated solutions with superior computational efficiency. These findings underscore the potential of QA in advancing scalable and efficient solutions for SBSE challenges.

cs.SE

A Dataset And Benchmark Of Underwater Object Detection For Robot Picking

Underwater object detection for robot picking has attracted a lot of interest. However, it is still an unsolved problem due to several challenges. We take steps towards making it more realistic by addressing the following challenges. Firstly, the currently available datasets basically lack the test set annotations, causing researchers must compare their method with other SOTAs on a self-divided test set (from the training set). Training other methods lead to an increase in workload and different researchers divide different datasets, resulting there is no unified benchmark to compare the performance of different algorithms. Secondly, these datasets also have other shortcomings, e.g., too many similar images or incomplete labels. Towards these challenges we introduce a dataset, Detecting Underwater Objects (DUO), and a corresponding benchmark, based on the collection and re-annotation of all relevant datasets. DUO contains a collection of diverse underwater images with more rational annotations. The corresponding benchmark provides indicators of both efficiency and accuracy of SOTAs (under the MMDtection framework) for academic research and industrial applications, where JETSON AGX XAVIER is used to assess detector speed to simulate the robot-embedded environment.

cs.CV