← Search

Peilin Zhao

74 accepted papers

2026

CrystalDiT: Simple Diffusion Transformers for Crystal Generation

AAAI 2026technical

We present CrystalDiT, a diffusion transformer for crystal structure generation that achieves state-of-the-art performance by challenging the trend of architectural complexity. Instead of intricate, multi-stream designs, CrystalDiT employs a unified transformer that imposes a powerful inductive bias

Cited by 0SourcePDFScholar
2026

PoinnCARE: Hyperbolic Multi-Modal Learning for Enzyme Classification

ICLR 2026poster

Enzyme Commission (EC) number prediction is vital for elucidating enzyme functions and advancing biotechnology applications. However, current methods struggle to capture the hierarchical relationships among enzymes and often overlook critical structural and active site features. To bridge this gap,…

Cited by 0SourceScholar
2026

PointNSP: Autoregressive 3D Point Cloud Generation with Next-Scale Level-of-Detail Prediction

CVPR 2026

Autoregressive point cloud generation has long lagged behind diffusion-based approaches in quality. The performance gap stems from the fact that autoregressive models impose an artificial ordering on inherently unordered point sets, forcing shape generation to proceed as a sequence of local predicti

Cited by 4SourcecodeScholar
2025

COME: Test-time Adaption by Conservatively Minimizing Entropy

ICLR 2025poster

Machine learning models must continuously self-adjust themselves for novel data distribution in the open world. As the predominant principle, entropy minimization (EM) has been proven to be a simple yet effective cornerstone in existing test-time adaption (TTA) methods. While unfortunately its fatal…

2025

Continual Optimization with Symmetry Teleportation for Multi-Task Learning

NeurIPS 2025poster

Multi-task learning (MTL) is a widely explored paradigm that enables the simultaneous learning of multiple tasks using a single model. Despite numerous solutions, the key issues of optimization conflict and task imbalance remain under-addressed, limiting performance. Unlike existing optimization-bas…

Cited by 0SourceScholar
2025

Efficient Parallel Training Methods for Spiking Neural Networks with Constant Time Complexity

ICML 2025poster

Spiking Neural Networks (SNNs) often suffer from high time complexity $O(T)$ due to the sequential processing of $T$ spikes, making training computationally expensive. In this paper, we propose a novel Fixed-point Parallel Training (FPT) method to accelerate SNN training without modifying the netwo…

Cited by 0SourcePDFScholar
2025

Exploring Tradeoffs through Mode Connectivity for Multi-Task Learning

NeurIPS 2025poster

Nowadays deep models are required to be versatile due to the increasing realistic needs. Multi-task learning (MTL) offers an efficient way for this purpose to learn multiple tasks simultaneously with a single model. However, prior MTL solutions often focus on resolving conflicts and imbalances durin…

Cited by 0SourceScholar
2025

HDT: Hierarchical Discrete Transformer for Multivariate Time Series Forecasting

AAAI 2025technical

Generative models have gained significant attention in multivariate time series forecasting (MTS), particularly due to their ability to generate high-fidelity samples. Forecasting the probability distribution of multivariate time series is a challenging yet practical task. Although some recent attem…

2025

IgGM: A Generative Model for Functional Antibody and Nanobody Design

ICLR 2025poster

Immunoglobulins are crucial proteins produced by the immune system to identify and bind to foreign substances, playing an essential role in shielding organisms from infections and diseases. Designing specific antibodies opens new pathways for disease treatment. With the rise of deep learning, AI-dri…

2025

Measuring Diversity in Synthetic Datasets

ICML 2025poster

Large language models (LLMs) are widely adopted to generate synthetic datasets for various natural language processing (NLP) tasks, such as text classification and summarization. However, accurately measuring the diversity of these synthetic datasets—an aspect crucial for robust model performance—re…

2025

Multi-Task Vehicle Routing Solver via Mixture of Specialized Experts under State-Decomposable MDP

NeurIPS 2025poster

Existing neural methods for multi-task vehicle routing problems (VRPs) typically learn unified solvers to handle multiple constraints simultaneously. However, they often underutilize the compositional structure of VRP variants, each derivable from a common set of basis VRP variants. This critical ov…

