Search arXiv⌕ Search

arXiv subjects

Xia Li

Publications and source records attributed to Xia Li.

At least 19 recordsLinked to original sources
arXiv2026

Breadth Beats Depth: Improving GCG-Based Jailbreak Optimization with Breadth-Oriented Suffix Search

Optimization-based jailbreak attacks such as Greedy Coordinate Gradient (GCG) achieve strong effectiveness and transferability by optimizing adversarial suffixes on white-box source models. However, existing GCG-based methods rely on averaged adversarial loss and deep greedy search, which can over-emphasize easy-to-jailbreak behaviors and overlook promising regions of the suffix space. We propose BOSS, a plug-and-play framework that improves GCG-based jailbreak optimization through breadth-oriented suffix search. BOSS uses Tail-Focused Adversarial Loss (TFAL), standard source loss, and behavior coverage to select terminal suffixes, then explores multiple short trajectories and selectively continues promising suffixes. Experiments on public benchmarks show that BOSS improves attack success rates across multiple GCG-based methods while reducing optimization time.

cs.CL↗
arXiv2026

Portable surrogate-free 4D MRI from standard fast multi-slice 2D MRI via implicit neural representations

Four-dimensional MRI (4D MRI) characterizes respiratory organ motion, yet existing reconstruction pipelines are tightly coupled to specific acquisition platforms (e.g., non-Cartesian trajectories with self-gating, vendor-specific navigators, or external respiratory hardware), limiting broad adoption across diverse clinical and research settings, including low-field, open-bore, and non-supine imaging. We present SIMPLE-4D (Surrogate-free, IMplicit, PortabLE 4D MRI), a software-first portable workflow that operates entirely on reconstructed slices from standard fast multi-slice 2D MRI and requires no pulse-sequence modification, no non-Cartesian trajectory, no navigator, and no external hardware. SIMPLE-4D combines an acquisition-agnostic front end consuming standard 2D protocols, a surrogate-free variational motion encoder that extracts a compact motion code directly from each 2D slice, and a physics-aware continuous spatio-temporal reconstruction based on a hash-encoded implicit neural representation (INR) with a SIREN deformation network producing bidirectional cycle-consistent DVFs and motion-dependent Gauss-Legendre thick-slice quadrature. Bidirectionality yields a complete inter-frame motion model by composition, supporting downstream tasks such as dose accumulation without retraining. We validate the identical pipeline on two contrasting datasets: a 1.5 T clinical bSSFP dataset (5 volunteers, 3 sessions each) and a 0.5 T open-bore HASTE dataset (5 volunteers, supine and upright). To our knowledge, this is the first per-frame 4D volumetric respiratory MRI reconstruction on a weight-bearing upright open-bore low-field scanner from reconstructed 2D Cartesian slices alone. On low-field data the INR template additionally acts as an implicit denoiser, yielding +132% SNR. Systematic ablations isolate each component's contribution.

physics.med-ph↗
arXiv2026

Causal-Privacy Audit Workflow for Synthetic and Distilled Data in Dropout Support

Synthetic and distilled student data are increasingly used to enable privacy-conscious learning analytics, yet their suitability for decision-facing institutional support remains uncertain. In dropout support, generated data must preserve not only predictive utility or distributional resemblance, but also the financial-status evidence used to guide advising, payment-plan assistance, and scholarship-related decisions. Method: This study introduces CaP-Eval, a decision-facing causal-privacy audit workflow for evaluating generated student data under a fixed estimand, timing-aware adjustment design, estimator set, and empirical privacy-governance screen. The workflow compares original, distilled, adversarial synthetic, statistical synthetic, and DPGNet privacy-oriented generated data on predictive utility, treatment-effect fidelity, robustness to alternative estimators, and local training-record proximity. Results: DPGNet and distilled data preserved the original financial-status treatment-effect structure more reliably than the adversarial and Gaussian Copula baselines. DPGNet preserved full direction and rank agreement across epsilon levels; epsilon = 10 produced the smallest non-original IPW and DML deviations, while epsilon = 1 and epsilon = 5 amplified several financial-status contrasts. Distilled data remained highly faithful but retained the strongest local training-record proximity signal. TabularGNet preserved qualitative directions with moderate attenuation, and Gaussian Copula compressed effect magnitudes. Conclusions: Predictive utility, privacy orientation, empirical disclosure signals, and causal fidelity diverged; generated student data require joint audits of direction, magnitude, overlap, and release-governance risk before decision use.

