Personal belief hero image

I’m Jingming Liang (Brighton), a senior undergraduate in Computer Science at Nankai University. I expect to begin my PhD at the Nankai–Baidu Joint Laboratory (NBJL) in 2027. Originally from Dalian, I also pursue minors in Finance and Criminal Law.

I build open-source tools and share learning resources through Lamplighter Commons, and contribute to StarryOS / tgoskits (merged contributions). For research and collaboration, reach me at liangjm@nbjl.nankai.edu.cn.

Research Interests:

  • AI Infrastructure (AI Infra): Scalable systems for AI training and inference, with a focus on distributed execution, communication, resource scheduling, and efficient model serving.
  • Heterogeneous Computing and GPU Optimization: Hardware-aware optimization across CPUs, GPUs, and NPUs, including efficient kernels and runtimes, with applications to on-device AI under memory and power constraints.
  • Embodied Intelligence and Systems Optimization: Efficient execution of perception and decision-making models, with an interest in deployment under real-time, memory, and compute constraints.

🔥 News

  • [Oct 2026]Open Source
    Lamplighter Commons I founded Lamplighter Commons to share open-source tools and learning resources.
  • [Aug 2026]Competitions
    National awards in AI systems Received national third prizes in the Xiandao Cup and Operating System Design Contest, plus Third Prize and the Special Contribution Award in the CANN-HCCL competition.

📝 Projects and Research

Selected Systems Projects

GPU Systems
APSP GPU optimization project overview

GPU Optimization for All-Pairs Shortest Path

Individual competition project · Aug–Sep 2025 · CCF-TCARCH National Champion

  • Designed a memory-aware 3-stage blocked Floyd–Warshall pipeline to reduce bandwidth pressure in dense APSP computation, using shared memory to improve data locality.
  • Optimized kernel execution through fusion, dual-stream scheduling, double buffering, and reduced synchronization overhead. Further compressed host-to-device transfer cost from O(V²) to O(E) via custom I/O and device-side graph reconstruction.
  • Ranked 1st nationally as an individual competitor, reducing end-to-end runtime by 52.9% on the official hidden datasets (11.50s → 5.42s), equivalent to a 2.12× speedup through profiling-driven optimization and systematic performance tuning.
On-Device AI
Our tennis-ball retrieval robot holding a ball on the actual operating-system competition floor, beside the collection bucket.

On-Device AIOS on RK3588 and StarryOS

Team competition project · May–Aug 2026 · Team captain; perception-to-control integration and OS performance optimization.

  • Integrated UVC image acquisition, RKNN/NPU inference, object detection, and robotic-arm control into a tennis-ball retrieval robot running on RK3588 and StarryOS.
  • Diagnosed RKNPU execution and SMP scheduling, fixing hot-path logging stalls and tasks remaining on a single core. In the project measurements, rknn_run latency fell from 817 to 211 ms.
  • Improved the four-thread speedup from 0.96× to 3.45× in the project tests; the team received a National Third Prize in the 2026 Operating System Design Contest.
AI Infrastructure
Conceptual illustration of Qwen3.5-27B serving with vLLM, KV cache, and TP=2 across two DCU accelerators.

LLM Inference Serving on Domestic DCUs

Individual competition project · Jul–Aug 2026 · Kernel and serving optimization.

  • Profiled Qwen3.5-27B with vLLM for long-context inference on domestic DCUs, separating prefill/decode bottlenecks and analyzing attention and paged KV-cache paths.
  • Optimized compute and memory access with FlashAttention, Triton GEMV, and CUDA Graph, and adapted TP=2 tensor parallelism and Custom AllReduce for two-device serving.
  • Completed optimization from individual kernels to the serving pipeline, placing 12th nationally and receiving a National Third Prize in the 2026 Xiandao Cup.

Research

Multimodal MoE
CMRD pipeline: controlled routing probes, same-question controls, and diagnosis-guided mitigation.

Diagnosing and Mitigating Noun-Driven Routing Bias in Multimodal Mixture-of-Experts

Research project · Apr–Jun 2026 · Routing probe design and experimental evaluation.

  • Developed CMRD (Controlled MoE Routing Decomposition), a training-free probe using text anchors and controlled pre-router interventions to examine noun-driven visual routing shifts.
  • Used same-question controls to approximately separate broad-semantic effects from a queried-specific residual, identifying a shared layer-10 routing hotspot in MoE-LLaVA-Qwen.
  • Evaluated Noun-Blind Routing and Two-Stage Verification for object-existence hallucination. On POPE-9000, Two-Stage Verification reduced false positives by about 60% and improved accuracy from 81.7% to 88.2%, while increasing false negatives.
Diffusion Models
K-LoRA project overview

Original K-LoRA: Ouyang et al., CVPR 2025. This overview provides background for the K-LoRA++ competition extension.

Adaptive Weight Scheduling for Image Diffusion Models (K-LoRA++)

