SearcharxivSearch

arXiv subjects

Guannan He

Publications and source records attributed to Guannan He.

At least 19 recordsLinked to original sources

DEFT: Data-Efficient Frequency-domain Top-k Sampling via Inverse Discrete Fourier Transform for Spatiotemporal Dynamical Systems Modeling

Modeling spatiotemporal dynamical systems governed by partial differential equations (PDEs) poses two major challenges: it either requires expensive physics-based simulators that entail iterative numerical solving at high computational cost, or it depends on abundant training data, yet purely data-driven models often generalize poorly to downstream dynamic operating conditions. We propose DEFT, a frequency-domain data sampling method that identifies the dominant Fourier modes of a physical system and systematically varies the corresponding amplitudes and phases to generate physically consistent training data via the inverse discrete Fourier transform. In addition, we derive a generalization bound of this method. We note that it also provides a theoretically principled criterion for selecting $K$. We evaluate the proposed method through three sets of experiments, each targeting a distinct aspect of its utility. First, we validate the framework on canonical PDEs solving demonstrating that it outperforms traditional methods when the system is dominated by a few prominent frequency components. Second, we employ DEFT as a data-value filter on the diffusion--sorption and Burgers equations of PDEBench, showing that it reduces data requirements by $40\%$ while sacrificing less than $2\%$ in predictive accuracy. Third, to evaluate DEFT for more challenging and practically relevant problems, we validate it in the battery degradation PDE system, achieving consistently high predictive accuracy across various test datasets with $R^2$ values exceeding $0.99$. Moreover, the learned frequency-domain features transfer to other battery chemistries with only $20\%$ of the fine-tuning data. These results demonstrate that DEFT is an effective data-sampling method for efficient operator learning.

cs.LG

FUSEP: A Multi-Center Benchmark for Diverse Tasks in Early Pregnancy Fetal Ultrasound Screening

A large number of infants with congenital anomalies are born each year globally, especially in areas with underdeveloped medical resources. Currently, fetal ultrasound screening is the most common modality for early pregnancy anatomy detection. This modality can detect anomalies earlier and provide opportune treatment advice. However, the lack of an ultrasound dataset on early fetal gestation has slowed down the development of automated assisted diagnosis. In this work, we present a benchmark dataset for Fetal Ultrasound Screening in Early Pregnancy to facilitate intelligent ultrasound examination and assisted diagnosis called FUSEP. Our dataset consists of two ultrasound views recommended by the international guideline, i.e., Crown-rump Length (CRL) and Nuchal Translucency (NT) views in three hospitals, totaling 4,017 ultrasound images, with 45,820 box-level expert-level annotations. Our dataset and baseline present the following three contributions: 1) Our medical experts annotated a total of 14 key anatomical structures in two views using a box-level format; 2) Our data is collected extensively from different sonographers, devices, scanning angles, hospitals, etc; 3) We report the performance of the semi-supervised learning, fully supervised learning, unsupervised domain adaptation (UDA), and source-free UDA in ultrasound images multi-object detection. To the best of our knowledge, this is the first publicly available dataset and benchmark for fetal early pregnancy ultrasound screening. We believe that FUSEP and benchmark can contribute to the medical community in the development of multiple tasks such as standard plane recognition, quality control on ultrasound images, automated assisted diagnostics in early fetal pregnancy, medical multi-object detection, domain adaptation for object detection, etc.

cs.CV

CoEvoKG: Co-Evolving Knowledge Graphs with Self-Evolving Search Agents

Large language models can improve with reinforcement learning for search agents, yet existing self play agents repeatedly generate tasks while discarding the knowledge gained during successful searches. We introduce CoEvoKG, a framework that turns a knowledge graph into both a source of verifiable training tasks and a persistent evidence memory for agent evolution. CoEvoKG jointly trains a task generator and a search agent: the generator creates multihop questions from entity chains sampled from the knowledge graph, while the agent learns from rewards for answer correctness and search trajectories whose entity paths are supported by graph evidence. When a search succeeds, CoEvoKG verifies and deduplicates the retrieved evidence, then writes it back to the corresponding graph nodes and edges. Future rounds reuse this enriched graph for task generation and reward computation, closing the loop between model self evolution and knowledge accumulation. Experiments on six QA benchmarks (NQ, TriviaQA, PopQA, HotpotQA, 2WikiMultiHopQA, and Bamboogle) with three backbone models show that CoEvoKG improves macro average accuracy over the corresponding base models by +11.2, +10.1, and +11.6 points on Qwen2.5-3B-Instruct, Qwen2.5-7B-Instruct, and Llama-3.1-8B-Instruct, respectively. Under matched training budgets, CoEvoKG further improves over competitive self play baselines and RL baselines for search agents by +2.6 to +3.7 macro average points across the three backbones. Code is available at https://github.com/lazzy1225/CoEvoKG.

