Searcharxiv⌕ Search

arXiv subjects

Lei Yang

Publications and source records attributed to Lei Yang.

At least 73 records · Page 4Linked to original sources

Thinking Seeds: Leveraging Historical Diversity for Position-Aware RL in LLMs

On-policy reinforcement learning (RL) for language model post-training suffers from a fundamental tension: as training progresses, policy entropy collapses and sampling diversity diminishes, causing the model to ``forget'' its own earlier exploratory capacity. While off-policy data can restore diversity, existing methods mix entire trajectories at the sequence level, introducing severe policy mismatch and training instability. We argue that the core question is not \emph{whether} to use off-policy data, but \emph{where} in the sequence it should appear. Based on this insight, we propose \textbf{Thinking Seeds}, a token-level mix-policy framework that uses the model's own historical checkpoints as off-policy prefixes, providing diverse starting points for reasoning, while the critical continuation is generated on-policy to preserve gradient quality. Through token-level importance ratios, Thinking Seeds effectively leverages historical diversity without compromising training stability. Extensive experiments across models and mathematical reasoning benchmarks demonstrate that Thinking Seeds consistently outperforms standard on-policy training and existing off-policy extensions. Our analysis reveals that the method maintains higher effective entropy, reduces gradient loss from clipping, and expands the explorable solution space, clarifying how position-aware mix-policy modeling improves both exploration and final performance in LLM RL.

cs.CL↗

Amplitude-Independent Robust Snapshot 6-D Radio SLAM via a Uniffed Angle-Delay Formulation

This paper addresses bistatic snapshot radio SLAM, in which a user equipment (UE) with unknown 6-D pose and clock bias is localized and environmental landmarks are reconstructed from a single multipath channel snapshot. Under mixed line-of-sight (LoS)/non-line-of-sight (NLoS) propagation, existing robust snapshot SLAM methods are mainly developed or validated in planar/2-D settings and often use path-amplitude or path-loss information for LoS handling, which makes them sensitive to calibration errors and propagation-model mismatch. We propose an amplitude-independent robust radio SLAM method built on a uniffed angle-delay formulation for LoS and single-bounce NLoS inlier paths. In the coarse stage, the method estimates the UE state and selects geometrically consistent inliers directly from angle-delay measurements, without amplitudebased LoS preclassiffcation or path-wise latent variables; the formulation is further extended to general 3-D/6-D pose estimation through twist-swing two-stage traversal initialization and local reffnement on SO(3). A subsequent Jacobian-row-equilibrated iteratively reweighted least-squares (IRLS) reffnement, combined with quasi-Akaike information criterion (QAIC) model comparison, detects the LoS path and jointly reffnes the UE state and scattering points. We also analyze formulation-speciffc local-rank properties and their minimal-set implications under unknown path identity. Simulations show that the proposed method remains competitive with calibrated amplitude-dependent baselines and is more robust to path-loss-model mismatch.

eess.SP↗

Vision as Unified Multimodal Generation

We formulate computer vision as unified multimodal generation, where heterogeneous visual tasks are expressed in the native text and image generation spaces of a unified multimodal model, without task-specific architectures. Under this formulation, SenseNova-Vision uses natural-language instructions and optional visual prompts to specify tasks, target regions or views, and decoding conventions, and generates responses as text for symbolic outputs, images for dense spatial predictions, or mixed text-and-image outputs for compositional tasks. To support large-scale training, we convert diverse computer vision annotations into instruction-response examples compatible with these generation spaces, resulting in the SenseNova-Vision Corpus, a computer-vision instruction-response corpus spanning text, image, and mixed targets. Starting from an off-the-shelf pretrained unified multimodal model, SenseNova-Vision is trained primarily on this corpus, with auxiliary multimodal data used as a capability-preserving mixture, and requires no task-specific prediction heads or architectural modifications. The resulting model covers a broad range of vision tasks, including detection, OCR, keypoint estimation, segmentation, depth estimation, surface normal prediction, point maps, and camera pose estimation, while supporting language-defined variants that combine category, color, region, and other visual cues. Experiments show that a single unified model can match leading task-specialized systems across structured visual understanding, dense geometric prediction, segmentation, and multi-view visual geometry. These results suggest unified multimodal generation as a scalable route for integrating computer vision capabilities into general-purpose foundation models. The model and corpus are publicly available.

