← Search

Junzhou Huang

72 accepted papers

2026

Breaking the Correlation Plateau: On the Optimization and Capacity Limits of Attention-Based Regressors

ICLR 2026poster

Attention-based regression models are often trained by jointly optimizing Mean Squared Error (MSE) loss and Pearson correlation coefficient (PCC) loss, emphasizing the magnitude of errors and the order or shape of targets, respectively. A common but poorly understood phenomenon during training is th…

Cited by 0SourceScholar
2026

GRAM-DTI: Adaptive Multimodal Representation Learning for Drug–Target Interaction Prediction

ICLR 2026poster

Drug target interaction (DTI) prediction is a cornerstone of computational drug discovery, enabling rational design, repurposing, and mechanistic insights. While deep learning has advanced DTI modeling, existing approaches primarily rely on SMILES–protein pairs and fail to exploit the rich multimoda…

Cited by 0SourceScholar
2026

GenePheno: Interpretable Gene Knockout-Induced Phenotype Abnormality Prediction from Gene Sequences

AAAI 2026technical

Exploring how genetic sequences shape phenotypes is a fundamental challenge in biology and a key step toward scalable, hypothesis-driven experimentation. The task is complicated by the large modality gap between sequences and phenotypes, as well as the pleiotropic nature of gene–phenotype relationsh

Cited by 0SourcePDFScholar
2026

Hyperbolic Gramian Volumes for Multimodal Alignment

CVPR 2026

Multimodal contrastive learning typically relies on pairwise similarities for alignment, but recent work has shown that Gramian volumes can capture higher-order correlations across modalities. However, Euclidean Gramian volumes suffer from volume collapse under L2 normalization, concentrating near u

Cited by 0SourceScholar
2026

Learning from Guidelines: Structured Prompt Optimization for Expert Annotation Tasks

AAAI 2026technical

Deep learning has significantly advanced numerous fields by training on extensive annotated datasets. However, this data-driven paradigm faces limitations such as limited adaptability and high annotation costs, particularly when precise adherence to detailed, domain-specific guidelines is required i

Cited by 0SourcePDFScholar
2026

Universal Guideline-Driven Image Clustering via a Hybrid LLM Agent

CVPR 2026

Unifying image clustering across different clustering scenarios remains challenging due to fundamental gaps among tasks. We introduce a Guideline-Driven Image Clustering Agent, the first universal framework that bridges these gaps through textual guidelines. To incorporate complex guidelines without

Cited by 0SourceScholar
2025

GoBERT: Gene Ontology Graph Informed BERT for Universal Gene Function Prediction

AAAI 2025technical

Exploring the functions of genes and gene products is crucial to a wide range of fields, including medical research, evolutionary biology, and environmental science. However, discovering new functions largely relies on expensive and exhaustive wet lab experiments. Existing methods of automatic funct…

Cited by 0SourcePDFScholar
2025

InversionGNN: A Dual Path Network for Multi-Property Molecular Optimization

ICLR 2025poster

Exploring chemical space to find novel molecules that simultaneously satisfy multiple properties is crucial in drug discovery. However, existing methods often struggle with trading off multiple properties due to the conflicting or correlated nature of chemical properties. To tackle this issue, we i…

2025

TRIDENT: Tri-Modal Molecular Representation Learning with Taxonomic Annotations and Local Correspondence

NeurIPS 2025spotlight

Molecular property prediction aims to learn representations that map chemical structures to functional properties. While multimodal learning has emerged as a powerful paradigm to learn molecular representations, prior works have largely overlooked textual and taxonomic information of molecules for r…

Cited by 0SourcecodeScholar
2025

Zero-Shot Composed Image Retrieval via Dual-Stream Instruction-Aware Distillation

ICCV 2025poster

Composed Image Retrieval (CIR) targets the retrieval of images conditioned on a reference image and a textual modification, but constructing labeled triplets (reference image, textual modification, target image) is inherently challenging. Existing Zero-Shot CIR (ZS-CIR) approaches often rely on well…

Cited by 0SourcePDFScholar
2024

CARES: A Comprehensive Benchmark of Trustworthiness in Medical Vision Language Models

NeurIPS 2024poster

Artificial intelligence has significantly impacted medical applications, particularly with the advent of Medical Large Vision Language Models (Med-LVLMs), sparking optimism for the future of automated and personalized healthcare. However, the trustworthiness of Med-LVLMs remains unverified, posing s…

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

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
2022

ConCL: Concept Contrastive Learning for Dense Prediction Pre-training in Pathology Images

ECCV 2022poster

