arXiv subjects

Qian Zhang

Publications and source records attributed to Qian Zhang.

At least 55 records · Page 3Linked to original sources

arXiv2026

Synthesis and stability of high-$T_c$ LaH$_{10\pmδ}$ films at high pressures

High-pressure hydrides hold the record for the highest superconducting critical temperatures across all classes of superconductors. Currently lanthanum decahydride, LaH$_{10}$, exhibits the highest critical temperature among binaries, with $T_c \approx$ 250 K at pressures between 140-180 GPa. Here, we report the synthesis of LaH$_{10\pmδ}$ films in two DACs at pressures of 168 GPa and 176 GPa via in situ laser heating of elemental lanthanum films with ammonia borane (NH$_3$BH$_3$) as the hydrogen donor. The high-symmetry fcc lanthanum sublattice (space group $Fm\bar3m$) is resolved using synchrotron X-ray diffraction, with unit cell parameters in excellent agreement with previous studies on bulk samples. We provide confirmation of high-$T_c$ superconductivity in LaH$_{10\pmδ}$ with highest $T_c$ of 247 K at 176 GPa evidenced in electrical measurements. The characteristic suppression of superconductivity is observed in magnetic fields. Furthermore, combined diffraction and electrical measurements reveal remarkable temporal stability of both the crystal structure and the high-$T_c$ superconductivity over the full measurement period of about 300 days post laser heating. Our work establishes film precursors using physical vapour deposition (PVD) techniques as a practical route to hydride formation, opening a pathway toward the controlled synthesis of promising ternary hydrides and the integration of micro-fabricated device geometries in diamond anvil cells.

cond-mat.supr-con↗

arXiv2026

Properties and applications of Lorentz--Muckenhoupt classes

In this paper, through the introduction of Lorentz--Muckenhoupt classes, we systematically investigate the boundedness of maximal operators on multiplier weighted Lorentz spaces. As applications, we give the characterization of the commutators of fractional integrals, which yields a partial answer to an open question proposed by D. Cruz-Uribe. Second, Hardy inequalities in Lorentz spaces are established, with the critical case $p=d$, in which the classical Hardy inequality fails. Finally, we apply the Lorentz estimates to fractional Schrödinger equations with singular potentials.

math.CA↗

arXiv2026

DrivingWorld: Constructing World Model for Autonomous Driving via Video GPT

Recent successes in autoregressive (AR) generation models, such as the GPT series in natural language processing, have motivated efforts to replicate this success in visual tasks. Some works attempt to extend this approach to autonomous driving by building video-based world models capable of generating realistic future video sequences and predicting ego states. However, prior works tend to produce unsatisfactory results, as the classic GPT framework is designed to handle 1D contextual information, such as text, and lacks the inherent ability to model the spatial and temporal dynamics essential for video generation. In this paper, we present DrivingWorld, a GPT-style world model for autonomous driving, featuring several spatial-temporal fusion mechanisms. This design enables effective modeling of both spatial and temporal dynamics, facilitating high-fidelity, long-duration video generation. Specifically, we propose a next-state prediction strategy to model temporal coherence between consecutive frames and apply a next-token prediction strategy to capture spatial information within each frame. To further enhance generalization ability, we propose a novel masking strategy and reweighting strategy for token prediction to mitigate long-term drifting issues and enable precise control. Our work demonstrates the ability to produce high-fidelity and consistent video clips of over 40 seconds in duration, which is over 2 times longer than state-of-the-art driving world models. Experiments show that, in contrast to prior works, our method achieves superior visual quality and significantly more accurate controllable future video generation. Our code is available at https://github.com/YvanYin/DrivingWorld.

cs.CV↗

arXiv2026

Stream Forcing: Constructing Unified Training Trajectory for Robust Streaming Video Generation

