Ben Liao

ORCID: 0000-0002-5084-2682
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Computational Drug Discovery Methods
  • Machine Learning in Materials Science
  • Protein Structure and Dynamics
  • Advanced Graph Neural Networks
  • Asymmetric Hydrogenation and Catalysis
  • Recommender Systems and Techniques
  • Machine Learning in Bioinformatics
  • Advanced Bandit Algorithms Research
  • Machine Learning and Algorithms
  • Topic Modeling
  • Advanced Materials and Mechanics
  • Advanced Operator Algebra Research
  • Natural Language Processing Techniques
  • Speech and dialogue systems
  • Reinforcement Learning in Robotics
  • Machine Learning and Data Classification
  • Color Science and Applications
  • Microbial Natural Products and Biosynthesis
  • Water Systems and Optimization
  • Stochastic Gradient Optimization Techniques
  • Graph Theory and Algorithms
  • Text and Document Classification Technologies
  • Multi-Agent Systems and Negotiation
  • Modular Robots and Swarm Intelligence
  • Semantic Web and Ontologies

Tencent (China)
2019-2023

Harbin Institute of Technology
2020

Chinese University of Hong Kong
2020

Shenzhen Institutes of Advanced Technology
2020

Zhejiang University
2020

Central South University
2020

National Chung Hsing University
2009

University of Washington
2003

University of California, Berkeley
2003

Seattle University
2003

