arXiv subjects

Wei Qi

Publications and source records attributed to Wei Qi.

At least 19 recordsLinked to original sources

arXiv2026

A complete classification of left-invariant Einstein metrics on $S^3\times S^3$

We complete the classification of compact simply connected homogeneous Einstein manifolds in dimension six by resolving the remaining cases for left-invariant Einstein metrics on $G=\mathrm{SU}(2)\times\mathrm{SU}(2)\cong S^3\times S^3$. Previous work leaves two cases for the isotropy group $K$, namely $K=\{e\}$ and $K\cong\mathbb Z_2$. We first rule out $K=\{e\}$. Then we show that any $\mathbb Z_2$ symmetry generated by an inner involution $\sigma$ with $\tr\sigma=-2$ necessarily extends to a $\mathbb Z_2\times\mathbb Z_2$ symmetry. Together with the previously known classification results, these theorems imply that every left-invariant Einstein metric on $G$ is, up to homothety and isometry, either the standard product metric $g_{\rm can}$ or the Jensen nearly K\"ahler metric $g_{\rm NK}$.

math.DG↗

arXiv2026

Tunable high-charge relativistic electron beams via direct laser acceleration in hohlraum-preheated foam targets

Direct laser acceleration (DLA) in near-critical-density (NCD) plasmas can efficiently generate high-charge relativistic electron beams, yet beam parameters depend critically on precise plasma state manipulation. Solid-ablation NCD plasmas evolve rapidly, posing severe controllability challenges. We produce NCD plasma via indirectly heating foam targets with ns laser driven hohlraum soft X-ray. Electrons are generated through irradiating the plasma with another picosecond laser. Tuning the laser pulse delay $\tau$ enables control of plasma profiles and beam parameters. Experiments show that when the foam is heated ($\tau$ = 6 ns, 9 ns), the beam exhibits $T \sim 13$ MeV effective temperature, $E_k \sim 80$ MeV cutoff energy, and hundreds of nC/sr charge for $E_k > 7.5$ MeV. These values are significantly higher than those from solid-foil ($T$ $\sim$ 2.7 MeV, $E_k$ $\sim$ 20 MeV, $Q$ $\sim$ 9 nC/sr) and cold-foam ($T$ $\sim$ 12 MeV, $E_k$ $\sim$ 50 MeV, $Q$ $\sim$ 5 nC/sr) interactions. At a longer delay of $\tau$ = 15 ns, the charge increases further while the temperature decreases, and at a shorter delay of $\tau$ = 3 ns, both temperature and charge are lower. 3D PIC simulations link these observations to the interplay between the microstructure of the cold foam and the evolving plasma density profile at different delay times, which together determine the beam charge, effective temperature, and divergence. The finding provides a routine to generate and tailor the relativistic electron beams, which is essential for designing laser-driven electron sources for high energy density physics and photonuclear reaction applications.

physics.plasm-ph↗

arXiv2026

Transpose Symmetry of Injectivity over Commutative Semirings

Let R be a commutative semiring, not necessarily with a multiplicative identity, and let A be an element of Mn(R). We prove that the map x to Ax on Rn is injective if and only if x to AT x is injective. Equivalently, the left- and right-cancellative elements of the multiplicative semigroup Mn(R) coincide. The proof splits formal determinant expansions into their even and odd halves; it uses no subtraction, additive cancellation, group completion, inverse, or multiplicative identity. As consequences we recover the stable-finiteness theorem for matrices over unital commutative semirings. We also prove that surjectivity is invariant under transpose. In fact, the existence of a surjective square matrix of positive size forces R to have a multiplicative identity.

math.RA↗

arXiv2026

SSPO: Structure-Aware Similarity-Weighted Preference Optimization for Neural Combinatorial Optimization