Streaming video generation holds strong potential for world modeling, where future frames must be inferred online sequentially to form a continuous video stream. However, streaming video diffusion models introduce a fundamental train-inference mismatch: inference follows a specialized denoising order, whereas advanced training strategies typically require diverse noise-level configurations. To address this trade-off between train-inference consistency and training coverage, we reformulate the video diffusion sampling as a frame-indexed stochastic process over noise levels. Within this stochastic process space, we construct a continuous training trajectory along which the sampling schedule progressively evolves from independent sampling to inference-consistent sampling. We further introduce a joint calibration algorithm and a temporal correlative sampling algorithm to ensure trajectory smoothness and cross-frame correlation. Building on these designs, we propose Stream Forcing, a unified training framework for streaming video generation that balances training sufficiency and inference efficiency. Extensive experiments demonstrate that Stream Forcing significantly improves generation quality with a 36.6% FVD improvement on the UCF-101 benchmark. Furthermore, our method facilitates robust zero-shot extrapolation to long-horizon video generation with a 27.9% FVD improvement on the UCF-101 benchmark.

cs.CV↗

arXiv2026

ReQuant: Fixed-Grid Discrete Refinement for Post-Training Quantization

Post-training quantization (PTQ) is widely used to reduce the memory and computational cost of large language models. Existing PTQ methods typically obtain an initial quantized model through heuristic rules or greedy optimization, and once quantization is completed the resulting integer assignments are usually treated as final. This observation motivates a complementary optimization stage within PTQ that keeps quantized weights improvable after an executable quantized model has been produced, while preserving the quantized format. We introduce ReQuant, a backpropagation-free fixed-grid refinement procedure for this stage. Agnostic to the PTQ initializer, ReQuant takes an existing quantized model as a feasible starting point and iteratively revisits its discrete weight assignments on the fixed quantization grid. Accepted updates strictly reduce the mean squared reconstruction error and remain on the original grid. In this way, ReQuant turns the initially fixed PTQ output into an iteratively optimizable discrete solution and serves as a plug-and-play post-processing stage for existing PTQ pipelines. Experiments across diverse model families, bit-widths, and downstream tasks show that ReQuant consistently improves quantized models from heterogeneous PTQ initializers, with especially large gains on simple initializers and lower bit-widths. Notably, ReQuant can refine a simple round-to-nearest initialization across multiple sweeps until it approaches or surpasses GPTAQ under the same quantization format. These results establish ReQuant as a practical complementary stage for further improving existing PTQ pipelines.

cs.AI↗

arXiv2026

Lost Opportunity Costs Under Ramp Stress: A Comparison of Ramp-Product Dispatch and Look-Ahead Economic Dispatch

This paper studies whether ramp-product settlement compensates generators that absorb intertemporal ramp scarcity as effectively as look-ahead economic dispatch. We evaluate this question by comparing the lost opportunity cost (LOC) induced by each approach. Using rolling-horizon simulations on a 10-generator system and a modified RTS-GMLC system, we compare ramp-product settlement (RP-LMP), look-ahead settlement (LA-LMP), and temporal locational marginal pricing (TLMP). In the featured deterministic ramp stressed cases, aggregate LOC is higher under RP-LMP than under LA-LMP. The main contribution is a generator-level critical assessment for ramp-product settlement: we identify which units are left with uncompensated intertemporal opportunity cost under RP-LMP and how that burden changes under LA-LMP. RP-LMP LOC is concentrated on units with repeated ramp-binding exposure, while LA-LMP mainly relieves those same units and leaves smaller residual LOC on other units. Multi-day tests preserve this ordering under perfect foresight in the larger test system, but show that it need not hold under forecast error.

eess.SY↗

arXiv2026

Robust device-independent characterization of sharpness and incompatibility of unsharp instruments

Unsharp measurements are key resources for tasks that balance information gain and disturbance, but certifying them without device assumptions remains a challenge. We propose a fully device-independent protocol for characterizing unsharp instruments, based on an entanglement-assisted sequential quantum random access code, where the first decoder is allowed to communicate her measurement setting to the second. This communication-enhanced scheme creates a decoding regime in which both decoders surpass classical bounds, enabling tight quantification of sharpness and direct quantification of measurement incompatibility beyond noncommunicating protocols. Experimentally, we implement tunable unsharp measurements using a Mach-Zehnder interferometer, observing the predicted sequential enhancement in decoding probability. Additionally, we achieve significantly narrower sharpness intervals and incompatibility quantification across multiple target sharpness values. Our results show that communication is a powerful operational resource for certifying precisely unsharp instruments and advancing device-independent quantum information protocols.

quant-ph↗

arXiv2026

Space-division multiplexed quantum key distribution exploiting multi-plane light conversion for few-mode fibers

