arXiv subjects

Yubo Zhang

Publications and source records attributed to Yubo Zhang.

At least 37 records · Page 2Linked to original sources

arXiv2026

A System-View Optimal Additional Active Power Control of Wind Turbines for Grid Frequency Support

Additional active power control (AAPC) of wind turbines (WTs) is essential to improve the transient frequency stability of low-inertia power systems. Most of the existing research has focused on imitating the frequency response of the synchronous generator (SG), known as virtual inertia control (VIC), but are such control laws optimal for the power systems? Inspired by this question, this paper proposes an optimal AAPC of WTs to maximize the frequency nadir post a major power deficit. By decoupling the WT response and the frequency dynamics, the optimal frequency trajectory is solved based on the trajectory model, and its universality is strictly proven. Then the optimal AAPC of WTs is constructed reversely based on the average system frequency (ASF) model with the optimal frequency trajectory as the desired control results. The proposed method can significantly improve the system frequency nadir. Meanwhile, the event insensitivity makes it can be deployed based on the on-line rolling update under a hypothetic disturbance, avoiding the heavy post-event computational burden. Finally, simulation results in a two-machine power system and the IEEE 39 bus power system verify the effectiveness of the optimal AAPC of WTs.

eess.SY↗

arXiv2026

PP-OCRv5: A Specialized 5M-Parameter Model Rivaling Billion-Parameter Vision-Language Models on OCR Tasks

The advent of "OCR 2.0" and large-scale vision-language models (VLMs) has set new benchmarks in text recognition. However, these unified architectures often come with significant computational demands, challenges in precise text localization within complex layouts, and a propensity for textual hallucinations. Revisiting the prevailing notion that model scale is the sole path to high accuracy, this paper introduces PP-OCRv5, a meticulously optimized, lightweight OCR system with merely 5 million parameters. We demonstrate that PP-OCRv5 achieves performance competitive with many billion-parameter VLMs on standard OCR benchmarks, while offering superior localization precision and reduced hallucinations. The cornerstone of our success lies not in architectural expansion but in a data-centric investigation. We systematically dissect the role of training data by quantifying three critical dimensions: data difficulty, data accuracy, and data diversity. Our extensive experiments reveal that with a sufficient volume of high-quality, accurately labeled, and diverse data, the performance ceiling for traditional, efficient two-stage OCR pipelines is far higher than commonly assumed. This work provides compelling evidence for the viability of lightweight, specialized models in the large-model era and offers practical insights into data curation for OCR. The source code and models are publicly available at https://github.com/PaddlePaddle/PaddleOCR.

cs.CV↗

arXiv2026

Elastic, Quasielastic, and Superelastic Electron Scattering from Thermal Lattice Distortions in Perfect Crystals

In standard treatments of electron transport, momentum relaxation in a perfect, defect-free crystal is linked with phonon creation or annihilation. In this work, we reconsider this problem for a finite, isolated crystal, retaining the lattice center-of-mass (recoil) degree of freedom and enforcing conservation of total mechanical momentum together with discrete crystal pseudomomentum. Starting from the density-density form of the electron-lattice interaction, we show that an electron in the interior of a perfect crystal admits elastic momentum-transfer channels in which total momentum is conserved by recoil of the lattice background without phonon excitation. These elastic channels can provide the leading contribution to momentum relaxation. We further identify mixed quasi-elastic and superelastic processes in which phonon occupations change but do not account entirely for the electron's momentum transfer. The elastic channels arise within the standard microscopic Hamiltonian and do not require additional disorder or defects. The resulting framework provides a complementary microscopic perspective on momentum relaxation in clean crystals and is consistent with experimental phenomena such as weak localization, quantum oscillations, ultrasonic attenuation, and the observed separation of momentum and energy relaxation times.

cond-mat.other↗

arXiv2026

Resource Allocation for Positive-Rate Covert Communications Using Optimization and Deep Reinforcement Learning