Cited by 0SourceScholar
2025

NTPP: Generative Speech Language Modeling for Dual-Channel Spoken Dialogue via Next-Token-Pair Prediction

ICML 2025poster

Inspired by the impressive capabilities of GPT-4o, there is growing interest in enabling speech language models (SLMs) to engage in natural, fluid spoken interactions with humans. Recent advancements have led to the development of several SLMs that demonstrate promising results in this area. However…

Cited by 0SourcePDFScholar
2025

Principled Data Selection for Alignment: The Hidden Risks of Difficult Examples

ICML 2025poster

The alignment of large language models (LLMs) often assumes that using more clean data yields better outcomes, overlooking the match between model capacity and example difficulty. Challenging this, we propose a new principle: *Preference data vary in difficulty, and overly difficult examples hinder…

2025

Right Question is Already Half the Answer: Fully Unsupervised LLM Reasoning Incentivization

NeurIPS 2025spotlight

Existing methods to enhance the reasoning capability of large language models predominantly rely on supervised fine-tuning (SFT) followed by reinforcement learning (RL) on reasoning-specific data. These approaches critically depend on external supervisions--such as labeled reasoning traces, verified…

Cited by 0SourcecodeScholar
2025

Scaling Diffusion Language Models via Adaptation from Autoregressive Models

ICLR 2025poster

Diffusion Language Models (DLMs) have emerged as a promising new paradigm for text generative modeling, potentially addressing limitations of autoregressive (AR) models. However, current DLMs have been studied at a smaller scale compared to their AR counterparts and lack fair comparison on language…

2025

Self-Bootstrapping for Versatile Test-Time Adaptation

ICML 2025poster

In this paper, we seek to develop a versatile test-time adaptation (TTA) objective for a variety of tasks — classification and regression across image-, object-, and pixel-level predictions. We achieve this through a self-bootstrapping scheme that optimizes prediction consistency between the test im…

Cited by 0SourcePDFScholar
2025

Self-Introspective Decoding: Alleviating Hallucinations for Large Vision-Language Models

ICLR 2025poster

Hallucination remains a significant challenge in Large Vision-Language Models (LVLMs). To alleviate this issue, some methods, known as contrastive decoding, induce hallucinations by manually disturbing the raw vision or instruction inputs and then mitigate them by contrasting the outputs of the orig…

2025

Spurious Feature Eraser: Stabilizing Test-Time Adaptation for Vision-Language Foundation Model

AAAI 2025technical

Vision-language foundation models have exhibited remarkable success across a multitude of downstream tasks due to their scalability on extensive image-text paired data. However, these models also display significant limitations when applied to downstream tasks, such as fine-grained image classificat…

2025

TS-LIF: A Temporal Segment Spiking Neuron Network for Time Series Forecasting

ICLR 2025poster

Spiking Neural Networks (SNNs) offer a promising, biologically inspired approach for processing spatiotemporal data, particularly for time series forecasting. However, conventional neuron models like the Leaky Integrate-and-Fire (LIF) struggle to capture long-term dependencies and effectively proces…

Cited by 0SourcePDFScholar
2025

Test-time Adapted Reinforcement Learning with Action Entropy Regularization

ICML 2025poster

Offline reinforcement learning is widely applied in multiple fields due to its advantages in efficiency and risk control. However, a major problem it faces is the distribution shift between offline datasets and online environments. This mismatch leads to out-of-distribution (OOD) state-action pairs…

Cited by 0SourcePDFScholar
2024

Enhancing Neural Subset Selection: Integrating Background Information into Set Representations

ICLR 2024poster

Learning neural subset selection tasks, such as compound selection in AI-aided drug discovery, have become increasingly pivotal across diverse applications. The existing methodologies in the field primarily concentrate on constructing models that capture the relationship between utility function val…

Cited by 1SourcePDFScholar
2024

LLM-Based Agent Society Investigation: Collaboration and Confrontation in Avalon Gameplay

EMNLP 2024main

This paper explores the open research problem of understanding the social behaviors of LLM-based agents. Using Avalon as a testbed, we employ system prompts to guide LLM agents in gameplay. While previous studies have touched on gameplay with LLM agents, research on their social behaviors is lacking…

2024

