Searcharxiv⌕ Search

arXiv subjects

Yipeng Wang

Publications and source records attributed to Yipeng Wang.

At least 37 records · Page 2Linked to original sources

DynamicRTL: RTL Representation Learning for Dynamic Circuit Behavior

There is a growing body of work on using Graph Neural Networks (GNNs) to learn representations of circuits, focusing primarily on their static characteristics. However, these models fail to capture circuit runtime behavior, which is crucial for tasks like circuit verification and optimization. To address this limitation, we introduce DR-GNN (DynamicRTL-GNN), a novel approach that learns RTL circuit representations by incorporating both static structures and multi-cycle execution behaviors. DR-GNN leverages an operator-level Control Data Flow Graph (CDFG) to represent Register Transfer Level (RTL) circuits, enabling the model to capture dynamic dependencies and runtime execution. To train and evaluate DR-GNN, we build the first comprehensive dynamic circuit dataset, comprising over 6,300 Verilog designs and 63,000 simulation traces. Our results demonstrate that DR-GNN outperforms existing models in branch hit prediction and toggle rate prediction. Furthermore, its learned representations transfer effectively to related dynamic circuit tasks, achieving strong performance in power estimation and assertion prediction.

cs.LG↗

Uniqueness of Cylindrical Tangent Cones $C_{p,q} \times \mathbb{R}$

We show the uniqueness of the cylindrical tangent cone $C(\mathbb{S}^2 \times \mathbb{S}^4) \times \mathbb{R}$ for area-minimizing hypersurfaces in $\mathbb{R}^9$, completing the uniqueness of all tangent cones of the form $C_{p,q} \times \mathbb{R}$ proved by Simon for dimensions at least 10 and Székelyhidi for the Simons cone.

math.DG↗

Time-Lapse Video-Based Embryo Grading via Complementary Spatial-Temporal Pattern Mining

Artificial intelligence has recently shown promise in automated embryo selection for In-Vitro Fertilization (IVF). However, current approaches either address partial embryo evaluation lacking holistic quality assessment or target clinical outcomes inevitably confounded by extra-embryonic factors, both limiting clinical utility. To bridge this gap, we propose a new task called Video-Based Embryo Grading - the first paradigm that directly utilizes full-length time-lapse monitoring (TLM) videos to predict embryologists' overall quality assessments. To support this task, we curate a real-world clinical dataset comprising over 2,500 TLM videos, each annotated with a grading label indicating the overall quality of embryos. Grounded in clinical decision-making principles, we propose a Complementary Spatial-Temporal Pattern Mining (CoSTeM) framework that conceptually replicates embryologists' evaluation process. The CoSTeM comprises two branches: (1) a morphological branch using a Mixture of Cross-Attentive Experts layer and a Temporal Selection Block to select discriminative local structural features, and (2) a morphokinetic branch employing a Temporal Transformer to model global developmental trajectories, synergistically integrating static and dynamic determinants for grading embryos. Extensive experimental results demonstrate the superiority of our design. This work provides a valuable methodological framework for AI-assisted embryo selection. The dataset and source code will be publicly available upon acceptance.

cs.CV↗

HALO: Hierarchical Autonomous Logic-Oriented Orchestration for Multi-Agent LLM Systems

Recent advancements in Multi-Agent Systems (MAS) powered by Large Language Models (LLMs) have demonstrated tremendous potential in diverse task scenarios. Nonetheless, existing agentic systems typically rely on predefined agent-role design spaces and static communication structures, limiting their adaptability as well as flexibility in complex interaction environments and leading to subpar performance on highly specialized and expert-level tasks. To address these issues, we introduce HALO, a multi-agent collaboration framework based on a hierarchical reasoning architecture. Specifically, we incorporate a high-level planning agent for task decomposition, mid-level role-design agents for subtask-specific agent instantiation, and low-level inference agents for subtask execution. Particularly, subtask execution is reformulated as a structured workflow search problem, where Monte Carlo Tree Search (MCTS) systematically explores the agentic action space to construct optimal reasoning trajectories. Additionally, as the majority of users lack expertise in prompt engineering, we leverage an Adaptive Prompt Refinement module to transform raw queries into task-specific prompts. Empirical evaluations on Code Generation (HumanEval), General Reasoning (MMLU), and Arithmetic Reasoning (MATH) benchmark datasets highlight the effectiveness of HALO, yielding a 14.4% average improvement over state-of-the-art baselines. Notably, HALO achieves up to 13.3% performance gain on the Moral Scenarios subject in the MMLU benchmark and up to 19.6% performance gain on the Algebra subarea in the MATH benchmark, indicating its advanced proficiency in tackling highly specialized and expert-level tasks. The code repository is available at https://github.com/23japhone/HALO.

