Search arXiv⌕ Search

arXiv subjects

Ruoyu Zhang

Publications and source records attributed to Ruoyu Zhang.

At least 19 recordsLinked to original sources

DeepSeek Elastic Compute (DSec): A Sandbox Infrastructure for Effective Agentic Training at Scale

Large-scale agentic training and evaluation with large language models (LLMs) rely on isolated, stateful execution environments in which models inspect repositories, invoke tools, execute commands, and interact with task-specific services. These workloads create sandboxes in large bursts, span heterogeneous functionality and isolation requirements, retain state across long interactions, and draw from large image corpora with limited reuse. Supporting them therefore requires an elastic execution platform rather than a single sandbox runtime. This report presents DeepSeek Elastic Compute (DSec), a production sandbox platform that exposes FnCall, container, microVM, and full-VM sandbox backends through a unified SDK. DSec coordinates placement and lifecycle management across the cluster, composes environments from independently versioned layers, combines memory sharing, reclamation, and CPU scheduling for high-density execution, and loads image data on demand from Fire-Flyer File System (3FS), a cluster-wide distributed filesystem. DSec is co-designed with the reinforcement learning (RL) framework, decouples stateful rollout execution from preemptible GPU training, coordinates sandbox lifecycle with training to preserve rollout state while reclaiming idle resources, and mitigates agent misbehavior such as reward hacking. A single production-scale unit of DSec spans around 160 nodes, serving about 3 million sandboxes per day; in production, it supports over 380,000 concurrent sandboxes and sustains over 5,000 sandbox creations per second. Our evaluation and deployment experience show that these mechanisms reduce environment setup and image-distribution overhead, improve memory efficiency, and preserve latency-sensitive performance under high-density overcommit.

cs.DC↗

Channel Estimation for Movable Antenna Systems: Challenges, Solutions, and Opportunities

Movable antenna (MA) has emerged as a promising technology for future wireless networks by exploiting channel variation over local antenna movement regions. However, accurate and efficient channel acquisition in MA systems remains challenging due to the trade-off between estimation accuracy and computational complexity. In this article, the MA channel model and the associated estimation framework are first reviewed, where channel information over the movement region is reconstructed from finite measurements by exploiting shared path parameters. The structured dependence of MA observations across space, time, and frequency naturally motivates the adoption of tensor-based modeling for channel estimation. Subsequently, we discuss the tensor-based signal model and corresponding parameter estimation methods from multidimensional observations. These methods are further compared with conventional channel estimation methods in terms of estimation accuracy, computational complexity, and general applicability. Furthermore, a representative case study is provided to illustrate the performance and characteristics of different algorithms under MA channel estimation settings. Finally, some future research directions for tensor decomposition-based channel estimation in MA systems are outlined.

eess.SP↗

Self-Calibration DOA Estimation for Movable Antenna Systems with Antenna Position Errors

In this letter, we investigate the direction-of-arrival (DOA) estimation problem for wireless sensing with movable antenna (MA) systems in the presence of unknown antenna position errors (APE). To achieve robust wireless sensing, we transform the DOA estimation problem with APE into an optimization problem via the orthogonality between the steering vector and the noise subspace. Then we propose an alternating optimization (AO)-based self-calibration estimation, which consists of two stages and iteratively estimates the APE and DOA. Specifically, in the first stage, by fixing the APE, the problem reduces to the classical DOA estimation problem, which is solved using the multiple signal classification (MUSIC) algorithm. In the second stage, we fix the DOA to estimate the APE. By applying the Lagrange multiplier technique to the subproblem, we obtain a closed-form expression for the APE estimation. Simulation results demonstrate the superior DOA estimation performance of the proposed self-calibration algorithm for MA systems compared to the existing approaches.

eess.SP↗

Tensor Decomposition-Based Wireless Sensing for MIMO-OFDM ISAC via Flexible Spatial-Temporal-Spectral Optimization

