arXiv subjects

Xiaoyu Wang

Publications and source records attributed to Xiaoyu Wang.

At least 127 records · Page 7Linked to original sources

arXiv2025

Realizing a topological diode effect on the surface of a topological Kondo insulator

Introducing the concept of topology into material science has sparked a revolution from classic electronic and optoelectronic devices to topological quantum devices. The latter has potential for transferring energy and information with unprecedented efficiency. Here, we demonstrate a topological diode effect on the surface of a three-dimensional material, SmB6, a candidate topological Kondo insulator. The diode effect is evidenced by pronounced rectification and photogalvanic effects under electromagnetic modulation and radiation at radio frequency. Our experimental results and modeling suggest that these prominent effects are intimately tied to the spatially inhomogeneous formation of topological surface states (TSS) at the intermediate temperature. This work provides a manner of breaking the mirror symmetry (in addition to the inversion symmetry), resulting in the formation of pn-junctions between puddles of metallic TSS. This effect paves the way for efficient current rectifiers or energy-harvesting devices working down to radio frequency range at low temperature, which could be extended to high temperatures using other topological insulators with large bulk gap.

cond-mat.str-el↗

arXiv2025

Multi-constraint Graph Partitioning Problems Via Recursive Bipartition Algorithm Based on Subspace Minimization Conjugate Gradient Method

The graph partitioning problem is a well-known NP-hard problem. In this paper, we formulate a 0-1 quadratic integer programming model for the graph partitioning problem with vertex weight constraints and fixed vertex constraints, and propose a recursive bipartition algorithm based on the subspace minimization conjugate gradient method. To alleviate the difficulty of solving the model, the constrained problem is transformed into an unconstrained optimization problem using equilibrium terms, elimination methods, and trigonometric properties, and solved via an accelerated subspace minimization conjugate gradient algorithm. Initial feasible partitions are generated using a hyperplane rounding algorithm, followed by heuristic refinement strategies, including one-neighborhood and two-interchange adjustments, to iteratively improve the results. Numerical experiments on knapsack-constrained graph partitioning and industrial examples demonstrate the effectiveness and feasibility of the proposed algorithm.

math.OC↗

arXiv2025

Fully First-Order Methods for Decentralized Bilevel Optimization

This paper focuses on decentralized stochastic bilevel optimization (DSBO) where agents only communicate with their neighbors. We propose Decentralized Stochastic Gradient Descent and Ascent with Gradient Tracking (DSGDA-GT), a novel algorithm that only requires first-order oracles that are much cheaper than second-order oracles widely adopted in existing works. We further provide a finite-time convergence analysis showing that for $n$ agents collaboratively solving the DSBO problem, the sample complexity of finding an $ε$-stationary point in our algorithm is $\mathcal{O}(n^{-1}ε^{-7})$, which matches the currently best-known results of the single-agent counterpart with linear speedup. The numerical experiments demonstrate both the communication and training efficiency of our algorithm.

math.OC↗

arXiv2025

A Novel Interactive-Guided Differential Testing Approach for FPGA Simulation Debugger Tools

Field-Programmable Gate Array (FPGA) development tool chains are widely used in FPGA design, simulation, and verification in critical areas like communications, automotive electronics, and aerospace. Commercial FPGA tool chains such as Xilinx' Vivado aids developers in swiftly identifying and rectifying bugs and issues in FPGA designs through a robust built-in debugger, ensuring the correctness and development efficiency of the FPGA design. Hardening such FPGA chip debugger tools by testing is crucial since engineers might misinterpret code and introduce incorrect fixes, leading to security risks. However, FPGA chip debugger tools are challenging to test as they require assessing both RTL designs and a series of debugging actions, including setting breakpoints and stepping through the code. To address this issue, we propose a interactive differential testing approach called DB-Hunter to detect bugs in Vivado's FPGA chip debugger tools. Specifically, DB-Hunter consists of three components: RTL design transformation component, debug action transformation component, and interactive differential testing component. By performing RTL design and debug action transformations, DB-Hunter generates diverse and complex RTL designs and debug actions, to thoroughly test the Vivado debugger using interactive differential testing to detect bugs. In three months, DB-Hunter reported 18 issues, including 10 confirmed as bugs by Xilinx Support, 6 bugs had been fixed in last version.

