Searcharxiv⌕ Search

arXiv subjects

Hang Wang

Publications and source records attributed to Hang Wang.

At least 37 records · Page 2Linked to original sources
arXiv2026

Preferred Synthesis of Armchair Transition Metal Dichalcogenide Nanotubes

In this work, we present the synthesis of transition-metal dichalcogenide (TMDC) nanotubes with a preferred chiral angle. SnS2, MoS2, and WS2 are formed with high yield and structural purity inside the channels of boron nitride nanotubes. Atomic-resolution imaging, nano-area electron diffraction, and Circular Dichroism spectroscopy reveal that these synthesized TMDC nanotubes prefer to have an armchair configuration, with a probability up to 84%. Density functional theory reveals a negligible difference in the formation energy between armchair and zigzag nanotubes, suggesting that the chirality preference does not originate from the differences in structural stability. However, a detailed TEM investigation revealed that these TMDC nanotubes formed via a transition state of nanoribbons, and these nanoribbons are energetically more stable in a zigzag configuration. Subsequent machine learning potential molecular dynamics simulations verify that zigzag nanoribbons do roll up to form an armchair SnS2 nanotubes. Finally, this "zigzag nanoribbon to armchair nanotube" transition process is directly observed in real time by in-situ transmission electron microscopy. This work demonstrates the first, but likely general, experimental strategy for synthesizing chirality-preferred TMDC nanotubes.

cond-mat.mtrl-sci↗
arXiv2026

VITA: Vision-to-Action Flow Matching Policy

Conventional flow matching and diffusion-based policies sample via iterative denoising from standard noise distributions (e.g., Gaussian), and require conditioning modules to repeatedly incorporate visual information during the generative process, incurring substantial time and memory overhead. To reduce the complexity, we develop VITA, VIsion-To-Action policy, a noise-free and conditioning-free flow matching policy learning framework that directly flows from visual representations to latent actions. Since the source of the flow is visually grounded, VITA eliminates the need for visual conditioning during generation. As expected, bridging vision and action is challenging, because actions are lower-dimensional, less structured, and sparser than visual representations; moreover, flow matching requires the source and target to have the same dimensionality. To overcome this, we introduce an action autoencoder that maps raw actions into a structured latent space aligned with visual latents, trained jointly with flow matching. To further prevent latent action space collapse during end-to-end training, we propose flow latent decoding, which anchors the latent generation process by backpropagating the action reconstruction loss through the flow matching ODE (ordinary differential equation) solving steps. We evaluate VITA on 9 simulation and 5 real-world tasks from ALOHA and Robomimic. VITA achieves 1.5x-2x faster inference compared to conventional methods with conditioning modules, while outperforming or matching state-of-the-art policies. Project page: https://ucd-dare.github.io/VITA/.

cs.CV↗
arXiv2025

Computation for Epidemic Prediction with Graph Neural Network by Model Combination

Modelling epidemic events such as COVID-19 cases in both time and space dimensions is an important but challenging task. Building on in-depth review and assessment of two popular graph neural network (GNN)-based regional epidemic forecasting models of \textbf{EpiGNN} and \textbf{ColaGNN}, we propose a novel hybrid graph neural network model, \textbf{EpiHybridGNN}, which integrates the strengths of both EpiGNN and \textbf{ColaGNN}. In the EpiGNN, through its transmission risk encoding module and Region-Aware Graph Learner (RAGL), both multi-scale convolutions and Graph Convolutional Networks (GCNs) are combined, aiming to effectively capture spatio-temporal propagation dynamics between regions and support the integration of external resources to enhance forecasting performance. While, in the ColaGNN, a cross-location attention mechanism, multi-scale dilated convolutions, and graph message passing are utilized to address the challenges of long-term forecasting through dynamic graph structures and spatio-temporal feature fusion. Both enjoy respective advantages but also share mutual shortcomings. Our EpiHybridGNN is therefore designed to combine the advantages of both EpiGNN, in its risk encoding and RAGL, and ColaGNN, in its long-term forecasting capabilities and dynamic attention mechanisms. This helps to form a more comprehensive and robust prediction of spatio-temporal epidemic propagation. The computational architecture, core formulas and their interpretations of our proposed EpiHybridGNN are provided. Multiple numerical real data experiments validate that our EpiHybridGNN significantly outperforms both EpiGNN and ColaGNN in epidemic forecasting with comprehensive insights and references offered.

stat.CO↗
arXiv2025

Approximately Macroscopically Unique States and Quantum Mechanics

We show that Mumford's Approximately Macroscopically Unique (AMU) states exist for quantum systems consisting of unbounded self-adjoint operators when the commutators are small. In particular, AMU states always exist in position and momentum systems when the Planck constant $|\hbar|$ is sufficiently small. However, we show that these standard quantum mechanical systems are far away from classical mechanical (commutative) systems even when $|\hbar|\to 0.$

