Haobo Wang

Haobo Wang

Auto-generated profile, based on publicly available information

Haobo Wang

Harvard University

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 May 2020 in IEEE Transactions on Smart Grid
Verified
Journal Article
Closed access
JZJian Zhao
Jian Zhao
LLLiang Li
Liang Li
ZXZhao Xu
Zhao Xu
XWXiaoyu Wang
Xiaoyu Wang
HWHaobo Wang
Haobo Wang
XSXianjun Shao
Xianjun Shao
The identification of the distribution system topology is the key concern in distribution system state estimation and the precondition for its energy management. However, lacking sufficient measurement devices, full-scale identification of entire distribution grid can hardly be achievable in practice. The frequent topology changes in distribution systems impose challenges for topology identification. This paper proposes a novel topology identification method by deeply mining the data obtained from gird terminals and smart meters at end-users premises. The proposed method starts with data processing, followed by nodal correlation analysis and topology modeling based on the Markov Random Field (MRF) method, where the pseudo-likelihood method and L2 regularization theory are introduced to improve the computation efficiency while preventing the over-fitting problem. Then the iterative screening method is developed to generate the distribution system topology of medium/low-voltage distribution systems. Finally, the incremental learning and parallel programming models are proposed to implement the algorithms on single/multi-terminal. The effectiveness of the proposed model is validated on IEEE 33-node, IEEE 123-node and actual distribution systems.

31 January 2024 in bioRxiv
Verified
Preprint
Open access
PDF file
ZZZhidian Zhang
Zhidian Zhang
HWHannah K. Wayment-Steele
Hannah K. Wayment-Steele
GBGaryk Brixi
Garyk Brixi
HWHaobo Wang
Haobo Wang
MPMatteo Dal Peraro
Matteo Dal Peraro
SOSergey Ovchinnikov
Sergey Ovchinnikov
Protein language models (pLMs) have emerged as potent tools for predicting and designing protein structure and function, and the degree to which these models fundamentally understand the inherent biophysics of protein structure stands as an open question. Motivated by a discovery that pLM-based structure predictors erroneously predict nonphysical structures for protein isoforms, we investigated the nature of sequence context needed for contact predictions in the pLM ESM-2. We demonstrate by use of a “categorical Jacobian” calculation that ESM-2 stores statistics of coevolving residues, analogously to simpler modelling approaches like Markov Random Fields and Multivariate Gaussian models. We further investigated how ESM-2 “stores” information needed to predict contacts by comparing sequence masking strategies, and found that providing local windows of sequence information allowed ESM-2 to best recover predicted contacts. This suggests that pLMs predict contacts by storing motifs of pairwise contacts. Our investigation highlights the limitations of current pLMs and underscores the importance of understanding the underlying mechanisms of these models. Significance Statement: Protein language models (pLMs) have exhibited remarkable capabilities in protein structure prediction and design. However, the extent to which they comprehend the intrinsic biophysics of protein structures remains uncertain. We present a suite of analyses that dissect how the flagship pLM ESM-2 predicts structure. Motivated by a consistent error of protein isoforms predicted as structured fragments, we developed a completely unsupervised method to uniformly evaluate any protein language model that allows for us to compare coevolutionary statistics to older linear models. We further identified t hat E SM-2 a ppears to have a precise context size that is needed to predict inter-residue contacts. Our study highlights the current limitations of pLMs and contributes to a deeper understanding of their underlying mechanisms, paving the way for more reliable protein structure predictions.

1 April 2016 in Biochemical and Biophysical Research Communications
Verified
Journal Article
Closed access
HWHaobo Wang
Haobo Wang
LYLijiang Yang
Lijiang Yang
XNXiaogang Niu
Xiaogang Niu

30 November 2020 in bioRxiv
Verified
Preprint
Open access
PDF file
DMDylan Marshall
Dylan Marshall
HWHaobo Wang
Haobo Wang
MSMichael Stiffler
Michael Stiffler
JDJustas Dauparas
Justas Dauparas
PKPeter Koo
Peter Koo
SOSergey Ovchinnikov
Sergey Ovchinnikov
If disentangled properly, patterns distilled from evolutionarily related sequences of a given protein family can inform their traits - such as their structure and function. Recent years have seen an increase in the complexity of generative models towards capturing these patterns; from sitewise to pairwise to deep and variational. In this study we evaluate the degree of structure and fitness patterns learned by a suite of progressively complex models. We introduce pairwise saliency, a novel method for evaluating the degree of captured structural information. We also quantify the fitness information learned by these models by using them to predict the fitness of mutant sequences and then correlate these predictions against their measured fitness values. We observe that models that inform structure do not necessarily inform fitness and vice versa, contrasting recent claims in this field. Our work highlights a dearth of consistency across fitness assays as well as divergently provides a general approach for understanding the pairwise decomposable relations learned by a given generative sequence model.

18 April 2024 in PRX Life
Verified
Journal Article
Open access
PDF file
HWHaobo Wang
Haobo Wang
SFShihao Feng
Shihao Feng
KTKotaro Tsuboyama
Kotaro Tsuboyama
SLSirui Liu
Sirui Liu
GRGabriel J. Rocklin
Gabriel J. Rocklin
SOSergey Ovchinnikov
Sergey Ovchinnikov
The exponential growth of protein sequences in the post-genomic era has revolutionized the application of generative sequence models for pivotal tasks such as contact prediction, protein design, alignment, and homology search. Despite remarkable progress in these areas, the interpretability of the modeled pairwise parameters remains limited due to complexities arising from coevolution, phylogeny, and entropy. While post-correction methods for contact prediction have been developed to eliminate entropy-related contributions from predicted contact maps, there is currently no direct approach to correct entropy in other applications reliant on raw parameters. In this paper, we investigate the sources of entropy signal and propose a novel spectral regularizer, LH (an abbreviation of Henri Lebesgue), to mitigate its impact during model fitting. By incorporating this regularizer into the GREMLIN framework (utilizing a Markov random field or Potts model), we enable the accurate inference of sparse contact maps while simultaneously improving interpretability and addressing overfitting concerns critical for sequence evaluation and design. To validate the efficacy of our approach, we design multiple protein sequences based on GREMLIN with both L2 and LH regularizers, and subsequently experimentally measure their using cDNA display proteolysis. Our findings demonstrate that proteins designed using the LH regularizer exhibit increased diversity and enhanced folding stability. Published by the American Physical Society 2024

7 March 2022 in bioRxiv
Verified
Preprint
Open access
PDF file
HWHaobo Wang
Haobo Wang
SFShihao Feng
Shihao Feng
SLSirui Liu
Sirui Liu
SOSergey Ovchinnikov
Sergey Ovchinnikov
The rise in the number of protein sequences in the post-genomic era has led to a major breakthrough in fitting generative sequence models for contact prediction, protein design, alignment, and homology search. Despite this success, the interpretability of the modeled pairwise parameters continues to be limited due to the entanglement of coevolution, phylogeny, and entropy. For contact prediction, post-correction methods have been developed to remove the contribution of entropy from the predicted contact maps. However, all remaining applications that rely on the raw parameters, lack a direct method to correct for entropy. In this paper, we investigate the origins of the entropy signal and propose a new spectral regularizer to down weight it during model fitting. We find the added regularizer to GREMLIN, a Markov Random Field or Potts model, allows for the inference of a sparse contact map without loss in precision, meanwhile improving interpretability, and resolving overfitting issues important for sequence evaluation and design.