cs.AI

Self-Play Meets Skill Evolution: Self-Evolving Search Agents that Pose, Solve, and Remember

Self-play agents can generate training problems without questions from target benchmarks, but their curricula lack persistent state: failures affect gradients yet do not explicitly shape future practice. External skill memories preserve procedural experience but are typically learned from fixed task distributions. We introduce \textbf{SESA} (Self-Evolving Skill-Augmented Agent), which makes procedural memory an evolving state of tool-augmented search self-play. A challenger poses problems, while a separately parameterized solver alone retrieves skills. Informative failures are distilled into reusable skills and written back to memory. The updated memory changes solver behavior and success, which changes the challenger's reward and the distribution of future problems; the resulting frontier produces new failures that rewrite memory. This bidirectional loop makes task generation and skill memory co-evolve. Because retrieved skills shape on-policy training trajectories, their benefits can enter the model parameters as well as remain in the external bank, enabling memory-free deployment and optional inference-time retrieval. Across seven open-domain and multi-hop question-answering benchmarks, SESA improves average accuracy over SSP by 1.2--3.2 points across multiple backbones and surpasses the skill-augmented SkillRL baseline by 0.9 points under a unified evaluation protocol. On Qwen3 models, SESA-Off retains 1.8--2.2 points of improvement over SSP, while the final skill bank adds a further 0.5--1.0 points. These results show that evolving skill memory is not merely an inference-time plug-in: it changes policy learning and the future training distribution while retaining value as optional external memory. Our code is available at https://github.com/Zenghuang-Fu/SESA-Self-Evolving-Search-Agents.

cs.AI

PiERN: Token-Level Routing for Integrating High-Precision Computation and Reasoning

Tasks on complex systems require high-precision numerical computation to support decisions, but current large language models (LLMs) cannot integrate such computations as an intrinsic and interpretable capability with existing architectures. Multi-agent approaches can leverage external experts, but inevitably introduce communication overhead and suffer from inefficiency caused by limited scalability. To this end, we propose Physically-isolated Experts Routing Network (PiERN), an architecture for integrating computation and reasoning. Instead of the tool-use workflows or function-calling, PiERN endogenously integrates computational capabilities into neural networks after separately training experts, a text-to-computation module, and a router. At inference, the router directs computation and reasoning at the token level, thereby enabling iterative alternation within a single chain of thought. We evaluate PiERN on representative linear and nonlinear computation-reasoning tasks against LLM finetuning and the multi-agent system approaches. Results show that the PiERN architecture achieves not only higher accuracy than directly finetuning LLMs but also significant improvements in response latency, token usage, and GPU energy consumption compared with mainstream multi-agent approaches. PiERN offers an efficient, interpretable, and scalable paradigm for interfacing language models with scientific systems.

cs.LG

Multitask Battery Management with Flexible Pretraining

Industrial-scale battery management involves various types of tasks, such as estimation, prediction, and system-level diagnostics. Each task employs distinct data across temporal scales, sensor resolutions, and data channels. Building task-specific methods requires a great deal of data and engineering effort, which limits the scalability of intelligent battery management. Here we present the Flexible Masked Autoencoder (FMAE), a flexible pretraining framework that can learn with missing battery data channels and capture inter-correlations across data snippets. FMAE learns unified battery representations from heterogeneous data and can be adopted by different tasks with minimal data and engineering efforts. Experimentally, FMAE consistently outperforms all task-specific methods across five battery management tasks with eleven battery datasets. On remaining life prediction tasks, FMAE uses 50 times less inference data while maintaining state-of-the-art results. Moreover, when real-world data lack certain information, such as system voltage, FMAE can still be applied with marginal performance impact, achieving comparable results with the best hand-crafted features. FMAE demonstrates a practical route to a flexible, data-efficient model that simplifies real-world multi-task management of dynamical systems.

cs.LG

Benchmarking Generalizable Bimanual Manipulation: RoboTwin Dual-Arm Collaboration Challenge at CVPR 2025 MEIS Workshop