cs.MA↗

Hybrid Brain-Machine Interface: Integrating EEG and EMG for Reduced Physical Demand

We present a hybrid brain-machine interface (BMI) that integrates steady-state visually evoked potential (SSVEP)-based EEG and facial EMG to improve multimodal control and mitigate fatigue in assistive applications. Traditional BMIs relying solely on EEG or EMG suffer from inherent limitations; EEG-based control requires sustained visual focus, leading to cognitive fatigue, while EMG-based control induces muscular fatigue over time. Our system dynamically alternates between EEG and EMG inputs, using EEG to detect SSVEP signals at 9.75 Hz and 14.25 Hz and EMG from cheek and neck muscles to optimize control based on task demands. In a virtual turtle navigation task, the hybrid system achieved task completion times comparable to an EMG-only approach, while 90% of users reported reduced or equal physical demand. These findings demonstrate that multimodal BMI systems can enhance usability, reduce strain, and improve long-term adherence in assistive technologies.

q-bio.NC↗

On the relation between Galerkin approximations and canonical best-approximations of solutions to some non-linear Schrödinger equations

In this paper, we establish a superconvergence property of Galerkin approximations to some non-linear Schrödinger equations of Gross-Pitaevskii type. More precisely, denoting by $u^*\in X \subseteq H^1(Ω)$ the exact solution to such an equation, by $\{X_δ\}_{δ>0}$, a sequence of conforming subspaces of $X$ satisfying the approximation property, by $u_δ^*\in X_δ$ the Galerkin solution to the equation, and by $Π^X_δ u^*$, the $(\cdot, \cdot)_{X}$-best approximation in $X_δ$ of $u^*$, we show -- under some assumptions -- that $u_δ^*$ converges at a higher rate to $Π^X_δ u^*$ than to $u^*$ in both the $L^2$ norm and the canonical $H^1$ norm. Our results apply to conforming finite element discretisations as well as spectral Galerkin methods based on polynomials or Fourier (plane-wave) expansions.

math.NA↗

Rigidity Results Involving Stabilized Scalar Curvature

We establish a rigidity theorem for Brendle and Hung's recent systolic inequality, which involves Gromov's notion of \(T^{\rtimes}\)-stabilized scalar curvature. Our primary technique is the construction of foliations by free boundary weighted constant mean curvature hypersurfaces, enabling us to generalize several classical scalar curvature rigidity results to the \(T^{\rtimes}\)-stabilized setting. Additionally, we develop a monotone quantity using Ricci flow coupled with a heat equation, which is essential for rigidity analysis.

math.DG↗

Adaptive LiDAR Odometry and Mapping for Autonomous Agricultural Mobile Robots in Unmanned Farms

Unmanned and intelligent agricultural systems are crucial for enhancing agricultural efficiency and for helping mitigate the effect of labor shortage. However, unlike urban environments, agricultural fields impose distinct and unique challenges on autonomous robotic systems, such as the unstructured and dynamic nature of the environment, the rough and uneven terrain, and the resulting non-smooth robot motion. To address these challenges, this work introduces an adaptive LiDAR odometry and mapping framework tailored for autonomous agricultural mobile robots operating in complex agricultural environments. The proposed framework consists of a robust LiDAR odometry algorithm based on dense Generalized-ICP scan matching, and an adaptive mapping module that considers motion stability and point cloud consistency for selective map updates. The key design principle of this framework is to prioritize the incremental consistency of the map by rejecting motion-distorted points and sparse dynamic objects, which in turn leads to high accuracy in odometry estimated from scan matching against the map. The effectiveness of the proposed method is validated via extensive evaluation against state-of-the-art methods on field datasets collected in real-world agricultural environments featuring various planting types, terrain types, and robot motion profiles. Results demonstrate that our method can achieve accurate odometry estimation and mapping results consistently and robustly across diverse agricultural settings, whereas other methods are sensitive to abrupt robot motion and accumulated drift in unstructured environments. Further, the computational efficiency of our method is competitive compared with other methods. The source code of the developed method and the associated field dataset are publicly available at https://github.com/UCR-Robotics/AG-LOAM.

cs.RO↗

Fill-Ins of Tori with Scalar Curvature Bounded from Below