"Detecting and segmenting objects within whole slide images is essential in computational pathology workflow. Self-supervised learning (SSL) is appealing to such annotation-heavy tasks. Despite the extensive benchmarks in natural images for dense tasks, such studies are, unfortunately, absent in cur…

2022

Deep Implicit Statistical Shape Models for 3D Medical Image Delineation

AAAI 2022technical

3D delineation of anatomical structures is a cardinal goal in medical imaging analysis. Prior to deep learning, statistical shape models (SSMs) that imposed anatomical constraints and produced high quality surfaces were a core technology. Today’s fully-convolutional networks (FCNs), while dominant,…

2022

Energy-Based Learning for Cooperative Games, with Applications to Valuation Problems in Machine Learning

ICLR 2022poster

Valuation problems, such as feature interpretation, data valuation and model valuation for ensembles, become increasingly more important in many machine learning applications. Such problems are commonly solved by well-known game-theoretic criteria, such as Shapley value or Banzhaf value. In this wor…

Cited by 18SourcePDFScholar
2022

Equivariant Graph Mechanics Networks with Constraints

ICLR 2022poster

Learning to reason about relations and dynamics over multiple interacting objects is a challenging topic in machine learning. The challenges mainly stem from that the interacting systems are exponentially-compositional, symmetrical, and commonly geometrically-constrained. Current methods, particular…

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

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

Multimodal Dynamics: Dynamical Fusion for Trustworthy Multimodal Classification

CVPR 2022poster

Integration of heterogeneous and high-dimensional data (e.g., multiomics) is becoming increasingly important. Existing multimodal classification algorithms mainly focus on improving performance by exploiting the complementarity from different modalities. However, conventional approaches are basicall…

Cited by 133PDFcodeScholar
2022

Node-Aligned Graph Convolutional Network for Whole-Slide Image Representation and Classification

CVPR 2022oral

The large-scale whole-slide images (WSIs) facilitate the learning-based computational pathology methods. However, the gigapixel size of WSIs makes it hard to train a conventional model directly. Current approaches typically adopt multiple-instance learning (MIL) to tackle this problem. Among them, M…

Cited by 71PDFcodeScholar
2022

SCL-WC: Cross-Slide Contrastive Learning for Weakly-Supervised Whole-Slide Image Classification

NeurIPS 2022accept

Weakly-supervised whole-slide image (WSI) classification (WSWC) is a challenging task where a large number of unlabeled patches (instances) exist within each WSI (bag) while only a slide label is given. Despite recent progress for the multiple instance learning (MIL)-based WSI analysis, the major l…

2022

Self-Supervised Pre-training for Protein Embeddings Using Tertiary Structures

AAAI 2022technical

The protein tertiary structure largely determines its interaction with other molecules. Despite its importance in various structure-related tasks, fully-supervised data are often time-consuming and costly to obtain. Existing pre-training models mostly focus on amino-acid sequences or multiple sequen…

Cited by 40SourcePDFScholar
2022

Vision-Language Pre-Training With Triple Contrastive Learning

CVPR 2022poster

Vision-language representation learning largely benefits from image-text alignment through contrastive losses (e.g., InfoNCE loss). The success of this alignment strategy is attributed to its capability in maximizing the mutual information (MI) between an image and its matched text. However, simply…

Cited by 351PDFcodeScholar
2021

Diagnose Like A Pathologist: Weakly-Supervised Pathologist-Tree Network for Slide-Level Immunohistochemical Scoring

AAAI 2021technical

The immunohistochemistry (IHC) test of biopsy tissue is crucial to develop targeted treatment and evaluate prognosis for cancer patients. The IHC staining slide is usually digitized into the whole-slide image (WSI) with gigapixels for quantitative image analysis. To perform a whole image prediction…

Cited by 44SourcePDFScholar
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

Functionally Regionalized Knowledge Transfer for Low-resource Drug Discovery

NeurIPS 2021poster

More recently, there has been a surge of interest in employing machine learning approaches to expedite the drug discovery process where virtual screening for hit discovery and ADMET prediction for lead optimization play essential roles. One of the main obstacles to the wide success of machine learni…

Cited by 16SourcePDFScholar
2021

Graph Information Bottleneck for Subgraph Recognition

ICLR 2021poster

Given the input graph and its label/property, several key problems of graph learning, such as finding interpretable subgraphs, graph denoising and graph compression, can be attributed to the fundamental problem of recognizing a subgraph of the original one. This subgraph shall be as informative…

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

Improving Generalization in Meta-learning via Task Augmentation

ICML 2021spotlight