Neural combinatorial optimization (NCO) relies on parallel solution sampling for training, yet existing methods fail to fully exploit the rich information latent in a co-sampled solution group. Preference-optimization methods anchor on the single best solution and discard fine-grained quality and structural signal from all other peers-a failure we term gradient signal polarization. Mean-based baselines instead weight peers uniformly, so structurally near-identical peers flood the baseline with redundant information and keep gradient variance high-a failure we term baseline redundancy. We propose SSPO (Structure-Aware Similarity-Weighted Preference Optimization), which scores all $B$ sampled solutions jointly through a dissimilarity-weighted leave-one-out baseline: structurally distinct peers receive higher weight, resolving both failures in a single mechanism. The baseline uses zero-parameter, problem-adaptive solution embeddings built from the encoder's existing node representations. Experiments on TSP, EFL, and JSP benchmarks show consistent gains over prior best-anchor and uniform-weight baselines. A direct comparison against uniform RLOO on TSP and EFL confirms that structure-aware weighting is the primary driver of improvement. The SSPO-trained EFL policy has been deployed in a production facility-location system at JD$\mathord{.}$com, confirming practical viability at scale.

stat.ML↗

arXiv2026

DualCert: A Solver for the Traveling Salesman Problem with Constraint-Coupled Learning

Large traveling salesman problem (TSP) instances require a solver to allocate limited computation while preserving the validity of its outputs. Existing neural--operations-research (OR) hybrids predict guidance without requiring learned transitions to satisfy constraints discovered during search. DualCert introduces \emph{constraint-coupled learning}, in which current degree equations and dynamically separated subtour-elimination constraints (SECs) define each learned transition. At each refinement, the degree equations and selected, strictly satisfied SEC equations, with positive slacks, define an iterate-dependent primal-slack Karush--Kuhn--Tucker (KKT) manifold. Repaired dual variables and violated SEC rows define a local cost field. An exact constrained mirror-descent step maps each finite state to a positive state on the same manifold. Where selected rows and deterministic ties remain fixed, implicit differentiation maps parameter perturbations into the manifold tangent space and reuses the forward constraint operator for the local-cost-field derivative. The terminal edge state allocates computation across Held--Karp ascent, candidate-graph edge tests, and tour construction under a fixed budget. Deterministic verification recomputes original costs and accepts only verified candidate-graph lower bounds and edge decisions. On 1,000 held-out TSP1000 instances, DualCert attains a mean tour-cost gap of $0.0573\%$ from Lin--Kernighan--Helsgaun version 3 (LKH-3) reference tours in $9.55$ batch-amortized seconds per instance. It returns a verified candidate-graph lower bound for every instance and achieves $81.46\%$ edge-decision coverage. The mean gap is $67.1\%$ smaller than the reported NeuroLKH mean gap. Thus, optimization constraints govern learning, while deterministic verification preserves output validity.

cs.AI↗

arXiv2026

Scores Are Not Decisions: Cost-Aware Stopping for Tool Acquisition in LLM Agents

As LLM agents increasingly depend on diverse external services such as search engines, databases, and connectors, agent harnesses face a fundamental tool-selection challenge: acquiring too few tools leaves the task under-informed, while too many adds cost, context load, and privacy exposure. Routers and retrievers can rank candidate tools by relevance, but a ranking alone does not determine how many are worth selecting. Existing approaches leave acquisition under heterogeneous costs unaddressed. We formulate this decision as cost-aware marginal decision-focused stopping (CAM-DF) over ranked tool prefixes, with CAM-DF-lite as a compact interpretable variant. We train directly on the offline gap between stopping now and the best continuation: its sign labels the decision, its magnitude weights each error by the payoff at stake. We prove this objective is Bayes-aligned with the stopping target and that score-only rules are suboptimal under heterogeneous costs. We evaluate on 1,343 tasks across five tool-use domains. On $\tau$-bench Retail, CAM-DF attains the highest payoff among deployable methods, with gains over a predict-then-threshold baseline across all five ranking sources and two cost regimes. Our approach is state-of-the-art under heterogeneous costs and high cost pressure, with larger gains under weaker rankings. In live execution, CAM-DF exposes the agent to 37\% fewer tools than full access while maintaining comparable task success. The CAM-DF family is a lightweight pre-execution plugin that turns existing tool rankings into lower-cost acquisition decisions without fine-tuning the underlying LLM.