As quantum key distribution (QKD) progresses from laboratory demonstrations toward practical deployment, quantum communi- cation networks increasingly require higher key rates and the ability to distribute independent secret keys among multiple users and network nodes. In this paper we present a promsing approach with multi-plane light conversion (MPLC) for demultiplexing entangled photons, transmitted through a few-mode fiber (FMF). We experimentally demonstrated a spatially multiplexed BBM92 QKD scheme. The modes are selectively excited through separate single-mode-fibers and subsequently separated by MPLC into distinct output ports. Unlike high-dimensional QKD based on coherent modal superpositions, our approach exploits distinguishable guided modes as parallel channels while preserving the entanglement required for QKD. For the multiplexed links, we obtain quantum bit error rates of $1.9 \pm 0.4\%$ for the channel 1 and $6.8 \pm 0.8\%$ for the channel 2. These results are relevant for scalable quantum-secured networks, space-division-multiplexed QKD systems, multi-user entanglement distribution, and future quantum internet architectures, where parallel quantum channels must be implemented without compromising the quantum correlations required for security.

quant-ph↗

arXiv2026

SWE-Milestone: Evaluating AI Agents on Continuous Software Evolution

Real-world software must continuously evolve to meet ever-changing and open-ended requirements. AI agents, increasingly deployed as long-running systems, are now entrusted to drive this evolution. Yet, existing benchmarks evaluate agents on isolated, one-off coding tasks, neglecting the temporal dependencies and technical debt inherent in real-world software evolution. To bridge this gap, we introduce DeepCommit, an agentic pipeline that reconstructs verifiable Milestone DAGs from noisy commit logs, where milestones are defined as functionally cohesive development goals. These executable sequences enable SWE-Milestone, a benchmark that evaluates agents on streams of milestone-level tasks, requiring them to sustain system integrity and limit error accumulation, dimensions of long-term software evolution largely missing from current benchmarks. Our evaluation of 12 frontier models across 4 agent frameworks reveals a critical vulnerability: overall performance scores drop significantly from >80% on isolated tasks to 38.03% in continuous settings, exposing agents' profound struggle with long-term maintenance and error propagation.

cs.SE↗

arXiv2026

Efficient Group Lasso Regularized Rank Regression with Simulation-Based Tuning

High-dimensional regression often suffers from heavy-tailed noise and outliers, which can severely undermine the reliability of least-squares based methods. To improve robustness, we adopt a non-smooth Wilcoxon score based rank objective and incorporate the group sparsity regularization. By extending the tuning-free property originally developed for the rank Lasso, we introduce a simulation-based tuning rule and further establish a finite-sample error bound for the resulting estimator. To solve the associated optimization problem, we develop a proximal augmented Lagrangian method, for which we provide a novel convergence analysis by proving the metric subregularity of the underlying non-polyhedral KKT mapping, while enabling efficient semismooth Newton updates for the subproblems. Extensive numerical experiments demonstrate the robustness and effectiveness of our proposed estimator against several leading alternatives, and showcase the efficiency and scalability of our algorithm compared to the state-of-the-art baseline in both simulated and real-data settings.

stat.ML↗

arXiv2026

Regression Accumulation in Multi-Turn LLM Programming Conversations

In LLM-assisted software development, coding is often iterative. We study regression accumulation in multi-turn LLM programming conversations, where later code suggestions may break requirements introduced in earlier turns. Reliability therefore depends not only on satisfying the current request, but also on preserving previously satisfied behavior. We construct 542 tasks from HumanEval+ and MBPP+ and extend each task into an 8-turn requirement-evolution chain. We evaluate six LLMs on 26,016 turn instances (542 x 6 x 8). At each turn, we test whether the current code still passes earlier benchmark tests. We also analyze 384 failure cases from the failure population and build a taxonomy of multi-turn regression bugs through independent four-annotator labeling. Our results show that regression accumulation appears across all six models: 40% to 73% of tasks lose previously correct behavior over the full conversation. Final-turn quality is lower than initial-turn quality across models, especially when later turns add input validation or broader input types. Manual analysis shows that Cross-Turn Conflict, where later code conflicts with earlier requirements, is the main failure class. We further find that Verification Gate, which checks new code against prior tests and triggers rollback and retry, is the only strategy that consistently improves all models, raising final-turn quality from 75.8% to 87.9% on DeepSeek-V3 and from 31.6% to 47.3% on Llama-3.1-8B. These findings suggest that strong single-turn performance can overestimate reliability in multi-turn coding conversations. Future evaluation and tool design should test whether later code suggestions preserve earlier requirements and should include Verification Gate mechanisms.