Let $γ$ be a Riemannian metric on $Σ= S^1 \times T^{n-2}$, where $3 \leq n \leq 7$. Consider $Ω= B^2 \times T^{n-2}$ with boundary $\partial Ω= Σ$, and let $g$ be a Riemannian metric on $Ω$ such that the scalar curvature $R_g \geq -n(n - 1)$ and $g|_{\partial Ω} = γ$. Assuming the mean curvature of $\partial Ω$ with respect to the outward normal is positive, we establish that the total mean curvature of $\partial Ω$ is bounded from above by a constant depending only on $n$ and $γ$. Furthermore, we compute the sharp constant for this estimate when $γ$ is a flat metric. This result resolves a special case of a conjecture by Gromov concerning total mean curvature of fill-in with scalar curvature bounded from below. The proof combines techniques developed by Shi-Tam, Shi-Wang-Wei, as well as recent work by Brendle-Hung on the systolic inequality.

math.DG↗

Planar Reflection-Aware Neural Radiance Fields

Neural Radiance Fields (NeRF) have demonstrated exceptional capabilities in reconstructing complex scenes with high fidelity. However, NeRF's view dependency can only handle low-frequency reflections. It falls short when handling complex planar reflections, often interpreting them as erroneous scene geometries and leading to duplicated and inaccurate scene representations. To address this challenge, we introduce a reflection-aware NeRF that jointly models planar reflectors, such as windows, and explicitly casts reflected rays to capture the source of the high-frequency reflections. We query a single radiance field to render the primary color and the source of the reflection. We propose a sparse edge regularization to help utilize the true sources of reflections for rendering planar reflections rather than creating a duplicate along the primary ray at the same depth. As a result, we obtain accurate scene geometry. Rendering along the primary ray results in a clean, reflection-free view, while explicitly rendering along the reflected ray allows us to reconstruct highly detailed reflections. Our extensive quantitative and qualitative evaluations of real-world datasets demonstrate our method's enhanced performance in accurately handling reflections.

cs.CV↗

Accurate Power Spectrum Estimation toward Nyquist limit

The power spectrum, as a statistic in Fourier space, is commonly numerically calculated using the fast Fourier transform method to efficiently reduce the computational costs. To alleviate the systematic bias known as aliasing due to the insufficient sampling, the interlacing technique was proposed. We derive the analytical form of the shot noise under the interlacing technique, which enables the exact separation of the Poisson shot noise from the signal in this case. Thanks to the accurate shot noise subtraction, we demonstrate an enhancement in the accuracy of power spectrum estimation, and compare with the other widely used estimators in community. The good performance of our estimation allows an abatement in the computational cost by using low resolution and low order mass assignment scheme in the analysis for huge surveys and mocks.

astro-ph.CO↗

Effective volume growth of three-manifolds with positive scalar curvature

In this note, we prove an effective linear volume growth for complete three-manifolds with non-negative Ricci curvature and uniformly positive scalar curvature. This recovers the results obtained by Munteanu-Wang. Our method builds upon recent work by Chodosh-Li-Stryker, which utilizes the technique of $μ$-bubbles and the almost-splitting theorem by Cheeger-Colding.

math.DG↗

Litmus: Fair Pricing for Serverless Computing

Serverless computing has emerged as a market-dominant paradigm in modern cloud computing, benefiting both cloud providers and tenants. While service providers can optimize their machine utilization, tenants only need to pay for the resources they use. To maximize resource utilization, these serverless systems co-run numerous short-lived functions, bearing frequent system condition shifts. When the system gets overcrowded, a tenant's function may suffer from disturbing slowdowns. Ironically, tenants also incur higher costs during these slowdowns, as commercial serverless platforms determine costs proportional to their execution times. This paper argues that cloud providers should compensate tenants for losses incurred when the server is over-provisioned. However, estimating tenants' losses is challenging without pre-profiled information about their functions. Prior studies have indicated that assessing tenant losses leads to heavy overheads. As a solution, this paper introduces a new pricing model that offers discounts based on the machine's state while presuming the tenant's loss under that state. To monitor the machine state accurately, Litmus pricing frequently conducts Litmus tests, an effective and lightweight solution for measuring system congestion. Our experiments show that Litmus pricing can accurately gauge the impact of system congestion and offer nearly ideal prices, with only a 0.2% price difference on average, in a heavily congested system.

cs.DC↗

Scalar curvature rigidity of warped product metrics

We show scalar-mean curvature rigidity of warped products of round spheres of dimension at least 2 over compact intervals equipped with strictly log-concave warping functions. This generalizes earlier results of Cecchini-Zeidler to all dimensions. Moreover, we show scalar curvature rigidity of round spheres of dimension at least 3 with two antipodal points removed. This resolves a problem in Gromov's ''Four Lectures'' in all dimensions. Our arguments are based on spin geometry.