cs.LG↗

arXiv2026

SPORD: A Simulation-Propose-then-OR-Dispose Approach for Supply Chain Planning

For years, supply chain planning at e-commerce firms has operated as a collection of isolated projects. Each planning task from static network planning to dynamic warehouse assortment planning requires analysts to spend weeks building models from scratch, calibrating and persuading executives to act on outputs they cannot verify. Three barriers drive this: bespoke models proliferate because standardization is difficult (operational fragmentation); once unified, the combinatorial scale of millions of SKUs, thousands of nodes, and intricate routing logic exceeds what solvers can handle within a tight window (computational intractability); and a mathematically optimal solution still fails to be implemented if the executives do not trust it (implementation hurdle). To bridge this gap, we propose and implement the Simulation-Propose-then-OR-Dispose method, deployed as JD.com's NetSim platform. The central insight is decoupling: simulation proposes by generating and evaluating the full set of operationally valid candidate paths-absorbing all idiosyncratic business logic, while an integer program disposes by selecting the globally optimal subset. Computationally, matrix-vectorized CPU/GPU accelerated simulation achieves a 10-100 times speedup over serial methods, and a list scheduling algorithm reduces coupled-order processing from hours to minutes. Operationally, we establish a closed loop via an intelligent diagnosis engine. Since 2025, NetSim has optimized end to-end services for over 20,000 suppliers, the cross-regional fulfillment rate dropped from 6.1% to 4.9%, and the average monthly carbon reduction is approximately 5,745 tCO2e. SPORD moves simulation from monitoring to active planning. The transparent outputs turn skeptical executives into engaged collaborators, and the modular architecture ensures that the next planning requires just configuration, not reconstruction.

cs.AI↗

arXiv2026

EHR-MPC: Inference-Time Control for Sepsis Treatment with Generative Patient Digital Twins

Sepsis is a leading cause of mortality, yet optimal treatment policies remain contested. Existing reinforcement learning (RL) approaches learn fixed strategies for sepsis treatment, limiting adaptability to changing clinical objectives during inference. We propose EHRMPC, a framework that decouples learning patient dynamics from optimizing treatment by training a patient digital twin in the form of a generative electronic health record (EHR) model. The digital twin predicts clinical trajectories under interventions and enables model predictive control (MPC) to optimize treatments via inference-time planning over simulations. We evaluate EHR-MPC on a multicenter ICU sepsis cohort spanning 8 hospitals in the Mass General Brigham health system using both off-policy importance sampling and on-policy simulation-based evaluation. Relative to RL baselines, EHR-MPC achieves comparable off-policy performance and improved simulation performance. Unlike RL, this work frames sepsis treatment optimization as inference-time control over learned patient dynamics, establishing a general framework for decision making with generative clinical models.

stat.ML↗

arXiv2026

On-Demand Service Zone Design for Energy-Constrained Spatial Queueing Systems

Electric service vehicles (ESVs), such as mobile chargers and drone-based service units, are becoming an important operational resource for on-demand service systems. Unlike conventional spatial servers, ESV operations are shaped by battery limits and recharging needs, which affect dispatch feasibility and spatial deployment decisions. We develop an energy-constrained hypercube spatial queueing model that embeds battery-state dynamics into the classical hypercube framework and uses a semi-Markov representation to estimate steady-state performance. We then formulate a joint location--zoning problem for station placement and service zone design. The resulting large-scale mixed-integer nonlinear program admits a set partitioning reformulation whose column coefficients are not available in closed form. We therefore develop a Branch-Price-and-Evaluation framework for set partitioning problems with externally computable column coefficients: upper-bounding surrogates guide pricing, and iterative exact evaluation updates the coefficients of active columns. Computational results show that explicit energy modeling significantly reduces false service promises and yields more credible planning decisions. They also reveal a load-dependent reversal in zoning: pooling is preferable under light demand, whereas tighter zoning becomes more profitable as demand increases. Over the tested range, profitability is driven more by zoning than by battery improvement, suggesting that managers should get service zone design right before investing in battery upgrades; this caution is reinforced by the counterintuitive finding that larger batteries may delay replenishment and reduce fleet readiness under sparse demand. These findings show that energy feasibility is not merely a matter of battery-capacity expansion, but a design dimension that shapes service-zone configuration.