Integrated sensing and communication (ISAC) is regarded as a key enabling technique in future 6th-generation (6G) mobile communication systems. However, existing multi-input multi-output (MIMO) orthogonal frequency division multiplexing (OFDM) ISAC designs generally rely on the fixed-position antennas and fixed allocation of time-frequency resources, thereby limiting the degrees of freedom of wireless sensing along the spatial-temporal-spectral dimensions. In this paper, we propose a novel wireless sensing framework for MIMO-OFDM ISAC systems with flexible spatial-temporal-spectral optimization and propose a tensor decomposition-based approach to estimate target parameters, including azimuth/elevation angles, ranges, and velocities. Specifically, we first establish a monostatic wireless sensing model for MIMO-OFDM ISAC systems, where the positions of antenna elements, the allocation of OFDM symbols and subcarriers can be flexibly configured. Then, we formulate the problem of estimating target parameters as a tensor decomposition problem admitting to the canonical polyadic format, which enables the parallel target parameters estimation process from corresponding factor matrices along the spatial, temporal, and spectral dimensions, respectively. Based on the decomposed factor matrices, we derive the Cramer-Rao Bound (CRB) for the unknown target parameters and reveal that the estimation accuracy of azimuth/elevation angles, velocities and ranges is fundamentally determined by the array geometry, the distribution of OFDM symbols and subcarriers. Building on this insight, we obtain an optimized solution for the positions of antenna elements, and optimal solutions for the subcarrier allocation and OFDM symbol allocation to minimize the CRB, as well as the mean square error of target parameters estimation.

eess.SP↗

Movable Antenna Enhanced Wireless Sensing via Steering Vector Correlation and CRB Optimization

In this paper, we investigate the angle-of-arrival (AoA) estimation problem for wireless sensing systems equipped with movable antennas (MA). To achieve high estimation performance and accuracy, we formulate a joint optimization problem integrating the sidelobes of steering vector correlation (SVC) and the Cramér-Rao bound (CRB). We first mathematically transform the SVC and the CRB into tractable objective functions. Specifically, we introduce a proxy variable and apply a discrete grid search strategy to overcome the intractability of optimizing the SVC with unknown target angles. Concurrently, we derive a generalized lower bound for the CRB, which yields a scalar function of the MA positions. Guided by the transformed objective, we propose a successive convex approximation-based position optimization algorithm. The proposed algorithm handles the non-convex terms by employing first order Taylor expansions within a defined trust region, which allows the MA positions to be updated incrementally in each iteration. Simulation results demonstrate that the proposed algorithm achieves superior AoA estimation performance.

eess.SP↗

Rotatable Antenna-Enhanced Wireless Sensing with Uniform Sparse Array via Tensor Decomposition

In this letter, we propose a new wireless sensing system equipped with a rotatable antenna (RA) array to enhance the sensing performance of a uniform sparse array (USA). To tackle the severe spatial undersampling issues, we propose a novel tensor decomposition-based direction-of-arrival (DOA) estimation algorithm. Specifically, we introduce a synchronous multiple rotation pattern for active target probing such that the received signals across multiple rotations to capture the diverse spatial degree of freedoms. Subsequently, we mathematically formulate the received signals across successive rotations as a third-order tensor, and leverage the canonical polyadic decomposition to obtain the factor matrices incorporating the DOA of targets. By analyzing the extrema distribution laws of array steering vector correlation (SVC) and gain SVC of RAs, we propose to combine the array and gain factor matrices via the Kronecker product, which theoretically guarantees the unambiguous DOA estimation. Simulation results demonstrate that the proposed RA-enhanced tensor decomposition-based algorithm achieves high-precision and unambiguous sensing performance compared to conventional uniform dense arrays and omnidirectional antenna systems.

eess.SP↗

Tensor-Based Dynamic Channel Estimation for mmWave Movable Antenna MIMO Systems

This paper investigates the dynamic channel estimation algorithm in mmWave movable antenna (MA) multiple-input multiple-output (MIMO) systems. To achieve highly accurate channel estimation, we propose a tensor decomposition-based channel estimation algorithm. First, by leveraging the path response model and utilizing the intrinsic sparsity of mmWave channels, the channel corresponding to MA pairs at the base station and mobile station is transformed into a superposition of channels from sparse paths. Next, the received signal is constructed as a fourth-order tensor to fully capture the high-dimensional structural information of the MA MIMO channel. Then, two tensor decomposition schemes are adopted to extract the factor matrices, and our analysis reveals that the uniqueness of the decomposition can be guaranteed in our model. Subsequently, the propagation loss, frequency offset, angle of arrival/departure, and time delay are obtained based on these factor matrices and the channel matrix can be rebuilt. Additionally, Cramér-Rao bound (CRB) is also derived as a performance evaluation standard, proving that the proposed algorithm achieves a higher estimation accuracy and nearly approaches this minimum bound. Moreover, normalized mean square error (NMSE) is selected as the evaluation metrics for estimation accuracy. Finally, simulation results reveal a notable reduction in the estimation error of the proposed algorithm when compared to the baseline algorithms, confirming its estimation advantage.

