Can Jin

Ph.D. Candidate in Computer Science, Rutgers University

personal3.jpg
CBIM, Busch Campus can.jin@rutgers.edu

I am a Ph.D. Candidate in Computer Science at Rutgers University, New Brunswick, advised by Professor Dimitris N. Metaxas. My research interests include Efficient Pre-training/Post-training/Inference of Foundation Models.

I earned my M.S. and B.S. degrees in Mathematics from the University of Science and Technology of China (USTC). Before my doctoral studies, I worked as a Machine Learning Engineer at Meituan Dianping Corporation. Recently, as a Research Intern at Adobe Research, I focused on the efficient pre-training of foundation models (LLMs/DiTs/omni-models) via Dense/MoE architectures.

I am actively seeking research internship opportunities starting from 2027, focusing on Efficient Pre-training/Post-training/Inference of Foundation Models. You can find my CV here.

Selected Publications

My research is organized around three core stages of foundation model development: pre-training, post-training, and inference. Across these directions, I work on making large models more capable, efficient, and reliable for reasoning, coding, alignment etc.

Pre-training
  • Focus: Investigating foundation model pre-training through efficient architecture design, generalizable training strategies, and scaling laws.
  1. DTop-p MoE: Sparsity-Controlled Dynamic Top-p MoE for Foundation Model Pre-training
    Can Jin*Hongwu Peng*, Mingcan Xiang, Qixin Zhang, Xiangchi Yuan, Amit Hasan, Ohiremen Dibua, Yifan Gong, Yan Kang, and Dimitris N. Metaxas
    In Forty-third International Conference on Machine Learning, 2026
    Propose DTop-p MoE, a dynamic routing mechanism that utilizes a Proportional-Integral controller and dynamic routing normalization to precisely control expert activation sparsity while adapting to varying token difficulty. DTop-p outperforms Top-k and Top-p MoE across Large Language Models and Diffusion Transformers.
  2. Learning from Teaching Regularization: Generalizable Correlations Should be Easy to Imitate
    In Advances in Neural Information Processing Systems, 2024
    Develop Learning from Teaching (LoT), a novel regularization technique for deep neural networks that enhances model generalization by training a teacher model to prioritize features that are easier for a student model to imitate, thereby filtering out spurious correlations.
Post-training
  • Focus: Investigating post-training techniques such as reinforcement learning, on-policy distillation, supervised fine-tuning, prompt-based adaptation, and pruning for efficient reasoning, coding, alignment, and adaptation.
  1. Act More, Decide Less: Skill-Guided Adaptive Action Chunking for Long-Horizon LLM Agents
    Yanting Yang*Can Jin* , Jinman Zhao, Jiahao Wu, Yang Zhou , Zhepeng Wang , Zhendong Wang , Mu Zhou, and Dimitris N. Metaxas
    In Findings of the Association for Computational Linguistics: EMNLP 2026, 2026
    Propose SPACE, a skill-guided adaptive action-chunking framework with hybrid on-/off-policy training and chunk-aware credit assignment, improving success rates by 7.0%–31.3% over the strongest baselines on ALFWorld and ScienceWorld while reducing LLM decision rounds by up to 78.9%.
  2. DARE: Difficulty-Adaptive Reinforcement Learning with Co-Evolved Difficulty Estimation
    Yang Zhou*Can Jin*, Zihan Dong , Zhepeng Wang, Yanting Yang, Shiyu Zhao , Lei Li, Runxue Bao, Yaochen Xie, and Dimitris N. Metaxas
    2026
    Introduce DARE, a difficulty-adaptive Reinforcement Learning framework that co-evolves policy-aligned difficulty estimation with dynamic data selection and difficulty-specific optimization, improving training efficiency, final accuracy, and inference-token efficiency for LLM reasoning.
  3. Weak Critics Make Strong Learners: On-Policy Critique Distillation for Scalable Oversight
    Can Jin* , Jiakang Li*, Rui Wu , Eddy Z. Zhang, and Dimitris N. Metaxas
    In 3rd AI for Math Workshop: Toward Self-Evolving Scientific Agents, 2026
    We propose weak-critic strong oversight and on-policy critique distillation (OPCD), showing that weak models can guide stronger models through useful critiques while improving alignment and reasoning performance.
  4. Reasoning over Precedents Alongside Statutes: Case-Augmented Deliberative Alignment for LLM Safety
    Can Jin*, Rui Wu*Tong Che*Qixin ZhangHongwu Peng , Jiahui Zhao, Zhenting Wang, Wenqi Wei, Ligong Han , Zhao Zhang, Yuan CaoRuixiang Tang, and Dimitris N. Metaxas
    In The 64th Annual Meeting of the Association for Computational Linguistics, 2026
    Propose CADA, a case-augmented deliberative alignment framework that leverages reinforcement learning on self-generated reasoning chains to transition from rigid rule enforcement to flexible case-based reasoning, significantly reducing over-refusal while enhancing robustness against jailbreak attacks.
  5. LoR-VP: Low-Rank Visual Prompting for Efficient Vision Model Adaptation
    Can Jin , Ying Li , Mingyu Zhao, Shiyu ZhaoZhenting WangXiaoxiao HeLigong HanTong Che, and Dimitris N. Metaxas
    In The Thirteenth International Conference on Learning Representations, 2025
    Design LoR-VP, a low-rank visual prompting technique for efficient vision model adaptation that reduces trainable parameters while outperforming full fine-tuning and standard visual prompting methods on object detection and segmentation benchmarks.
  6. Visual Prompting Upgrades Neural Network Sparsification: A Data-Model Perspective
    Can Jin*Tianjin Huang* , Yihua Zhang, Mykola PechenizkiySijia LiuShiwei Liu, and Tianlong Chen
    In Proceedings of the AAAI Conference on Artificial Intelligence, 2025
    Propose VPNs, a novel data-model co-design framework that simultaneously optimizes visual prompts and network sparsity, significantly enhancing the performance and transferability of sparse vision models.
