Zhanfeng Mo

Orcid: 0000-0003-2254-8651

According to our database1, Zhanfeng Mo authored at least 11 papers between 2019 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
MiroMind-M1: An Open-Source Advancement in Mathematical Reasoning via Context-Aware Multi-Stage Policy Optimization.
CoRR, July, 2025

100 Days After DeepSeek-R1: A Survey on Replication Studies and More Directions for Reasoning Language Models.
CoRR, May, 2025

Parameter and Memory Efficient Pretraining via Low-rank Riemannian Optimization.
Proceedings of the Thirteenth International Conference on Learning Representations, 2025

Probabilistic Neural Pruning via Sparsity Evolutionary Fokker-Planck-Kolmogorov Equation.
Proceedings of the Thirteenth International Conference on Learning Representations, 2025

2024
Fast Graph Generation via Spectral Diffusion.
IEEE Trans. Pattern Anal. Mach. Intell., May, 2024

Graph Principal Flow Network for Conditional Graph Generation.
Proceedings of the ACM on Web Conference 2024, 2024

Learning Adaptive Multiresolution Transforms via Meta-Framelet-based Graph Convolutional Network.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
Group-shrinkage feature selection with a spatial network for mining DNA methylation data.
Comput. Biol. Medicine, March, 2023

Panda LLM: Training Data and Evaluation for Open-Sourced Chinese Instruction-Following Large Language Models.
CoRR, 2023

Pruning via Sparsity-indexed ODE: a Continuous Sparsity Viewpoint.
Proceedings of the International Conference on Machine Learning, 2023

2019
Theoretical Investigation of Generalization Bound for Residual Networks.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019


  Loading...