math.OA↗
arXiv2025

SDE-DET: A Precision Network for Shatian Pomelo Detection in Complex Orchard Environments

Pomelo detection is an essential process for their localization, automated robotic harvesting, and maturity analysis. However, detecting Shatian pomelo in complex orchard environments poses significant challenges, including multi-scale issues, obstructions from trunks and leaves, small object detection, etc. To address these issues, this study constructs a custom dataset STP-AgriData and proposes the SDE-DET model for Shatian pomelo detection. SDE-DET first utilizes the Star Block to effectively acquire high-dimensional information without increasing the computational overhead. Furthermore, the presented model adopts Deformable Attention in its backbone, to enhance its ability to detect pomelos under occluded conditions. Finally, multiple Efficient Multi-Scale Attention mechanisms are integrated into our model to reduce the computational overhead and extract deep visual representations, thereby improving the capacity for small object detection. In the experiment, we compared SDE-DET with the Yolo series and other mainstream detection models in Shatian pomelo detection. The presented SDE-DET model achieved scores of 0.883, 0.771, 0.838, 0.497, and 0.823 in Precision, Recall, mAP@0.5, mAP@0.5:0.95 and F1-score, respectively. SDE-DET has achieved state-of-the-art performance on the STP-AgriData dataset. Experiments indicate that the SDE-DET provides a reliable method for Shatian pomelo detection, laying the foundation for the further development of automatic harvest robots.

cs.CV↗
arXiv2025

$K$-Theory of Adelic and Rational Group $C^*$-algebras via Generalized Winding Numbers

We take the following approach to analyze homotopy equivalence in periodic adelic functions. First, we introduce the concept of pre-periodic functions and define their homotopy invariant through the construction of a generalized winding number. Subsequently, we establish a fundamental correspondence between periodic adelic functions and pre-periodic functions. By extending the generalized winding number to periodic adelic functions, we demonstrate that this invariant completely characterizes homotopy equivalence classes within the space of periodic adelic functions. Building on this classification, we obtain an explicit description of the $K_{1}$-group of the rational group $C^\ast$-algebra, $K_{1}(C^{*}(\mathbb{Q}))$. Finally, we employ a similar strategy to determine the structure of $K_1(C^{\ast}(\mathbb{A}))$.

math.KT↗
arXiv2025

A Machine Learning-Based Study on the Synergistic Optimization of Supply Chain Management and Financial Supply Chains from an Economic Perspective

Based on economic theories and integrated with machine learning technology, this study explores a collaborative Supply Chain Management and Financial Supply Chain Management (SCM - FSCM) model to solve issues like efficiency loss, financing constraints, and risk transmission. We combine Transaction Cost and Information Asymmetry theories and use algorithms such as random forests to process multi-dimensional data and build a data-driven, three-dimensional (cost-efficiency-risk) analysis framework. We then apply an FSCM model of "core enterprise credit empowerment plus dynamic pledge financing." We use Long Short-Term Memory (LSTM) networks for demand forecasting and clustering/regression algorithms for benefit allocation. The study also combines Game Theory and reinforcement learning to optimize the inventory-procurement mechanism and uses eXtreme Gradient Boosting (XGBoost) for credit assessment to enable rapid monetization of inventory. Verified with 20 core and 100 supporting enterprises, the results show a 30\% increase in inventory turnover, an 18\%-22\% decrease in SME financing costs, a stable order fulfillment rate above 95\%, and excellent model performance (demand forecasting error <= 8\%, credit assessment accuracy >= 90\%). This SCM-FSCM model effectively reduces operating costs, alleviates financing constraints, and supports high-quality supply chain development.

cs.LG↗
arXiv2025

Euler characteristics, higher Kazhdan projections and delocalised $\ell^2$-Betti numbers

For non-amenable finitely generated virtually free groups, we show that the combinatorial Euler characteristic introduced by Emerson and Meyer is the preimage of the K-theory class of higher Kazhdan projections under the Baum-Connes assembly map. This allows to represent the K-theory class of their higher Kazhdan projection as a finite alternating sum of the K-theory classes of certain averaging projections. The latter is associated to the finite subgroups appearing in the fundamental domain of their Bass-Serre tree. As an immediate application we obtain non-vanishing calculations for delocalised $\ell^2$-Betti numbers for this class of groups.

math.OA↗
arXiv2025

Speech-Forensics: Towards Comprehensive Synthetic Speech Dataset Establishment and Analysis