Latent Diffusion Transformer for Probabilistic Time Series Forecasting

AAAI 2024technical

The probability prediction of multivariate time series is a notoriously challenging but practical task. This research proposes to condense high-dimensional multivariate time series forecasting into a problem of latent space time series generation, to improve the expressiveness of each timestamp and…

Cited by 34SourcePDFScholar
2024

Mitigating Catastrophic Forgetting in Online Continual Learning by Modeling Previous Task Interrelations via Pareto Optimization

ICML 2024poster

Catastrophic forgetting remains a core challenge in continual learning (CL), where the models struggle to retain previous knowledge when learning new tasks. While existing replay-based CL methods have been proposed to tackle this challenge by utilizing a memory buffer to store data from previous tas…

Cited by 8SourcePDFScholar
2024

SDformer: Similarity-driven Discrete Transformer For Time Series Generation

NeurIPS 2024poster

The superior generation capabilities of Denoised Diffusion Probabilistic Models (DDPMs) have been effectively showcased across a multitude of domains. Recently, the application of DDPMs has extended to time series generation tasks, where they have significantly outperformed other deep generative mod…

Cited by 6SourcePDFScholar
2024

SEGNO: Generalizing Equivariant Graph Neural Networks with Physical Inductive Biases

ICLR 2024spotlight

Graph Neural Networks (GNNs) with equivariant properties have emerged as powerful tools for modeling complex dynamics of multi-object physical systems. However, their generalization ability is limited by the inadequate consideration of physical inductive biases: (1) Existing studies overlook the con…

Cited by 22SourcePDFScholar
2024

Test-Time Model Adaptation with Only Forward Passes

ICML 2024oral

Test-time adaptation has proven effective in adapting a given trained model to unseen test samples with potential distribution shifts. However, in real-world scenarios, models are usually deployed on resource-limited devices, e.g., FPGAs, and are often quantized and hard-coded with non-modifiable pa…

2024

Towards Geometric Normalization Techniques in SE(3) Equivariant Graph Neural Networks for Physical Dynamics Simulations

IJCAI 2024poster