cs.LG↗
arXiv2026

Edge-directed geometric partitioning for versatile video coding

To improve the coding performance, geometric partition (GEO) was proposed for the upcoming VVC standard. GEO provides 140 partition candidates. The index of optimal GEO mode needs to be signaled explicitly. Considering different structural characteristics of different CUs and the correlation between spatial adjacent blocks and temporal collocated blocks, we propose a GEO mode prediction strategy by constructing a Most Probable Mode (MPM) list to reduce the overhead of GEO index and improve coding efficiency. Based on the observation of the high correlation between the partition mode and object boundaries, an edge-directed geometric partition scheme is proposed to construct the MPM list according to spatio-temporal edge information. The proposed method provides an objective BD-rate gain of 0.58% and 1.00% on average for RA and LDB configurations compared to VTM-6.0. Besides, it also promotes the visual quality of object boundaries.

cs.CV↗
arXiv2026

Forget Less, Generalize More: Unifying Temporal and Structural Adaptation for Dynamic Graphs

Representation learning on dynamic graphs requires capturing complex dependencies that evolve across both time and structure. Existing approaches typically adopt fixed temporal decay schemes or predetermined structural propagation depths, limiting their ability to generalize across graphs with diverse interaction frequencies and topological characteristics. We propose Dual-Scale Retentive Dynamics (DSRD), a unified framework that maintains a retentive representation state encoding both temporal memory and structural context. DSRD introduces two key components: (i) a retentive state with dual-scale adaptation that jointly models temporal dynamics and structural propagation within a single recurrent formulation, and (ii) adaptive decay kernels with learnable time-sensitivity parameters that automatically balance short-term responsiveness and long-term retention based on the underlying interaction patterns. We provide theoretical analysis establishing the equivalence between event-wise parallel aggregation and efficient recurrent state updates, as well as stability and boundedness guarantees for the learned dynamics. Extensive experiments on 14 real-world benchmarks demonstrate that DSRD consistently achieves state-of-the-art performance on both link prediction and node classification tasks, with strong generalization across transductive and inductive settings.

cs.LG↗
arXiv2026

Multiple populations detection with the Chinese Space Station Survey Telescope main survey camera

Multiple stellar populations (MPs), characterized by star-to-star light-element abundance variations, are ubiquitous in globular clusters (GCs). Spectroscopy directly reveals these anomalies, while photometric studies, especially with the \textit{Hubble Space Telescope} (\textit{HST}), have been essential for tracing MP sequences in colour-magnitude diagrams (CMDs). However, the limited field of view of \textit{HST} confines most studies to cluster centres. The upcoming \textit{Chinese Space Station Survey Telescope} (CSST), with its wide field of view and UV-optical coverage, will enable systematic MP studies over entire clusters. We assess the capability of the CSST wide-field camera to detect and characterize MPs in GCs using realistic simulations. Synthetic stellar population models with different helium abundances ($ΔY$) and CNO variations were used to simulate CSST observations of GCs at distances of 9.6 and 20~kpc under different exposure times. MP detectability was evaluated using CMDs in seven CSST bands and UV-optical pseudo-colour diagrams. For a GC at 9.6~kpc, the $NUV-u$ colour is highly sensitive to $ΔY$ and CNO variations, with separations of $Δ(NUV-u)\approx0.16$ mag for red giants and up to 0.44 mag for dwarfs. MPs can be resolved when the total UV exposure exceeds $\sim1000$~s and the optical exposure exceeds $\sim300$~s. At 20~kpc, encompassing $\sim80\%$ of Galactic GCs, CSST still retains strong diagnostic power, resolving populations with $ΔY\geq0.06$ and $δ[\mathrm{N/Fe}]\geq0.64$, and separating MPs down to $i\sim19.5$ mag in clusters with large chemical spreads. The $NUV$-$u$-$g$ combination provides diagnostic performance comparable to the \textit{HST} F275W--F336W--F438W system. CSST will enable homogeneous MP surveys across the full spatial extent of star clusters in the Milky Way and nearby galaxies.