Embodied Artificial Intelligence (Embodied AI) is an emerging frontier in robotics, driven by the need for autonomous systems that can perceive, reason, and act in complex physical environments. While single-arm systems have shown strong task performance, collaborative dual-arm systems are essential for handling more intricate tasks involving rigid, deformable, and tactile-sensitive objects. To advance this goal, we launched the RoboTwin Dual-Arm Collaboration Challenge at the 2nd MEIS Workshop, CVPR 2025. Built on the RoboTwin Simulation platform (1.0 and 2.0) and the AgileX COBOT-Magic Robot platform, the competition consisted of three stages: Simulation Round 1, Simulation Round 2, and a final Real-World Round. Participants totally tackled 17 dual-arm manipulation tasks, covering rigid, deformable, and tactile-based scenarios. The challenge attracted 64 global teams and over 400 participants, producing top-performing solutions like SEM and AnchorDP3 and generating valuable insights into generalizable bimanual policy learning. This report outlines the competition setup, task design, evaluation methodology, key findings and future direction, aiming to support future research on robust and generalizable bimanual manipulation policies. The Challenge Webpage is available at https://robotwin-benchmark.github.io/cvpr-2025-challenge/.

cs.RO

Simple is what you need for efficient and accurate medical image segmentation

While modern segmentation models often prioritize performance over practicality, we advocate a design philosophy prioritizing simplicity and efficiency, and attempted high performance segmentation model design. This paper presents SimpleUNet, a scalable ultra-lightweight medical image segmentation model with three key innovations: (1) A partial feature selection mechanism in skip connections for redundancy reduction while enhancing segmentation performance; (2) A fixed-width architecture that prevents exponential parameter growth across network stages; (3) An adaptive feature fusion module achieving enhanced representation with minimal computational overhead. With a record-breaking 16 KB parameter configuration, SimpleUNet outperforms LBUNet and other lightweight benchmarks across multiple public datasets. The 0.67 MB variant achieves superior efficiency (8.60 GFLOPs) and accuracy, attaining a mean DSC/IoU of 85.76%/75.60% on multi-center breast lesion datasets, surpassing both U-Net and TransUNet. Evaluations on skin lesion datasets (ISIC 2017/2018: mDice 84.86%/88.77%) and endoscopic polyp segmentation (KVASIR-SEG: 86.46%/76.48% mDice/mIoU) confirm consistent dominance over state-of-the-art models. This work demonstrates that extreme model compression need not compromise performance, providing new insights for efficient and accurate medical image segmentation. Codes can be found at https://github.com/Frankyu5666666/SimpleUNet.

eess.IV

FPDANet: A Multi-Section Classification Model for Intelligent Screening of Fetal Ultrasound

ResNet has been widely used in image classification tasks due to its ability to model the residual dependence of constant mappings for linear computation. However, the ResNet method adopts a unidirectional transfer of features and lacks an effective method to correlate contextual information, which is not effective in classifying fetal ultrasound images in the classification task, and fetal ultrasound images have problems such as low contrast, high similarity, and high noise. Therefore, we propose a bilateral multi-scale information fusion network-based FPDANet to address the above challenges. Specifically, we design the positional attention mechanism (DAN) module, which utilizes the similarity of features to establish the dependency of different spatial positional features and enhance the feature representation. In addition, we design a bilateral multi-scale (FPAN) information fusion module to capture contextual and global feature dependencies at different feature scales, thereby further improving the model representation. FPDANet classification results obtained 91.05\% and 100\% in Top-1 and Top-5 metrics, respectively, and the experimental results proved the effectiveness and robustness of FPDANet.

eess.IV

Promptable Counterfactual Diffusion Model for Unified Brain Tumor Segmentation and Generation with MRIs

Brain tumor analysis in Magnetic Resonance Imaging (MRI) is crucial for accurate diagnosis and treatment planning. However, the task remains challenging due to the complexity and variability of tumor appearances, as well as the scarcity of labeled data. Traditional approaches often address tumor segmentation and image generation separately, limiting their effectiveness in capturing the intricate relationships between healthy and pathological tissue structures. We introduce a novel promptable counterfactual diffusion model as a unified solution for brain tumor segmentation and generation in MRI. The key innovation lies in our mask-level prompting mechanism at the sampling stage, which enables guided generation and manipulation of specific healthy or unhealthy regions in MRI images. Specifically, the model's architecture allows for bidirectional inference, which can segment tumors in existing images and generate realistic tumor structures in healthy brain scans. Furthermore, we present a two-step approach for tumor generation and position transfer, showcasing the model's versatility in synthesizing realistic tumor structures. Experiments on the BRATS2021 dataset demonstrate that our method outperforms traditional counterfactual diffusion approaches, achieving a mean IoU of 0.653 and mean Dice score of 0.785 for tumor segmentation, outperforming the 0.344 and 0.475 of conventional counterfactual diffusion model. Our work contributes to improving brain tumor detection and segmentation accuracy, with potential implications for data augmentation and clinical decision support in neuro-oncology. The code is available at https://github.com/arcadelab/counterfactual_diffusion.