cs.CV↗

Gluon Generalized TMD signatures at the EIC from exclusive heavy (axial-)vector meson production

Potential experimental signatures of gluon generalized transverse momentum-dependent distributions (GTMDs) are proposed via exclusive heavy (axial-)vector meson production in lepton-proton collisions. Within the framework of collinear twist-3 factorization, we show that specific azimuthal-angle-dependent observables can provide sensitivity to the gluon GTMDs $F_{1,4}^g$ and $G_{1,1}^g$, which are related to partonic orbital angular momentum and spin-orbit correlations, respectively. These functions represent a unique sector of nucleon structure with no counterparts in the generalized parton distribution or transverse-momentum-dependent frameworks. We show that interference between different virtual-photon polarizations leads to distinct azimuthal modulations, including the polarization-independent $\cos 2ϕ$ and polarization-dependent $\sin 2ϕ$ terms, with $ϕ$ defined as the angle between the lepton scattering plane and the hadron production plane. These observables provide signatures of the elusive gluon GTMDs $F_{1,4}^g$ and $G_{1,1}^g$, opening a new channel to access the spin structure of the nucleon at the future Electron-Ion Collider.

hep-ph↗

Beyond Static Rules: Automated Discovery of Latent Vulnerabilities in Text-to-SQL

While Large Language Models (LLMs) have achieved remarkable success in Text-to-SQL tasks, their deployment in real-world environments is hindered by latent reliability issues. Identifying these latent weaknesses is critical for building trustworthy database interfaces, yet current diagnostic approaches rely heavily on static, expert-defined rules, which lack the capability for systematic and automated exploration. To bridge this gap, we propose SAGE (Systematic Automated Guided Exploration), a novel framework designed to autonomously uncover latent failure patterns in LLM-based Text-to-SQL generation. Specifically, SAGE generates vulnerability hypotheses for given samples and references a continuously evolving Vulnerability Codex to design targeted perturbations, thereby iteratively verifying and documenting potential defects. Extensive experiments on state-of-the-art open-source LLMs demonstrate that SAGE uncovers a substantial number of failure cases, highlighting the significant fragility of current models. Furthermore, our analysis reveals that the Vulnerability Codex exhibits strong cross-model transferability, indicating that the discovered patterns represent generalized structural weaknesses. Finally, we explore SAGE's potential for remediation. Although preliminary, lightweight fine-tuning on the generated samples yields promising improvements, suggesting a scalable pathway for closing the reliability loop in future work.

cs.CL↗

Cloud-Native Evaluation-as-a-Service: A Microservices Architecture for Scalable AI Monitoring with Conformal Guarantees

We present EaaS, a cloud-native reference architecture that operationalizes AI evaluation methods as six stateless Kubernetes microservices: conformal prediction with finite-sample-corrected Adaptive Prediction Sets, calibration assessment, drift detection via RFF-approximated Maximum Mean Discrepancy, fairness monitoring with bootstrap confidence intervals, a DAG-based pipeline orchestrator, and a result storage API. We validate four key methodological concerns. First, empirical coverage is consistent with the marginal conformal guarantee across K=50 random calibration/test splits, with mean coverage within 1.4 percentage points of the nominal target. Second, all four MMLU answer tokens appear in the top-20 logprobs with 0% imputation needed, and simulated imputation at 10% produces less than 1.5% coverage impact. Third, RFF-MMD achieves 100% detection power for mild and severe drift at the median heuristic bandwidth, with Type I error between 5-8.5%. Fourth, fairness monitoring on the UCI Adult Income dataset reveals significant demographic parity disparities by race (DP gap=0.33) with stable alerts across sequential batches. Conformal prediction and calibration services achieve sub-2ms p99 latency at batch size 100; RFF-MMD requires ~500ms suited for periodic batch monitoring. A comparison with four open-source tools suggests that, to the best of our knowledge, no current platform combines conformal-prediction-as-a-service, microservice decomposition, and DAG-based orchestration.

