Zhitong Cheng | Search arXiv

arXiv2026

SPBench: A Multi-Task Evaluation Benchmark for Exploration Seismic Processing

Exploration seismic processing underpins subsurface imaging and resource exploration, but learning-based methods remain difficult to compare across studies. Our survey of 368 papers finds widespread reliance on private or difficult-to-reproduce datasets, with only 25 providing public code. This obscures whether reported gains arise from model design or experimental settings. We introduce the Seismic Processing Benchmark (SPBench), covering six tasks: random noise attenuation, trace interpolation, ground-roll suppression, multiple suppression, deblending, and first-arrival picking. We reproduce 24 supervised methods on 10 datasets under 43 standardized settings and release datasets, implementations, configurations, evaluation scripts, and results. To complement global scores and per-trace pick errors, we introduce signal-component-resolved evaluation (SCoRE) for reconstruction and a reference-free ridge-curvature score (RC_norm) for first-arrival picking. Our analyses show that synthetic rankings do not reliably predict field rankings, with task-dependent agreement when models train within each setting. As degradation strengthens, rankings reorder more under coherent ground roll than under random-like interference. The ridge score agrees with MAE-based model rankings in the evaluated settings, with a mean Kendall correlation of 0.881 across three field surveys, while SCoRE reveals frequency- and energy-dependent differences hidden by global scores. SPBench provides a reproducible basis for comparing learning-based seismic processing methods and characterizes how their relative advantages vary across data settings, degradation strengths, and evaluation criteria.

physics.geo-ph↗

arXiv2026

Feature-Space Planes Searcher: A Universal Domain Adaptation Framework for Interpretability and Computational Efficiency

Domain shift, characterized by degraded model performance during transition from labeled source domains to unlabeled target domains, poses a persistent challenge for deploying deep learning systems. Current unsupervised domain adaptation (UDA) methods predominantly rely on fine-tuning feature extractors - an approach limited by inefficiency, reduced interpretability, and poor scalability to modern architectures. Our analysis reveals that models pretrained on large-scale data exhibit domain-invariant geometric patterns in their feature space, characterized by intra-class clustering and inter-class separation, thereby preserving transferable discriminative structures. These findings indicate that domain shifts primarily manifest as boundary misalignment rather than feature degradation. Unlike fine-tuning entire pre-trained models - which risks introducing unpredictable feature distortions - we propose the Feature-space Planes Searcher (FPS): a novel domain adaptation framework that optimizes decision boundaries by leveraging these geometric patterns while keeping the feature encoder frozen. This streamlined approach enables interpretative analysis of adaptation while substantially reducing memory and computational costs through offline feature extraction, permitting full-dataset optimization in a single computation cycle. Evaluations on public benchmarks demonstrate that FPS achieves competitive or superior performance to state-of-the-art methods. FPS scales efficiently with multimodal large models and shows versatility across diverse domains including protein structure prediction, remote sensing classification, and earthquake detection. We anticipate FPS will provide a simple, effective, and generalizable paradigm for transfer learning, particularly in domain adaptation tasks. .

cs.CV↗