arXiv subjects

Hao Wang

Publications and source records attributed to Hao Wang.

At least 685 records · Page 38Linked to original sources

arXiv2025

Existence and multiplicity of normalized solutions for the quasi-linear Schrödinger equations with mixed nonlinearities

In this paper, we study the existence and multiplicity of the normalized solutions to the following quasi-linear problem \begin{equation*} -Δu-Δ(|u|^2)u+λu=|u|^{p-2}u+τ|u|^{q-2}u, \text{ in }\mathbb{R}^N,~ 1\leq N\leq4, \end{equation*} with prescribed mass $$\int_{\mathbb{R}^N}|u|^2dx=a ,$$ where $λ\in\mathbb{R}$ appears as a Lagrange multiplier and the parameters $a,τ$ are all positive constants. We are concerned about the mass-mixed case $2<q<2+\frac{4}{N}$ and $4+\frac{4}{N}<p<2\cdot2^*$, where $2^*:=\frac{2N}{N-2}$ for $N\geq3$, while $2^*:=\infty$ for $N=1,2$. We show the existence of normalized ground state solution and normalized solution of mountain pass type. Our results can be regarded as a supplement to Lu et al. ( Proc. Edinb. Math. Soc., 2024) and Jeanjean et al. ( arXiv:2501.03845).

math.AP↗

arXiv2025

Fourth-order compact difference schemes for the one-dimensional Euler-Bernoulli beam equation with damping term

This paper proposes and analyzes a finite difference method based on compact schemes for the Euler-Bernoulli beam equation with damping terms. The method achieves fourth-order accuracy in space and second-order accuracy in time, while requiring only three spatial grid points within a single compact stencil. Spatial discretization is carried out using a compact finite difference scheme, with a variable substitution technique employed to reduce the order of the equation and effectively handle the damping terms. For the temporal discretization, the Crank-Nicolson scheme is applied. The consistency, stability, and convergence of the proposed method are rigorously proved. Numerical experiments are presented to verify the theoretical results and demonstrate the accuracy and efficiency of the method.

math.NA↗

arXiv2025

Thought-Augmented Planning for LLM-Powered Interactive Recommender Agent

Interactive recommendation is a typical information-seeking task that allows users to interactively express their needs through natural language and obtain personalized recommendations. Large language model-powered (LLM-powered) agents have become a new paradigm in interactive recommendations, effectively capturing users' real-time needs and enhancing personalized experiences. However, due to limited planning and generalization capabilities, existing formulations of LLM-powered interactive recommender agents struggle to effectively address diverse and complex user intents, such as intuitive, unrefined, or occasionally ambiguous requests. To tackle this challenge, we propose a novel thought-augmented interactive recommender agent system (TAIRA) that addresses complex user intents through distilled thought patterns. Specifically, TAIRA is designed as an LLM-powered multi-agent system featuring a manager agent that orchestrates recommendation tasks by decomposing user needs and planning subtasks, with its planning capacity strengthened through Thought Pattern Distillation (TPD), a thought-augmentation method that extracts high-level thoughts from the agent's and human experts' experiences. Moreover, we designed a set of user simulation schemes to generate personalized queries of different difficulties and evaluate the recommendations based on specific datasets. Through comprehensive experiments conducted across multiple datasets, TAIRA exhibits significantly enhanced performance compared to existing methods. Notably, TAIRA shows a greater advantage on more challenging tasks while generalizing effectively on novel tasks, further validating its superiority in managing complex user intents within interactive recommendation systems. The code is publicly available at:https://github.com/Alcein/TAIRA.

cs.CL↗

arXiv2025

Safe and Performant Deployment of Autonomous Systems via Model Predictive Control and Hamilton-Jacobi Reachability Analysis

While we have made significant algorithmic developments to enable autonomous systems to perform sophisticated tasks, it remains difficult for them to perform tasks effective and safely. Most existing approaches either fail to provide any safety assurances or substantially compromise task performance for safety. In this work, we develop a framework, based on model predictive control (MPC) and Hamilton-Jacobi (HJ) reachability, to optimize task performance for autonomous systems while respecting the safety constraints. Our framework guarantees recursive feasibility for the MPC controller, and it is scalable to high-dimensional systems. We demonstrate the effectiveness of our framework with two simulation studies using a 4D Dubins Car and a 6 Dof Kuka iiwa manipulator, and the experiments show that our framework significantly improves the safety constraints satisfaction of the systems over the baselines.