Detecting synthetic from real speech is increasingly crucial due to the risks of misinformation and identity impersonation. While various datasets for synthetic speech analysis have been developed, they often focus on specific areas, limiting their utility for comprehensive research. To fill this gap, we propose the Speech-Forensics dataset by extensively covering authentic, synthetic, and partially forged speech samples that include multiple segments synthesized by different high-quality algorithms. Moreover, we propose a TEmporal Speech LocalizaTion network, called TEST, aiming at simultaneously performing authenticity detection, multiple fake segments localization, and synthesis algorithms recognition, without any complex post-processing. TEST effectively integrates LSTM and Transformer to extract more powerful temporal speech representations and utilizes dense prediction on multi-scale pyramid features to estimate the synthetic spans. Our model achieves an average mAP of 83.55% and an EER of 5.25% at the utterance level. At the segment level, it attains an EER of 1.07% and a 92.19% F1 score. These results highlight the model's robust capability for a comprehensive analysis of synthetic speech, offering a promising avenue for future research and practical applications in this field.

cs.SD↗
arXiv2025

GenAI-based Multi-Agent Reinforcement Learning towards Distributed Agent Intelligence: A Generative-RL Agent Perspective

Multi-agent reinforcement learning faces fundamental challenges that conventional approaches have failed to overcome: exponentially growing joint action spaces, non-stationary environments where simultaneous learning creates moving targets, and partial observability that constrains coordination. Current methods remain reactive, employing stimulus-response mechanisms that fail when facing novel scenarios. We argue for a transformative paradigm shift from reactive to proactive multi-agent intelligence through generative AI-based reinforcement learning. This position advocates reconceptualizing agents not as isolated policy optimizers, but as sophisticated generative models capable of synthesizing complex multi-agent dynamics and making anticipatory decisions based on predictive understanding of future interactions. Rather than responding to immediate observations, generative-RL agents can model environment evolution, predict other agents' behaviors, generate coordinated action sequences, and engage in strategic reasoning accounting for long-term dynamics. This approach leverages pattern recognition and generation capabilities of generative AI to enable proactive decision-making, seamless coordination through enhanced communication, and dynamic adaptation to evolving scenarios. We envision this paradigm shift will unlock unprecedented possibilities for distributed intelligence, moving beyond individual optimization toward emergent collective behaviors representing genuine collaborative intelligence. The implications extend across autonomous systems, robotics, and human-AI collaboration, promising solutions to coordination challenges intractable under traditional reactive frameworks.

cs.AI↗
arXiv2025

$L^p$ coarse Baum-Connes conjecture via $C_{0}$ coarse geometry

In this paper, we investigate the $L^{p}$ coarse Baum-Connes conjecture for $p\in [1,\infty)$ via $C_{0}$ coarse structure, which is a refinement of the bounded coarse structure on a metric space. We prove that the $C_{0}$ version of the $L^{p}$ coarse Baum-Connes conjecture holds for a finite-dimensional simplicial complex equipped with a uniform spherical metric. Using this result, we construct an obstruction group for the $L^{p}$ coarse Baum-Connes conjecture. As an application, we show that the obstruction group vanishes under the assumption of finite asymptotic dimension, thereby providing a new proof of the $L^{p}$ coarse Baum-Connes conjecture in this case.

math.FA↗
arXiv2025

The Impact of Inhomogeneous Perturbations of the Inflaton on the Cosmological Primordial Magnetic Field

We investigate the impact of inhomogeneous inflaton perturbations on primordial magnetic fields within the framework of generalized inflationary magnetogenesis models. Extending the Ratra model to general spacetime backgrounds, we analyze the constraint structure of the electromagnetic field and demonstrate that the standard Coulomb gauge must be generalized to accommodate spatial inhomogeneities. Instead of the vector potential, we solve the conjugate momentum with the modified initial conditions introduced by the coupling function, which become dominant during the late stages of inflation. These change the conditions under which scale-invariant electromagnetic spectra are achieved. Furthermore, we address the challenge of evaluating convolutions between vector potentials and inflaton perturbations by employing separate large- and small-scale approximations. The resulting influence to the electric and magnetic power spectra are quantified using $Δ_E$ and $Δ_B$, revealing a scale-dependent influence of inhomogeneities. We also find that the spectrum index evolution is sensitive to the sign of $V_ϕ$, with distinctive behaviors for electric and magnetic fields under different scale-invariance conditions. Notably, for nearly scale-invariant magnetic fields, the perturbative effects shift the spectral index towards the red and migrate toward smaller scales as inflation progresses, offering a potential observational probe to differentiate between large-field and small-field inflation scenarios.

astro-ph.CO↗
arXiv2025

Ego-centric Learning of Communicative World Models for Autonomous Driving