astro-ph.SR↗
arXiv2026

Weakly Supervised Camouflaged Object Detection Based on the SAM Model and Mask Guidance

Camouflaged object detection (COD) from a single image is a challenging task due to the high similarity between objects and their surroundings. Existing fully supervised methods require labor-intensive pixel-level annotations, making weakly supervised methods a viable compromise that balances accuracy and annotation efficiency. However, weakly supervised methods often experience performance degradation due to the use of coarse annotations. In this paper, we introduce a new weakly supervised approach for camouflaged object detection to overcome these limitations. Specifically, we propose a novel network, MGNet, which tackles edge ambiguity and missed detections by utilizing initial masks generated by our custom-designed Cascaded Mask Decoder (CMD) to guide the segmentation process and enhance edge predictions. We introduce a Context Enhancement Module(CEM) to reduce the missing detection, and a Mask-guided Feature Aggregation Module (MFAM) for effective feature aggregation. For the weak supervision challenge, we propose BoxSAM, which leverages the Segment Anything Model (SAM) with bounding-box prompts to generate pseudo-labels. By employing a redundant processing strategy, high quality pixel-level pseudo-labels are provided for training MGNet. Extensive experiments demonstrate that our method delivers competitive performance against current state-of-the-art methods.

cs.CV↗
arXiv2026

Learning to Evolve: Multi-modal Interactive Fields for Robust Humanoid Navigation in Dynamic Environments

Safe manipulation-oriented navigation for humanoid robots requires scene memory that remains reliable under locomotion-induced perceptual distortion, environmental changes, and interaction-level geometric safety constraints. Existing semantic mapping and scene-graph systems are difficult to deploy directly in this setting because they often assume stable camera trajectories, static environments, or coarse object geometry. We introduce the Multi-modal Interactive Field (MIF), a humanoid-oriented system that integrates confidence-aware semantic 3D Gaussian Splatting, discrepancy-triggered spatial memory updates, and task-driven geometric reconstruction within a closed-loop perception-adaptation pipeline. MIF couples three fields: an uncertainty-aware 3DGS Appearance Field that suppresses gait-induced blur, a Spatial Field that maintains topological memory, and a Geometry Field that supports Interaction Pose Safety (IPS) before manipulation. A discrepancy detection score is introduced to separate locomotion-induced false-positive changes from persistent changes and updates only locally inconsistent regions. On a Unitree-G1 humanoid in a real dynamic office, MIF improves relocation success in non-static environments from 12% to 94% compared with static scene-graph memory, while reducing semantic memory footprint by 91.4% through feature distillation for practical online operation. Project page and code: https://ziya-jiang.github.io/MIF-homepage/

cs.RO↗
arXiv2026

Design, Testing, and Commissioning of the Sun Yat-sen University (SYSU) 80 cm Infrared Telescope