cs.SE↗

arXiv2025

Theoretical study of the open-flavor tetraquark $T_{c\bar{s}}(2900)$ in the process $\bar{B}_s^0 \to K^0 D^0 π^0$

Recently, the LHCb Collaboration has measured two decay processes $B^0\to\bar{D}^0D_s^+π^-$ and $B^+\to D^-D_s^+π^+$ related to isospin symmetry, where two new open-flavor tetraquark states $T_{c\bar{s}}(2900)^0$ and $T_{c\bar{s}}(2900)^{++}$ that belong to an isospin triplet were observed in the $D_s^+π^-$ and $D_s^+π^+$ invariant mass distributions. In this work, we have investigated the validity of the process $\bar{B}_s^0\to K^0D^0π^0$ as the promising process to confirm the existence of $T_{c\bar{s}}(2900)^0$ resonance. Taking into account the tetraquark state $T_{c\bar{s}}(2900)$, as well as intermediate resonances $K^*(892)$, $K_0^*(1430)$, and $K_2^*(1430)$, it has been shown that a clear peak of the open-flavor tetraquark $T_{c\bar{s}}(2900)$ appears in the $K^0D^0$ invariant mass distribution of the process $\bar{B}_s^0\to K^0D^0π^0$, which could be tested by future experiments.

hep-ph↗

arXiv2025

Decentralized Federated Learning with Model Caching on Mobile Agents

Federated Learning (FL) trains a shared model using data and computation power on distributed agents coordinated by a central server. Decentralized FL (DFL) utilizes local model exchange and aggregation between agents to reduce the communication and computation overheads on the central server. However, when agents are mobile, the communication opportunity between agents can be sporadic, largely hindering the convergence and accuracy of DFL. In this paper, we propose Cached Decentralized Federated Learning (Cached-DFL) to investigate delay-tolerant model spreading and aggregation enabled by model caching on mobile agents. Each agent stores not only its own model, but also models of agents encountered in the recent past. When two agents meet, they exchange their own models as well as the cached models. Local model aggregation utilizes all models stored in the cache. We theoretically analyze the convergence of Cached-DFL, explicitly taking into account the model staleness introduced by caching. We design and compare different model caching algorithms for different DFL and mobility scenarios. We conduct detailed case studies in a vehicular network to systematically investigate the interplay between agent mobility, cache staleness, and model convergence. In our experiments, Cached-DFL converges quickly, and significantly outperforms DFL without caching.

cs.LG↗

arXiv2025

Quantitative Error Bounds for Scaling Limits of Stochastic Iterative Algorithms

Stochastic iterative algorithms, including stochastic gradient descent (SGD) and stochastic gradient Langevin dynamics (SGLD), are widely utilized for optimization and sampling in large-scale and high-dimensional problems in machine learning, statistics, and engineering. Numerous works have bounded the parameter error in, and characterized the uncertainty of, these approximations. One common approach has been to use scaling limit analyses to relate the distribution of algorithm sample paths to a continuous-time stochastic process approximation, particularly in asymptotic setups. Focusing on the univariate setting, in this paper, we build on previous work to derive non-asymptotic functional approximation error bounds between the algorithm sample paths and the Ornstein-Uhlenbeck approximation using an infinite-dimensional version of Stein's method of exchangeable pairs. We show that this bound implies weak convergence under modest additional assumptions and leads to a bound on the error of the variance of the iterate averages of the algorithm. Furthermore, we use our main result to construct error bounds in terms of two common metrics: the Lévy-Prokhorov and bounded Wasserstein distances. Our results provide a foundation for developing similar error bounds for the multivariate setting and for more sophisticated stochastic approximation algorithms.

stat.ML↗

arXiv2025

Generalized Multi-hop Traffic Pressure for Heterogeneous Traffic Perimeter Control