eess.IV

EVBattery: A Large-Scale Electric Vehicle Dataset for Battery Health and Capacity Estimation

Electric vehicles (EVs) play an important role in reducing carbon emissions. As EV adoption accelerates, safety issues caused by EV batteries have become an important research topic. In order to benchmark and develop data-driven methods for this task, we introduce a large and comprehensive dataset of EV batteries. Our dataset includes charging records collected from hundreds of EVs from three manufacturers over several years. Our dataset is the first large-scale public dataset on real-world battery data, as existing data either include only several vehicles or is collected in the lab environment. Meanwhile, our dataset features two types of labels, corresponding to two key tasks - battery health estimation and battery capacity estimation. In addition to demonstrating how existing deep learning algorithms can be applied to this task, we further develop an algorithm that exploits the data structure of battery systems. Our algorithm achieves better results and shows that a customized method can improve model performances. We hope that this public dataset provides valuable resources for researchers, policymakers, and industry professionals to better understand the dynamics of EV battery aging and support the transition toward a sustainable transportation system.

cs.LG

Battery Valuation and Management for Battery Swapping Station with an Intertemporal Framework

Battery swapping as a business model for battery energy storage (BES) has great potential in future integrated low-carbon energy and transportation systems. However, frequent battery swapping will inevitably accelerate battery degradation and shorten the battery life accordingly. To model the tradeoff of BES use between energy and transportation applications coupled by battery swapping, we develop a life-cycle decision model that coordinates battery charging and swapping. This model is derived based on an improved intertemporal decision framework, in which the optimal marginal degradation cost (MDC) of BES is determined to maximize the BES benefit across time and application. The proposed framework and model are applied to manage a battery swapping station that simultaneously provides battery swapping services to electric vehicle customers and provides flexibility service to the power grid, including energy arbitrage and reserve. The case study shows that while the end of the physical life of BES occurs faster with battery swapping, the economic life becomes considerably longer. The results also reveal that the optimal MDC depends on the battery values in each application, and we analyze how the battery swapping price affects the optimal MDC and battery life. The proposed framework and model can also provide decision support for on-demand BES service, such as battery trading, renting and secondary use.

eess.SY

A Model-Adaptive Clustering Method for Low-Carbon Energy System Optimization

Intermittent renewable energy resources like wind and solar pose great uncertainty of multiple time scales, from minutes to years, on the design and operation of power systems. Energy system optimization models have been developed to find the least-cost solution to matching the uncertainty with flexibility resources. However, input data that capture such multi-time-scale uncertainty are characterized with a long time horizon and bring great difficulty to solving the optimization model. Here we propose an adaptive clustering method based on the decision variables of optimization model to alleviate the computational complexity, in which the energy system is optimized over selected representative time periods instead of the full time horizon. The proposed clustering method is adaptive to various energy system optimization models or settings, because it extracts features from the optimization models. Results show that the proposed clustering method can significantly lower the error in approximating the solution with the full time horizon, compared to traditional clustering methods.

math.OC

Sector coupling via hydrogen to lower the cost of energy system decarbonization