eess.SP↗

Arveson's version of the Gauss-Bonnet-Chern formula for Hilbert modules over the polynomial rings

In this paper, we refine the framework of Arveson's version of the Gauss-Bonnet-Chern formula by proving that a submodule in the Drury-Arveson module being locally algebraic is equivalent to Arveson's version of the Gauss-Bonnet-Chern formula holding true for the associated quotient module. Moreover, we establish the asymptotic Arveson's curvature invariant and the asymptotic Euler characteristic for contractive Hilbert modules over polynomial rings in infinitely many variables, and obtain the infinitely-many-variables analogue of Arveson's version of Gauss-Bonnet-Chern formula. Finally, we solve the finite defect problem for submodules of the Drury-Arveson module $H^2$ in infinitely many variables by proving that $H^2$ has no nontrivial submodules of finite rank.

math.FA↗

Arveson's Gauss-Bonnet-Chern Formula for Hilbert Modules in the Multiplier-Algebra Framework

The present paper continues Arveson's program on curvature, Euler characteristic, and Gauss-Bonnet-Chern type formulae for Hilbert modules. For regular unitarily invariant complete Nevanlinna--Pick spaces on the unit ball in \(\mathbb{C}^d\), we prove that Arveson's Gauss-Bonnet-Chern formula holds unconditionally over the full multiplier algebra. Together with the polynomial-ring case, this shows that the validity of the formula depends essentially on the coefficient algebra. We then solve Arveson's finite defect problem in the same framework by giving a sharp classification of finite defect submodules. This problem is natural in curvature theory, since both curvature and Euler characteristic are governed by the defect structure. Finally, using commutative-algebra methods, we apply this classification to unitary-equivalence rigidity for finite-codimensional submodules of vector-valued reproducing kernel Hilbert modules.

math.FA↗

Joint Shape-Position Optimization Enhanced 2D DOA Estimation in Movable Antenna Systems

Movable Antenna (MA) technology is emerging as a promising advancement with the potential to significantly enhance the performance of future wireless communication and sensing systems. In this paper, we address two-dimensional (2D) direction of arrival (DOA) estimation via joint shape-position optimization. Specifically, we formulate an optimization problem aimed at minimizing the Cramér-Rao Bound (CRB) based on a 2D DOA estimation model for MA systems. To tackle the highly non-convex nature of this CRB minimization, we investigate the spatial utilization of the movable region (MR) under minimum antenna spacing constraints. By demonstrating that an equilateral triangle yields the minimum overlap area, we strategically design an equilateral triangular MR. This specific geometric configuration enables the exploitation of structural symmetry to simplify the geometric constraints, which effectively reduces the complexity of solving the optimization problem. Subsequently, we derive the optimal MA positions by selecting the candidate locations farthest from the centroid of MR. The results demonstrate that the proposed joint shape-position optimization substantially enhances 2D DOA estimation performance.

eess.SP↗

Search for Charmonium(-like) states decaying into the $Ω^-\barΩ^+$ final states

Recently, the BESIII experiment performed a measurement of the energy-dependent Born cross section and the effective form factor for the $e^+e^-\toΩ^-\barΩ^+$ reaction at center-of-mass energies ranging from 3.4 to 4.7 GeV. A fit to the energy dependence of the dressed cross section is performed. With the assumption of a charmonium (like) resonance [i.e., $ψ(3770)$, $ψ(4040)$, $ψ(4160)$, $Y(4230)$, $Y(4360)$, $ψ(4415)$, or $Y(4660)$] plus a power-law function, the fit is applied to the data from the recent BESIII measurement, which was additionally combined with previous CLEO-c measurement data. No significance is found. The products of the branching fraction and the two electronic partial widths for the assumed charmonium(-like) states decaying into the $Ω^-\barΩ^+$ final states are also provided. In addition, by taking the world average values of the electronic branching fraction, the branching fractions for $ψ(3770)$, $ψ(4040)$, $ψ(4160)$, $ψ(4415)$ decaying into $Ω^-\barΩ^+$ final states at the 90\% confidence level are determined for the first time. These are found to be at least an order of magnitude larger than expected from predictions using a scaling based on the observed electronic widths.