cs.PF↗

arXiv2026

Observation of stopping power reduction at strong ion-plasma coupling

Ion stopping in dense plasma is crucial for stellar evolution and fusion ignition. However, its behavior in the strong ion-plasma coupling regime beyond the linear limit has long remained elusive, due to formidable experimental challenges. Here we report the first experimental investigation of ion stopping at an unprecedented coupling parameter exceeding unity, achieved by sending laser-accelerated short-pulse and intense quasi-monoenergetic carbon ions ($\sim$583 keV/u, C$^{5+}$) into a uniform, long-lived, well-characterized dense plasma target ($T_e$ $\approx$ 17 eV, $n_e$ $\approx$ 4$\times$10$^{20}$ cm$^{-3}$). By simultaneously measuring ion energy loss and charge-state evolution, we eliminated key experimental ambiguities arising from charge-state determination. Our results clearly show a reduction in stopping power compared with predictions from standard linear dielectric response or binary collision models, and they agree well with the hybrid calculation of molecular dynamics with quantum corrections. The importance of nonlinear screening effects arising from many-body interactions and quantum effects due to the wave nature of electrons was demonstrated at strong coupling. This work establishes a definitive high-fidelity experimental benchmark for collisional dynamics in the strong-coupling regime. It offers critical insight for accurate modeling of energy transport in inertial confinement fusion and astrophysical plasmas.

physics.plasm-ph↗

arXiv2026

Efficient Generation of Neutrons Based on Ultrashort Laser-driven Direct Acceleration in Microwire-Array Targets

We report on an experimental demonstration of efficient neutron generation based on direct laser acceleration in microwire-array targets irradiated by ultrashort (tens of femtoseconds) laser pulses. The optimal array period was identified, at which the maximum proton energy and the number of protons with energies exceeding $1~\mathrm{MeV}$ were significantly increased. Using a $1~\mathrm{PW}$, $\sim25~\mathrm{fs}$ laser at a moderate intensity of $\sim10^{20}~\mathrm{W/cm^2}$, a high neutron yield of up to $(8.33\pm0.84)\times10^{6}~\mathrm{n/sr/J}$ was detected from the LiD converter via $^7\mathrm{Li}(p,n)$ and $\mathrm{D}(p,n+p)$ nuclear reactions. Self-consistent integrated simulations reproduced the experimental results and predicted that with a Be converter, a forward pulsed neutron source with an unprecedented yield per joule of $3.67\times10^{7}~\mathrm{n/sr/J}$ can be obtained under identical laser conditions. This type of neutron source is favorable for applications that require a high repetition rate utilizing compact and economical laser systems.

physics.plasm-ph↗

arXiv2026

Polarization, Maximal Concurrence, and Pure States in High-Energy Collisions

We establish a quantitative relation between local spin polarization and quantum entanglement in two-qubit systems by mathematically proving a closed-form upper bound on the concurrence at fixed local polarization magnitudes. The bound shows how the maximal concurrence is jointly constrained by the two local polarizations. We further demonstrate that this bound is saturated by pure states in certain cases with identical polarizations. As a concrete physical application, we consider the parity-violating process $e^+e^- \to Z^0 \to q\bar{q}$, which generates final-state spin polarization. We show that the maximal concurrence is attained in specific kinematic regions and is significantly reduced relative to the unpolarized case. These results establish a general, process-independent framework connecting local polarization, maximal entanglement, and pure states.

hep-ph↗

arXiv2026

ActivityEditor: Learning to Synthesize Physically Valid Human Mobility