Perimeter control (PC) prevents loss of traffic network capacity due to congestion in urban areas. Homogeneous PC allows all access points to a protected region to have identical permitted inflow. However, homogeneous PC performs poorly when the congestion in the protected region is heterogeneous (e.g., imbalanced demand) since the homogeneous PC does not consider specific traffic conditions around each perimeter intersection. When the protected region has spatially heterogeneous congestion, one needs to modulate the perimeter inflow rate to be higher near low-density regions and vice versa for high-density regions. A naïve approach is to leverage 1-hop traffic pressure to measure traffic condition around perimeter intersections, but such metric is too spatially myopic for PC. To address this issue, we formulate multi-hop downstream pressure grounded on Markov chain theory, which ``looks deeper'' into the protected region beyond perimeter intersections. In addition, we formulate a two-stage hierarchical control scheme that can leverage this novel multi-hop pressure to redistribute the total permitted inflow provided by a pre-trained deep reinforcement learning homogeneous control policy. Experimental results show that our heterogeneous PC approaches leveraging multi-hop pressure significantly outperform homogeneous PC in scenarios where the origin-destination flows are highly imbalanced with high spatial heterogeneity. Moveover, our approach is shown to be robust against turning ratio uncertainties by a sensitivity analysis.

cs.LG↗

arXiv2025

Multi-hop Upstream Anticipatory Traffic Signal Control with Deep Reinforcement Learning

Coordination in traffic signal control is crucial for managing congestion in urban networks. Existing pressure-based control methods focus only on immediate upstream links, leading to suboptimal green time allocation and increased network delays. However, effective signal control inherently requires coordination across a broader spatial scope, as the effect of upstream traffic should influence signal control decisions at downstream intersections, impacting a large area in the traffic network. Although agent communication using neural network-based feature extraction can implicitly enhance spatial awareness, it significantly increases the learning complexity, adding an additional layer of difficulty to the challenging task of control in deep reinforcement learning. To address the issue of learning complexity and myopic traffic pressure definition, our work introduces a novel concept based on Markov chain theory, namely \textit{multi-hop upstream pressure}, which generalizes the conventional pressure to account for traffic conditions beyond the immediate upstream links. This farsighted and compact metric informs the deep reinforcement learning agent to preemptively clear the multi-hop upstream queues, guiding the agent to optimize signal timings with a broader spatial awareness. Simulations on synthetic and realistic (Toronto) scenarios demonstrate controllers utilizing multi-hop upstream pressure significantly reduce overall network delay by prioritizing traffic movements based on a broader understanding of upstream congestion.

cs.LG↗

arXiv2025

Bias voltage controlled inversions of tunneling magnetoresistance in van der Waals heterostructures Fe3GaTe2/hBN/Fe3GaTe2

We report the bias voltage controlled inversions of tunneling magnetoresistance (TMR) in magnetic tunnel junctions composed of Fe3GaTe2 electrodes and hBN tunneling barrier, observed at room temperature. The polarity reversal of TMR occurs consistently at around 0.625 V across multiple devices and temperatures, highlighting the robustness of the effect. To understand this behavior, we developed a theoretical model incorporating spin-resolved density of states (DOS) at high energy levels. By adjusting the DOS weighting at different k points to account for misalignment between the crystal structure of electrodes in experimental devices, we improved agreement between experimental and theoretical inversion voltages. Our results provide valuable insight into the voltage-controlled spin injection and detection in two-dimensional magnetic tunnel junctions, with implications for the development of energy-efficient spintronic devices.

cond-mat.mes-hall↗

arXiv2025

CoPRA: Bridging Cross-domain Pretrained Sequence Models with Complex Structures for Protein-RNA Binding Affinity Prediction

Accurately measuring protein-RNA binding affinity is crucial in many biological processes and drug design. Previous computational methods for protein-RNA binding affinity prediction rely on either sequence or structure features, unable to capture the binding mechanisms comprehensively. The recent emerging pre-trained language models trained on massive unsupervised sequences of protein and RNA have shown strong representation ability for various in-domain downstream tasks, including binding site prediction. However, applying different-domain language models collaboratively for complex-level tasks remains unexplored. In this paper, we propose CoPRA to bridge pre-trained language models from different biological domains via Complex structure for Protein-RNA binding Affinity prediction. We demonstrate for the first time that cross-biological modal language models can collaborate to improve binding affinity prediction. We propose a Co-Former to combine the cross-modal sequence and structure information and a bi-scope pre-training strategy for improving Co-Former's interaction understanding. Meanwhile, we build the largest protein-RNA binding affinity dataset PRA310 for performance evaluation. We also test our model on a public dataset for mutation effect prediction. CoPRA reaches state-of-the-art performance on all the datasets. We provide extensive analyses and verify that CoPRA can (1) accurately predict the protein-RNA binding affinity; (2) understand the binding affinity change caused by mutations; and (3) benefit from scaling data and model size.

