Kun He
68 papers · 2016–2026 · 13 venues · across top CS/AI venues
This profile combines several different researchers. Authors are keyed by name, and this name's papers fall into 10 separate collaboration groups - the largest holds only 41% of them. Pick the group below that matches the researcher you mean. How a shared name is split.
Achievements are not shown for a combined profile - each one describes a single researcher's record, which this is not.
Which Kun He?
7 groups of papers that share co-authors internally but none with each other - each most likely a different researcher. Pick one to see its papers.
with John E. Hopcroft, Chu-Min Li, Jiongzhi Zheng
28 papers
· 2016–2025
· AAAI, IJCAI, ICLR
Hide ▲
Exact Algorithms with New Upper Bounds for the Maximum k-plex Problem
IJCAI 2025
Hierarchically Encapsulated Representation for Protocol Design in Self-Driving Labs
ICLR 2025
Neural Collapse Inspired Knowledge Distillation
AAAI 2025
Targeted control of fast prototyping through domain-specific interface
ICML 2025
KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem
AAAI 2024
Leveraging Contrastive Learning for Enhanced Node Representations in Tokenized Graph Transformers
NeurIPS 2024
Long-range Meta-path Search on Large-scale Heterogeneous Graphs
NeurIPS 2024
Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers
IJCAI 2024
You Only Need Less Attention at Each Stage in Vision Transformers
CVPR 2024
Differentiable Meta Multigraph Search with Partial Message Propagation on Heterogeneous Information Networks
AAAI 2023
FABind: Fast and Accurate Protein-Ligand Binding
NeurIPS 2023
Farsighted Probabilistic Sampling: A General Strategy for Boosting Local Search MaxSAT Solvers
AAAI 2023
Hybrid Learning with New Value Function for the Maximum Common Induced Subgraph Problem
AAAI 2023
NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs
ICLR 2023
On the Complexity of Bayesian Generalization
ICML 2023
Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem
AAAI 2023
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem
IJCAI 2022
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit
IJCAI 2022
Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract)
IJCAI 2022
Stochastic Variance Reduced Ensemble Adversarial Attack for Boosting the Adversarial Transferability
CVPR 2022
Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem
AAAI 2021
A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems
AAAI 2020
Nesterov Accelerated Gradient and Scale Invariance for Adversarial Attacks
ICLR 2020
Robust Local Features for Improving the Generalization of Adversarial Training
ICLR 2020
Single Image Reflection Removal Through Cascaded Refinement
CVPR 2020
Improving the Generalization of Adversarial Training with Domain Adaptation
ICLR 2019
Towards Understanding Learning Representations: To What Extent Do Different Neural Networks Learn the Same Representation
NeurIPS 2018
A Powerful Generative Model Using Random Weights for the Deep Image Representation
NeurIPS 2016