hep-ex↗

A Review of Hyperon Physics at BESIII Experiment

The BESIII Collaboration has collected large data samples from $e^+e^-$ collisions at center-of-mass energies ranging from 1.84 to 4.95 GeV, which include the world's largest charmonium sample, consisting of 10 billion $J/ψ$ and 3 billion $ψ(3686)$ events. These high-statistics datasets enable BESIII to carry out a wide range of studies in hyperon physics. In this article, we review the major achievements of the BESIII Collaboration in this field, which can be broadly categorized into four areas: hyperon polarization and $CP$ violation, rare hyperon decays, hyperon pair production, and hyperon-nucleon interactions.

hep-ex↗

DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning

General reasoning represents a long-standing and formidable challenge in artificial intelligence. Recent breakthroughs, exemplified by large language models (LLMs) and chain-of-thought prompting, have achieved considerable success on foundational reasoning tasks. However, this success is heavily contingent upon extensive human-annotated demonstrations, and models' capabilities are still insufficient for more complex problems. Here we show that the reasoning abilities of LLMs can be incentivized through pure reinforcement learning (RL), obviating the need for human-labeled reasoning trajectories. The proposed RL framework facilitates the emergent development of advanced reasoning patterns, such as self-reflection, verification, and dynamic strategy adaptation. Consequently, the trained model achieves superior performance on verifiable tasks such as mathematics, coding competitions, and STEM fields, surpassing its counterparts trained via conventional supervised learning on human demonstrations. Moreover, the emergent reasoning patterns exhibited by these large-scale models can be systematically harnessed to guide and enhance the reasoning capabilities of smaller models.

cs.CL↗

DeepSeek-V3.2: Pushing the Frontier of Open Large Language Models

We introduce DeepSeek-V3.2, a model that harmonizes high computational efficiency with superior reasoning and agent performance. The key technical breakthroughs of DeepSeek-V3.2 are as follows: (1) DeepSeek Sparse Attention (DSA): We introduce DSA, an efficient attention mechanism that substantially reduces computational complexity while preserving model performance in long-context scenarios. (2) Scalable Reinforcement Learning Framework: By implementing a robust reinforcement learning protocol and scaling post-training compute, DeepSeek-V3.2 performs comparably to GPT-5. Notably, our high-compute variant, DeepSeek-V3.2-Speciale, surpasses GPT-5 and exhibits reasoning proficiency on par with Gemini-3.0-Pro, achieving gold-medal performance in both the 2025 International Mathematical Olympiad (IMO) and the International Olympiad in Informatics (IOI). (3) Large-Scale Agentic Task Synthesis Pipeline: To integrate reasoning into tool-use scenarios, we developed a novel synthesis pipeline that systematically generates training data at scale. This methodology facilitates scalable agentic post-training, yielding substantial improvements in generalization and instruction-following robustness within complex, interactive environments.

cs.CL↗

GRACE: Designing Generative Face Video Codec via Agile Hardware-Centric Workflow

The Animation-based Generative Codec (AGC) is an emerging paradigm for talking-face video compression. However, deploying its intricate decoder on resource and power-constrained edge devices presents challenges due to numerous parameters, the inflexibility to adapt to dynamically evolving algorithms, and the high power consumption induced by extensive computations and data transmission. This paper for the first time proposes a novel field programmable gate arrays (FPGAs)-oriented AGC deployment scheme for edge-computing video services. Initially, we analyze the AGC algorithm and employ network compression methods including post-training static quantization and layer fusion techniques. Subsequently, we design an overlapped accelerator utilizing the co-processor paradigm to perform computations through software-hardware co-design. The hardware processing unit comprises engines such as convolution, grid sampling, upsample, etc. Parallelization optimization strategies like double-buffered pipelines and loop unrolling are employed to fully exploit the resources of FPGA. Ultimately, we establish an AGC FPGA prototype on the PYNQ-Z1 platform using the proposed scheme, achieving \textbf{24.9$\times$} and \textbf{4.1$\times$} higher energy efficiency against commercial Central Processing Unit (CPU) and Graphic Processing Unit (GPU), respectively. Specifically, only \textbf{11.7} microjoules ($\upmu$J) are required for one pixel reconstructed by this FPGA system.