SE(3) equivariance is a fundamental property that is highly desirable to maintain in physical dynamics modeling. This property ensures neural outputs to remain robust when the inputs are translated or rotated. Recently, there have been several proposals for SE(3) equivariant graph neural networks (G…

Cited by 0SourcePDFScholar
2024

WatME: Towards Lossless Watermarking Through Lexical Redundancy

ACL 2024long

Text watermarking has emerged as a pivotal technique for identifying machine-generated text. However, existing methods often rely on arbitrary vocabulary partitioning during decoding to embed watermarks, which compromises the availability of suitable tokens and significantly degrades the quality of…

2023

A Unified View of Deep Learning for Reaction and Retrosynthesis Prediction: Current Status and Future Challenges

IJCAI 2023poster

Reaction and retrosynthesis prediction are two fundamental tasks in computational chemistry. In recent years, these two tasks have attracted great attentions from both machine learning and drug discovery communities. Various deep learning approaches have been proposed to tackle these two problems an…

Cited by 14SourcePDFScholar
2023

BEEF: Bi-Compatible Class-Incremental Learning via Energy-Based Expansion and Fusion

ICLR 2023poster

Neural networks suffer from catastrophic forgetting when sequentially learning tasks phase-by-phase, making them inapplicable in dynamically updated systems. Class-incremental learning (CIL) aims to enable neural networks to learn different categories at multi-stages. Recently, dynamic-structure-bas…

2023

Class-Conditional Sharpness-Aware Minimization for Deep Long-Tailed Recognition

CVPR 2023poster

It's widely acknowledged that deep learning models with flatter minima in its loss landscape tend to generalize better. However, such property is under-explored in deep long-tailed recognition (DLTR), a practical problem where the model is required to generalize equally well across all classes when…

2023

Doubly Stochastic Graph-based Non-autoregressive Reaction Prediction

IJCAI 2023poster

Organic reaction prediction is a critical task in drug discovery. Recently, researchers have achieved non-autoregressive reaction prediction by modeling the redistribution of electrons, resulting in state-of-the-art top-1 accuracy, and enabling parallel sampling. However, the current non-autoregress…

Cited by 9SourcePDFScholar
2023

DrugOOD: Out-of-Distribution Dataset Curator and Benchmark for AI-Aided Drug Discovery – a Focus on Affinity Prediction Problems with Noise Annotations

AAAI 2023technical

AI-aided drug discovery (AIDD) is gaining popularity due to its potential to make the search for new pharmaceuticals faster, less expensive, and more effective. Despite its extensive use in numerous fields (e.g., ADMET prediction, virtual screening), little research has been conducted on the out-of-…

Cited by 122SourcePDFScholar
2023

Fairness-guided Few-shot Prompting for Large Language Models

NeurIPS 2023poster

Large language models have demonstrated surprising ability to perform in-context learning, i.e., these models can be directly applied to solve numerous downstream tasks by conditioning on a prompt constructed by a few input-output examples. However, prior research has shown that in-context learning…

Cited by 82SourcePDFScholar
2023

FusionRetro: Molecule Representation Fusion via In-Context Learning for Retrosynthetic Planning

ICML 2023poster

Retrosynthetic planning aims to devise a complete multi-step synthetic route from starting materials to a target molecule. Current strategies use a decoupled approach of single-step retrosynthesis models and search algorithms, taking only the product as the input to predict the reactants for each pl…

2023

Handling Missing Data via Max-Entropy Regularized Graph Autoencoder

AAAI 2023technical

Graph neural networks (GNNs) are popular weapons for modeling relational data. Existing GNNs are not specified for attribute-incomplete graphs, making missing attribute imputation a burning issue. Until recently, many works notice that GNNs are coupled with spectral concentration, which means the sp…

Cited by 17SourcePDFScholar
2023

ImGCL: Revisiting Graph Contrastive Learning on Imbalanced Node Classification

AAAI 2023technical

Graph contrastive learning (GCL) has attracted a surge of attention due to its superior performance for learning node/graph representations without labels. However, in practice, the underlying class distribution of unlabeled nodes for the given graph is usually imbalanced. This highly imbalanced cla…

Cited by 28SourcePDFScholar
2023

On the Pitfall of Mixup for Uncertainty Calibration

CVPR 2023poster

By simply taking convex combinations between pairs of samples and their labels, mixup training has been shown to easily improve predictive accuracy. It has been recently found that models trained with mixup also perform well on uncertainty calibration. However, in this study, we found that mixup tra…

Cited by 16SourcePDFScholar
2023

Pareto Invariant Risk Minimization: Towards Mitigating the Optimization Dilemma in Out-of-Distribution Generalization

ICLR 2023poster

Recently, there has been a growing surge of interest in enabling machine learning systems to generalize well to Out-of-Distribution (OOD) data. Most efforts are devoted to advancing optimization objectives that regularize models to capture the underlying invariance; however, there often are compromi…

2023

Retaining Beneficial Information from Detrimental Data for Neural Network Repair

NeurIPS 2023poster

The performance of deep learning models heavily relies on the quality of the training data. Inadequacies in the training data, such as corrupt input or noisy labels, can lead to the failure of model generalization. Recent studies propose repairing the model by identifying the training samples that c…

Cited by 0SourcePDFScholar
2023

Towards Stable Test-time Adaptation in Dynamic Wild World

ICLR 2023top-5%

Test-time adaptation (TTA) has shown to be effective at tackling distribution shifts between training and testing data by adapting a given model on test samples. However, the online model updating of TTA may be unstable and this is often a key obstacle preventing existing TTA methods from being depl…

2022

Efficient Test-Time Model Adaptation without Forgetting

ICML 2022spotlight

Test-time adaptation provides an effective means of tackling the potential distribution shift between model training and inference, by dynamically updating the model at test time. This area has seen fast progress recently, at the effectiveness of handling test shifts. Nonetheless, prior methods stil…

2022

GNN-Retro: Retrosynthetic Planning with Graph Neural Networks

AAAI 2022technical

Retrosynthetic planning plays an important role in the field of organic chemistry, which could generate a synthetic route for the target product. The synthetic route is a series of reactions which are started from the available molecules. The most challenging problem in the generation of the synthet…

Cited by 32SourcePDFScholar
2022

Learning Neural Set Functions Under the Optimal Subset Oracle

NeurIPS 2022accept

Learning set functions becomes increasingly important in many applications like product recommendation and compound selection in AI-aided drug discovery. The majority of existing works study methodologies of set function learning under the function value oracle, which, however, requires expensive su…

2022

Local Augmentation for Graph Neural Networks

ICML 2022spotlight

Graph Neural Networks (GNNs) have achieved remarkable performance on graph-based tasks. The key idea for GNNs is to obtain informative representation through aggregating information from local neighborhoods. However, it remains an open question whether the neighborhood information is adequately aggr…

2022

SVIP: Sequence VerIfication for Procedures in Videos

CVPR 2022poster

In this paper, we propose a novel sequence verification task that aims to distinguish positive video pairs performing the same action sequence from negative ones with step-level transformations but still conducting the same task. Such a challenging task resides in an open-set setting without prior a…

Cited by 25PDFcodeScholar
2022

UMIX: Improving Importance Weighting for Subpopulation Shift via Uncertainty-Aware Mixup

NeurIPS 2022accept

Subpopulation shift widely exists in many real-world machine learning applications, referring to the training and test distributions containing the same subpopulation groups but varying in subpopulation frequencies. Importance reweighting is a normal way to handle the subpopulation shift issue by im…

2021

AdaXpert: Adapting Neural Architecture for Growing Data

ICML 2021spotlight

In real-world applications, data often come in a growing manner, where the data volume and the number of classes may increase dynamically. This will bring a critical challenge for learning: given the increasing data volume or the number of classes, one has to instantaneously adjust the neural model…

2021

Communication Efficient Primal-Dual Algorithm for Nonconvex Nonsmooth Distributed Optimization

AISTATS 2021poster

Decentralized optimization problems frequently appear in the large scale machine learning problems. However, few works work on the difficult nonconvex nonsmooth case. In this paper, we propose a decentralized primal-dual algorithm to solve this type of problem in a decentralized manner and the propo…

Cited by 19SourcePDFScholar
2021

Exploring Robustness of Unsupervised Domain Adaptation in Semantic Segmentation

ICCV 2021poster

Recent studies imply that deep neural networks are vulnerable to adversarial examples, i.e., inputs with a slight but intentional perturbation are incorrectly classified by the network. Such vulnerability makes it risky for some security-related applications (e.g., semantic segmentation in autonomou…

Cited by 45PDFcodeScholar
2021

Hierarchical Graph Capsule Network

AAAI 2021technical

Graph Neural Networks (GNNs) draw their strength from explicitly modeling the topological information of structured data. However, existing GNNs suffer from limited capability in capturing the hierarchical graph representation which plays an important role in graph classification. In this paper, we…

2021

Meta-learning Hyperparameter Performance Prediction with Neural Processes

ICML 2021spotlight

The surrogate that predicts the performance of hyperparameters has been a key component for sequential model-based hyperparameter optimization. In practical applications, a trial of a hyper-parameter configuration may be so costly that a surrogate is expected to return an optimal configuration with…

Cited by 22SourcePDFScholar
2021

Meta-learning with an Adaptive Task Scheduler

NeurIPS 2021poster

To benefit the learning of a new task, meta-learning has been proposed to transfer a well-generalized meta-model learned from various meta-training tasks. Existing meta-learning algorithms randomly sample meta-training tasks with a uniform probability, under the assumption that tasks are of equal im…

2021

PSSM-Distil: Protein Secondary Structure Prediction (PSSP) on Low-Quality PSSM by Knowledge Distillation with Contrastive Learning

AAAI 2021technical

Protein secondary structure prediction (PSSP) is an essential task in computational biology. To achieve the accurate PSSP, the general and vital feature engineering is to use multiple sequence alignment (MSA) for Position-Specific Scoring Matrix (PSSM) extraction. However, when only low-quality PSSM…

2020

Adversarial Sparse Transformer for Time Series Forecasting

NeurIPS 2020poster

Many approaches have been proposed for time series forecasting, in light of its significance in wide applications including business demand prediction. However, the existing methods suffer from two key limitations. Firstly, most point prediction models only predict an exact value of each time step…

Cited by 302SourcePDFScholar
2020

Breaking the Curse of Space Explosion: Towards Efficient NAS with Curriculum Search

ICML 2020poster

Neural architecture search (NAS) has become an important approach to automatically find effective architectures. To cover all possible good architectures, we need to search in an extremely large search space with billions of candidate architectures. More critically, given a large search space, we ma…

2020

Contextualized Point-of-Interest Recommendation

IJCAI 2020poster

Point-of-interest (POI) recommendation has become an increasingly important sub-field of recommendation system research. Previous methods employ various assumptions to exploit the contextual information for improving the recommendation accuracy. The common property among them is that similar users a…

Cited by 0SourcePDFScholar
2020

Relation-Aware Transformer for Portfolio Policy Learning

IJCAI 2020poster

Portfolio selection is an important yet challenging task in AI for FinTech. One of the key issues is how to represent the non-stationary price series of assets in a portfolio, which is important for portfolio decisions. The existing methods, however, fall short of capturing: 1) the complicated seq…

2020

RetroXpert: Decompose Retrosynthesis Prediction Like A Chemist

NeurIPS 2020spotlight

Retrosynthesis is the process of recursively decomposing target molecules into available building blocks. It plays an important role in solving problems in organic synthesis planning. To automate or assist in the retrosynthesis analysis, various retrosynthesis prediction algorithms have been propose…

2020

Towards Fast Adaptation of Neural Architectures with Meta Learning

ICLR 2020poster

Recently, Neural Architecture Search (NAS) has been successfully applied to multiple artificial intelligence areas and shows better performance compared with hand-designed networks. However, the existing NAS methods only target a specific task. Most of them usually do well in searching an architectu…

Cited by 104SourcecodeScholar
2019

Complexities in Projection-Free Stochastic Non-convex Minimization

AISTATS 2019poster

For constrained nonconvex minimization problems, we propose a meta stochastic projection-free optimization algorithm, named Normalized Frank Wolfe Updating, that can take any Gradient Estimator (GE) as input. For this algorithm, we prove its convergence rate, regardless of the choice of GE. Using a…

Cited by 35SourcePDFScholar
2019

Graph Convolutional Networks for Temporal Action Localization

ICCV 2019poster

Most state-of-the-art action localization systems process each action proposal individually, without explicitly exploiting their relations during learning. However, the relations between proposals actually play an important role in action localization, since a meaningful action always consists of mu…

Cited by 640PDFcodeScholar
2019

Hyperparameter Learning via Distributional Transfer

NeurIPS 2019poster

Bayesian optimisation is a popular technique for hyperparameter learning but typically requires initial exploration even in cases where similar prior tasks have been solved. We propose to transfer information across tasks using learnt representations of training datasets used in those tasks. This re…

Cited by 35SourcePDFScholar
2019

NAT: Neural Architecture Transformer for Accurate and Compact Architectures

NeurIPS 2019poster

Designing effective architectures is one of the key factors behind the success of deep neural networks. Existing deep architectures are either manually designed or automatically searched by some Neural Architecture Search (NAS) methods. However, even a well-searched architecture may still contain ma…

2018

Towards More Efficient Stochastic Decentralized Learning: Faster Convergence and Sparse Communication

ICML 2018oral

Recently, the decentralized optimization problem is attracting growing attention. Most existing methods are deterministic with high per-iteration cost and have a convergence rate quadratically depending on the problem condition number. Besides, the dense communication is necessary to ensure the conv…

Cited by 68SourcePDFScholar
2017

Projection-free Distributed Online Learning in Networks

ICML 2017poster

The conditional gradient algorithm has regained a surge of research interest in recent years due to its high efficiency in handling large-scale machine learning problems. However, none of existing studies has explored it in the distributed online learning setting, where locally light computation is…

Cited by 91SourcePDFScholar
2016

Matrix Eigen-decomposition via Doubly Stochastic Riemannian Optimization

ICML 2016poster

Matrix eigen-decomposition is a classic and long-standing problem that plays a fundamental role in scientific computing and machine learning. Despite some existing algorithms for this inherently non-convex problem, the study remains inadequate for the need of large data nowadays. To address this gap…

Cited by 5SourcePDFScholar