The Sun Yat-sen University (SYSU) 80 cm telescope is a new generation near-infrared (NIR) facility in China dedicated to time-domain astronomy, while also serving as a testbed for emerging NIR cameras. Commissioned in October 2024 at the 4100 m Lenghu site on the Tibetan Plateau in China, the telescope adopts a reflective Cassegrain design with two Nasmyth foci for J and K bands. The J band imaging system, initially equipped with a 640 x 512 off-the-shelf InGaAs camera (INS Mars640) and upgraded in June 2025 to a 1280 x 1024 science-grade, deeply cooled camera (YNAOIR), achieves background-limited performance with a dark current of ~ 14 e-/s/pix and a readout noise of ~ 11 e-. The system reaches a limiting magnitude of J ~ 17 mag (Vega system) in single 20 s exposures and depths of J ~ 19.4 mag with stacked 30 minute exposures. For a variable with J ~ 14 mag during on-sky tests, the system delivers millimagnitude-level photometric precision. Since commissioning, the telescope observed transients such as gamma-ray bursts (GRBs), supernovae and comets, variables including active galactic nuclei (AGNs), high-redshift quasars (z > 6), and brown dwarfs, as well as deep-field imaging reaching J ~ 20.5 mag. This validates the feasibility of using InGaAs cameras for astronomical observations, encouraging other institutions to develop dedicated infrared telescopes or integrate infrared cameras into existing optical telescopes.

astro-ph.IM↗
arXiv2026

Graph Retention Networks for Dynamic Graphs

In this paper, we propose Graph Retention Networks (GRNs) as a unified architecture for deep learning on dynamic graphs. The GRN extends the concept of retention into dynamic graph data as graph retention, equipping the model with three key computational paradigms: parallelizable training, low-cost $\mathcal{O}(1)$ inference, and long-term chunkwise training. This architecture achieves an optimal balance between efficiency, effectiveness, and scalability. Extensive experiments on benchmark datasets demonstrate its strong performance in both edge-level prediction and node-level classification tasks with significantly reduced training latency, lower GPU memory overhead, and improved inference throughput by up to 86.7x compared to SOTA baselines. The proposed GRN architecture achieves competitive performance across diverse dynamic graph benchmarks, demonstrating its adaptability to a wide range of tasks.

cs.LG↗
arXiv2026

Class-Imbalanced-Aware Adaptive Dataset Distillation for Scalable Pretrained Model on Credit Scoring

The advent of artificial intelligence has significantly enhanced credit scoring technologies. Despite the remarkable efficacy of advanced deep learning models, mainstream adoption continues to favor tree-structured models due to their robust predictive performance on tabular data. Although pretrained models have seen considerable development, their application within the financial realm predominantly revolves around question-answering tasks and the use of such models for tabular-structured credit scoring datasets remains largely unexplored. Tabular-oriented large models, such as TabPFN, has made the application of large models in credit scoring feasible, albeit can only processing with limited sample sizes. This paper provides a novel framework to combine tabular-tailored dataset distillation technique with the pretrained model, empowers the scalability for TabPFN. Furthermore, though class imbalance distribution is the common nature in financial datasets, its influence during dataset distillation has not been explored. We thus integrate the imbalance-aware techniques during dataset distillation, resulting in improved performance in financial datasets (e.g., a 2.5% enhancement in AUC). This study presents a novel framework for scaling up the application of large pretrained models on financial tabular datasets and offers a comparative analysis of the influence of class imbalance on the dataset distillation process. We believe this approach can broaden the applications and downstream tasks of large models in the financial domain.

cs.LG↗
arXiv2026

LoD-Loc v3: Generalized Aerial Localization in Dense Cities using Instance Silhouette Alignment

We present LoD-Loc v3, a novel method for generalized aerial visual localization in dense urban environments. While prior work LoD-Loc v2 achieves localization through semantic building silhouette alignment with low-detail city models, it suffers from two key limitations: poor cross-scene generalization and frequent failure in dense building scenes. Our method addresses these challenges through two key innovations. First, we develop a new synthetic data generation pipeline that produces InsLoD-Loc - the largest instance segmentation dataset for aerial imagery to date, comprising 100k images with precise instance building annotations. This enables trained models to exhibit remarkable zero-shot generalization capability. Second, we reformulate the localization paradigm by shifting from semantic to instance silhouette alignment, which significantly reduces pose estimation ambiguity in dense scenes. Extensive experiments demonstrate that LoD-Loc v3 outperforms existing state-of-the-art (SOTA) baselines, achieving superior performance in both cross-scene and dense urban scenarios with a large margin. The project is available at https://nudt-sawlab.github.io/LoD-Locv3/.

