SHIFT: Sigmoid-Based Heuristic Invertible Fitness-Landscape Transformation for Accelerating SBST

• URL: http://arxiv.org/abs/2604.09171v1
• Date: Fri, 10 Apr 2026 09:54:06 GMT
• Title: SHIFT: Sigmoid-Based Heuristic Invertible Fitness-Landscape Transformation for Accelerating SBST
• Abstract summary: SHIFT (Sigmoid-Based Heuristic Invertible Fitness-Landscape Transformation for Accelerating SBST) is a method designed to compress local landscapes and facilitate escape from stagnant regions without altering global semantics.<n>We show that sigmoid compression constitutes a lightweight yet effective mechanism for achieving more reliable coverage discovery in complex testing environments.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Search-Based Software Testing (SBST) automates test input generation but is frequently hindered by challenging fitness landscapes characterized by numerous deceptive local optima that impede search progress, as well as extended plateaus where informative fitness signals are scarce. To address this bottleneck, we propose SHIFT (Sigmoid-Based Heuristic Invertible Fitness-Landscape Transformation for Accelerating SBST), a method designed to compress local landscapes and facilitate escape from stagnant regions without altering global semantics. By systematically contracting dense regions where search points cluster, the approach preserves mapping invertibility while enabling optimization algorithms to traverse more effectively toward global coverage with the same step size. When evaluated against established baselines, including pure hill climbing and genetic algorithms, under a normalized experimental protocol, the proposed technique yields consistent improvements in convergence speed and search efficiency. These results demonstrate that sigmoid compression constitutes a lightweight yet effective mechanism for achieving more reliable coverage discovery in complex testing environments.

Related papers

• Rethinking Attention Locality in Spiking Transformers [50.00501275379363]
  Spiking Transformers provide a promising paradigm for efficient visual processing with spike-driven computation.<n>Their Softmax-free Spiking Self-Attention (SSA) struggles to establish spatially localized token interactions.<n>We propose Spatially Contiguous Local Attention with Boundary Continuity Pathway (SCLA-BCP)<n>Our approach improves mAP@50 by up to 9.50% on COCO on 2017 and mIoU by up to 3.42% on ADE20K.
  arXiv  Detail & Related papers  (2026-08-09T07:36:17Z)
• Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network [5.81838331663612]
  Mobile robot path planning methods are often constrained by vast search spaces, resulting in latency in samplingbased algorithms.<n>We present the Connectivity- Preserving Region Proposal Network (CP-RPN), a segmentationguided model designed to predict compact and topologically connected candidate regions.
  arXiv  Detail & Related papers  (2026-05-27T11:59:03Z)
• ViCrop-Det: Spatial Attention Entropy Guided Cropping for Training-Free Small-Object Detection [6.1221124436192875]
  ViCrop-Det is a training-free inference framework that introduces adaptive spatial trust region shrinkage.<n>We show that ViCrop-Det consistently adds +1-3 mAP@50 to RT-DETR-R50 and Deformable DETR with a marginal 20-23% latency overhead.<n>Under compute-matched settings, our adaptive routing strategy comprehensively surpasses uniform slicing baselines, achieving a highly optimized accuracy-speed trade-off.
  arXiv  Detail & Related papers  (2026-04-29T15:35:03Z)
• IoUCert: Robustness Verification for Anchor-based Object Detectors [58.35703549470485]
  We introduce IoUCert, a novel formal verification framework designed specifically to overcome these bottlenecks in anchor-based object detection architectures.<n>We show that our method enables the robustness verification of realistic, anchor-based models including SSD, YOLOv2, and YOLOv3 variants against various input perturbations.
  arXiv  Detail & Related papers  (2026-03-03T14:36:46Z)
• Event-based Visual Deformation Measurement [76.25283405575108]
  Visual Deformation Measurement aims to recover dense deformation fields by tracking surface motion from camera observations.<n>Traditional image-based methods rely on minimal inter-frame motion to constrain the correspondence search space.<n>We propose an event-frame fusion framework that exploits events for temporally dense motion cues and frames for spatially dense precise estimation.
  arXiv  Detail & Related papers  (2026-02-16T01:04:48Z)