cs.LG↗

Improving Muon-Scattering Material Identification via Coarse Momentum Encoding and Unsupervised Domain Adaptation

Cosmic-ray muon scattering has shown considerable potential for detecting nuclear materials and other dense contraband, but practical deployment remains challenging. A major difficulty arises from the coupling between material properties and muon momentum, since the broad natural momentum distribution influences the scattering angle and prevents unambiguous material identification. In this work, we propose a Coarse Momentum-Aware Domain Adaptation (CMADA) method to enable precise identification of materials. Instead of relying on high-precision momentum measurements, the proposed framework adopts coarse momentum binning combined with unsupervised domain adaptation to learn transferable scattering representations. In addition, a precision review mode based on averaging repeated samplings was proposed to further enhances identification performance. The coarse momentum binning strategy improves same-domain identification accuracy from 62.15% without momentum information to 89.52% with 5-bin momentum information, and further to 93.37% (precision review mode). Furthermore, the proposed unsupervised domain adaptation framework improves the cross-domain identification accuracy from 71.71% for the source-only baseline to 89.00% without requiring target domain labels.

physics.ins-det↗

A cryogenic gas target for high-intensity radioactive ion beam production at HIRFL-RIBLL

A liquid-nitrogen-cooled cryogenic gas target system has been developed and installed for radioactive ion beam (RIB) production at the Radioactive Ion Beam Line in Lanzhou (RIBLL). Light-element gases ($\mathrm{H}_2$, $\mathrm{D}_2$, and $^4\mathrm{He}$) filled in the target cell were cooled to cryogenic temperatures, with the gas-cell outlet temperature typically monitored at 82--86 K during beam irradiation and operating pressures up to 1000 mbar. The system was used to produce $^{7}\mathrm{Be}$, $^{16}\mathrm{N}$, and $^{15}\mathrm{O}$ RIBs via the $^{1}\mathrm{H}(^{7}\mathrm{Li}, ^{7}\mathrm{Be})n$, $^{2}\mathrm{H}(^{15}\mathrm{N}, ^{16}\mathrm{N})p$, and $^{1}\mathrm{H}(^{15}\mathrm{N}, ^{15}\mathrm{O})n$ inverse kinematics reactions, yielding purities of 85\%, 99\%, and 95\%, with intensities of $1.02\times10^{6}$, $2.7\times10^{5}$, and $1.0\times10^{5}$ pps, respectively. A $^{93m}\mathrm{Mo}$ isomer beam was also produced via the $\mathrm{^4He(^{94}Zr,} 5n)^{93m}\mathrm{Mo}$ reaction, achieving an intensity of $5.38\times10^{3}$ pps and a purity of 20\% (which can be further improved to $\sim$50\% with offline time-of-flight gating). By delivering a broader range of high-intensity secondary RIBs, this setup establishes a robust platform at RIBLL for low- and medium-energy nuclear astrophysics and reaction studies.

physics.ins-det↗

Nonparametric Bayesian Calibration of Computer Models

Combining field data and computer models is a crucial step for making inferences, predictions, and decisions for complex science and engineering systems. We formulate and analyze a nonparametric Bayesian methodology for calibrating the distribution of parameters in a computer model using field observations. Our results include establishing; a unique nonparametric Bayesian posterior corresponding to a chosen prior with an explicit formula for the posterior density; a maximum entropy property of the posterior corresponding to the uniform prior; the almost everywhere continuity of the posterior density; and a comprehensive statistical analysis of an estimator based on importance sampling. They also include establishing the well-posedness of the nonparametric Bayesian solution of the calibration problem. We illustrate the results using several examples.

