← Search

Can Chen

18 accepted papers

2026

Dismantling Pathological Shortcuts: A Causal Framework for Faithful LVLM Decoding

ICML 2026poster

Large Vision-Language Models (LVLMs) exhibit sophisticated reasoning but remain susceptible to object hallucination. Deviating from the prevailing attention intensity assumption, we reveal a deeper dynamic structural misalignment: hallucination is triggered at decision-critical steps where specific …

Cited by 0SourceScholar
2026

MoCo-EA: Exploiting Adversarial Mode Connectivity for Efficient Evolutionary Attacks

ICML 2026poster

Evolutionary algorithms for adversarial attacks leverage population-based search to discover perturbations without gradient information, but suffer from inefficient crossover operations that destroy adversarial properties through discrete interpolation. We introduce Mode Connectivity Evolutionary At…

Cited by 0SourceScholar
2026

Support-Proximity Augmented Diffusion Estimation for Offline Black-Box Optimization

ICML 2026poster

Offline black-box optimization aims to discover novel designs with high property scores using only a static dataset, a task fundamentally challenged by the out-of-distribution (OOD) extrapolation problem. Existing approaches typically bifurcate into inverse methods, which struggle with the ill-posed…

Cited by 0SourceScholar
2026

Training Diffusion Language Models for Black-Box Optimization

ICML 2026spotlight

We study offline black-box optimization (BBO), aiming to discover improved designs from an offline dataset of designs and labels, a problem common in robotics, DNA, and materials science with limited labeled samples. While recent work applies autoregressive LLMs to BBO by formatting tasks as natural…

Cited by 0SourceScholar
2025

3DMolFormer: A Dual-channel Framework for Structure-based Drug Discovery

ICLR 2025poster

Structure-based drug discovery, encompassing the tasks of protein-ligand docking and pocket-aware 3D drug design, represents a core challenge in drug discovery. However, no existing work can deal with both tasks to effectively leverage the duality between them, and current methods for each task are…

2025

AffinityFlow: Guided Flows for Antibody Affinity Maturation

ICML 2025poster

Antibodies are widely used as therapeutics, but their development requires costly affinity maturation, involving iterative mutations to enhance binding affinity. This paper explores a sequence-only scenario for affinity maturation, using solely antibody and antigen sequences. Recently AlphaFlow wrap…

Cited by 0SourcePDFScholar
2025

Fast and Interpretable Mixed-Integer Linear Program Solving by Learning Model Reduction

AAAI 2025technical

By exploiting the correlation between the structure and the solution of Mixed-Integer Linear Programming (MILP), Machine Learning (ML) has become a promising method for solving large-scale MILP problems. Existing ML-based MILP solvers mainly focus on end-to-end solution learning, which suffers from…

Cited by 2SourcePDFScholar
2023

A Flow-Guided Non-Local Alignment Network for Video Compressive Sensing Reconstruction

ICASSP 2023accepted

Video compressive sensing (VCS) presents a promising encoder paradigm for efficient video signals acquisition at resource-limited applications. In order to recover complete and accurate signals at the decoder, powerful reconstruction algorithms are desired to exploit rich temporal redundancies withi…

Cited by 0SourceScholar
2023

Bidirectional Learning for Offline Model-based Biological Sequence Design

ICML 2023poster

Offline model-based optimization aims to maximize a black-box objective function with a static dataset of designs and their scores. In this paper, we focus on biological sequence design to maximize some sequence score. A recent approach employs bidirectional learning, combining a forward mapping for…

2023

Importance-aware Co-teaching for Offline Model-based Optimization

NeurIPS 2023poster

Offline model-based optimization aims to find a design that maximizes a property of interest using only an offline dataset, with applications in robot, protein, and molecule design, among others. A prevalent approach is gradient ascent, where a proxy model is trained on the offline dataset and then…

2023

Parallel-mentoring for Offline Model-based Optimization

NeurIPS 2023poster

We study offline model-based optimization to maximize a black-box objective function with a static dataset of designs and scores. These designs encompass a variety of domains, including materials, robots, DNA sequences, and proteins. A common approach trains a proxy on the static dataset and perform…

2022

Bidirectional Learning for Offline Infinite-width Model-based Optimization

NeurIPS 2022accept

In offline model-based optimization, we strive to maximize a black-box objective function by only leveraging a static dataset of designs and their scores. This problem setting arises in numerous fields including the design of materials, robots, DNAs, proteins, etc. Recent approaches train a deep neu…

2021

Generalized DataWeighting via Class-Level Gradient Manipulation

NeurIPS 2021poster

Label noise and class imbalance are two major issues coexisting in real-world datasets. To alleviate the two issues, state-of-the-art methods reweight each instance by leveraging a small amount of clean and unbiased data. Yet, these methods overlook class-level information within each instance, whic…