We aim to achieve keyless covert communication with a positive-rate in Rayleigh block-fading channels. Specifically, the transmitter and the legitimate receiver are assumed to have either causal or non-causal knowledge of the \ac{CSI} for both the legitimate and the warden channels, while the warden only knows the statistical distribution of the \ac{CSI}. Two problem formulations are considered in this work: (a) Power allocation: maximizing the sum covert rate subject to a maximum power constraint, and (b) Rate allocation: minimizing the power consumption subject to a minimum covert rate constraint. Both problems are formulated based on recent information theoretical results on covert communication over state-dependent channels. When the \ac{CSI} of each fading block is known non-causally, we propose a novel three-step method to solve both the power and rate allocation problems. In the case where the \ac{CSI} is known causally, the power allocation problem can be formulated as \ac{MDP} and be solved using a \ac{DDQN} approach. Although the rate allocation problem under causal \ac{CSI} does not directly conform to an \ac{MDP} structure, it can be approximately solved using the \ac{DDQN} trained for power allocation. Simulation results demonstrate the effectiveness of the proposed power and rate allocation methods and provide comprehensive performance comparisons across different allocation schemes.

cs.IT↗

arXiv2026

Entropy-Tree: Tree-Based Decoding with Entropy-Guided Exploration

Large language models achieve strong reasoning performance, yet existing decoding strategies either explore blindly (random sampling) or redundantly (independent multi-sampling). We propose Entropy-Tree, a tree-based decoding method that exploits entropy as a signal for branching decisions--expanding the search tree only at positions where the model exhibits genuine uncertainty. Entropy-Tree shows superior accuracy and calibration in reasoning tasks: it achieves better pass@k than Multi-chain across multiple models and datasets, and its predictive entropy demonstrates better AUROC compared to several traditional metrics. Entropy-Tree unifies efficient structured exploration and reliable uncertainty estimation within a single decoding procedure.

cs.CL↗

arXiv2025

Adiabaticity Crossover: From Anderson Localization to Planckian Diffusion

We investigate electron transport in one dimension from the quantum-acoustic perspective, where the coherent-state representation of lattice vibrations results in a time-dependent deformation potential whose rate is set by the sound speed, fluctuation spectrum is set by the temperature, and overall amplitude is set by the electron-lattice coupling strength. We introduce an acceleration-based adiabatic criterion, consistent with the adiabatic theorem and Landau-Zener theory, that separates adiabatic and diabatic dynamics across the $(T,v)$ plane. The discrete classification agrees with a continuous mean-squared acceleration scale and correlates with a coherence measure given by the ratio of coherence length to the initial packet width $L_ϕ(t)/σ_0$. We identify a broad Planckian domain in which the dimensionless diffusivity $α\!=\!Dm/\hbar$ is of order unity and only weakly depends on the parameters. This domain is more prevalent in diabatic regions and in areas of reduced phase coherence, indicating a dephasing driven crossover from Anderson localization to Planckian diffusion. Using the Einstein relation together with nearly constant $α$, we directly obtain a low temperature tendency $1/τ_{\rm tr}\propto T$, offering a insight to $T$-linear resistivity in strange metals. These results provide a unified picture that links adiabaticity, dephasing, and Planckian diffusion in dynamically disordered quantum-acoustics.

quant-ph↗

arXiv2025

Relative Error Fair Clustering in the Weak-Strong Oracle Model

We study fair clustering problems in a setting where distance information is obtained from two sources: a strong oracle providing exact distances, but at a high cost, and a weak oracle providing potentially inaccurate distance estimates at a low cost. The goal is to produce a near-optimal fair clustering on $n$ input points with a minimum number of strong oracle queries. This models the increasingly common trade-off between accurate but expensive similarity measures (e.g., large-scale embeddings) and cheaper but inaccurate alternatives. The study of fair clustering in the model is motivated by the important quest of achieving fairness with the presence of inaccurate information. We achieve the first $(1+\varepsilon)$-coresets for fair $k$-median clustering using $\text{poly}\left(\frac{k}{\varepsilon}\cdot\log n\right)$ queries to the strong oracle. Furthermore, our results imply coresets for the standard setting (without fairness constraints), and we could in fact obtain $(1+\varepsilon)$-coresets for $(k,z)$-clustering for general $z=O(1)$ with a similar number of strong oracle queries. In contrast, previous results achieved a constant-factor $(>10)$ approximation for the standard $k$-clustering problems, and no previous work considered the fair $k$-median clustering problem.

cs.DS↗

arXiv2025

PaddleOCR-VL: Boosting Multilingual Document Parsing via a 0.9B Ultra-Compact Vision-Language Model