cs.RO↗

arXiv2025

KARMA Approach supporting Development Process Reconstruction in Model-based Systems Engineering

Model reconstruction is a method used to drive the development of complex system development processes in model-based systems engineering. Currently, during the iterative design process of a system, there is a lack of an effective method to manage changes in development requirements, such as development cycle requirements and cost requirements, and to realize the reconstruction of the system development process model. To address these issues, this paper proposes a model reconstruction method to support the development process model. Firstly, the KARMA language, based on the GOPPRR-E metamodeling method, is utilized to uniformly formalize the process models constructed based on different modeling languages. Secondly, a model reconstruction framework is introduced. This framework takes a structured development requirements based natural language as input, employs natural language processing techniques to analyze the development requirements text, and extracts structural and optimization constraint information. Then, after structural reorganization and algorithm optimization, a development process model that meets the development requirements is obtained. Finally, as a case study, the development process of the aircraft onboard maintenance system is reconstructed. The results demonstrate that this method can significantly enhance the design efficiency of the development process.

cs.SE↗

arXiv2025

Ferroelectricity in 6 Angstrom-Thick Two-dimensional Ga$_2$O$_3$

Atomic-scale ferroelectric thin films hold great promise for high-density, low-power applications but face stability and voltage scaling challenges at extreme thinness. Here, we demonstrate ferroelectricity in single-crystalline two-dimensional (2D) Ga$_2$O$_3$, an ultra-wide-bandgap semiconductor, at just 6 angstrom thickness, exhibiting exceptional retention and thermal stability. We show that epitaxial beta-Ga$_2$O$_3$ can be exfoliated down to a half-unit cell thickness via a self-limiting mechanism, enabling a biaxial strain-induced phase transition into a novel ferroelectric layered structure. Strain modulation enables the reduction of polarization switching voltage to 0.8 V, meeting CMOS voltage scaling requirements. Theoretical calculations reveal that switching is driven by covalent bond reconstruction, effectively countering depolarization and enhancing stability. Additionally, we integrate ferroelectric 2D Ga$_2$O$_3$ onto silicon using a low-temperature, back-end-of-line-compatible process. This work advances the exploration of sub-nanometer ferroelectrics, paving the way for high-density, low-power, non-volatile applications seamlessly integrated with advanced silicon technology.

cond-mat.mtrl-sci↗

arXiv2025

RePST: Language Model Empowered Spatio-Temporal Forecasting via Semantic-Oriented Reprogramming

Spatio-temporal forecasting is pivotal in numerous real-world applications, including transportation planning, energy management, and climate monitoring. In this work, we aim to harness the reasoning and generalization abilities of Pre-trained Language Models (PLMs) for more effective spatio-temporal forecasting, particularly in data-scarce scenarios. However, recent studies uncover that PLMs, which are primarily trained on textual data, often falter when tasked with modeling the intricate correlations in numerical time series, thereby limiting their effectiveness in comprehending spatio-temporal data. To bridge the gap, we propose RePST, a semantic-oriented PLM reprogramming framework tailored for spatio-temporal forecasting. Specifically, we first propose a semantic-oriented decomposer that adaptively disentangles spatially correlated time series into interpretable sub-components, which facilitates PLM to understand sophisticated spatio-temporal dynamics via a divide-and-conquer strategy. Moreover, we propose a selective discrete reprogramming scheme, which introduces an expanded spatio-temporal vocabulary space to project spatio-temporal series into discrete representations. This scheme minimizes the information loss during reprogramming and enriches the representations derived by PLMs. Extensive experiments on real-world datasets show that the proposed RePST outperforms twelve state-of-the-art baseline methods, particularly in data-scarce scenarios, highlighting the effectiveness and superior generalization capabilities of PLMs for spatio-temporal forecasting. Our codes can be found at https://github.com/usail-hkust/REPST.

cs.LG↗

arXiv2025