• Renormalization Group Guided Tensor Network Structure Search [58.0378300612202]
  Network structure search (TN-SS) aims to automatically discover optimal network topologies and rank robustness for efficient tensor decomposition in high-dimensional data representation.<n>We propose RGTN (Renormalization Group guided Network search), a physics-inspired framework transforming TN-SS via multi-scale renormalization group flows.
  arXiv  Detail & Related papers  (2025-12-31T06:31:43Z)
• Efficient Global-Local Fusion Sampling for Physics-Informed Neural Networks [5.257115841810259]
  We propose a Global-Local Fusion (GLF) Sampling Strategy that combines the strengths of both approaches.<n>New collocation points are generated by perturbing training points with Gaussian noise scaled inversely to the residual.<n>To further reduce computational overhead, a lightweight linear surrogate is introduced to approximate the global residual-based distribution.
  arXiv  Detail & Related papers  (2025-10-28T03:10:54Z)
• Efficient Test-time Adaptive Object Detection via Sensitivity-Guided Pruning [73.40364018029673]
  Continual test-time adaptive object detection (CTTA-OD) aims to online adapt a source pre-trained detector to ever-changing environments.<n>Our motivation stems from the observation that not all learned source features are beneficial.<n>Our method achieves superior adaptation performance while reducing computational overhead by 12% in FLOPs.
  arXiv  Detail & Related papers  (2025-06-03T05:27:56Z)
• Fully Spiking Neural Networks for Unified Frame-Event Object Tracking [17.626181371045575]
  We propose the first fully Spiking Frame-Event Tracking framework called SpikeFET.<n>This network achieves synergistic integration of convolutional local feature extraction and Transformer-based global modeling within the spiking paradigm.<n>We show that proposed framework achieves superior tracking accuracy over existing methods while significantly reducing power consumption.
  arXiv  Detail & Related papers  (2025-05-27T07:53:50Z)
• Improved Bag-of-Words Image Retrieval with Geometric Constraints for Ground Texture Localization [1.2430809884830318]
  Ground texture localization using a downward-facing camera offers a low-cost, high-precision localization solution.<n>We present a significantly improved bag-of-words (BoW) image retrieval system for ground texture localization.
  arXiv  Detail & Related papers  (2025-05-16T18:37:18Z)
• ACMamba: Fast Unsupervised Anomaly Detection via An Asymmetrical Consensus State Space Model [51.83639270669481]
  Unsupervised anomaly detection in hyperspectral images (HSI) aims to detect unknown targets from backgrounds.<n>HSI studies are hindered by steep computational costs due to the high-dimensional property of HSI and dense sampling-based training paradigm.<n>We propose an Asymmetrical Consensus State Space Model (ACMamba) to significantly reduce computational costs without compromising accuracy.
  arXiv  Detail & Related papers  (2025-04-16T05:33:42Z)
• Locally Adaptive One-Class Classifier Fusion with Dynamic $\ell$p-Norm Constraints for Robust Anomaly Detection [17.93058599783703]
  We introduce a framework that dynamically adjusts fusion weights based on local data characteristics. Our method incorporates an interior-point optimization technique that significantly improves computational efficiency. The framework's ability to adapt to local data patterns while maintaining computational efficiency makes it particularly valuable for real-time applications.
  arXiv  Detail & Related papers  (2024-11-10T09:57:13Z)
• Exploiting Low-confidence Pseudo-labels for Source-free Object Detection [54.98300313452037]
  Source-free object detection (SFOD) aims to adapt a source-trained detector to an unlabeled target domain without access to the labeled source data. Current SFOD methods utilize a threshold-based pseudo-label approach in the adaptation phase. We propose a new approach to take full advantage of pseudo-labels by introducing high and low confidence thresholds.
  arXiv  Detail & Related papers  (2023-10-19T12:59:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.