stat.ME↗

DIVER: Reinforced Diffusion Breaks Imitation Bottlenecks in End-to-End Autonomous Driving

Most end-to-end autonomous driving methods rely on imitation learning from single expert demonstrations, often leading to conservative and homogeneous behaviors that limit generalization in complex real-world scenarios. In this work, we propose DIVER, an end-to-end driving framework that integrates reinforcement learning with diffusion-based generation to produce diverse and feasible trajectories. At the core of DIVER lies a reinforced diffusion-based generation mechanism. First, the model conditions on map elements and surrounding agents to generate multiple reference trajectories from a single ground-truth trajectory, alleviating the limitations of imitation learning that arise from relying solely on single expert demonstrations. Second, reinforcement learning is employed to guide the diffusion process, where reward-based supervision enforces safety and diversity constraints on the generated trajectories, thereby enhancing their practicality and generalization capability. Furthermore, to address the limitations of L2-based open-loop metrics in capturing trajectory diversity, we propose a novel Diversity metric to evaluate the diversity of multi-mode predictions.Extensive experiments on the closed-loop NAVSIM and Bench2Drive benchmarks, as well as the open-loop nuScenes dataset, demonstrate that DIVER significantly improves trajectory diversity, effectively addressing the mode collapse problem inherent in imitation learning.

cs.CV↗

A Single-Loop Minorized Dual Decomposition Method for Nonsmooth Multi-Stage Stochastic Programming

In this paper, we study multi-stage stochastic programming (MSP) problems with nonsmooth composite objectives. Tailored to their intrinsic stage-wise and scenario-wise structure, we develop a single-loop minorized dual decomposition method, in which each iteration constructs a minorized problem and its restricted Wolfe dual, and then performs \textit{one iteration} of the symmetric Gauss--Seidel based inexact alternating direction method of multipliers on the resulting dual problem to generate the next iterate. A key feature of the proposed optimization framework is that the resulting updates preserve the stage-wise and scenario-wise decomposable structure of the MSP problem and are suitable for parallel implementation. We establish global convergence of the generated iterates for the three-stage case and further establish the corresponding global convergence theorem for the general multi-stage setting. Numerical experiments illustrate the computational viability of the proposed framework and its favorable scaling behavior with respect to the stage-wise and scenario-wise structure.

math.OC↗

GraphWorld: Long-Horizon Planning with World Models for End-to-End Autonomous Driving

End-to-end autonomous driving has made significant progress by unifying perception, prediction, and planning within a single learning framework, achieving strong performance in short-horizon decision making. However, most existing E2E-AD methods remain confined to short-horizon planning and lack the ability to model long-term temporal dependencies, which severely limits their generalization and security in complex and highly interactive driving scenarios. In this work, we propose GraphWorld, an E2E-AD framework that explicitly enhances long-horizon planning through latent world modeling. We introduce an Ego-Centric Interaction Graph, which adaptively models critical neighboring agents based on spatial proximity, and propagates relational context to planning queries via cross-node cross-attention. We present a World-State-Conditioned Planning that learns ego-centric latent world representations by modeling interactions between an ego vehicle and surrounding agents. This latent world state captures key interaction dynamics and safety-relevant semantics, and serves as a conditioning signal to guide long-horizon, safety-aware trajectory planning. Extensive experiments on Bench2Drive, NAVSIMv1/2, and nuScenes demonstrate that GraphWorld significantly reduces collision rates and improves long-horizon planning performance, validating its effectiveness in complex driving environments.

cs.CV↗

GraphBEV++: Multi-Modal Feature Alignment for Autonomous Driving