cs.SE↗

arXiv2026

DRL-Based Joint Beamforming and Surface Shape Optimization for Flexible Intelligent Metasurface-Aided ISAC Systems

Integrated sensing and communication (ISAC) unifies high-precision sensing and wireless data transmission. In this paper, we investigate the design of ISAC systems enabled by flexible intelligent metasurface (FIM) and aim to minimize the Cramér-Rao bound (CRB) with quality of service (QoS) constraints using deep reinforcement learning (DRL). Specifically, we formulate the joint design of beamforming matrix and FIMs surface shape to reduce the CRB subject to transmit power, QoS and the FIMs surface shape constraints. However, the non-convex formulation makes optimization problem difficult to solve. To tackle this issue, we develop a deep deterministic policy gradient (DDPG) actor critic DRL scheme for the joint design, guided by a constraint aware reward to progressively improve sensing performance. Numerical results demonstrate that jointly optimizing the beamforming matrix and the FIMs surface shape substantially decreases CRB while ensuring communication quality compared with existing rigid arrays.

cs.IT↗

arXiv2026

Revealing Safety-Critical Scenarios for UTM via Transformer

Unmanned Traffic Management (UTM) systems are cloud-based platforms designed to manage and coordinate multiple aerial vehicles remotely. UTM systems are safety-critical which cannot tolerate failures like crash or collision. To reveal latent vulnerabilities, there are neither optimal failure-exposing demonstrations nor clear reward signals. Additionally, UTM's self-healing capability introduces the ``long-tail effect'' of critical failures. We propose framing UTM vulnerability discovery as a sequence modeling problem amenable to transformer-based RL architectures. Our approach leverages attention mechanisms to directly model the relationship among system states, and predict optimal actions. Our framework introduces a Policy Model that generates targeted test scenarios and an Action Sampler that enforces domain constraints. We use a risk-based reward function to guide exploration. Through extensive evaluation on a 700-hour simulation study, we demonstrate an 8$\times$ improvement in vulnerability discovery efficiency compared to expert-guided testing. It also discovers critical edge cases that traditional methods have missed.

cs.AI↗

arXiv2026

The Forgetting-Retention Dilemma: Certified Unlearning Theory in Continual Learning

Machine unlearning aims to eliminate the influence of specific data from trained models to safeguard privacy. However, this presents a significant challenge in the context of continual learning (CL), where models update sequentially on dynamic datasets. A major limitation is that current certified unlearning algorithms fail to account for the complex, cumulative model evolution inherent to CL framework. In this work, we establish the first theoretical foundation bridging CL and machine unlearning. We formulate the CL's unlearning objective as the minimization of post-unlearning excess risk, which decomposes into CL excess risk and unlearning loss, characterizing the fundamental trade-off between preserving historical knowledge and targeted forgetting. Under mild assumptions, we first establish an upper bound for the CL excess risk in non-convex models. We then adapt two certified unlearning approaches, gradient-based and Hessian-based, to the CL framework. Our analysis reveals that while the gradient-based approach is less effective than the Hessian-based method in minimizing unlearning loss, it offers the distinct advantage of nearly zero storage overhead for enabling unlearning. This insight motivates a hybrid strategy that reduces storage costs while maintaining post-unlearning performance. Experimental results further validate our theoretical findings.

cs.LG↗

arXiv2026

SPACE: Swarm Pheromone Fields for Adaptive Collision-Aware Exploration

