SearcharxivSearch

arXiv subjects

Ruibo Wang

Publications and source records attributed to Ruibo Wang.

At least 19 recordsLinked to original sources

OPERA: Offline Policy-guided Expert Routing and Adaptation for Universal Biomedical Image Analysis

Biomedical image analysis spans diverse modalities and tasks, yet real-world deployment is hindered by severe distribution shifts across scanners, protocols, and patient populations. High-performing models consequently require repeated domain-specific fine-tuning, which is a costly cycle that becomes impractical when labels are scarce or privacy constraints limit data sharing. We propose OPERA (Offline Policy-guided Expert Routing and Adaptation), a multi-agent ensemble framework that addresses this deployment bottleneck by treating expert weight assignment as an offline policy learning problem: a routing policy is learned from a small validation set without gradient updates to any expert agent, then deployed with test-time adaptation to handle distribution shift. OPERA coordinates heterogeneous specialist agents through complementary mechanisms. The expert profiling module learns selection policies offline, enabling informed allocation of expertise. Each agent undergoes confidence calibration through temperature adjustment, ensuring more reliable probabilistic outputs. OPERA also incorporates distribution aware adaptation, where class weights are dynamically adjusted at the batch level using statistics derived from unlabeled test data. Instance level routing assigns each sample to the most suitable expert by leveraging inter model agreement and predictive entropy. We evaluate OPERA on 9 datasets covering fundus photography, chest X-ray, CT, MRI, and multimodal diagnostic benchmarks, comparing against 30+ baselines across classification, segmentation, and multimodal settings. OPERA consistently improves performance and calibration quality, demonstrating that offline policy-guided expert agents coordination is a practical path to deployable biomedical AI without retraining. Code is on \href{https://github.com/HUANGLIZI/OPERA}{GitHub}.

cs.CV

Rethinking Burst Buffer Optimization: Enabling Layout Heterogeneity via Hybrid Analysis and LLM Guidance

Burst buffers (BBs) are essential for mitigating I/O bottlenecks in modern HPC systems. However, existing BB file systems often suffer from structural performance degradation due to fixed data layouts that fail to align with diverse application behaviors. While current machine-learning-based optimizations focus primarily on tuning storage stack parameters for a given layout, they offer diminishing returns when a fundamental mismatch exists between I/O patterns and the underlying data organization. Furthermore, these approaches typically incur prohibitive costs due to extensive training or intrusive profiling. To bridge this gap, we present Proteus, a semantic-aware BB system that treats data layout as a first-class optimization dimension. The core insight of Proteus is that application I/O intent can be reconstructed by synergetically combining static code structures with lightweight runtime signals. Through a hybrid pipeline and a single execution probe, Proteus extracts latent semantic cues to determine the optimal layout prior to production runs-eliminating the need for prior training or exhaustive profiling. Evaluation with representative HPC workloads shows that Proteus achieves 91.30\% decision accuracy, delivering up to 3.24$\times$ and 2.9$\times$ speedups for write-intensive and metadata-intensive workloads, respectively.

cs.DC

MAdam: Metric-Aware Multi-Objective Adam

Multi-objective optimization (MOO) underlies many machine learning problems, yet MOO solvers across the loss-balancing, gradient-balancing, and Pareto-based families almost universally hand their reconciled directions to Adam~\cite{kingma2015adam}. We show this coupling introduces two systematic gaps between the solver's intent and the optimizer's execution. The first is a \emph{weighting mismatch}: Adam's second-moment denominator entangles the time-varying preference vector with gradient statistics, marginalizing the preference into a history average and collapsing distinct Pareto trade-offs toward a near-uniform mixture. The second is a \emph{geometric mismatch}: Adam's adaptive metric distorts the Euclidean geometry MOO solvers assume, turning aligned objectives into apparent conflicts. To resolve both jointly, we introduce \textbf{MAdam} (Metric-Aware Multi-Objective Adam), a drop-in wrapper that leaves both solver and optimizer unchanged. MAdam preconditions the reconciled direction by the preference-conditioned curvature of the scalarized objective; on this whitened input, Adam's second moment collapses to identity, so the realized update is governed by the preference-conditioned metric. Across multi-task learning, Pareto-front recovery, physics-informed neural networks, and medical imaging, MAdam consistently improves over Adam for every solver family.

cs.LG

Coverage and Rate Analysis of Follower-Based LEO Satellite Networks: A Stochastic Geometry Approach

To mitigate inter-satellite interference and payload limits in LEO mega-constellations, satellite clusters, groups of small cooperative satellites have been proposed to improve performance and reduce interference. The typical configuration divides the cluster into a leader satellite with full processing and control capabilities and multiple simpler follower satellites that assist with coverage and throughput. These clusters enhance coverage and throughput, prompting interest in their performance gains and optimal deployment. Given that the spherical stochastic geometry (SG) model has been proven effective for modeling such structures, we establish a performance evaluation framework based on the SG approach for the leader-follower satellite architecture, enabling an assessment of communication performance under different deployment configurations quantitatively. We derive analytical expressions for the outage probability and average data rate to evaluate the communication performance of the satellite system, along with low-complexity approximations. Numerical results demonstrate the performance advantages of the leader-follower architecture over a single leader satellite and explore optimal deployment configurations for the follower satellites.

cs.IT

A Prediction-as-Perception Framework for 3D Object Detection

Humans combine prediction and perception to observe the world. When faced with rapidly moving birds or insects, we can only perceive them clearly by predicting their next position and focusing our gaze there. Inspired by this, this paper proposes the Prediction-As-Perception (PAP) framework, integrating a prediction-perception architecture into 3D object perception tasks to enhance the model's perceptual accuracy. The PAP framework consists of two main modules: prediction and perception, primarily utilizing continuous frame information as input. Firstly, the prediction module forecasts the potential future positions of ego vehicles and surrounding traffic participants based on the perception results of the current frame. These predicted positions are then passed as queries to the perception module of the subsequent frame. The perceived results are iteratively fed back into the prediction module. We evaluated the PAP structure using the end-to-end model UniAD on the nuScenes dataset. The results demonstrate that the PAP structure improves UniAD's target tracking accuracy by 10% and increases the inference speed by 15%. This indicates that such a biomimetic design significantly enhances the efficiency and accuracy of perception models while reducing computational resource consumption.

cs.CV

Giant field-tunable nonlinear Hall effect by Lorentz skew scattering in a graphene moire superlattice

The nonlinear Hall effect (NHE) can enable rectification and energy harvesting, and its control by external fields, including gate, strain and magnetic field, has been pursued intensively. However, existing tuning pathways rely predominantly on fully quantum mechanical effects and are typically inefficient, resulting in weak NHE signals that limit further progress. In this work, we report the discovery of a distinct type of NHE in a graphene-hBN moire superlattice, which arises from a classical-quantum cooperative effect called Lorentz skew scattering (LSK), induced by a perpendicular magnetic field. This field-driven NHE exhibits a linear dependence on magnetic field and a pronounced unidirectional angular dependence. Remarkably, its magnitude reaches up to 32% of the linear Hall signal. We show that this giant, field-tunable NHE originating from LSK follows a unique quartic scaling law and produces a record-high nonlinear Hall conductivity (36000 {\mu}mV-1{\Omega}-1) near van Hove singularities of moire minibands, which is over an order of magnitude larger than all previously reported NHEs. Our findings establish an efficient, magnetic-field-driven route to giant Hall rectification in high-mobility materials, offering a broadly applicable paradigm for modulating the NHE beyond electrostatic gating.

cond-mat.mes-hall

Performance Analysis of SAGIN from the Relay Perspective: A Spherical Stochastic Geometry Approach

In recent years, the satellite-aerial-ground integrated network (SAGIN) has become essential in meeting the increasing demands for global wireless communications. In SAGIN, high-altitude platforms (HAPs) can serve as communication hubs and act as relays to enhance communication performance. In this paper, we evaluate network performance and analyze the role of HAPs in SAGIN from the relay perspective. Based on this unique perspective, we introduce three metrics to evaluate the performance, named the average access data rate, the average backhaul data rate, and the backhaul rate exceedance probability (BREP). Considering the need for dynamic topology and interference analysis, we choose spherical stochastic geometry (SSG) as a tool and derive analytical expressions for the above metrics to achieve low-complexity performance evaluation. Specifically, we provide a closed-form expression for the end-to-end performance metric BREP. Given that there is no existing literature in the SSG field studying networks from a relay perspective, we specifically investigate the impact of satellite network topology on performance in our numerical results to further highlight the advantages of the SSG framework. Additionally, we analyze the minimum HAP transmission power required to maintain both short-term and long-term data rate demands.

cs.NI

Non-Terrestrial Network Models Using Stochastic Geometry: Planar or Spherical?

With the explosive deployment of non-terrestrial networks (NTNs), the computational complexity of network performance analysis is rapidly escalating. As one of the most suitable mathematical tools for analyzing large-scale network topologies, stochastic geometry (SG) enables the representation of network performance metrics as functions of network parameters, thus offering low-complexity performance analysis solutions. However, choosing between planar and spherical models remains challenging. Planar models neglect Earth's curvature, causing deviations in high-altitude NTN analysis, yet are still often used for simplicity. This paper introduces relative error to quantify the gap between planar and spherical models, helping determine when planar modeling is sufficient. To calculate the relative error, we first propose a point process (PP) generation algorithm that simultaneously generates a pair of homogeneous and asymptotically similar planar and spherical PPs. We then introduce several typical similarity metrics, including topology-related and network-level metrics, and further develop a relative error estimation algorithm based on these metrics. In addition, we derive an analytical expression for the optimal planar altitude, which reduces computational complexity and provides theoretical support for planar approximation. Finally, numerical results investigate how deployment altitude and region affect NTN modeling, with case studies on HAP and LEO satellite constellations.

cs.NI

Analyzing Localizability of LEO/MEO Hybrid Networks: A Stochastic Geometry Approach

With the increase in global positioning service demands and the requirement for more precise positioning, assisting existing medium and high orbit satellite-enabled positioning systems with low Earth orbit (LEO) satellites has garnered widespread attention. However, providing low computational complexity performance analysis for hybrid LEO/MEO massive satellite constellations remains a challenge. In this article, we introduce for the first time the application of stochastic geometry (SG) framework in satellite-enabled positioning performance analysis and provide an analytical expression for the K-availiability probability and K-localizability probability under bidirectional beam alignment transmissions. The K-localizability probability, defined as the probability that at least K satellites can participate in the positioning process, serves as a prerequisite for positioning. Since the modeling of MEO satellite constellations within the SG framework has not yet been studied, we integrate the advantages of Cox point processes and binomial point processes, proposing a doubly stochastic binomial point process binomial point process for accurate modeling of MEO satellite constellations. Finally, we investigate the impact of constellation configurations and antenna patterns on the localizability performance of LEO, MEO, and hybrid MEO/LEO constellations. We also demonstrate the network performance gains brought to MEO positioning systems by incorporating assistance from LEO satellites.

cs.NI

Observation of giant nonlinear valley Hall effect

The valley Hall effect (VHE) holds great promise for valleytronic applications by leveraging the valley degree of freedom. To date, research on VHE has focused on its linear response to an applied current, leaving nonlinear valley responses undetected and nonlinear valleytronic devices undeveloped. Here, we report the experimental observation of a nonlinear VHE in a graphene-hBN moire superlattice, evidenced by the generation of second-harmonic nonlocal voltages under AC currents. Remarkably, the nonlinear VHE has magnitude surpassing the linear VHE and is highly tunable via a gate voltage, which exhibits a pair of opposite peaks on the two sides of a Dirac gap. The nonlinear signal shows quadratic scaling with driving current and quartic scaling with local resistance, setting it apart from the linear counterpart. These experimental features are consistent with the theoretical picture of nonlocal transport mediated by nonlinear VHE and linear inverse VHE. We further reveal a nonlinear inverse VHE by observing the third- and fourth-harmonic nonlocal voltages. The nonlinear VHE provides a novel mechanism for valley manipulation and enables a novel valleytronic device, the valley rectifier, that converts AC charge current into DC valley current.

cond-mat.mes-hall

Modeling and Analysis of Non-Terrestrial Networks by Spherical Stochastic Geometry

Non-terrestrial networks (NTNs) are anticipated to be indispensable in extending coverage and enabling global communication access in next-generation wireless networks. With the extensive deployment of non-terrestrial platforms, evaluating the performance of NTN-enabled communication systems becomes a challenging task. Spherical stochastic geometry (SG) is a recently proposed analytical framework that has garnered increasing attention. Due to its suitability for modeling large-scale dynamic topologies and its ability to provide an analytical framework for interference analysis and low-complexity performance evaluation, spherical SG has been widely applied in NTN performance analysis. This paper surveys the modeling and analysis of NTN networks based on spherical SG. We begin by introducing the spherical SG framework, detailing its history and development. Next, we categorize existing spherical SG models into three types based on orbital modeling methods and provide algorithm implementations for common models. Furthermore, we investigate the accuracy and necessity of spherical modeling through case studies. On the topology level, concepts such as association strategy, central angle, zenith angle, contact angle, and availability probability are introduced, with simple derivations provided. On the channel level, we detail the modeling of large-scale fading, small-scale fading, and beam gain for different channel links. Finally, we discuss several advanced topics that have not been fully explored but have strong motivation and research potential, and we predict future research directions.

cs.NI

Satellite-Terrestrial Routing or Inter-Satellite Routing? A Stochastic Geometry Perspective

The design and comparison of satellite-terrestrial routing (STR) and inter-satellite routing (ISR) in low Earth orbit satellite constellations is a widely discussed topic. The signal propagation distance under STR is generally longer than that under ISR, resulting in greater path loss. The global deployment of gateways introduces additional costs for STR. In contrast, transmissions under ISR rely on the energy of satellites, which could be more costly. Additionally, ISLs require more complex communication protocol design, extra hardware support, and increased computational power. To maximize energy efficiency, we propose two optimal routing relay selection algorithms for ISR and STR, respectively. Furthermore, we derive the analytical expressions for the routing availability probability and energy efficiency, quantifying the performance of the algorithms. The analyses enable us to assess the performance of the proposed algorithms against existing methods through numerical results, compare the performance of STR and ISR, and provide useful insights for constellation design.

cs.NI

Perseus: Leveraging Common Data Patterns with Curriculum Learning for More Robust Graph Neural Networks

Graph Neural Networks (GNNs) excel at handling graph data but remain vulnerable to adversarial attacks. Existing defense methods typically rely on assumptions like graph sparsity and homophily to either preprocess the graph or guide structure learning. However, preprocessing methods often struggle to accurately distinguish between normal edges and adversarial perturbations, leading to suboptimal results due to the loss of valuable edge information. Robust graph neural network models train directly on graph data affected by adversarial perturbations, without preprocessing. This can cause the model to get stuck in poor local optima, negatively affecting its performance. To address these challenges, we propose Perseus, a novel adversarial defense method based on curriculum learning. Perseus assesses edge difficulty using global homophily and applies a curriculum learning strategy to adjust the learning order, guiding the model to learn the full graph structure while adaptively focusing on common data patterns. This approach mitigates the impact of adversarial perturbations. Experiments show that models trained with Perseus achieve superior performance and are significantly more robust to adversarial attacks.

cs.LG

Enhancing Physical Layer Security in LEO Satellite-Enabled IoT Network Communications

The extensive deployment of Low Earth Orbit (LEO) satellites introduces significant security challenges for communication security issues in Internet of Things (IoT) networks. With the rising number of satellites potentially acting as eavesdroppers, integrating Physical Layer Security (PLS) into satellite communications has become increasingly critical. However, these studies are facing challenges such as dealing with dynamic topology difficulties, limitations in interference analysis, and the high complexity of performance evaluation. To address these challenges, for the first time, we investigate PLS strategies in satellite communications using the Stochastic Geometry (SG) analytical framework. We consider the uplink communication scenario in an LEO-enabled IoT network, where multi-tier satellites from different operators respectively serve as legitimate receivers and eavesdroppers. In this scenario, we derive low-complexity analytical expressions for the security performance metrics, namely availability probability, successful communication probability, and secure communication probability. By introducing the power allocation parameters, we incorporate the Artificial Noise (AN) technique, which is an important PLS strategy, into this analytical framework and evaluate the gains it brings to secure transmission. In addition to the AN technique, we also analyze the impact of constellation configuration, physical layer parameters, and network layer parameters on the aforementioned metrics.

cs.NI

End-to-End Uplink Performance Analysis of Satellite-Based IoT Networks: A Stochastic Geometry Approach

With the deployment of satellite constellations, Internet-of-Things (IoT) devices in remote areas have gained access to low-cost network connectivity. In this paper, we investigate the performance of IoT devices connecting in up-link through low Earth orbit (LEO) satellites to geosynchronous equatorial orbit (GEO) links. We model the dynamic LEO satellite constellation using the stochastic geometry method and provide an analysis of end-to-end availability with low-complexity and coverage performance estimates for the mentioned link. Based on the analytical expressions derived in this research, we make a sound investigation on the impact of constellation configuration, transmission power, and the relative positions of IoT devices and GEO satellites on end-to-end performance.

cs.NI

NeRO: Neural Road Surface Reconstruction

Accurately reconstructing road surfaces is pivotal for various applications especially in autonomous driving. This paper introduces a position encoding Multi-Layer Perceptrons (MLPs) framework to reconstruct road surfaces, with input as world coordinates x and y, and output as height, color, and semantic information. The effectiveness of this method is demonstrated through its compatibility with a variety of road height sources like vehicle camera poses, LiDAR point clouds, and SFM point clouds, robust to the semantic noise of images like sparse labels and noise semantic prediction, and fast training speed, which indicates a promising application for rendering road surfaces with semantics, particularly in applications demanding visualization of road surface, 4D labeling, and semantic groupings.

cs.CV

Network-Level Analysis of Integrated Sensing and Communication Using Stochastic Geometry

To meet the demands of densely deploying communication and sensing devices in the next generation of wireless networks, integrated sensing and communication (ISAC) technology is employed to alleviate spectrum scarcity, while stochastic geometry (SG) serves as a tool for low-complexity performance evaluation. To assess network-level performance, there is a natural interaction between ISAC technology and the SG method. From ISAC network perspective, we illustrate how to leverage SG analytical framework to evaluate ISAC network performance by introducing point process distributions and stochastic fading channel models. From SG framework perspective, we summarize the unique performance metrics and research objectives of ISAC networks, thereby extending the scope of SG research in the field of wireless communications. Additionally, considering the limited discussion in the existing SG-based ISAC works in terms of distribution and channel modeling, a case study is designed to exploit topology and channel fading awareness to provide relevant network insights.

cs.NI

Exploring UAV Networking from the Terrain Information Completeness Perspective: A Tutorial

Terrain information is a crucial factor affecting the performance of unmanned aerial vehicle (UAV) networks. As a tutorial, this article provides a unique perspective on the completeness of terrain information, summarizing and enhancing the research on terrain-based UAV deployment. In the presence of complete terrain information, two highly discussed topics are UAV-aided map construction and dynamic trajectory design based on maps. We propose a case study illustrating the mutually reinforcing relationship between them. When terrain information is incomplete, and only terrain-related feature parameters are available, we discuss how existing models map terrain features to blockage probabilities. By introducing the application of this model with stochastic geometry, a case study is proposed to analyze the accuracy of the model. When no terrain information is available, UAVs gather terrain information during the real-time networking process and determine the next position by collected information. This real-time search method is currently limited to relay communication. In the case study, we extend it to a multi-user scenario and summarize three trade-offs of the method. Finally, we conduct a qualitative analysis to assess the impact of three factors that have been overlooked in terrain-based UAV deployment.

cs.NI