Skip to content
View mike-liuliu's full-sized avatar
427 followers · 2.4k following

Block or report mike-liuliu

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 250 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
mike-liuliu/README.md

My old email address ([email protected]) is no longer in use. Please use my new address ([email protected]) if you need to contact me. Please do not send me spam. Any spam I receive will be reported.

I have been invited to serve as a reviewer (and program committee member) for AISTATS 2026. AISTATS (International Conference on Artificial Intelligence and Statistics) is a leading conference in machine learning, artificial intelligence, and statistics, particularly well-regarded in North America and Europe. It is renowned for its integration of theory and practice, covering topics ranging from probabilistic models and Bayesian methods to deep learning and large-scale data analysis. The acceptance rate is approximately 30%. The deadline for abstract submissions is September 25, 2025. Submissions are welcome.

9/23/2025:

I received an invitation to review for ICLR 2026. Thank you to the program chairs. ICLR, short for the International Conference on Learning Representations, is one of the top academic conferences in the field of artificial intelligence, focusing particularly on deep learning, representation learning, and their applications. ICLR was founded in 2013 by Turing Award winners Yoshua Bengio and Yann LeCun. Along with NeurIPS and ICML, ICLR is considered one of the three top machine learning conferences. The abstract submission deadline has now passed, and the estimated submissions are 25k+. The results will likely be released after January 8, 2026. Good luck to everyone.

Pinned Loading

  1. Algorithm_4 Algorithm_4 Public

    Source code of the paper "An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph."

    Jupyter Notebook 15

  2. Min-Max-Jump-distance Min-Max-Jump-distance Public

    Source code of the paper "Min-Max-Jump distance and its applications."

    Jupyter Notebook 7

  3. test test Public

    Honor wall and some of my papers.

    4

  4. shortest_path_warm_start shortest_path_warm_start Public

    Source code of the paper "Solving the all pairs shortest path problem after minor update of a large dense graph."

    Jupyter Notebook 3

  5. gl_index gl_index Public

    Source code of the paper "A New Index for Clustering Evaluation Based on Density Estimation."

    Jupyter Notebook 4

  6. Data-for-UM-S-TM Data-for-UM-S-TM Public

    Data for "Topic Model Supervised by Understanding Map"

    2