Massive robot swarms can explore unknown environments quickly, but adding robots eventually stops helping. Doorways and dense traffic create congestion, increasing inter-robot contacts and reducing the value of each additional robot. We study this safety-efficiency tradeoff for ground swarms of tens to hundreds of robots. We present SPACE, Swarm Pheromone Fields for Adaptive Collision-Aware Exploration. Inspired by ant foraging, SPACE maintains a shared environmental field with an attractive frontier pheromone, a repellent explore pheromone, and a fast robot-density field. Coordination is decentralized and mediated through this field. We evaluate SPACE on real building floorplans, namely sixteen home layouts from the HouseExpo dataset and eight campus floors from the KTH dataset, with swarms of up to two hundred and fifty-six robots. SPACE lies on the empirical Pareto frontier. It attains the lowest inter-robot contact rate at every congested swarm size, four to seventeen times fewer than a greedy nearest-frontier planner, while keeping coverage time within about two percent of that near time-optimal planner. The results indicate that, at this scale, coordination mainly improves safety rather than coverage time.

cs.RO↗

arXiv2026

Convergence analysis of the Riemannian proximal gradient method with inexact oracle

We extend the notion of an inexact first-order oracle from the Euclidean setting to Riemannian optimization, and conduct a convergence analysis for the Riemannian proximal gradient method equipped with this oracle, which we refer to as RPG-IO. Under mild conditions on the oracle errors, we establish the global convergence of RPG-IO. Specifically, we prove that (i) the norm of the search direction converges to zero; (ii) the sequence of function values converges to the function value at any accumulation point of the iterates; and (iii) every accumulation point of the iterates is a stationary point. Under the additional assumption of the Riemannian Kurdyka--Łojasiewicz (KL) property, we prove that the full sequence of iterates generated by RPG-IO converges to a single stationary point. Moreover, we derive explicit convergence rates when the KL exponent is specified. Finally, when a strong inexact oracle is employed, we establish the convergence rate of the sequence of function values to the optimal value.

math.OC↗

arXiv2026

SenseExpo: Spatial Exploration and Navigation via Scene Estimation from Expeditious Predictive Operators

We present \textbf{SenseExpo}, a lightweight single-robot exploration framework that integrates a compact map prediction network into a frontier-based strategy. SenseExpo addresses two long-standing challenges in classical methods -- high computational overhead and poor environmental generalization. Our prediction network combines Generative Adversarial Networks (GANs), Transformers, and Fast Fourier Convolution (FFC) to achieve a remarkably small footprint of only 709K parameters. Despite its compactness, SenseExpo outperforms U-Net (24.5M) and LaMa (51M) on the KTH dataset, achieving PSNR 9.026 and SSIM 0.718, representing a 38.7\% PSNR gain over LaMa. Cross-domain evaluation further verifies strong generalization with an FID of 161.55 on HouseExpo. In exploration experiments, SenseExpo reaches target coverage 67.9\% faster on KTH and 77.1\% faster on MRPB~1.0 than a MapEx-style global obstacle-prediction baseline under the same simulator; because the methods predict different map semantics, this comparison evaluates planning utility rather than a direct predictor ranking. Implemented as a plug-and-play ROS (Robot Operating System) node, our framework integrates with existing navigation stacks, providing an efficient solution for resource-constrained robotic systems.

cs.CV↗

arXiv2026

ACEsplat: Accelerated 3D Gaussian Scene Regression via RGB and Poses Only

Per-scene 3D Gaussian Splatting (3DGS) enables high-fidelity rendering, but practical robotic and AR scene capture pipelines often depend on external geometric initialization (e.g., SfM point clouds or depth estimates), which can be slow and brittle in on-site deployment. We present ACEsplat, a fast per-scene optimization framework that reconstructs 3D Gaussian representations from RGB images and camera poses only, without requiring external 3D priors (e.g., precomputed SfM models or supervised depth maps). ACEsplat uses a two-stage pipeline: (1) a self-supervised scene coordinate regression (SCR) module builds an internal geometry prior within 4--5 minutes; (2) SCR features and coordinate priors are fused by a lightweight Gaussian initialization head, followed by per-scene 3DGS optimization. On static-view rendering, ACEsplat achieves 29.11 dB PSNR on Wayspots with real-time SLAM poses and 33.20 dB on Cambridge Landmarks with SfM-refined poses. On RealEstate10K sparse-view novel view synthesis, it achieves competitive image fidelity under a challenging 2-view setting. ACEsplat completes scene-specific SCR mapping and 3DGS reconstruction within 15--25 minutes on a single GPU, making it a practical RGB+pose-only solution for rapid scene setup in robotics and mixed-reality applications.

cs.RO↗