q-bio.BM↗

arXiv2024

Stability and convergence analysis of AdaGrad for non-convex optimization via novel stopping time-based techniques

Adaptive gradient optimizers (AdaGrad), which dynamically adjust the learning rate based on iterative gradients, have emerged as powerful tools in deep learning. These adaptive methods have significantly succeeded in various deep learning tasks, outperforming stochastic gradient descent. However, despite AdaGrad's status as a cornerstone of adaptive optimization, its theoretical analysis has not adequately addressed key aspects such as asymptotic convergence and non-asymptotic convergence rates in non-convex optimization scenarios. This study aims to provide a comprehensive analysis of AdaGrad and bridge the existing gaps in the literature. We introduce a new stopping time technique from probability theory, which allows us to establish the stability of AdaGrad under mild conditions. We further derive the asymptotically almost sure and mean-square convergence for AdaGrad. In addition, we demonstrate the near-optimal non-asymptotic convergence rate measured by the average-squared gradients in expectation, which is stronger than the existing high-probability results. The techniques developed in this work are potentially of independent interest for future research on other adaptive stochastic algorithms.

math.OC↗

arXiv2024

SolarDesign: An Online Photovoltaic Device Simulation and Design Platform

SolarDesign (https://solardesign.cn/) is an online photovoltaic device simulation and design platform that provides engineering modeling analysis for crystalline silicon solar cells, as well as emerging high-efficiency solar cells such as organic, perovskite, and tandem cells. The platform offers user-updatable libraries of basic photovoltaic materials and devices, device-level multi-physics simulations involving optical-electrical-thermal interactions, and circuit-level compact model simulations based on detailed balance theory. Employing internationally advanced numerical methods, the platform accurately, rapidly, and efficiently solves optical absorption, electrical transport, and compact circuit models. It achieves multi-level photovoltaic simulation technology from ``materials to devices to circuits'' with fully independent intellectual property rights. Compared to commercial software, the platform achieves high accuracy and improves speed by more than an order of magnitude. Additionally, it can simulate unique electrical transport processes in emerging solar cells, such as quantum tunneling, exciton dissociation, and ion migration.

physics.optics↗

arXiv2024

Nonlinear valley Hall effect in a bilayer transition metal dichalcogenide

Valley-contrasting Hall transport conventionally relies on the inversion symmetry breaking in two-dimensional systems, which greatly limits the selection range of valley materials. In particular, while monolayer transition metal dichalcogenides have been widely utilized as a well-known class of valley materials in valleytronics, the centrosymmetric nature hinders the realization of valley-contrasting properties in the bilayer counterparts. Here, taking MoS$_{2}$ as an example, we discover valley-contrasting transport in bilayer transition metal dichalcogenides by exploring nonlinear transport regime. Using effective models and first-principles calculations, our work demonstrates that nonvanishing nonlinear valley Hall conductivities emerge in a uniaxially strained MoS$_{2}$ bilayer, owing to strain-induced band tilts of Dirac fermions. With the aid of small spin-orbit-coupling induced band splittings, the conduction bands generate much remarkable nonlinear valley Hall conductivity. Moreover, the nonlinear conductivities are highly tunable through modulating the strength and the direction of the strain, chemical potential, and interlayer gap. Our findings not only expands material choices for valleytronic applications, but also provides opportunities for designing advanced electronic devices that leverage nonlinear valley transports.

cond-mat.mes-hall↗

arXiv2024

Bias Voltage Driven Tunneling Magnetoresistance Polarity Reversal in 2D Stripy Antiferromagnet CrOCl

Atomically thin materials with coupled magnetic and electric polarization are critical for developing energy-efficient and high-density spintronic devices, yet they remain scarce due to often conflicting requirements of stabilizing both magnetic and electric orders. The recent discovery of the magnetoelectric effect in the 2D stripy antiferromagnet CrOCl highlights this semiconductor as a promising platform to explore electric field effects on magnetoresistance. In this study, we systematically investigate the magnetoresistance in tunneling junctions of bilayer and monolayer CrOCl. We observe that the transition from antiferromagnetic to ferrimagnetic phases in both cases induces a positive magnetoresistance at low bias voltages, which reverses to a negative value at higher bias voltages. This polarity reversal is attributed to the additional electric dipoles present in the antiferromagnetic state, as supported by our theoretical calculations. These findings suggest a pathway for the electric control of spintronic devices and underscore the potential of 2D magnets like CrOCl in advancing energy-efficient spintronic applications.

cond-mat.mes-hall↗

arXiv2024

Magnetoresistance oscillations in vertical junctions of 2D antiferromagnetic semiconductor CrPS$_4$

Magnetoresistance (MR) oscillations serve as a hallmark of intrinsic quantum behavior, traditionally observed only in conducting systems. Here we report the discovery of MR oscillations in an insulating system, the vertical junctions of CrPS$_4$ which is a two dimensional (2D) A-type antiferromagnetic semiconductor. Systematic investigations of MR peaks under varying conditions, including electrode materials, magnetic field direction, temperature, voltage bias and layer number, elucidate a correlation between MR oscillations and spin-canted states in CrPS$_4$. Experimental data and analysis point out the important role of the in-gap electronic states in generating MR oscillations, and we proposed that spin selected interlayer hopping of localized defect states may be responsible for it. Our findings not only illuminate the unusual electronic transport in CrPS$_4$ but also underscore the potential of van der Waals magnets for exploring interesting phenomena.

cond-mat.mes-hall↗

arXiv2024

Effective Bilevel Optimization via Minimax Reformulation

Bilevel optimization has found successful applications in various machine learning problems, including hyper-parameter optimization, data cleaning, and meta-learning. However, its huge computational cost presents a significant challenge for its utilization in large-scale problems. This challenge arises due to the nested structure of the bilevel formulation, where each hyper-gradient computation necessitates a costly inner optimization procedure. To address this issue, we propose a reformulation of bilevel optimization as a minimax problem, effectively decoupling the outer-inner dependency. Under mild conditions, we show these two problems are equivalent. Furthermore, we introduce a multi-stage gradient descent and ascent (GDA) algorithm to solve the resulting minimax problem with convergence guarantees. Extensive experimental results demonstrate that our method outperforms state-of-the-art bilevel methods while significantly reducing the computational cost.

cs.LG↗

arXiv2024

GestureGPT: Toward Zero-Shot Free-Form Hand Gesture Understanding with Large Language Model Agents

Existing gesture interfaces only work with a fixed set of gestures defined either by interface designers or by users themselves, which introduces learning or demonstration efforts that diminish their naturalness. Humans, on the other hand, understand free-form gestures by synthesizing the gesture, context, experience, and common sense. In this way, the user does not need to learn, demonstrate, or associate gestures. We introduce GestureGPT, a free-form hand gesture understanding framework that mimics human gesture understanding procedures to enable a natural free-form gestural interface. Our framework leverages multiple Large Language Model agents to manage and synthesize gesture and context information, then infers the interaction intent by associating the gesture with an interface function. More specifically, our triple-agent framework includes a Gesture Description Agent that automatically segments and formulates natural language descriptions of hand poses and movements based on hand landmark coordinates. The description is deciphered by a Gesture Inference Agent through self-reasoning and querying about the interaction context (e.g., interaction history, gaze data), which is managed by a Context Management Agent. Following iterative exchanges, the Gesture Inference Agent discerns the user's intent by grounding it to an interactive function. We validated our framework offline under two real-world scenarios: smart home control and online video streaming. The average zero-shot Top-1/Top-5 grounding accuracies are 44.79%/83.59% for smart home tasks and 37.50%/73.44% for video streaming tasks. We also provide an extensive discussion that includes rationale for model selection, generalizability, and future research directions for a practical system etc.

cs.CL↗