cs.CV↗
arXiv2026

Point-In-Context: Understanding Point Cloud via In-Context Learning

The rise of large-scale models has catalyzed in-context learning as a powerful approach for multitasking, particularly in natural language and image processing. However, its application to 3D point cloud tasks has been largely unexplored. In this paper, we introduce Point-In-Context (PIC), a pioneering framework for 3D point cloud understanding that leverages in-context learning with a standard transformer architecture. PIC uniquely enables the execution of multiple tasks after a single, unified training phase, eliminating the need for fine-tuning. To extend masked point modeling to 3D in-context learning, we introduce a Joint Sampling module, a simple yet effective technique that emphasizes the mapping relationship between input and target. PIC treats both inputs and targets as coordinate-based, addressing the segmentation challenge by associating label points with pre-defined XYZ coordinates for each category. However, relying on such fixed label-coordinate assignments limits the model's ability to generalize to unseen domains. To address this limitation, we further propose two innovative training strategies: In-Context Labeling and In-Context Enhancing. These strategies are integrated into PIC++, which enhances dynamic in-context labeling and model training. Besides its multitask capability, PIC++ demonstrates generalization across part segmentation datasets by employing dynamic in-context labels and regular in-context pairs. Remarkably, PIC++, trained once without fine-tuning, can generalize effectively to unseen datasets and perform novel part segmentation through customized prompts. Overall, PIC is a general framework that seamlessly integrates additional tasks or datasets through a unified data format via in-context learning. Extensive experiments substantiate PIC's versatility and adaptability in handling diverse tasks and segmenting multiple datasets simultaneously.

cs.CV↗
arXiv2026

Enhanced Structured Lasso Pruning with Class-wise Information

Modern applications require lightweight neural network models. Most existing neural network pruning methods focus on removing unimportant filters; however, these may result in the loss of statistical information after pruning due to failing to consider the class-wise information. In this paper, we employ the structured lasso from the perspective of utilizing precise class-wise information for model pruning with the help of Information Bottleneck theory, which guides us to ensure the retention of statistical information before and after pruning. With these techniques, we propose two novel adaptive network pruning schemes in parallel: sparse graph-structured lasso pruning with Information Bottleneck (sGLP-IB) and sparse tree-guided lasso pruning with Information Bottleneck (sTLP-IB). The key component is that we prune the model filters utilizing sGLP-IB and sTLP-IB with more precise structured class-wise relatedness. Compared to multiple state-of-the-art methods, our approaches achieve the best performance across three datasets and six model structures on extensive experiments. For example, with the VGG16 model based on the CIFAR-10 dataset, we can reduce the parameters by 85%, decrease the FLOPs by 61%, and maintain an accuracy of 94.10% (0.14% better than the original). For large-scale ImageNet, we can reduce the parameters by 55% while keeping the accuracy at 76.12% (only drop 0.03%) using the ResNet architecture. In summary, we succeed in reducing the model size and computational resource usage while maintaining the effectiveness of accuracy.

cs.CV↗
arXiv2026

Mock Observations of Multiple Stellar Populations in Tidal Streams of Palomar 5 for the Chinese Space Station Survey Telescope