Inference
  • Focus: Investigating inference-time techniques such as test-time search, refinement/critiquing, prompt engineering, and multi-agent systems for improving reasoning, coding, retrieval, and agentic performance.
  1. Two Heads are Better Than One: Test-time Scaling of Multi-agent Collaborative Reasoning
    Can JinHongwu PengQixin ZhangYang Zhou , Yujin Tang, Tong Che, and Dimitris N. Metaxas
    In Findings of the Association for Computational Linguistics: EMNLP 2026, 2026
    Develop MAS-TTS, a framework that integrates a specialized multi-agent training pipeline with an adaptive CEO agent to orchestrate collaborative reasoning, effectively optimizing test-time scaling for complex tasks.
  2. Latent Reward Steering: An Adaptive Inference-Time Framework that Implicitly Promotes Cognitive Behaviors in Reasoning LLMs
    Jiakang Li*, Guanyu Zhu*Can Jin* , Chenxi Huang, Dexu Yu , Ronghao Chen, Yang ZhouHongwu Peng, Xuanqi Lan, Dimitris N. Metaxas , and Youhua Li
    In Findings of the Association for Computational Linguistics: EMNLP 2026, 2026
    Introduce LRS, an adaptive inference-time framework that learns reward gradients from correctness-labeled reasoning traces to selectively steer fragile SAE latent states, consistently improving reasoning across multiple LLM backbones and benchmarks.
  3. APEER: Automatic Prompt Engineering Enhances Large Language Model Reranking (Best Paper Award @ RelWeb)
    In Companion Proceedings of the ACM Web Conference 2025, Sydney, NSW, Australia, 2025
    Propose APEER, a novel automatic prompt engineering algorithm that iteratively generates and refines prompts to enhance the performance and transferability of Large Language Models in information retrieval reranking tasks.

Academic Services

Teaching Assistant
  • Rutgers University: CS344: Algorithms (Spring 2026), CS211: Computer Architecture (Fall 2025), CS534: Computer Vision (Spring 2025), CS210: Data Management for Data Science (Fall 2024)
Peer Review
  • Conference: NeurIPS 25/26, ICLR 25/26, ICML 24/26, CVPR 25/26, ECCV 26, AAAI 26/27, etc.
  • Journal: Alexandria Engineering Journal, Information Fusion, Pattern Recognition, Signal Processing