Feature misalignment in BEV perception is a critical yet often overlooked challenge in autonomous driving, especially under calibration uncertainties between LiDAR and camera sensors. To address this issue, we propose a robust multi-modal fusion framework, GraphBEV++, which systematically mitigates projection-induced misalignment. The framework consists of two key modules: LocalAlign-v2 and GlobalAlign-v2. LocalAlign-v2 introduces neighborhood-aware depth features via graph matching to correct local misalignment. It supports both LSS-based and query-based BEV representations, making it compatible with BEVFusion and BEVFormer architectures for consistent cross-paradigm alignment. GlobalAlign-v2 encompasses two variants: Deformable and Diffusion. The Deformable variant addresses global misalignment in LSS-based multi-modal BEV by explicitly learning cross-modal feature offsets. In contrast, the Diffusion variant targets implicit misalignment in query-based BEV by injecting noise to simulate misalignment and employing a denoising process to recover aligned features. Experimental results show that GraphBEV++ achieves state-of-the-art performance under misalignment noise on nuScenes and Waymo subset, improves long-range detection on Argoverse2, and generalizes effectively to the 3D occupancy prediction task, consistently improving occupancy estimation accuracy and robustness under both clean and noisy settings. Furthermore, GraphBEV++ effectively alleviates misalignment issues in end-to-end autonomous driving. Compared with five baselines (UniAD, VAD, FusionAD, MomAD, and WoTE), it demonstrates superior performance in both open-loop (nuScenes) and closed-loop (Bench2Drive and NAVSIM) evaluations across perception, prediction, and planning tasks.

cs.CV↗

LLM-Enhanced Deep Reinforcement Learning for Task Offloading in Collaborative Edge Computing

Collaborative edge computing uses edge nodes in different locations to execute tasks, necessitating dynamic task offloading decisions to maintain low latency and high reliability, especially under unpredictable node failures. Although deep reinforcement learning (DRL) and large language models (LLMs) have shown promise for task offloading, DRL often suffers from poor sample efficiency and local optima, while LLMs are difficult to use directly due to inference overhead and output uncertainty. To address these limitations, we propose \textbf{LeDRL}, a hybrid decision framework that couples a \emph{lightweight LLM} with self-attention-enhanced DRL for real-time task offloading. LeDRL constructs structured, context-aware prompts capturing node status, task semantics, and link dynamics to derive high-level strategy priors. These are selectively processed by a self-attention-based alignment module for context-aware policy optimization. A reflective evaluator further distills semantic feedback from past trajectories to refine subsequent prompts and provide consistent guidance. Extensive experiments show that LeDRL outperforms representative baselines in task success rate, convergence speed, and real-time responsiveness across diverse network scales, achieving over 17\% improvement in success rate. Furthermore, we deploy LeDRL on Jetson-based edge devices using our prototype system \textit{CoEdgeSys}, demonstrating its robustness and feasibility under resource constraints. Our code is available at:https://github.com/GalleyG5/LeDRL.git.

cs.DC↗

A Local Perturbation Theory for Cross-Domain Interference and Recovery in Multi-Domain RL

Reinforcement learning (RL) post-training improves large language models (LLMs) on individual domains such as mathematical reasoning, code generation, question answering, and creative writing (CW), but training on one domain often degrades performance on others. Existing explanations based on catastrophic forgetting or global gradient conflict are incomplete: substantial interference can occur even when full-model gradients are nearly orthogonal. We show that single-domain RL produces sparse, small-magnitude parameter edits with weak overlap among top-changed neurons, while different domains still share substantial active computation routes on which update directions determine whether they act synergistically or conflict. Guided by this observation, we prove under a local perturbation model of multi-domain RL that later-domain training harms an earlier domain mainly through a second-order damage term, which under the observed sparse route structure concentrates in a low-dimensional shared conflict subspace. Moreover, a short domain refresh contracts the harmful component on this subspace, enabling selective recovery with limited collateral damage. Consistent with the theory, a brief Re-Math refresh after Code $\rightarrow$ Math $\rightarrow$ QA $\rightarrow$ CW recovers Math from 57.66 to 66.04 while largely preserving performance on the other domains, yielding the best average score of 66.39. Beyond refresh, a training-free rollback on a sparse proxy conflict coordinate set for the Math-QA pair partially restores Math, providing direct proxy-level evidence for localized damage. These results provide a localized mechanistic account of interference and recovery in multi-domain RL.