Observations show that multiple stellar populations (MPs) are ubiquitous in globular clusters. The Hubble Space Telescope (HST) has been a pivotal tool for previous photometric studies of MPs. The Chinese Space Station Survey Telescope (CSST) is a two-meter telescope scheduled for launch. One of its imaging instruments, the Survey Camera (SC), combines ultraviolet sensitivity comparable to that of HST with a significantly larger field of view, making it well-suited for conducting large-scale photometric surveys of MPs within extensive stellar stream structures. In this work, we perform mock observations of the stellar stream Palomar 5 to assess the feasibility of detecting MPs with the CSST/SC. The results indicate that the CSST/SC cannot resolve MPs in stellar streams at distances comparable to Palomar 5 ($\gtrsim 20$ kpc) with one or ten 150 s exposures. This fundamental limitation arises from the absence of the precise proper motions required to disentangle stream members. We estimate that successful resolution would require the target stream to be $\lesssim$ 8 kpc under a 150 s exposure. Furthermore, using theoretical color-magnitude diagrams, we find that the CSST/SC $g$-band provides an optimal balance between contamination rate and completeness rate for member identification in the cluster's core. However, this approach fails in the stream due to severe field star contamination. Therefore, future CSST observations of Palomar 5 and its tidal tails will employ multiple epochs across several bands to obtain the deep photometry and proper motion data for a definitive MP analysis.

astro-ph.IM↗
arXiv2026

PivotAttack: Rethinking the Search Trajectory in Hard-Label Text Attacks via Pivot Words

Existing hard-label text attacks often rely on inefficient "outside-in" strategies that traverse vast search spaces. We propose PivotAttack, a query-efficient "inside-out" framework. It employs a Multi-Armed Bandit algorithm to identify Pivot Sets-combinatorial token groups acting as prediction anchors-and strategically perturbs them to induce label flips. This approach captures inter-word dependencies and minimizes query costs. Extensive experiments across traditional models and Large Language Models demonstrate that PivotAttack consistently outperforms state-of-the-art baselines in both Attack Success Rate and query efficiency.

cs.CL↗
arXiv2026

Spatial Property of Multiple Metallic Populations in the Tidal Stream of ω Centauri

ω Centauri, the remnant nucleus of an accreted dwarf galaxy, is a unique laboratory for studying complex stellar populations. The recently discovered Fimbulthul stream provides a fossil record of its ongoing tidal dissolution. In this work, we investigate the spatial distributions of metal-rich and metal-poor populations within ω Centauri and its stream to constrain the cluster's formation history. Using synthetic photometry from Gaia DR3 XP spectra, we classify stars via a Support Vector Classifier (SVC). The spatial distributions are then compared to a scaling N-body simulation performed with the PeTar code. Our analysis reveals no significant radial gradient in population ratios within the cluster, though the metal-rich stars may be slightly more extended. The population ratio in the tidal stream is consistent with that of the present-day cluster, albeit with large uncertainties. Our simulation indicates that any initial radial gradient must have been shallow, with a maximum fraction difference less than 0.15. Both observational and dynamical results suggest that the metal-rich population is not formed centrally concentrated. By combining our results and existing literature, we propose a new formation scenario for ω Centauri.

astro-ph.GA↗
arXiv2026

ENCO: Life-Cycle Management of Enterprise-Grade Copilots

Software engineers frequently grapple with the challenge of accessing disparate documentation and telemetry data, including TroubleShooting Guides (TSGs), incident reports, code repositories, and various internal tools developed by multiple stakeholders. While on-call duties are inevitable, incident resolution becomes even more daunting due to the obscurity of legacy sources and the pressures of strict time constraints. To enhance the efficiency of on-call engineers (OCEs) and streamline their daily workflows, we introduced DECO-a comprehensive framework for developing, deploying, and managing enterprise-grade copilots tailored to improve productivity in engineering routines. This paper details the design and implementation of the DECO framework, emphasizing its innovative NL2SearchQuery functionality and a lightweight agentic framework. These features support efficient and customized retrieval-augmented-generation (RAG) algorithms that not only extract relevant information from diverse sources but also select the most pertinent skills in response to user queries. This enables the addressing of complex technical questions and provides seamless, automated access to internal resources. Additionally, DECO incorporates a robust mechanism for converting unstructured incident logs into user-friendly, structured guides, effectively bridging the documentation gap. Since its launch in September 2023, ENCO has demonstrated its effectiveness through widespread adoption, enabling tens of thousands of interactions and engaging hundreds of monthly active users (MAU) across dozens of organizations within the company.

cs.SE↗