Human mobility modeling is indispensable for diverse urban applications. However, existing data-driven methods often suffer from data scarcity, limiting their applicability in regions where historical trajectories are unavailable or restricted. To bridge this gap, we propose \textbf{ActivityEditor}, a novel dual-LLM-agent framework designed for zero-shot cross-regional trajectory generation. Our framework decomposes the complex synthesis task into two collaborative stages. Specifically, an intention-based agent, which leverages demographic-driven priors to generate structured human intentions and coarse activity chains to ensure high-level socio-semantic coherence. These outputs are then refined by editor agent to obtain mobility trajectories through iteratively revisions that enforces human mobility law. This capability is acquired through reinforcement learning with multiple rewards grounded in real-world physical constraints, allowing the agent to internalize mobility regularities and ensure high-fidelity trajectory generation. Extensive experiments demonstrate that \textbf{ActivityEditor} achieves superior zero-shot performance when transferred across diverse urban contexts. It maintains high statistical fidelity and physical validity, providing a robust and highly generalizable solution for mobility simulation in data-scarce scenarios. Our code is available at: https://anonymous.4open.science/r/ActivityEditor-066B.

cs.AI↗

arXiv2026

PolyFormer: learning efficient reformulations for scalable optimization under complex physical constraints

Real-world optimization problems are often constrained by complex physical laws that limit computational scalability. These constraints are inherently tied to complex regions, and thus learning models that incorporate physical and geometric knowledge, i.e., physics-informed machine learning (PIML), offer a promising pathway for efficient solution. Here, we introduce PolyFormer, which opens a new direction for PIML in prescriptive optimization tasks, where physical and geometric knowledge is not merely used to regularize learning models, but to simplify the problems themselves. PolyFormer captures geometric structures behind constraints and transforms them into efficient polytopic reformulations, thereby decoupling problem complexity from solution difficulty and enabling off-the-shelf optimization solvers to efficiently produce feasible solutions with acceptable optimality loss. Through evaluations across three important problems (large-scale resource aggregation, network-constrained optimization, and optimization under uncertainty), PolyFormer achieves computational speedups up to 6,400-fold and memory reductions up to 99.87%, while maintaining solution quality competitive with or superior to state-of-the-art methods. These results demonstrate that PolyFormer provides an efficient and reliable solution for scalable constrained optimization, expanding the scope of PIML to prescriptive tasks in scientific discovery and engineering applications.

cs.LG↗

arXiv2026

A survey on the uniform $S$-version of rings, modules and their homological theories

This survey provides a comprehensive overview of the recent advancements in the theory of ``uniformly $S$''-algebraic structures in commutative ring theory. Originating from the classical concepts of Noetherian, coherent, von Neumann regular, and semisimple rings, the introduction of a multiplicative subset $S$ has led to the development of $S$-Noetherian, $S$-coherent, and other $S$-analogues. However, the element $s \in S$ in the original definitions often depends on the ideal or module under consideration. To overcome this limitation and enable deeper module-theoretic characterizations, the notion of "uniformly $S$" (abbreviated as $u$-$S$) was introduced. This survey systematically presents the definitions, characterizations, and properties of $u$-$S$-torsion modules, $u$-$S$-exact sequences, and the subsequent uniform analogues of fundamental module classes: $u$-$S$-finitely presented, $u$-$S$-Noetherian, $u$-$S$-coherent, $u$-$S$-flat, $u$-$S$-projective, $u$-$S$-injective, and $u$-$S$-absolutely pure modules. We then explore the associated uniform homological dimensions, including the $u$-$S$-weak global dimension, the $u$-$S$-global dimension, and their interplay with polynomial rings and localizations. The survey also covers structural ring classes such as $u$-$S$-von Neumann regular, $u$-$S$-semisimple, $u$-$S$-Artinian, $u$-$S$-multiplication rings, and rings with $u$-$S$-Noetherian spectrum.

math.AC↗

arXiv2026

QDBFT: A Dynamic Consensus Algorithm for Quantum-Secured Blockchain