cs.LG↗

Mixed-Precision GPU Acceleration for Large-Scale Minimum Enclosing Ball Problems

A mixed-precision GPU-oriented optimization framework is developed for computing the minimum enclosing ball of a collection of balls. The approach is built on an equivalent second-order cone programming reformulation and a relative-type inexact proximal augmented Lagrangian method (ripALM), which provides a high-accuracy optimization backbone while solving the inner subproblems only to a progress-dependent relative accuracy. The proximal augmented Lagrangian inherits a constraint-wise separable structure: its objective, gradient, generalized Hessian, and multiplier updates can be efficiently evaluated on GPUs as parallel maps over the input balls followed by reductions. To further improve efficiency, a mixed-precision reduction strategy is introduced. A low-precision ripALM run identifies balls near the approximate boundary, a high-precision ripALM run refines the reduced problem, and a full a posteriori feasibility check detects and reintroduces any violated discarded balls. Thus, low precision is used only for screening and warm starting, while the final feasibility is enforced against the original problem. Numerical experiments show that ripALM and mixed-precision ripALM achieve high accuracy and are substantially faster than the tested CPU-based geometric software and general-purpose conic solvers on large-scale instances.

math.OC↗

From Pixels to Words -- Towards Native One-Vision Models at Scale

Current vision-language models (VLMs) typically stitch together separate image encoders and language decoders via multi-stage alignment, a modular framework that inevitably fragments pixel-level signals across frames and scatters early pixel-word interactions. In parallel, native VLMs, despite impressive performance on single images, remain largely unexplored in multi-image, video understanding, and spatial intelligence. Hence, we introduce NEO-ov, a native foundation model that learns cross-frame and pixel-word correspondence end-to-end, without any external encoders, auxiliary adapters, or post-hoc fusion. By eliminating module boundaries entirely, NEO-ov enables fine-grained and unified spatiotemporal modeling to emerge natively inside the model. Notably, NEO-ov largely narrows the gap to modular counterparts while excelling at fine-grained visual perception, validating that native "one-vision" architectures are not only feasible but competitive at scale. Beyond empirical performance, we unveil systematic architectural analyses and detailed training recipes to facilitate subsequent native multimodal modeling. Our code and models are publicly available at: https://github.com/EvolvingLMMs-Lab/NEO.

cs.CV↗

Bayesian Deployment Approval for Learned Landing Controllers under Finite Rollout Validation

Reinforcement learning and data-driven autonomous controllers are commonly evaluated using cumulative reward and empirical success frequency under finite simulation trajectories. However, such empirical metrics do not necessarily provide sufficient statistical evidence regarding deployment readiness under uncertainty. This work develops a Bayesian approval framework for learned autonomous landing controllers under finite rollout evidence. A probabilistic landing capability formulation is introduced based on touchdown safety satisfaction under uncertain operating conditions, while Bayesian posterior inference is used to quantify uncertainty regarding the true deployment capability of learned policies. Posterior approval probability and posterior deployment risk are further introduced for deployment-oriented evaluation, together with a sequential validation framework supporting approve/reject/continue decisions during progressive rollout testing. Simulation experiments using PPO and SAC controllers demonstrate that empirical success and reward optimization may produce overconfident deployment interpretation under limited validation evidence, whereas posterior approval inference provides a more uncertainty-calibrated assessment of deployment readiness. The proposed framework provides a practical statistical connection between conventional reinforcement-learning evaluation and deployment-oriented validation under uncertainty and may be generalized to broader classes of learned autonomous systems.

cs.LG↗