cs.CV↗

Self-Supervised and Topological Signal-Quality Assessment for Any PPG Device

Wearable photoplethysmography (PPG) is embedded in billions of devices, yet its optical waveform is easily corrupted by motion, perfusion loss, and ambient light, jeopardizing downstream cardiometric analytics. Existing signal-quality assessment (SQA) methods rely either on brittle heuristics or on data-hungry supervised models. We introduce the first fully unsupervised SQA pipeline for wrist PPG. Stage 1 trains a contrastive 1-D ResNet-18 on 276 h of raw, unlabeled data from heterogeneous sources (varying in device and sampling frequency), yielding optical-emitter- and motion-invariant embeddings (i.e., the learned representation is stable across differences in LED wavelength, drive intensity, and device optics, as well as wrist motion). Stage 2 converts each 512-D encoder embedding into a 4-D topological signature via persistent homology (PH) and clusters these signatures with HDBSCAN. To produce a binary signal-quality index (SQI), the acceptable PPG signals are represented by the densest cluster while the remaining clusters are assumed to mainly contain poor-quality PPG signals. Without re-tuning, the SQI attains Silhouette, Davies-Bouldin, and Calinski-Harabasz scores of 0.72, 0.34, and 6173, respectively, on a stratified sample of 10,000 windows. In this study, we propose a hybrid self-supervised-learning--topological-data-analysis (SSL--TDA) framework that offers a drop-in, scalable, cross-device quality gate for PPG signals.

eess.SP↗

Rapid Adaptation of SpO2 Estimation to Wearable Devices via Transfer Learning on Low-Sampling-Rate PPG

Blood oxygen saturation (SpO2) is a vital marker for healthcare monitoring. Traditional SpO2 estimation methods often rely on complex clinical calibration, making them unsuitable for low-power, wearable applications. In this paper, we propose a transfer learning-based framework for the rapid adaptation of SpO2 estimation to energy-efficient wearable devices using low-sampling-rate (25Hz) dual-channel photoplethysmography (PPG). We first pretrain a bidirectional Long Short-Term Memory (BiLSTM) model with self-attention on a public clinical dataset, then fine-tune it using data collected from our wearable We-Be band and an FDA-approved reference pulse oximeter. Experimental results show that our approach achieves a mean absolute error (MAE) of 2.967% on the public dataset and 2.624% on the private dataset, significantly outperforming traditional calibration and non-transferred machine learning baselines. Moreover, using 25Hz PPG reduces power consumption by 40% compared to 100Hz, excluding baseline draw. Our method also attains an MAE of 3.284% in instantaneous SpO2 prediction, effectively capturing rapid fluctuations. These results demonstrate the rapid adaptation of accurate, low-power SpO2 monitoring on wearable devices without the need for clinical calibration.

eess.SP↗

Generalizable Blood Pressure Estimation from Multi-Wavelength PPG Using Curriculum-Adversarial Learning

Accurate and generalizable blood pressure (BP) estimation is vital for the early detection and management of cardiovascular diseases. In this study, we enforce subject-level data splitting on a public multi-wavelength photoplethysmography (PPG) dataset and propose a generalizable BP estimation framework based on curriculum-adversarial learning. Our approach combines curriculum learning, which transitions from hypertension classification to BP regression, with domain-adversarial training that confuses subject identity to encourage the learning of subject-invariant features. Experiments show that multi-channel fusion consistently outperforms single-channel models. On the four-wavelength PPG dataset, our method achieves strong performance under strict subject-level splitting, with mean absolute errors (MAE) of 14.2mmHg for systolic blood pressure (SBP) and 6.4mmHg for diastolic blood pressure (DBP). Additionally, ablation studies validate the effectiveness of both the curriculum and adversarial components. These results highlight the potential of leveraging complementary information in multi-wavelength PPG and curriculum-adversarial strategies for accurate and robust BP estimation.

eess.SP↗