There is growing interest in hydrogen (H$_2$) use for long-duration energy storage in a future electric grid dominated by variable renewable energy (VRE) resources. Modelling the role of H$_2$ as grid-scale energy storage, often referred as "power-to-gas-to-power (P2G2P)" overlooks the cost-sharing and emission benefits from using the deployed H$_2$ production and storage assets to also supply H$_2$ for decarbonizing other end-use sectors where direct electrification may be challenged. Here, we develop a generalized modelling framework for co-optimizing energy infrastructure investment and operation across power and transportation sectors and the supply chains of electricity and H$_2$, while accounting for spatio-temporal variations in energy demand and supply. Applying this sector-coupling framework to the U.S. Northeast under a range of technology cost and carbon price scenarios, we find a greater value of power-to-H$_2$ (P2G) versus P2G2P routes. P2G provides flexible demand response, while the extra cost and efficiency penalties of P2G2P routes make the solution less attractive for grid balancing. The effects of sector-coupling are significant, boosting VRE generation by 12-55% with both increased capacities and reduced curtailments and reducing the total system cost (or levelized costs of energy) by 6-14% under 96% decarbonization scenarios. Both the cost savings and emission reductions from sector coupling increase with H$_2$ demand for other end-uses, more than doubling for a 96% decarbonization scenario as H$_2$ demand quadraples. Moreover, we found that the deployment of carbon capture and storage is more cost-effective in the H$_2$ sector because of the lower cost and higher utilization rate. These findings highlight the importance of using an integrated multi-sector energy system framework with multiple energy vectors in planning energy system decarbonization pathways.

math.OC

The economics of utility-scale portable energy storage systems in a high-renewable grid

Battery storage is expected to play a crucial role in the low-carbon transformation of energy systems. The deployment of battery storage in the power gird, however, is currently severely limited by its low economic viability, which results from not only high capital costs but also the lack of flexible and efficient utilization schemes and business models. Making utility-scale battery storage portable through trucking unlocks its capability to provide various on-demand services. We introduce the potential applications of utility-scale portable energy storage and investigate its economics in California using a spatiotemporal decision model that determines the optimal operation and transportation schedules of portable storage. We show that mobilizing energy storage can increase its life-cycle revenues by 70% in some areas and improve renewable energy integration by relieving local transmission congestion. The life-cycle revenue of spatiotemporal arbitrage can fully compensate for the costs of portable energy storage system in several regions in California, including San Diego and the San Francisco Bay Area.

math.OC

Hydrogen Supply Chain Planning with Flexible Transmission and Storage Scheduling

Hydrogen is becoming an increasingly appealing energy carrier, as the costs of renewable energy generation and water electrolysis continue to decline. Developing modelling and decision tools for the H$_{2}$ supply chain that fully capture the flexibility of various resources is essential to understanding the overall cost-competitiveness of H$_{2}$ use. To address this need, we have developed a H$_{2}$ supply chain planning model that determines the least-cost mix of H$_{2}$ generation, storage, transmission, and compression facilities to meet H$_{2}$ demands and is coupled with power systems through electricity prices. We incorporate flexible scheduling for H$_{2}$ trucks and pipeline, allowing them to serve as both H$_{2}$ transmission and storage resources to shift H$_{2}$ demand/production across space and time. The case study results in the U.S. Northeast indicate that the proposed framework for flexible scheduling of H$_{2}$ transmission and storage resources is critical not only to cost minimization but also to the choice of H$_{2}$ production pathways between electrolyzer and centralized natural-gas-based production facilities. Trucks as mobile storage could make electrolyzer more competitive by providing extra spatiotemporal flexibility to respond to the electricity price variability while meeting H$_{2}$ demands. The proposed model also provides a reasonable trade-off between modeling accuracy and solution times.

math.OC

Power System Dispatch with Marginal Degradation Cost of Battery Storage

Battery storage is essential for the future smart grid. The inevitable cell degradation renders the battery lifetime volatile and highly dependent on battery dispatch, and thus incurs opportunity cost. This paper rigorously derives the marginal degradation cost of battery for power system dispatch. The derived optimal marginal degradation cost is time-variant to reflect the time value of money and the functionality fade of battery and takes the form of a constant value divided by a discount factor plus a term related to battery state of health. In case studies, we demonstrate the evolution of the optimal marginal costs of degradation that corresponds to the optimal long-term dispatch outcome. We also show that the optimal marginal cost of degradation depends on the marginal cost of generation in the grid.

math.OC

Spatiotemporal Arbitrage of Large-Scale Portable Energy Storage for Grid Congestion Relief

Energy storage has great potential in grid congestion relief. By making large-scale energy storage portable through trucking, its capability to address grid congestion can be greatly enhanced. This paper explores a business model of large-scale portable energy storage for spatiotemporal arbitrage over nodes with congestion. We propose a spatiotemporal arbitrage model to determine the optimal operation and transportation schedules of portable storage. To validate the business model, we simulate the schedules of a Tesla Semi full of Tesla Powerpack doing arbitrage over two nodes in California with local transmission congestion. The results indicate that the contributions of portable storage to congestion relief are much greater than that of stationary storage, and that trucking storage can bring net profit in energy arbitrage applications.

eess.SY