h-calibration: Rethinking Classifier Recalibration with Probabilistic Error-Bounded Objective

Deep neural networks have demonstrated remarkable performance across numerous learning tasks but often suffer from miscalibration, resulting in unreliable probability outputs. This has inspired many recent works on mitigating miscalibration, particularly through post-hoc recalibration methods that aim to obtain calibrated probabilities without sacrificing the classification performance of pre-trained models. In this study, we summarize and categorize previous works into three general strategies: intuitively designed methods, binning-based methods, and methods based on formulations of ideal calibration. Through theoretical and practical analysis, we highlight ten common limitations in previous approaches. To address these limitations, we propose a probabilistic learning framework for calibration called h-calibration, which theoretically constructs an equivalent learning formulation for canonical calibration with boundedness. On this basis, we design a simple yet effective post-hoc calibration algorithm. Our method not only overcomes the ten identified limitations but also achieves markedly better performance than traditional methods, as validated by extensive experiments. We further analyze, both theoretically and experimentally, the relationship and advantages of our learning objective compared to traditional proper scoring rule. In summary, our probabilistic framework derives an approximately equivalent differentiable objective for learning error-bounded calibrated probabilities, elucidating the correspondence and convergence properties of computational statistics with respect to theoretical bounds in canonical calibration. The theoretical effectiveness is verified on standard post-hoc calibration benchmarks by achieving state-of-the-art performance. This research offers valuable reference for learning reliable likelihood in related fields.

cs.LG↗

arXiv2025

Enhancing Vector Quantization with Distributional Matching: A Theoretical and Empirical Study

The success of autoregressive models largely depends on the effectiveness of vector quantization, a technique that discretizes continuous features by mapping them to the nearest code vectors within a learnable codebook. Two critical issues in existing vector quantization methods are training instability and codebook collapse. Training instability arises from the gradient discrepancy introduced by the straight-through estimator, especially in the presence of significant quantization errors, while codebook collapse occurs when only a small subset of code vectors are utilized during training. A closer examination of these issues reveals that they are primarily driven by a mismatch between the distributions of the features and code vectors, leading to unrepresentative code vectors and significant data information loss during compression. To address this, we employ the Wasserstein distance to align these two distributions, achieving near 100\% codebook utilization and significantly reducing the quantization error. Both empirical and theoretical analyses validate the effectiveness of the proposed approach.

cs.CV↗

arXiv2025

Unify3D: An Augmented Holistic End-to-end Monocular 3D Human Reconstruction via Anatomy Shaping and Twins Negotiating

Monocular 3D clothed human reconstruction aims to create a complete 3D avatar from a single image. To tackle the human geometry lacking in one RGB image, current methods typically resort to a preceding model for an explicit geometric representation. For the reconstruction itself, focus is on modeling both it and the input image. This routine is constrained by the preceding model, and overlooks the integrity of the reconstruction task. To address this, this paper introduces a novel paradigm that treats human reconstruction as a holistic process, utilizing an end-to-end network for direct prediction from 2D image to 3D avatar, eliminating any explicit intermediate geometry display. Based on this, we further propose a novel reconstruction framework consisting of two core components: the Anatomy Shaping Extraction module, which captures implicit shape features taking into account the specialty of human anatomy, and the Twins Negotiating Reconstruction U-Net, which enhances reconstruction through feature interaction between two U-Nets of different modalities. Moreover, we propose a Comic Data Augmentation strategy and construct 15k+ 3D human scans to bolster model performance in more complex case input. Extensive experiments on two test sets and many in-the-wild cases show the superiority of our method over SOTA methods. Our demos can be found in : https://e2e3dgsrecon.github.io/e2e3dgsrecon/.

cs.CV↗

arXiv2025

Tady: A Neural Disassembler without Structural Constraint Violations

Disassembly is a crucial yet challenging step in binary analysis. While emerging neural disassemblers show promise for efficiency and accuracy, they frequently generate outputs violating fundamental structural constraints, which significantly compromise their practical usability. To address this critical problem, we regularize the disassembly solution space by formalizing and applying key structural constraints based on post-dominance relations. This approach systematically detects widespread errors in existing neural disassemblers' outputs. These errors often originate from models' limited context modeling and instruction-level decoding that neglect global structural integrity. We introduce Tady, a novel neural disassembler featuring an improved model architecture and a dedicated post-processing algorithm, specifically engineered to address these deficiencies. Comprehensive evaluations on diverse binaries demonstrate that Tady effectively eliminates structural constraint violations and functions with high efficiency, while maintaining instruction-level accuracy.