Abstract Graph neural networks (GNN) has been considered as an attractive modelling method for molecular property prediction, and numerous studies have shown that GNN could yield more promising results than traditional descriptor-based methods. In this study, based on 11 public datasets covering various endpoints, the predictive capacity computational efficiency of prediction models developed by eight machine learning (ML) algorithms, including four (SVM, XGBoost, RF DNN) graph-based (GCN,...

10.1186/s13321-020-00479-8 article EN cc-by Journal of Cheminformatics 2021-02-17

Accurate quantification of protein–ligand interactions remains a key challenge to structure-based drug design. However, traditional machine learning (ML)-based methods based on handcrafted descriptors, one-dimensional protein sequences, and/or two-dimensional graph representations limit their capability learn the generalized molecular in 3D space. Here, we proposed novel deep representation framework named InteractionGraphNet (IGN) from structures complexes. In IGN, two independent...

10.1021/acs.jmedchem.1c01830 article EN Journal of Medicinal Chemistry 2021-12-08

In many real-world tasks, multiple agents must learn to coordinate with each other given their private observations and limited communication ability. Deep multiagent reinforcement learning (Deep-MARL) algorithms have shown superior performance in such challenging settings. One representative class of work is value decomposition, which decomposes the global shared Q-value $Q_{tot}$ into individual Q-values $Q^{i}$ guide individuals' behaviors, i.e. VDN imposing an additive formation QMIX...

10.48550/arxiv.2002.03939 preprint EN other-oa arXiv (Cornell University) 2020-01-01

Abstract Graph neural networks (GNN) has been considered as an attractive modelling method for molecular property prediction, and numerous studies have shown that GNN could yield more promising results than traditional descriptor-based methods. In this study, based on 11 public datasets covering various endpoints, the predictive capacity computational efficiency of prediction models developed by eight machine learning (ML) algorithms, including four (SVM, XGBoost, RF DNN) graph-based (GCN,...

10.21203/rs.3.rs-79416/v1 preprint EN cc-by Research Square (Research Square) 2020-09-21

Abstract Accurate predictions of druggability and bioactivities compounds are desirable to reduce the high cost time drug discovery. After more than five decades continuing developments, quantitative structure–activity relationship (QSAR) methods have been established as indispensable tools that facilitate fast, reliable affordable assessments physicochemical biological properties in drug-discovery programs. Currently, there mainly two types QSAR methods, descriptor-based graph-based...

10.1093/bib/bbab112 article EN Briefings in Bioinformatics 2021-03-12

Development of accurate machine-learning-based scoring functions (MLSFs) for structure-based virtual screening against a given target requires large unbiased dataset with structurally diverse actives and decoys. However, most datasets the development MLSFs were designed traditional SFs may suffer from hidden biases data insufficiency. Hereby, we developed new approach named Topology-based Conformation-based decoys generation (TocoDecoy), which integrates two strategies to generate by...

10.1021/acs.jmedchem.2c00460 article EN Journal of Medicinal Chemistry 2022-06-01

Many deep learning (DL)-based molecular generative models have been proposed to design novel molecules. These may perform well on benchmarks, but they usually do not take real-world constraints into account, such as available training data set, synthetic accessibility, and scaffold diversity in drug discovery. In this study, a new algorithm, ChemistGA, was by combining the traditional heuristic algorithm with DL, which crossover of genetic (GA) redefined DL conjunction GA, an innovative...

10.1021/acs.jmedchem.2c01179 article EN Journal of Medicinal Chemistry 2022-09-06

We study noncommutative maximal inequalities and ergodic theorems for group actions on von Neumann algebras. Consider a locally compact G of polynomial growth with symmetric subset V. Let α be continuous action algebra M by trace-preserving automorphisms. then show that the operators defined Anx=1m(Vn)∫Vnαgxdm(g),x∈Lp(M),n∈N,1≤p≤∞, are weak type (1,1) strong (p,p) 1<p<∞. Consequently, sequence (Anx)n≥1 converges almost uniformly x∈Lp(M) 1≤p<∞. Also, we establish individual associated more...

10.1215/00127094-2020-0034 article EN Duke Mathematical Journal 2020-10-30

Chatbot models have achieved remarkable progress in recent years but tend to yield contradictory responses. In this paper, we exploit the advantage of contrastive learning technique mitigate issue. To endow model with ability discriminating patterns, minimize similarity between target response and contradiction related negative example. The example is generated learnable latent noise, which receives feedback from pretrained critic. Experimental results show that our method helps avoid...

10.18653/v1/2022.findings-acl.219 article EN cc-by Findings of the Association for Computational Linguistics: ACL 2022 2022-01-01

Fairness in recommendation has attracted increasing attention due to bias and discrimination possibly caused by traditional recommenders. In Interactive Recommender Systems (IRS), user preferences the system's fairness status are constantly changing over time. Existing fairness-aware recommenders mainly consider static settings. Directly applying existing methods IRS will result poor recommendation. To resolve this problem, we propose a reinforcement learning based framework, FairRec,...

10.48550/arxiv.2106.13386 preprint EN cc-by-nc-sa arXiv (Cornell University) 2021-01-01

Retrosynthesis prediction is a crucial task for organic synthesis. In this work, we propose template-free and Transformer-based method dubbed RetroPrime, integrating chemists’ retrosynthetic strategy of (1) decomposing molecule into synthons then (2) generating reactants by attaching leaving groups. These two steps are accomplished with versatile Transformer models, respectively. While RetroPrime performs competitively against all state-of-the art models on the standard USPTO-50K dataset, it...

10.26434/chemrxiv.12971942.v1 preprint EN cc-by-nc-nd 2020-09-18

10.1016/j.jmatprotec.2009.09.021 article EN Journal of Materials Processing Technology 2009-10-02

Retrosynthesis prediction is a crucial task for organic synthesis. In this work, we propose template-free and Transformer-based method dubbed RetroPrime, integrating chemists’ retrosynthetic strategy of (1) decomposing molecule into synthons then (2) generating reactants by attaching leaving groups. These two steps are accomplished with versatile Transformer models, respectively. While RetroPrime performs competitively against all state-of-the art models on the standard USPTO-50K dataset, it...

10.26434/chemrxiv.12971942.v2 preprint EN cc-by-nc-nd 2020-11-26

Molecular de novo design is a critical yet challenging task in scientific fields, aiming to novel molecular structures with desired property profiles. Significant progress has been made by resorting generative models for graphs. However, limited attention paid hierarchical models, which can exploit the inherent structure (with rich semantic information) of graphs and generate complex molecules larger size that we shall demonstrate be difficult most existing models. The primary challenge...

10.24963/ijcai.2023/556 article EN 2023-08-01

We prove a Chernoff-type bound for sums of matrix-valued random variables sampled via regular (aperiodic and irreducible) finite Markov chain. Specially, consider walk on chain Hermitian function its state space. Our result gives exponentially decreasing bounds the tail distributions extreme eigenvalues sample mean matrix. proof is based matrix expander (regular undirected graph) Chernoff [Garg et al. STOC '18] scalar Chernoff-Hoeffding chains [Chung STACS '12]. can be applied to analyze...

10.48550/arxiv.2008.02464 preprint EN other-oa arXiv (Cornell University) 2020-01-01

Abstract Graph neural networks (GNN) has been considered as an attractive modelling method for molecular property prediction, and numerous studies have shown that GNN could yield more promising results than traditional descriptor-based methods. In this study, based on 11 public datasets covering various endpoints, the predictive capacity computational efficiency of prediction models developed by eight machine learning (ML) algorithms, including four (SVM, XGBoost, RF DNN) graph-based (GCN,...

10.21203/rs.3.rs-81439/v1 preprint EN cc-by Research Square (Research Square) 2020-09-28

The notion of word embedding plays a fundamental role in natural language processing (NLP). However, pre-training for very large-scale vocabulary is computationally challenging most existing methods. In this work, we show that with merely small fraction contexts (Q-contexts)which are typical the whole corpus (and their mutual information words), one can construct high-quality negligible errors. Mutual between and words be encoded canonically as sampling state, thus, Q-contexts fast...

10.1145/3459637.3482343 preprint EN 2021-10-26

Molecular de novo design is a critical yet challenging task in scientific fields, aiming to novel molecular structures with desired property profiles. Significant progress has been made by resorting generative models for graphs. However, limited attention paid hierarchical models, which can exploit the inherent structure (with rich semantic information) of graphs and generate complex molecules larger size that we shall demonstrate be difficult most existing models. The primary challenge...

10.48550/arxiv.2305.08457 preprint EN other-oa arXiv (Cornell University) 2023-01-01

Retrosynthesis prediction is a crucial task for organic synthesis. In this work, we propose template-free and Transformer-based method dubbed RetroPrime, integrating chemists’ retrosynthetic strategy of (1) decomposing molecule into synthons then (2) generating reactants by attaching leaving groups. These two steps are accomplished with versatile Transformer models, respectively. While RetroPrime performs competitively against all state-of-the art models on the standard USPTO-50K dataset, it...

10.26434/chemrxiv.12971942 preprint EN cc-by-nc-nd 2020-09-18

In this paper, we present LiQuID, a tool for seeing lighting quality in design.Photographs are useful vehicles both describing and making assessments of architectural systems.A significant barrier to using photographs during the design process relates sheer volume renderings that needs be analyzed.Although there have been efforts produce novel visualization systems manage large sets photographs, research aims reduce complexity by classifying data into representative prototypes.A hypothetical...

10.52842/conf.acadia.2003.337 article EN ACADIA quarterly 2003-01-01
Coming Soon ...