In this report, we propose PaddleOCR-VL, a SOTA and resource-efficient model tailored for document parsing. Its core component is PaddleOCR-VL-0.9B, a compact yet powerful vision-language model (VLM) that integrates a NaViT-style dynamic resolution visual encoder with the ERNIE-4.5-0.3B language model to enable accurate element recognition. This innovative model efficiently supports 109 languages and excels in recognizing complex elements (e.g., text, tables, formulas, and charts), while maintaining minimal resource consumption. Through comprehensive evaluations on widely used public benchmarks and in-house benchmarks, PaddleOCR-VL achieves SOTA performance in both page-level document parsing and element-level recognition. It significantly outperforms existing solutions, exhibits strong competitiveness against top-tier VLMs, and delivers fast inference speeds. These strengths make it highly suitable for practical deployment in real-world scenarios. Code is available at https://github.com/PaddlePaddle/PaddleOCR .

cs.CV↗

arXiv2025

Electron Localization in Non-Compact Covalent Bonds Captured by the r2SCAN+V Approach

In density functional theory, the SCAN (Strongly Constrained and Appropriately Normed) and r2SCAN functionals significantly improve over generalized gradient approximation functionals such as PBE (Perdew-Burke-Ernzerhof) in predicting electronic, magnetic, and structural properties across various materials, including transition-metal compounds. However, there remain puzzling cases where SCAN and r2SCAN underperform, such as in calculating the band structure of graphene, the magnetic moment of Fe, the potential energy curve of the Cr2 molecule, and the bond length of VO2. This research identifies a common characteristic among these challenging materials: non-compact covalent bonding through s-s, p-p, or d-d electron hybridization. While SCAN and r2SCAN excel at capturing electron localization at local atomic sites, they struggle to accurately describe electron localization in non-compact covalent bonds, resulting in a biased improvement. To address this issue, we propose the r2SCAN+V approach as a practical modification that improves accuracy across all the tested materials. The parameter V is 4 eV for metallic Fe, but substantially lower for the other cases. Our findings provide valuable insights for the future development of advanced functionals.

cond-mat.mtrl-sci↗

arXiv2025

An Encoder-Decoder Network for Beamforming over Sparse Large-Scale MIMO Channels

We develop an end-to-end deep learning framework for downlink beamforming in large-scale sparse MIMO channels. The core is a deep EDN architecture with three modules: (i) an encoder NN, deployed at each user end, that compresses estimated downlink channels into low-dimensional latent vectors. The latent vector from each user is compressed and then fed back to the BS. (ii) a beamformer decoder NN at the BS that maps recovered latent vectors to beamformers, and (iii) a channel decoder NN at the BS that reconstructs downlink channels from recovered latent vectors to further refine the beamformers. The training of EDN leverages two key strategies: (a) semi-amortized learning, where the beamformer decoder NN contains an analytical gradient ascent during both training and inference stages, and (b) knowledge distillation, where the loss function consists of a supervised term and an unsupervised term, and starting from supervised training with MMSE beamformers, over the epochs, the model training gradually shifts toward unsupervised using the sum-rate objective. The proposed EDN beamforming framework is extended to both far-field and near-field hybrid beamforming scenarios. Extensive simulations validate its effectiveness under diverse network and channel conditions.

eess.SY↗

arXiv2025

RAG+: Enhancing Retrieval-Augmented Generation with Application-Aware Reasoning

The integration of external knowledge through Retrieval-Augmented Generation (RAG) has become foundational in enhancing large language models (LLMs) for knowledge-intensive tasks. However, existing RAG paradigms often overlook the cognitive step of applying knowledge, leaving a gap between retrieved facts and task-specific reasoning. In this work, we introduce RAG+, a principled and modular extension that explicitly incorporates application-aware reasoning into the RAG pipeline. RAG+ constructs a dual corpus consisting of knowledge and aligned application examples, created either manually or automatically, and retrieves both jointly during inference. This design enables LLMs not only to access relevant information but also to apply it within structured, goal-oriented reasoning processes. Experiments across mathematical, legal, and medical domains, conducted on multiple models, demonstrate that RAG+ consistently outperforms standard RAG variants, achieving average improvements of 3-5%, and peak gains up to 13.5% in complex scenarios. By bridging retrieval with actionable application, RAG+ advances a more cognitively grounded framework for knowledge integration, representing a step toward more interpretable and capable LLMs.