We study multi-agent reinforcement learning (MARL) for tasks in complex high-dimensional environments, such as autonomous driving. MARL is known to suffer from the \textit{partial observability} and \textit{non-stationarity} issues. To tackle these challenges, information sharing is often employed, which however faces major hurdles in practice, including overwhelming communication overhead and scalability concerns. By making use of generative AI embodied in world model together with its latent representation, we develop {\it CALL}, \underline{C}ommunic\underline{a}tive Wor\underline{l}d Mode\underline{l}, for MARL, where 1) each agent first learns its world model that encodes its state and intention into low-dimensional latent representation with smaller memory footprint, which can be shared with other agents of interest via lightweight communication; and 2) each agent carries out ego-centric learning while exploiting lightweight information sharing to enrich her world model, and then exploits its generalization capacity to improve prediction for better planning. We characterize the gain on the prediction accuracy from the information sharing and its impact on performance gap. Extensive experiments are carried out on the challenging local trajectory planning tasks in the CARLA platform to demonstrate the performance gains of using \textit{CALL}.

cs.RO↗
arXiv2025

GeoMM: On Geodesic Perspective for Multi-modal Learning

Geodesic distance serves as a reliable means of measuring distance in nonlinear spaces, and such nonlinear manifolds are prevalent in the current multimodal learning. In these scenarios, some samples may exhibit high similarity, yet they convey different semantics, making traditional distance metrics inadequate for distinguishing between positive and negative samples. This paper introduces geodesic distance as a novel distance metric in multi-modal learning for the first time, to mine correlations between samples, aiming to address the limitations of common distance metric. Our approach incorporates a comprehensive series of strategies to adapt geodesic distance for the current multimodal learning. Specifically, we construct a graph structure to represent the adjacency relationships among samples by thresholding distances between them and then apply the shortest-path algorithm to obtain geodesic distance within this graph. To facilitate efficient computation, we further propose a hierarchical graph structure through clustering and combined with incremental update strategies for dynamic status updates. Extensive experiments across various downstream tasks validate the effectiveness of our proposed method, demonstrating its capability to capture complex relationships between samples and improve the performance of multimodal learning models.

cs.CV↗
arXiv2025

HCMA: Hierarchical Cross-model Alignment for Grounded Text-to-Image Generation

Text-to-image synthesis has progressed to the point where models can generate visually compelling images from natural language prompts. Yet, existing methods often fail to reconcile high-level semantic fidelity with explicit spatial control, particularly in scenes involving multiple objects, nuanced relations, or complex layouts. To bridge this gap, we propose a Hierarchical Cross-Modal Alignment (HCMA) framework for grounded text-to-image generation. HCMA integrates two alignment modules into each diffusion sampling step: a global module that continuously aligns latent representations with textual descriptions to ensure scene-level coherence, and a local module that employs bounding-box layouts to anchor objects at specified locations, enabling fine-grained spatial control. Extensive experiments on the MS-COCO 2014 validation set show that HCMA surpasses state-of-the-art baselines, achieving a 0.69 improvement in Frechet Inception Distance (FID) and a 0.0295 gain in CLIP Score. These results demonstrate HCMA's effectiveness in faithfully capturing intricate textual semantics while adhering to user-defined spatial constraints, offering a robust solution for semantically grounded image generation. Our code is available at https://github.com/hwang-cs-ime/HCMA.

cs.CV↗
arXiv2025

IN-RIL: Interleaved Reinforcement and Imitation Learning for Policy Fine-Tuning

Imitation learning (IL) and reinforcement learning (RL) each offer distinct advantages for robotics policy learning: IL provides stable learning from demonstrations, and RL promotes generalization through exploration. While existing robot learning approaches using IL-based pre-training followed by RL-based fine-tuning are promising, this two-step learning paradigm often suffers from instability and poor sample efficiency during the RL fine-tuning phase. In this work, we introduce IN-RIL, INterleaved Reinforcement learning and Imitation Learning, for policy fine-tuning, which periodically injects IL updates after multiple RL updates and hence can benefit from the stability of IL and the guidance of expert data for more efficient exploration throughout the entire fine-tuning process. Since IL and RL involve different optimization objectives, we develop gradient separation mechanisms to prevent destructive interference during \ABBR fine-tuning, by separating possibly conflicting gradient updates in orthogonal subspaces. Furthermore, we conduct rigorous analysis, and our findings shed light on why interleaving IL with RL stabilizes learning and improves sample-efficiency. Extensive experiments on 14 robot manipulation and locomotion tasks across 3 benchmarks, including FurnitureBench, OpenAI Gym, and Robomimic, demonstrate that \ABBR can significantly improve sample efficiency and mitigate performance collapse during online finetuning in both long- and short-horizon tasks with either sparse or dense rewards. IN-RIL, as a general plug-in compatible with various state-of-the-art RL algorithms, can significantly improve RL fine-tuning, e.g., from 12\% to 88\% with 6.3x improvement in the success rate on Robomimic Transport. Project page: https://github.com/ucd-dare/IN-RIL.

cs.RO↗