← Search

Guolin Ke

20 accepted papers

2026

From Human Labels to Literature: Semi-Supervised Learning of NMR Chemical Shifts at Scale

ICML 2026poster

Accurate prediction of nuclear magnetic resonance (NMR) chemical shifts is fundamental to spectral analysis and molecular structure elucidation, yet existing machine learning methods rely on limited, labor-intensive atom-assigned datasets. We propose a semi-supervised framework that learns NMR chemi…

Cited by 0SourceScholar
2026

On the Design of One-step Diffusion via Shortcutting Flow Paths

ICLR 2026poster

Recent advances in few-step diffusion models have demonstrated their efficiency and effectiveness by shortcutting the probabilistic paths of diffusion models, especially in training one-step diffusion models from scratch (a.k.a. shortcut models). However, their theoretical derivation and practical i…

Cited by 3SourcecodeScholar
2025

Beyond Atoms: Enhancing Molecular Pretrained Representations with 3D Space Modeling

ICML 2025poster

Molecular pretrained representations (MPR) has emerged as a powerful approach for addressing the challenge of limited supervised data in applications such as drug discovery and material design. While early MPR methods relied on 1D sequences and 2D graphs, recent advancements have incorporated 3D co…

Cited by 1SourcePDFScholar
2025

MolParser: End-to-end Visual Recognition of Molecule Structures in the Wild

ICCV 2025poster

In recent decades, chemistry publications and patents have increased rapidly. A significant portion of key information is embedded in molecular structure figures, complicating large-scale literature searches and limiting the application of large language models in fields such as biology, chemistry,…

Cited by 0SourcePDFScholar
2025

SciAssess: Benchmarking LLM Proficiency in Scientific Literature Analysis

NAACL 2025findings

Recent breakthroughs in Large Language Models (LLMs) have revolutionized scientific literature analysis. However, existing benchmarks fail to adequately evaluate the proficiency of LLMs in this domain, particularly in scenarios requiring higher-level abilities beyond mere memorization and the handli…

2025

SciLitLLM: How to Adapt LLMs for Scientific Literature Understanding

ICLR 2025poster

Scientific literature understanding is crucial for extracting targeted information and garnering insights, thereby significantly advancing scientific discovery. Despite the remarkable success of Large Language Models (LLMs), they face challenges in scientific literature understanding, primarily due…

2024

Exploring Molecular Pretraining Model at Scale

NeurIPS 2024poster

In recent years, pretraining models have made significant advancements in the fields of natural language processing (NLP), computer vision (CV), and life sciences. The significant advancements in NLP and CV are predominantly driven by the expansion of model parameters and data size, a phenomenon now…

Cited by 1SourcePDFScholar
2024

S-MolSearch: 3D Semi-supervised Contrastive Learning for Bioactive Molecule Search

NeurIPS 2024poster

Virtual Screening is an essential technique in the early phases of drug discovery, aimed at identifying promising drug candidates from vast molecular libraries. Recently, ligand-based virtual screening has garnered significant attention due to its efficacy in conducting extensive database screening…

Cited by 1SourcePDFScholar
2023

Uni-Mol: A Universal 3D Molecular Representation Learning Framework

ICLR 2023poster

Molecular representation learning (MRL) has gained tremendous attention due to its critical role in learning from limited supervised data for applications like drug design. In most MRL methods, molecules are treated as 1D sequential tokens or 2D topology graphs, limiting their ability to incorporate…

2022

Quantized Training of Gradient Boosting Decision Trees

NeurIPS 2022accept

Recent years have witnessed significant success in Gradient Boosting Decision Trees (GBDT) for a wide range of machine learning applications. Generally, a consensus about GBDT's training algorithms is gradients and statistics are computed based on high-precision floating points. In this paper, we in…

Cited by 31SourcePDFScholar
2021

Do Transformers Really Perform Badly for Graph Representation?

NeurIPS 2021poster

The Transformer architecture has become a dominant choice in many domains, such as natural language processing and computer vision. Yet, it has not achieved competitive performance on popular leaderboards of graph-level prediction compared to mainstream GNN variants. Therefore, it remains a mystery…

2021

How could Neural Networks understand Programs?

ICML 2021spotlight

Semantic understanding of programs is a fundamental problem for programming language processing (PLP). Recent works that learn representations of code based on pre-training techniques in NLP have pushed the frontiers in this direction. However, the semantics of PL and NL have essential differences.…

2021

Less is More: Pretrain a Strong Siamese Encoder for Dense Text Retrieval Using a Weak Decoder

EMNLP 2021main

Dense retrieval requires high-quality text sequence embeddings to support effective search in the representation space. Autoencoder-based language models are appealing in dense retrieval as they train the encoder to output high-quality embedding that can reconstruct the input texts. However, in this…

2021

Stable, Fast and Accurate: Kernelized Attention with Relative Positional Encoding

NeurIPS 2021poster

The attention module, which is a crucial component in Transformer, cannot scale efficiently to long sequences due to its quadratic complexity. Many works focus on approximating the dot-then-exponentiate softmax function in the original attention, leading to sub-quadratic or even linear-complexity Tr…

Cited by 54SourcePDFScholar
2017

LightGBM: A Highly Efficient Gradient Boosting Decision Tree

NeurIPS 2017poster

Gradient Boosting Decision Tree (GBDT) is a popular machine learning algorithm, and has quite a few effective implementations such as XGBoost and pGBRT. Although many engineering optimizations have been adopted in these implementations, the efficiency and scalability are still unsatisfactory when th…

2016

A Communication-Efficient Parallel Algorithm for Decision Tree

NeurIPS 2016poster

Decision tree (and its extensions such as Gradient Boosting Decision Trees and Random Forest) is a widely used machine learning algorithm, due to its practical effectiveness and model interpretability. With the emergence of big data, there is an increasing need to parallelize the training process of…

Cited by 193SourcePDFScholar