cs.AI↗

arXiv2025

Neural Tangent Knowledge Distillation for Optical Convolutional Networks

Hybrid Optical Neural Networks (ONNs, typically consisting of an optical frontend and a digital backend) offer an energy-efficient alternative to fully digital deep networks for real-time, power-constrained systems. However, their adoption is limited by two main challenges: the accuracy gap compared to large-scale networks during training, and discrepancies between simulated and fabricated systems that further degrade accuracy. While previous work has proposed end-to-end optimizations for specific datasets (e.g., MNIST) and optical systems, these approaches typically lack generalization across tasks and hardware designs. To address these limitations, we propose a task-agnostic and hardware-agnostic pipeline that supports image classification and segmentation across diverse optical systems. To assist optical system design before training, we estimate achievable model accuracy based on user-specified constraints such as physical size and the dataset. For training, we introduce Neural Tangent Knowledge Distillation (NTKD), which aligns optical models with electronic teacher networks, thereby narrowing the accuracy gap. After fabrication, NTKD also guides fine-tuning of the digital backend to compensate for implementation errors. Experiments on multiple datasets (e.g., MNIST, CIFAR, Carvana Masking) and hardware configurations show that our pipeline consistently improves ONN performance and enables practical deployment in both pre-fabrication simulations and physical implementations.

cs.CV↗

arXiv2025

PaddleOCR 3.0 Technical Report

This technical report introduces PaddleOCR 3.0, an Apache-licensed open-source toolkit for OCR and document parsing. To address the growing demand for document understanding in the era of large language models, PaddleOCR 3.0 presents three major solutions: (1) PP-OCRv5 for multilingual text recognition, (2) PP-StructureV3 for hierarchical document parsing, and (3) PP-ChatOCRv4 for key information extraction. Compared to mainstream vision-language models (VLMs), these models with fewer than 100 million parameters achieve competitive accuracy and efficiency, rivaling billion-parameter VLMs. In addition to offering a high-quality OCR model library, PaddleOCR 3.0 provides efficient tools for training, inference, and deployment, supports heterogeneous hardware acceleration, and enables developers to easily build intelligent document applications.

cs.CV↗

arXiv2025

Re-TASK: Revisiting LLM Tasks from Capability, Skill, and Knowledge Perspectives

The Chain-of-Thought (CoT) paradigm has become a pivotal method for solving complex problems with large language models (LLMs). However, its application to domain-specific tasks remains challenging, as LLMs often fail to decompose tasks accurately or execute subtasks effectively. This paper introduces the Re-TASK framework, a novel theoretical model that revisits LLM tasks from capability, skill, and knowledge perspectives, drawing on the principles of Bloom's Taxonomy and Knowledge Space Theory. While CoT provides a workflow-centric perspective on tasks, Re-TASK introduces a Chain-of-Learning (CoL) paradigm that highlights task dependencies on specific capability items, further broken down into their constituent knowledge and skill components. To address CoT failures, we propose a Re-TASK prompting strategy, which strengthens task-relevant capabilities through targeted knowledge injection and skill adaptation. Experiments across diverse domains demonstrate the effectiveness of Re-TASK. In particular, we achieve improvements of 45.00% on Yi-1.5-9B and 24.50% on Llama3-Chinese-8B for legal tasks. These results highlight the potential of Re-TASK to significantly enhance LLM performance and its applicability in specialized domains. We release our code and data at https://github.com/Uylee/Re-TASK.

cs.CL↗

arXiv2025

Comprehensive landscape and simple rules for transition-metal Heusler semiconductors