math.DG↗

On-the-Go Tree Detection and Geometric Traits Estimation with Ground Mobile Robots in Fruit Tree Groves

By-tree information gathering is an essential task in precision agriculture achieved by ground mobile sensors, but it can be time- and labor-intensive. In this paper we present an algorithmic framework to perform real-time and on-the-go detection of trees and key geometric characteristics (namely, width and height) with wheeled mobile robots in the field. Our method is based on the fusion of 2D domain-specific data (normalized difference vegetation index [NDVI] acquired via a red-green-near-infrared [RGN] camera) and 3D LiDAR point clouds, via a customized tree landmark association and parameter estimation algorithm. The proposed system features a multi-modal and entropy-based landmark correspondences approach, integrated into an underlying Kalman filter system to recognize the surrounding trees and jointly estimate their spatial and vegetation-based characteristics. Realistic simulated tests are used to evaluate our proposed algorithm's behavior in a variety of settings. Physical experiments in agricultural fields help validate our method's efficacy in acquiring accurate by-tree information on-the-go and in real-time by employing only onboard computational and sensing resources.

cs.RO↗

Multimodal Dataset for Localization, Mapping and Crop Monitoring in Citrus Tree Farms

In this work we introduce the CitrusFarm dataset, a comprehensive multimodal sensory dataset collected by a wheeled mobile robot operating in agricultural fields. The dataset offers stereo RGB images with depth information, as well as monochrome, near-infrared and thermal images, presenting diverse spectral responses crucial for agricultural research. Furthermore, it provides a range of navigational sensor data encompassing wheel odometry, LiDAR, inertial measurement unit (IMU), and GNSS with Real-Time Kinematic (RTK) as the centimeter-level positioning ground truth. The dataset comprises seven sequences collected in three fields of citrus trees, featuring various tree species at different growth stages, distinctive planting patterns, as well as varying daylight conditions. It spans a total operation time of 1.7 hours, covers a distance of 7.5 km, and constitutes 1.3 TB of data. We anticipate that this dataset can facilitate the development of autonomous robot systems operating in agricultural tree environments, especially for localization, mapping and crop monitoring tasks. Moreover, the rich sensing modalities offered in this dataset can also support research in a range of robotics and computer vision tasks, such as place recognition, scene understanding, object detection and segmentation, and multimodal learning. The dataset, in conjunction with related tools and resources, is made publicly available at https://github.com/UCR-Robotics/Citrus-Farm-Dataset.

cs.RO↗

OmnimatteRF: Robust Omnimatte with 3D Background Modeling

Video matting has broad applications, from adding interesting effects to casually captured movies to assisting video production professionals. Matting with associated effects such as shadows and reflections has also attracted increasing research activity, and methods like Omnimatte have been proposed to separate dynamic foreground objects of interest into their own layers. However, prior works represent video backgrounds as 2D image layers, limiting their capacity to express more complicated scenes, thus hindering application to real-world videos. In this paper, we propose a novel video matting method, OmnimatteRF, that combines dynamic 2D foreground layers and a 3D background model. The 2D layers preserve the details of the subjects, while the 3D background robustly reconstructs scenes in real-world videos. Extensive experiments demonstrate that our method reconstructs scenes with better quality on various videos.

cs.CV↗

Analysis of the Single Reference Coupled Cluster Method for Electronic Structure Calculations: The Full Coupled Cluster Equations

The central problem in electronic structure theory is the computation of the eigenvalues of the electronic Hamiltonian -- an unbounded, self-adjoint operator acting on a Hilbert space of antisymmetric functions. Coupled cluster (CC) methods, which are based on a non-linear parameterisation of the sought-after eigenfunction and result in non-linear systems of equations, are the method of choice for high accuracy quantum chemical simulations but their numerical analysis is underdeveloped. The existing numerical analysis relies on a local, strong monotonicity property of the CC function that is valid only in a perturbative regime, i.e., when the sought-after ground state CC solution is sufficiently close to zero. In this article, we introduce a new well-posedness analysis for the single reference coupled cluster method based on the invertibility of the CC derivative. Under the minimal assumption that the sought-after eigenfunction is intermediately normalisable and the associated eigenvalue is isolated and non-degenerate, we prove that the continuous (infinite-dimensional) CC equations are always locally well-posed. Under the same minimal assumptions and provided that the discretisation is fine enough, we prove that the discrete Full-CC equations are locally well-posed, and we derive residual-based error estimates with guaranteed positive constants. Preliminary numerical experiments indicate that the constants that appear in our estimates are a significant improvement over those obtained from the local monotonicity approach.

math.NA↗