Hao Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Hao Wang has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Duanyu Feng
Sichuan University
3 shared publications - Lei Zhang
School of Mathematical Sciences Shanghai Jiao Tong University 200240 Shanghai P. R. China
3 shared publications - Yangshuai Wang
Department of Mathematics Faculty of Science National University of Singapore 10 Lower Kent Ridge Road Singapore
3 shared publications Yongfu Dai
3 shared publications- Christoph Ortner
Department of Mathematics, University of British Columbia, 1984 Mathematics Road, Vancouver, BC V6T 1Z2, Canada
2 shared publications - Duanyu Feng
Sichuan University
2 shared publications
Latest Publications
- 12 June 2026
- Published by American Vacuum Society in Journal of Vacuum Science & Technology B
- Vol. 44 (4)
Molecular dynamics study of Ar scattering from Pt(100): Reflected velocity distributions, accommodation coefficients, and a Gaussian tangential kernel
Gas–surface scattering kernels used in rarefied flow and vacuum modeling commonly assume Maxwellian reflection with constant accommodation coefficients. Molecular dynamics simulations were performed to quantify Ar scattering from a thermostated Pt(100) surface using a molecular-beam configuration. Incident speeds spanning 0.5–8 times the most probable speed and incident angles of 5°, 45°, and 75° were considered. Three trajectory classes were observed: single-bounce reflection, multibounce reflection, and adsorption following multiple bounces. Escape from the surface potential well occurred when the peak normal momentum during the interaction exceeded the incident normal momentum. Reflected velocity distributions were strongly non-Maxwellian. At low incident speeds, the tangential component was well described by a Gaussian and the normal component lay between Maxwellian and Gaussian forms. With increasing incident speed, the tangential distribution developed a shoulder and ultimately became bimodal, accompanied by tangential–normal coupling. Increasing incident angle reduced the spread of reflected velocities and shifted scattering from diffuse toward specularlike reflection. Accommodation coefficients were markedly condition dependent: tangential momentum accommodation decreased monotonically with incident speed at large angles; normal momentum and energy accommodation exhibited opposite trends between low- and high-speed regimes; and tangential momentum accommodation exceeded unity at small angles, indicating tangential velocity reversal. Motivated by the low-speed behavior, a tangential scattering-kernel parameterization is proposed in which a Gaussian distribution is used with incident-speed- and angle-dependent mean and variance, providing a compact model form for gas–surface boundary conditions.
- 12 June 2026
- Published by American Vacuum Society in Journal of Vacuum Science & Technology B
- Vol. 44 (4)
Molecular dynamics study of Ar scattering from Pt(100): Reflected velocity distributions, accommodation coefficients, and a Gaussian tangential kernel
Gas–surface scattering kernels used in rarefied flow and vacuum modeling commonly assume Maxwellian reflection with constant accommodation coefficients. Molecular dynamics simulations were performed to quantify Ar scattering from a thermostated Pt(100) surface using a molecular-beam configuration. Incident speeds spanning 0.5–8 times the most probable speed and incident angles of 5°, 45°, and 75° were considered. Three trajectory classes were observed: single-bounce reflection, multibounce reflection, and adsorption following multiple bounces. Escape from the surface potential well occurred when the peak normal momentum during the interaction exceeded the incident normal momentum. Reflected velocity distributions were strongly non-Maxwellian. At low incident speeds, the tangential component was well described by a Gaussian and the normal component lay between Maxwellian and Gaussian forms. With increasing incident speed, the tangential distribution developed a shoulder and ultimately became bimodal, accompanied by tangential–normal coupling. Increasing incident angle reduced the spread of reflected velocities and shifted scattering from diffuse toward specularlike reflection. Accommodation coefficients were markedly condition dependent: tangential momentum accommodation decreased monotonically with incident speed at large angles; normal momentum and energy accommodation exhibited opposite trends between low- and high-speed regimes; and tangential momentum accommodation exceeded unity at small angles, indicating tangential velocity reversal. Motivated by the low-speed behavior, a tangential scattering-kernel parameterization is proposed in which a Gaussian distribution is used with incident-speed- and angle-dependent mean and variance, providing a compact model form for gas–surface boundary conditions.
- 18 February 2026
- Published by Elsevier in Computer Physics Communications
- Vol. 322
Adaptive quasicontinuum methods and simulations for crystal defects with a theory based unified a posteriori error estimate
- 18 February 2026
- Published by Elsevier in Computer Physics Communications
- Vol. 322
Adaptive quasicontinuum methods and simulations for crystal defects with a theory based unified a posteriori error estimate
- Open Access
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.
Open AccessFourth-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.
- 20 June 2025
- Published by Springer Nature
- p. 180-192
A Hybrid Loss Framework for Decomposition-Based Time Series Forecasting Methods: Balancing Global and Component Errors
- 20 June 2025
- Published by Springer Nature
- p. 180-192
A Hybrid Loss Framework for Decomposition-Based Time Series Forecasting Methods: Balancing Global and Component Errors
- Open Access
Formulation and Analysis of Blended Atomistic to Higher-Order Continuum Coupling Methods for Crystalline Defects
Concurrent multiscale methods play an important role in modeling and simulating materials with defects, aiming to achieve the balance between accuracy and efficiency. Atomistic-to-continuum (a/c) coupling methods, a typical class of concurrent multiscale methods, link atomic-scale simulations with continuum mechanics. Existing a/c methods adopt the classic second-order Cauchy-Born approximation as the continuum mechanics model. In this work, we employ a higher-order Cauchy-Born model to study the potential accuracy improvement of the coupling scheme. In particular, we develop an energy-based blended atomistic to higher-order continuum method and present a rigorous a priori error analysis. We show that the overall accuracy of the energy-based blended method is not actually improved due the coupling interface error which is of lower order and may not be improved. On the contrast, higher order accuracy is achieved by the force-based blended atomistic to higher-order continuum method. Our theoretical results are demonstrated by a detailed numerical study.
Open AccessFormulation and Analysis of Blended Atomistic to Higher-Order Continuum Coupling Methods for Crystalline Defects
Concurrent multiscale methods play an important role in modeling and simulating materials with defects, aiming to achieve the balance between accuracy and efficiency. Atomistic-to-continuum (a/c) coupling methods, a typical class of concurrent multiscale methods, link atomic-scale simulations with continuum mechanics. Existing a/c methods adopt the classic second-order Cauchy-Born approximation as the continuum mechanics model. In this work, we employ a higher-order Cauchy-Born model to study the potential accuracy improvement of the coupling scheme. In particular, we develop an energy-based blended atomistic to higher-order continuum method and present a rigorous a priori error analysis. We show that the overall accuracy of the energy-based blended method is not actually improved due the coupling interface error which is of lower order and may not be improved. On the contrast, higher order accuracy is achieved by the force-based blended atomistic to higher-order continuum method. Our theoretical results are demonstrated by a detailed numerical study.
- Open Access
A General Framework of Linear Elasticity Enhanced Multiscale Coupling Methods for Crystalline Defects
The atomistic-to-continuum (a/c) coupling methods, also known as the quasicontinuum (QC) methods, are a important class of concurrent multisacle methods for modeling and simulating materials with defects. The a/c methods aim to balance the accuracy and efficiency by coupling a molecular mechanics model (also termed as the atomistic model) in the vicinity of localized defects with the Cauchy-Born approximation of the atomistic model in the elastic far field. However, since both the molecular mechanics model and its Cauchy-Born approximation are usually a nonlinear, it potentially leads to a high computational cost for large-scale simulations. In this work, we propose an advancement of the classic quasinonlocal (QNL) a/c coupling method by incorporating a linearized Cauchy-Born model to reduce the computational cost. We present a rigorous a priori error analysis for this QNL method with linear elasticity enhancement (QNLL method), and show both analytically and numerically that it achieves the same convergence behavior as the classic (nonlinear) QNL method by proper determination of certain parameters relating to domain decomposition and finite element discretization. More importantly, our numerical experiments demonstrate that the QNLL method perform an substantial improvement of the computational efficiency in term of CPU times.
Open AccessA General Framework of Linear Elasticity Enhanced Multiscale Coupling Methods for Crystalline Defects
The atomistic-to-continuum (a/c) coupling methods, also known as the quasicontinuum (QC) methods, are a important class of concurrent multisacle methods for modeling and simulating materials with defects. The a/c methods aim to balance the accuracy and efficiency by coupling a molecular mechanics model (also termed as the atomistic model) in the vicinity of localized defects with the Cauchy-Born approximation of the atomistic model in the elastic far field. However, since both the molecular mechanics model and its Cauchy-Born approximation are usually a nonlinear, it potentially leads to a high computational cost for large-scale simulations. In this work, we propose an advancement of the classic quasinonlocal (QNL) a/c coupling method by incorporating a linearized Cauchy-Born model to reduce the computational cost. We present a rigorous a priori error analysis for this QNL method with linear elasticity enhancement (QNLL method), and show both analytically and numerically that it achieves the same convergence behavior as the classic (nonlinear) QNL method by proper determination of certain parameters relating to domain decomposition and finite element discretization. More importantly, our numerical experiments demonstrate that the QNLL method perform an substantial improvement of the computational efficiency in term of CPU times.
- Open Access
A Hybrid Loss Framework for Decomposition-based Time Series Forecasting Methods: Balancing Global and Component Errors
Accurate time series forecasting, predicting future values based on past data, is crucial for diverse industries. Many current time series methods decompose time series into multiple sub-series, applying different model architectures and training with an end-to-end overall loss for forecasting. However, this raises a question: does this overall loss prioritize the importance of critical sub-series within the decomposition for the better performance? To investigate this, we conduct a study on the impact of overall loss on existing time series methods with sequence decomposition. Our findings reveal that overall loss may introduce bias in model learning, hindering the learning of the prioritization of more significant sub-series and limiting the forecasting performance. To address this, we propose a hybrid loss framework combining the global and component losses. This framework introduces component losses for each sub-series alongside the original overall loss. It employs a dual min-max algorithm to dynamically adjust weights between the overall loss and component losses, and within component losses. This enables the model to achieve better performance of current time series methods by focusing on more critical sub-series while still maintaining a low overall loss. We integrate our loss framework into several time series methods and evaluate the performance on multiple datasets. Results show an average improvement of 0.5-2% over existing methods without any modifications to the model architectures.
Open AccessA Hybrid Loss Framework for Decomposition-based Time Series Forecasting Methods: Balancing Global and Component Errors
Accurate time series forecasting, predicting future values based on past data, is crucial for diverse industries. Many current time series methods decompose time series into multiple sub-series, applying different model architectures and training with an end-to-end overall loss for forecasting. However, this raises a question: does this overall loss prioritize the importance of critical sub-series within the decomposition for the better performance? To investigate this, we conduct a study on the impact of overall loss on existing time series methods with sequence decomposition. Our findings reveal that overall loss may introduce bias in model learning, hindering the learning of the prioritization of more significant sub-series and limiting the forecasting performance. To address this, we propose a hybrid loss framework combining the global and component losses. This framework introduces component losses for each sub-series alongside the original overall loss. It employs a dual min-max algorithm to dynamically adjust weights between the overall loss and component losses, and within component losses. This enables the model to achieve better performance of current time series methods by focusing on more critical sub-series while still maintaining a low overall loss. We integrate our loss framework into several time series methods and evaluate the performance on multiple datasets. Results show an average improvement of 0.5-2% over existing methods without any modifications to the model architectures.
- Open Access
HARMONIC: Harnessing LLMs for Tabular Data Synthesis and Privacy Protection
Data serves as the fundamental foundation for advancing deep learning, particularly tabular data presented in a structured format, which is highly conducive to modeling. However, even in the era of LLM, obtaining tabular data from sensitive domains remains a challenge due to privacy or copyright concerns. Hence, exploring how to effectively use models like LLMs to generate realistic and privacy-preserving synthetic tabular data is urgent. In this paper, we take a step forward to explore LLMs for tabular data synthesis and privacy protection, by introducing a new framework HARMONIC for tabular data generation and evaluation. In the tabular data generation of our framework, unlike previous small-scale LLM-based methods that rely on continued pre-training, we explore the larger-scale LLMs with fine-tuning to generate tabular data and enhance privacy. Based on idea of the k-nearest neighbors algorithm, an instruction fine-tuning dataset is constructed to inspire LLMs to discover inter-row relationships. Then, with fine-tuning, LLMs are trained to remember the format and connections of the data rather than the data itself, which reduces the risk of privacy leakage. In the evaluation part of our framework, we develop specific privacy risk metrics DLT for LLM synthetic data generation, as well as performance evaluation metrics LLE for downstream LLM tasks. Our experiments find that this tabular data generation framework achieves equivalent performance to existing methods with better privacy, which also demonstrates our evaluation framework for the effectiveness of synthetic data and privacy risks in LLM scenarios.
Open AccessHARMONIC: Harnessing LLMs for Tabular Data Synthesis and Privacy Protection
Data serves as the fundamental foundation for advancing deep learning, particularly tabular data presented in a structured format, which is highly conducive to modeling. However, even in the era of LLM, obtaining tabular data from sensitive domains remains a challenge due to privacy or copyright concerns. Hence, exploring how to effectively use models like LLMs to generate realistic and privacy-preserving synthetic tabular data is urgent. In this paper, we take a step forward to explore LLMs for tabular data synthesis and privacy protection, by introducing a new framework HARMONIC for tabular data generation and evaluation. In the tabular data generation of our framework, unlike previous small-scale LLM-based methods that rely on continued pre-training, we explore the larger-scale LLMs with fine-tuning to generate tabular data and enhance privacy. Based on idea of the k-nearest neighbors algorithm, an instruction fine-tuning dataset is constructed to inspire LLMs to discover inter-row relationships. Then, with fine-tuning, LLMs are trained to remember the format and connections of the data rather than the data itself, which reduces the risk of privacy leakage. In the evaluation part of our framework, we develop specific privacy risk metrics DLT for LLM synthetic data generation, as well as performance evaluation metrics LLE for downstream LLM tasks. Our experiments find that this tabular data generation framework achieves equivalent performance to existing methods with better privacy, which also demonstrates our evaluation framework for the effectiveness of synthetic data and privacy risks in LLM scenarios.
- Open Access
LAiW: A Chinese Legal Large Language Models Benchmark
General and legal domain LLMs have demonstrated strong performance in various tasks of LegalAI. However, the current evaluations of these LLMs in LegalAI are defined by the experts of computer science, lacking consistency with the logic of legal practice, making it difficult to judge their practical capabilities. To address this challenge, we are the first to build the Chinese legal LLMs benchmark LAiW, based on the logic of legal practice. To align with the thinking process of legal experts and legal practice (syllogism), we divide the legal capabilities of LLMs from easy to difficult into three levels: basic information retrieval, legal foundation inference, and complex legal application. Each level contains multiple tasks to ensure a comprehensive evaluation. Through automated evaluation of current general and legal domain LLMs on our benchmark, we indicate that these LLMs may not align with the logic of legal practice. LLMs seem to be able to directly acquire complex legal application capabilities but perform poorly in some basic tasks, which may pose obstacles to their practical application and acceptance by legal experts. To further confirm the complex legal application capabilities of current LLMs in legal application scenarios, we also incorporate human evaluation with legal experts. The results indicate that while LLMs may demonstrate strong performance, they still require reinforcement of legal logic.
Open AccessLAiW: A Chinese Legal Large Language Models Benchmark
General and legal domain LLMs have demonstrated strong performance in various tasks of LegalAI. However, the current evaluations of these LLMs in LegalAI are defined by the experts of computer science, lacking consistency with the logic of legal practice, making it difficult to judge their practical capabilities. To address this challenge, we are the first to build the Chinese legal LLMs benchmark LAiW, based on the logic of legal practice. To align with the thinking process of legal experts and legal practice (syllogism), we divide the legal capabilities of LLMs from easy to difficult into three levels: basic information retrieval, legal foundation inference, and complex legal application. Each level contains multiple tasks to ensure a comprehensive evaluation. Through automated evaluation of current general and legal domain LLMs on our benchmark, we indicate that these LLMs may not align with the logic of legal practice. LLMs seem to be able to directly acquire complex legal application capabilities but perform poorly in some basic tasks, which may pose obstacles to their practical application and acceptance by legal experts. To further confirm the complex legal application capabilities of current LLMs in legal application scenarios, we also incorporate human evaluation with legal experts. The results indicate that while LLMs may demonstrate strong performance, they still require reinforcement of legal logic.
- Open Access
Empowering Many, Biasing a Few: Generalist Credit Scoring through Large Language Models
In the financial industry, credit scoring is a fundamental element, shaping access to credit and determining the terms of loans for individuals and businesses alike. Traditional credit scoring methods, however, often grapple with challenges such as narrow knowledge scope and isolated evaluation of credit tasks. Our work posits that Large Language Models (LLMs) have great potential for credit scoring tasks, with strong generalization ability across multiple tasks. To systematically explore LLMs for credit scoring, we propose the first open-source comprehensive framework. We curate a novel benchmark covering 9 datasets with 14K samples, tailored for credit assessment and a critical examination of potential biases within LLMs, and the novel instruction tuning data with over 45k samples. We then propose the first Credit and Risk Assessment Large Language Model (CALM) by instruction tuning, tailored to the nuanced demands of various financial risk assessment tasks. We evaluate CALM, existing state-of-art (SOTA) methods, open source and closed source LLMs on the build benchmark. Our empirical results illuminate the capability of LLMs to not only match but surpass conventional models, pointing towards a future where credit scoring can be more inclusive, comprehensive, and unbiased. We contribute to the industry's transformation by sharing our pioneering instruction-tuning datasets, credit and risk assessment LLM, and benchmarks with the research community and the financial industry.
Open AccessEmpowering Many, Biasing a Few: Generalist Credit Scoring through Large Language Models
In the financial industry, credit scoring is a fundamental element, shaping access to credit and determining the terms of loans for individuals and businesses alike. Traditional credit scoring methods, however, often grapple with challenges such as narrow knowledge scope and isolated evaluation of credit tasks. Our work posits that Large Language Models (LLMs) have great potential for credit scoring tasks, with strong generalization ability across multiple tasks. To systematically explore LLMs for credit scoring, we propose the first open-source comprehensive framework. We curate a novel benchmark covering 9 datasets with 14K samples, tailored for credit assessment and a critical examination of potential biases within LLMs, and the novel instruction tuning data with over 45k samples. We then propose the first Credit and Risk Assessment Large Language Model (CALM) by instruction tuning, tailored to the nuanced demands of various financial risk assessment tasks. We evaluate CALM, existing state-of-art (SOTA) methods, open source and closed source LLMs on the build benchmark. Our empirical results illuminate the capability of LLMs to not only match but surpass conventional models, pointing towards a future where credit scoring can be more inclusive, comprehensive, and unbiased. We contribute to the industry's transformation by sharing our pioneering instruction-tuning datasets, credit and risk assessment LLM, and benchmarks with the research community and the financial industry.