Meta-learning has proven to be a powerful paradigm for transferring the knowledge from previous tasks to facilitate the learning of a novel task. Current dominant algorithms train a well-generalized model initialization which is adapted to each task via the support set. The crux lies in optimizing t…

2021

Learning Diverse-Structured Networks for Adversarial Robustness

ICML 2021spotlight

In adversarial training (AT), the main focus has been the objective and optimizer while the model has been less studied, so that the models being used are still those classic ones in standard training (ST). Classic network architectures (NAs) are generally worse than searched NA in ST, which should…

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

Minimizing Labeling Cost for Nuclei Instance Segmentation and Classification with Cross-domain Images and Weak Labels

AAAI 2021technical

Nucleus instance segmentation and classification in histopathological images is an essential prerequisite in pathology diagnosis/prognosis. However, nucleus annotations (e.g., segmentation and labeling) require domain experts, and annotating nuclei at pixel-level is time-consuming and labor-intensiv…

Cited by 23SourcePDFScholar
2021

Not All Low-Pass Filters are Robust in Graph Convolutional Networks

NeurIPS 2021poster

Graph Convolutional Networks (GCNs) are promising deep learning approaches in learning representations for graph-structured data. Despite the proliferation of such methods, it is well known that they are vulnerable to carefully crafted adversarial attacks on the graph structure. In this paper, we fi…

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

Co-Heterogeneous and Adaptive Segmentation from Multi-Source and Multi-Phase CT Imaging Data: A Study on Pathological Liver and Lesion Segmentation

ECCV 2020poster

Within medical imaging, organ/pathology segmentation models trained on current publicly available and fully-annotated datasets usually do not well-represent the heterogeneous modalities, phases, pathologies, and clinical scenarios encountered in real environments. On the other hand, there are tremen…

Cited by 36SourcePDFScholar
2020

Deep Multimodal Fusion by Channel Exchanging

NeurIPS 2020poster

Deep multimodal fusion by using multiple sources of data for classification or regression has exhibited a clear advantage over the unimodal counterpart on various applications. Yet, current methods including aggregation-based and alignment-based fusion are still inadequate in balancing the trade-off…

2020

Dirichlet Graph Variational Autoencoder

NeurIPS 2020poster

Graph Neural Networks (GNN) and Variational Autoencoders (VAEs) have been widely used in modeling and generating graphs with latent factors. However there is no clear explanation of what these latent factors are and why they perform well. In this work, we present Dirichlet Graph Variational Autoenco…

Cited by 55SourcePDFScholar
2020

DropEdge: Towards Deep Graph Convolutional Networks on Node Classification

ICLR 2020poster

Over-fitting and over-smoothing are two main obstacles of developing deep Graph Convolutional Networks (GCNs) for node classification. In particular, over-fitting weakens the generalization ability on small dataset, while over-smoothing impedes model training by isolating output representations from…

Cited by 1783SourcecodeScholar
2020

Label-Driven Reconstruction for Domain Adaptation in Semantic Segmentation

ECCV 2020poster

Unsupervised domain adaptation enables to alleviate the need for pixel-wise annotation in the semantic segmentation. One of the most common strategies is to translate images from the source domain to the target domain and then align their marginal distributions in the feature space using adversarial…

Cited by 113SourcePDFScholar
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

Revisiting Parameter Sharing for Automatic Neural Channel Number Search

NeurIPS 2020poster

Recent advances in neural architecture search inspire many channel number search algorithms~(CNS) for convolutional neural networks. To improve searching efficiency, parameter sharing is widely applied, which reuses parameters among different channel configurations. Nevertheless, it is unclear how p…

2020

Self-Supervised Graph Transformer on Large-Scale Molecular Data

NeurIPS 2020poster

How to obtain informative representations of molecules is a crucial prerequisite in AI-driven drug design and discovery. Recent researches abstract molecules as graphs and employ Graph Neural Networks (GNNs) for molecular representation learning. Nevertheless, two issues impede the usage of GNNs in…

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

DTWNet: a Dynamic Time Warping Network

NeurIPS 2019poster

Dynamic Time Warping (DTW) is widely used as a similarity measure in various domains. Due to its invariance against warping in the time axis, DTW provides more meaningful discrepancy measurements between two signals than other dis- tance measures. In this paper, we propose a novel component in an ar…

2019

Distributed Inexact Newton-type Pursuit for Non-convex Sparse Learning

AISTATS 2019poster

In this paper, we present a sample distributed greedy pursuit method for non-convex sparse learning under cardinality constraint. Given the training samples uniformly randomly partitioned across multiple machines, the proposed method alternates between local inexact sparse minimization of a Newton-t…