cs.CR↗

arXiv2025

FOAM: A General Frequency-Optimized Anti-Overlapping Framework for Overlapping Object Perception

Overlapping object perception aims to decouple the randomly overlapping foreground-background features, extracting foreground features while suppressing background features, which holds significant application value in fields such as security screening and medical auxiliary diagnosis. Despite some research efforts to tackle the challenge of overlapping object perception, most solutions are confined to the spatial domain. Through frequency domain analysis, we observe that the degradation of contours and textures due to the overlapping phenomenon can be intuitively reflected in the magnitude spectrum. Based on this observation, we propose a general Frequency-Optimized Anti-Overlapping Framework (FOAM) to assist the model in extracting more texture and contour information, thereby enhancing the ability for anti-overlapping object perception. Specifically, we design the Frequency Spatial Transformer Block (FSTB), which can simultaneously extract features from both the frequency and spatial domains, helping the network capture more texture features from the foreground. In addition, we introduce the Hierarchical De-Corrupting (HDC) mechanism, which aligns adjacent features in the separately constructed base branch and corruption branch using a specially designed consistent loss during the training phase. This mechanism suppresses the response to irrelevant background features of FSTBs, thereby improving the perception of foreground contour. We conduct extensive experiments to validate the effectiveness and generalization of the proposed FOAM, which further improves the accuracy of state-of-the-art models on four datasets, specifically for the three overlapping object perception tasks: Prohibited Item Detection, Prohibited Item Segmentation, and Pneumonia Detection. The code will be open source once the paper is accepted.

cs.CV↗

arXiv2025

SMPL Normal Map Is All You Need for Single-view Textured Human Reconstruction

Single-view textured human reconstruction aims to reconstruct a clothed 3D digital human by inputting a monocular 2D image. Existing approaches include feed-forward methods, limited by scarce 3D human data, and diffusion-based methods, prone to erroneous 2D hallucinations. To address these issues, we propose a novel SMPL normal map Equipped 3D Human Reconstruction (SEHR) framework, integrating a pretrained large 3D reconstruction model with human geometry prior. SEHR performs single-view human reconstruction without using a preset diffusion model in one forward propagation. Concretely, SEHR consists of two key components: SMPL Normal Map Guidance (SNMG) and SMPL Normal Map Constraint (SNMC). SNMG incorporates SMPL normal maps into an auxiliary network to provide improved body shape guidance. SNMC enhances invisible body parts by constraining the model to predict an extra SMPL normal Gaussians. Extensive experiments on two benchmark datasets demonstrate that SEHR outperforms existing state-of-the-art methods.

cs.CV↗

arXiv2025

PoGDiff: Product-of-Gaussians Diffusion Models for Imbalanced Text-to-Image Generation

Diffusion models have made significant advancements in recent years. However, their performance often deteriorates when trained or fine-tuned on imbalanced datasets. This degradation is largely due to the disproportionate representation of majority and minority data in image-text pairs. In this paper, we propose a general fine-tuning approach, dubbed PoGDiff, to address this challenge. Rather than directly minimizing the KL divergence between the predicted and ground-truth distributions, PoGDiff replaces the ground-truth distribution with a Product of Gaussians (PoG), which is constructed by combining the original ground-truth targets with the predicted distribution conditioned on a neighboring text embedding. Experiments on real-world datasets demonstrate that our method effectively addresses the imbalance problem in diffusion models, improving both generation accuracy and quality.

cs.LG↗

arXiv2025

Collimated Hard X-Rays from Hybrid Laser and Plasma Wakefield Accelerators