Competition research project · Apr–Oct 2025 · Schedule formulation, evaluation, and demo development; National Third Prize in Challenge Cup.

  • Extended the original K-LoRA framework for training-free subject/style LoRA fusion by mathematically formulating and evaluating 8 distinct stage-aware scaling schedules across diffusion timesteps.
  • Compared the schedules through first-order derivative analysis and cross-domain experiments; a constant-derivative linear schedule gave the best content/style balance among the evaluated schedules in the tested settings, with less structural distortion and visual jitter.
  • Facilitated the end-to-end development of the project’s interactive demo and drove its practical deployment for downstream generative applications.
LTSF
SparseTSF-FFT framework overview

SparseTSF-FFT: A Frequency-Domain Framework for Time Series Forecasting

Course project · Sep–Dec 2024 · Framework migration and model extension.

  • Reimplemented and extended SparseTSF from PyTorch to MindSpore, including custom API mappings and reconstruction of the training/evaluation pipeline for cross-framework deployment.
  • Designed an FFT-based learnable filtering module to replace local sliding-window convolutions, aiming to better capture long-range periodic structure under a lightweight parameter budget.
  • Conducted cross-framework profiling and forecasting evaluations, observing improved long-horizon performance (e.g., at 336 and 720 steps on ETTh1/ETTh2) relative to the baseline in the evaluated settings.

Other Engineering Projects

Information Systems
RaceRadar iOS app overview

RaceRadar: An End-to-End iOS System for Aggregating and Prioritizing Competition Opportunities

Independent engineering project · Nov 2025–present · App Store release in preparation

  • Built a fault-tolerant, multi-source ingestion pipeline that continuously crawls, cleans, deduplicates, and ranks competition announcements, publishing a unified JSON feed through scheduled GitHub Actions workflows.
  • Developed a native iOS app in Swift/Xcode with card-based discovery, detailed opportunity pages, deadline-aware prioritization, source/category tagging, and shareable competition posters.
  • Designed the system around real student workflows, translating automated data ingestion and ranking into a deployable user-facing information system for discovering higher-quality and time-sensitive opportunities.

Open source

GitHub profile
eprogressing/triangle-light-maze-solver

Triangle Light Maze Solver

A solver for triangular-maze questions in online coding assessments at well-known companies. Dynamic programming finds the path that collects the most lights, with interactive results.

  • 53 stars
  • 7 forks
  • JavaScript
  • MIT

GitHub statistics as of .

🎖 Honors and Awards

🏆 Competition Awards

2026

2025

2024

Teaching, Leadership, and Service

Roles

Sep 2025 - Jan 2026

Teaching Assistant

Computer Hardware Fundamentals

Sep 2025 - Jan 2026

Student Assistant

Youth League Committee Office

Sep 2023 - Present

Class Monitor & Youth League Branch Deputy Secretary

School of Computer Science

Service Impact

249.9h Volunteer Service 153h Social Practice 530h Peer Learning Support TEDx Official Volunteer

Selected Honors

2026

Outstanding Communist Youth League Member

Nankai University May Fourth Honors

2024, 2025

Outstanding Student Cadre

2025

Outstanding Team

Nankai Xiong'an Summer Social Practice

2025

Outstanding Individual

Teachers and Students Together in Four Aspects Social Practice

2025

Leader of the May Fourth Red Flag Youth League Group

2025

Outstanding Class Youth League Branch

2023

Official Representative

Nankai University Student Congress

2024

Outstanding Officer

Organization Department, Youth League Committee

🏅 Scholarships

2026

2026.10 CNY 5,000
Gongneng Scholarship

Nankai University

2025

2025.11 CNY 2,000
Academic Progress Scholarship

Nankai University

2025.11 CNY 2,000
Student Service Scholarship

Nankai University

2024

2024.11 CNY 2,000
Social Welfare Scholarship

Nankai University

2024.11 CNY 2,000
Student Service Scholarship

Nankai University

📖 Education

Nankai University, School of Computer Science

Sep 2023 - Jun 2027 (Expected)

B.Eng. Candidate in Computer Science and Technology

Minors: Finance, Criminal Law.

985 Project 211 Project Double First-Class
Nankai University emblem

University of Macau, Faculty of Science and Technology

Exchange Programme Admission

Admitted to the exchange programme in Computer and Information Science

Admission offer International Exchange Macau SAR
University of Macau emblem

💼 Internships

📡 Technical Communication

Public Engagement

I share computer science study notes and learning resources on Rednote, making course material accessible to a wider student audience.

CS and AI Educational Outreach

Account statistics as of October 2026.

6,211 followers 3M+ total views 156k likes and saves

Beyond Research

Outside computing, I play the violin and classical guitar, with Grade 10 certifications in both from the China Conservatory of Music. I also enjoy volleyball, marathon running, and independent travel.

Running moment