The security foundation of blockchain system relies primarily on classical cryptographic methods and consensus algorithms. However, the advent of quantum computing poses a significant threat to conventional public-key cryptosystems based on computational hardness assumptions. In particular, Shor's algorithm can efficiently solve discrete logarithm and integer factorization problems in polynomial time, thereby undermining the immutability and security guarantees of existing systems. Moreover, current Practical Byzantine Fault Tolerance (PBFT) protocols, widely adopted in consortium blockchains, suffer from high communication overhead and limited efficiency when coping with dynamic node reconfigurations, while offering no intrinsic protection against quantum adversaries. To address these challenges, we propose QDBFT, a quantum-secured dynamic consensus algorithm, with two main contributions: first,we design a primary node automatic rotation mechanism based on a consistent hash ring to enable consensus under dynamic membership changes, ensuring equitable authority distribution; second, we integrate Quantum Key Distribution (QKD) networks to provide message authentication for inter-node communication, thereby achieving information-theoretic security in the consensus process. Experimental evaluations demonstrate that QDBFT achieves performance comparable to traditional PBFT while delivering strong resilience against quantum attacks, making it a promising solution for future quantum-secure decentralized infrastructures.

cs.CR↗

arXiv2026

A Dual-TransUNet Deep Learning Framework for Multi-Source Precipitation Merging and Improving Seasonal and Extreme Estimates

Multi-source precipitation products (MSPs) from satellite retrievals and reanalysis are widely used for hydroclimatic monitoring, yet spatially heterogeneous biases and limited skill for extremes still constrain their hydrologic utility. Here we develop a dual-stage TransUNet-based multi-source precipitation merging framework (DDL-MSPMF) that integrates six MSPs with four ERA5 near-surface physical predictors. A first-stage classifier estimates daily precipitation occurrence probability, and a second-stage regressor fuses the classifier outputs together with all predictors to estimate daily precipitation amount at 0.25 degree resolution over China for 2001-2020. Benchmarking against multiple deep learning and hybrid baselines shows that the TransUNet - TransUNet configuration yields the best seasonal performance (R = 0.75; RMSE = 2.70 mm/day) and improves robustness relative to a single-regressor setting. For heavy precipitation (>25 mm/day), DDL-MSPMF increases equitable threat scores across most regions of eastern China and better reproduces the spatial pattern of the July 2021 Zhengzhou rainstorm, indicating enhanced extreme-event detection beyond seasonal-mean corrections. Independent evaluation over the Qinghai-Tibet Plateau using TPHiPr further supports its applicability in data-scarce regions. SHAP analysis highlights the importance of precipitation occurrence probabilities and surface pressure, providing physically interpretable diagnostics. The proposed framework offers a scalable and explainable approach for precipitation fusion and extreme-event assessment.

cs.LG↗

arXiv2025

A Quantitative Method for Evaluating Security Boundaries in Quantum Key Distribution Combined with Block Ciphers

With the rapid development of quantum computing, classical cryptography systems are increasingly vulnerable to security threats, thereby highlighting the urgency of constructing architectures that are resilient to quantum computing attacks. While Quantum Key Distribution (QKD) offers security with information-theoretic guarantees, its relatively low key generation rate necessitates integration with classical cryptographic techniques, particularly block ciphers such as AES and SM4, to facilitate practical applications. However, when a single QKD-key is employed to encrypt multiple data blocks, the reduction in cryptographic security strength has not yet been quantitatively analyzed. In this work, we focus on the security strength in the application scenario where QKD is combined with block ciphers. We propose a quantitative evaluation method for the security benefits of the QKD-key renewal period, aiming to provide a precise measure of the cryptographic security strength in such hybrid systems. Our method is based on concrete security paradigm of block cipher modes of operation. We demonstrate that under practical security level requirements, for files consisting of specific blocks, rekeying k times can provide an additional log2(k) to 2log2(k) bits of security. Our research offers a novel perspective on balancing the security and efficiency of QKD-based encryption.

cs.CR↗