2019

Exploring Fast and Communication-Efficient Algorithms in Large-Scale Distributed Networks

AISTATS 2019poster

The communication overhead has become a significant bottleneck in data-parallel network with the increasing of model size and data samples. In this work, we propose a new algorithm LPC-SVRG with quantized gradients and its acceleration ALPC-SVRG to effectively reduce the communication complexity wh…

Cited by 25SourcePDFScholar
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

Imitation Learning from Observations by Minimizing Inverse Dynamics Disagreement

NeurIPS 2019spotlight

This paper studies Learning from Observations (LfO) for imitation learning with access to state-only demonstrations. In contrast to Learning from Demonstration (LfD) that involves both action and state supervisions, LfO is more practical in leveraging previously inapplicable resources (e.g., videos)…

Cited by 90SourcePDFScholar
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…

2019

Progressive Feature Alignment for Unsupervised Domain Adaptation

CVPR 2019poster

Unsupervised domain adaptation (UDA) transfers knowledge from a label-rich source domain to a fully-unlabeled target domain. To tackle this task, recent approaches resort to discriminative domain transfer in virtue of pseudo-labels to enforce the class-level distribution alignment across the source…

Cited by 544PDFScholar
2018

Adaptive Sampling Towards Fast Graph Representation Learning

NeurIPS 2018poster

Graph Convolutional Networks (GCNs) have become a crucial tool on learning representations of graph vertices. The main challenge of adapting GCNs on large-scale graphs is the scalability issue that it incurs heavy cost both in computation and memory due to the uncontrollable neighborhood expansion a…

Cited by 640SourcePDFScholar
2018

Adversarial Learning with Local Coordinate Coding

ICML 2018oral

Generative adversarial networks (GANs) aim to generate realistic data from some prior distribution (e.g., Gaussian noises). However, such prior distribution is often independent of real data and thus may lose semantic information (e.g., geometric structure or content in images) of data. In practice,…

Cited by 44SourcePDFScholar
2018

Discrimination-aware Channel Pruning for Deep Neural Networks

NeurIPS 2018poster

Channel pruning is one of the predominant approaches for deep model compression. Existing pruning methods either train from scratch with sparsity constraints on channels, or minimize the reconstruction error between the pre-trained feature maps and the compressed ones. Both strategies suffer from s…

2018

End-to-End Learning of Motion Representation for Video Understanding

CVPR 2018poster

Despite the recent success of end-to-end learned representations, hand-crafted optical flow features are still widely used in video analysis tasks. To fill this gap, we propose TVNet, a novel end-to-end trainable neural network, to learn optical-flow-like features from data. TVNet subsumes a specifi…

Cited by 265SourcePDFScholar
2018

Error Compensated Quantized SGD and its Applications to Large-scale Distributed Optimization

ICML 2018oral

Large-scale distributed optimization is of great importance in various applications. For data-parallel based distributed learning, the inter-node gradient communication often becomes the performance bottleneck. In this paper, we propose the error compensated quantized stochastic gradient descent alg…

Cited by 286SourcePDFScholar
2018

Weakly Supervised Dense Event Captioning in Videos

NeurIPS 2018poster

Dense event captioning aims to detect and describe all events of interest contained in a video. Despite the advanced development in this area, existing methods tackle this task by making use of dense temporal annotations, which is dramatically source-consuming. This paper formulates a new problem: w…

2018

Weakly Supervised Region Proposal Network and Object Detection

ECCV 2018poster

The Convolutional Neural Network (CNN) based region proposal generation method (i.e. region proposal network), trained using bounding box annotations, is an essential component in modern fully supervised object detectors. However, Weakly Supervised Object Detection (WSOD) has not benefited from CNN-…

Cited by 247SourcePDFScholar
2017

Efficient Optimization for Linear Dynamical Systems with Applications to Clustering and Sparse Coding

NeurIPS 2017poster

Linear Dynamical Systems (LDSs) are fundamental tools for modeling spatio-temporal data in various disciplines. Though rich in modeling, analyzing LDSs is not free of difficulty, mainly because LDSs do not comply with Euclidean geometry and hence conventional learning techniques can not be applied d…

Cited by 12SourcePDFScholar
2017

WSISA: Making Survival Prediction From Whole Slide Histopathological Images

CVPR 2017poster

Image-based precision medicine techniques can be used to better treat cancer patients. However, the gigapixel resolution of Whole Slide Histopathological Images (WSIs) makes traditional survival models computationally impossible. These models usually adopt manually labeled discriminative patches fro…

Cited by 360PDFcodeScholar