We report a synergistic enhancement of betatron radiation based on the hybrid laser and plasma wakefield acceleration scheme. Quasi-phase-stable acceleration in an up-ramp plasma density first generates GeV-energy electron beams that act as a drive beam for PWFA, which then further accelerates the witness beam to GeV energies, enhancing both photon energy and flux. A full width at half maximum divergence $(6.1 \pm 1.9)\times(5.8\pm 1.6) $ mrad$^2$ of betatron radiation, a critical energy of $71 \pm 8$ keV, and an average flux of more than $10^{14}$ photons per steradian above 5 keV were all experimentally obtained thanks to this scheme, which was an order of magnitude higher than the previous reports. Quasi-three-dimensional particle-in-cell simulations were used to model the acceleration and radiation of the electrons in our experimental conditions, establishing a new paradigm for compact collimated hard X-ray sources.

physics.plasm-ph↗

arXiv2025

Analytical solutions of CPT-odd Maxwell equations in Schwarzschild spacetime

In this work, we present the CPT-violating (CPTV) Maxwell equations in curved spacetime using the Newman-Penrose (NP) formalism. We obtain a semi-analytical solution to the Maxwell equations in Schwarzschild spacetime under the assumption that the CPT-odd $\left(k_{AF}\right)^μ$ term exhibits spherical symmetry in the Schwarzschild background. Retaining only terms up to linear order in the $\left(k_{AF}\right)^μ$ coefficient, we obtain perturbative solutions by treating the solutions of the Lorentz-invariant Maxwell equations as the zeroth-order approximation and incorporating the $\left(k_{AF}\right)^μ$ terms as an additional source term alongside the external charge current. Each resulting NP scalar field can be factorized into two components: the radial component is expressed in terms of hypergeometric functions, while the angular component is described by spin-weighted spherical harmonics.

gr-qc↗

arXiv2025

Mono: Is Your "Clean" Vulnerability Dataset Really Solvable? Exposing and Trapping Undecidable Patches and Beyond

The quantity and quality of vulnerability datasets are essential for developing deep learning solutions to vulnerability-related tasks. Due to the limited availability of vulnerabilities, a common approach to building such datasets is analyzing security patches in source code. However, existing security patches often suffer from inaccurate labels, insufficient contextual information, and undecidable patches that fail to clearly represent the root causes of vulnerabilities or their fixes. These issues introduce noise into the dataset, which can mislead detection models and undermine their effectiveness. To address these issues, we present mono, a novel LLM-powered framework that simulates human experts' reasoning process to construct reliable vulnerability datasets. mono introduces three key components to improve security patch datasets: (i) semantic-aware patch classification for precise vulnerability labeling, (ii) iterative contextual analysis for comprehensive code understanding, and (iii) systematic root cause analysis to identify and filter undecidable patches. Our comprehensive evaluation on the MegaVul benchmark demonstrates that mono can correct 31.0% of labeling errors, recover 89% of inter-procedural vulnerabilities, and reveals that 16.7% of CVEs contain undecidable patches. Furthermore, mono's enriched context representation improves existing models' vulnerability detection accuracy by 15%. We open source the framework mono and the dataset MonoLens in https://github.com/vul337/mono.

cs.CR↗

arXiv2025

AI shares emotion with humans across languages and cultures

Effective and safe human-machine collaboration requires the regulated and meaningful exchange of emotions between humans and artificial intelligence (AI). Current AI systems based on large language models (LLMs) can provide feedback that makes people feel heard. Yet it remains unclear whether LLMs represent emotion in language as humans do, or whether and how the emotional tone of their output can be controlled. We assess human-AI emotional alignment across linguistic-cultural groups and model-families, using interpretable LLM features translated from concept-sets for over twenty nuanced emotion categories (including six basic emotions). Our analyses reveal that LLM-derived emotion spaces are structurally congruent with human perception, underpinned by the fundamental affective dimensions of valence and arousal. Furthermore, these emotion-related features also accurately predict large-scale behavioural data on word ratings along these two core dimensions, reflecting both universal and language-specific patterns. Finally, by leveraging steering vectors derived solely from human-centric emotion concepts, we show that model expressions can be stably and naturally modulated across distinct emotion categories, which provides causal evidence that human emotion concepts can be used to systematically induce LLMs to produce corresponding affective states when conveying content. These findings suggest AI not only shares emotional representations with humans but its affective outputs can be precisely guided using psychologically grounded emotion concepts.

cs.CL↗