Heusler alloys, renowned for their multifunctionality and capacity for vast elemental customization, are primarily classified into half-Heusler (XYZ) and full-Heusler (X2YZ) structural types. Typically, the 18-electron half-Heusler and the 24-electron full-Heusler alloys are recognized as semiconductors, following the Slater-Pauling rule. Semiconductors are desired for many applications, but they represent a minor portion compared to the predominantly metallic and half-metallic members of the Heusler family. Recently, vacancy-filling off-stoichiometric Heuslers of ternary X1+bYZ (0 <= b <= 1) and quaternary XaX'bYZ (1 <= a + b <= 2) have emerged as a more versatile strategy. However, the flexibility associated with off-stoichiometry inevitably leads to complications, including issues with fractional filling ratios and complex site occupations. This work presents a comprehensive landscape of transition-metal-containing Heusler semiconductors, focusing on the off-stoichiometric Heuslers but seamlessly encompassing the integer-stoichiometric systems. The structural and electronic properties can be theoretically understood through a few simple rules. Many systems have been experimentally validated, showcasing their potential for applications such as thermoelectric converters.

cond-mat.mtrl-sci↗

arXiv2025

Fair Dynamic Spectrum Access via Fully Decentralized Multi-Agent Reinforcement Learning

We consider a decentralized wireless network with several source-destination pairs sharing a limited number of orthogonal frequency bands. Sources learn to adapt their transmissions (specifically, their band selection strategy) over time, in a decentralized manner, without sharing information with each other. Sources can only observe the outcome of their own transmissions (i.e., success or collision), having no prior knowledge of the network size or of the transmission strategy of other sources. The goal of each source is to maximize their own throughput while striving for network-wide fairness. We propose a novel fully decentralized Reinforcement Learning (RL)-based solution that achieves fairness without coordination. The proposed Fair Share RL (FSRL) solution combines: (i) state augmentation with a semi-adaptive time reference; (ii) an architecture that leverages risk control and time difference likelihood; and (iii) a fairness-driven reward structure. We evaluate FSRL in more than 50 network settings with different number of agents, different amounts of available spectrum, in the presence of jammers, and in an ad-hoc setting. Simulation results suggest that, when we compare FSRL with a common baseline RL algorithm from the literature, FSRL can be up to 89.0% fairer (as measured by Jain's fairness index) in stringent settings with several sources and a single frequency band, and 48.1% fairer on average.

cs.NI↗

arXiv2025

Advances and challenges of SCAN and r2SCAN density functionals in transition-metal compounds

Transition-metal compounds (TMCs) with open-shell d-electrons are characterized by a complex interplay of lattice, charge, orbital, and spin degrees of freedom, giving rise to a diverse range of fascinating applications. Often exhibiting exotic properties, these compounds are commonly classified as correlated systems due to strong inter-electronic interactions called Hubbard U. This inherent complexity presents significant challenges to Kohn-Sham density functional theory (KS-DFT), the most widely used electronic structure method in condensed matter physics and materials science. While KS-DFT is, in principle, exact for the ground-state total energy, its exchange-correlation energy must be approximated in practice. The mean-field nature of KS implementations, combined with the limitations of current exchange-correlation density functional approximations, has led to the perception that DFT is inadequate for correlated systems, particularly TMCs. Consequently, a common workaround involves augmenting DFT with an on-site Hubbard-like U correction. In recent years, the strongly constrained and appropriately normed (SCAN) density functional, along with its refined variant r2SCAN, has achieved remarkable progress in accurately describing the structural, energetic, electronic, magnetic, and vibrational properties of TMCs, challenging the traditional perception of DFT's limitations. This review explores the design principles of SCAN and r2SCAN, highlights their key advancements in studying TMCs, explains the mechanisms driving these improvements, and addresses the remaining challenges in this evolving field.

cond-mat.mtrl-sci↗

arXiv2025

Fair Clustering in the Sliding Window Model

We study streaming algorithms for proportionally fair clustering, a notion originally suggested by Chierichetti et. al. (2017), in the sliding window model. We show that although there exist efficient streaming algorithms in the insertion-only model, surprisingly no algorithm can achieve finite multiplicative ratio without violating the fairness constraint in the sliding window. Hence, the problem of fair clustering is a rare separation between the insertion-only streaming model and the sliding window model. On the other hand, we show that if the fairness constraint is relaxed by a multiplicative $(1+\varepsilon)$ factor, there exists a $(1 + \varepsilon)$-approximate sliding window algorithm that uses $\text{poly}(k\varepsilon^{-1}\log n)$ space. This achieves essentially the best parameters (up to degree in the polynomial) provided the aforementioned lower bound. We also implement a number of empirical evaluations on real datasets to complement our theoretical results.

cs.DS↗