Seungmin Oh

Seungmin Oh 오승민

Ph.D. Candidate, Multi-Modal Artificial Intelligence Lab, Ajou UniversityAdvised by Prof. Jongbin Ryu

I make large neural networks efficient enough to run on edge devices under tight compute limits.

News

  • Sep 2026

    Paper accepted to NeurIPS 2026.

  • Aug 2026

    Two papers accepted to EMNLP 2026.

  • Aug 2026

    Paper accepted to BMVC 2026.

  • Sep 2025

    Selected for the Doctoral Research Grant from NRF Korea.

  • Apr 2025

    First place at the IEEE Low-Power Computer Vision Challenge, CVPR 2025.

  • Sep 2024

    Paper accepted to ACCV 2024.

  • Sep 2024

    Filed a PCT patent on CT-based small bowel obstruction triage.

  • Apr 2024

    Paper published in Scientific Reports.

  • Dec 2023

    Paper published in the International Journal of Surgery.

Research

Efficient VLA

I want VLA policies to hold up inside real robot control loops, which means three things at once: training that transfers across embodiments, inference cheap enough to run every control step, and failures caught early enough for the policy to recover.

Efficient LLM compression

Structured pruning leaves a model that has to relearn what was removed. I work on giving that recovery enough capacity, and on scheduling compression so the error that accumulates in deeper layers is paid down first (EMNLP 2026).

Efficient vision and test-time adaptation

Making vision models cheap without giving up accuracy: re-parameterization at branch level (ACCV 2024), transfer that keeps a vision-language model general (BMVC 2026), and test-time adaptation that verifies candidate labels instead of adjusting predictions (NeurIPS 2026). The same drive won Track 1 of the 2025 IEEE Low-Power Computer Vision Challenge.

Publications

  1. NeurIPS’26

    Efficient Test-time Adaptation through Candidate Verification and Divergence Shifts

    • VLM
    • EfficientAI
    • Test-time Adaptation
  2. EMNLP’26

    Layer-wise Curriculum Learning for Efficient LLM Compression

    • LLM
    • EfficientAI
    • Curriculum Learning
  3. EMNLP’26

    Train Overcomplete, Deploy Compact: Scaling Recovery Capacity for Structured LLM Pruning

    • LLM
    • EfficientAI
    • Re-parameterization
  4. BMVC’26

    Re-calibrated Contrastive Loss for Transformation-Aware Prompt Conditioning in Vision-Language Models

    • VLM
    • Learning Methodology
  1. arXiv’25

    Evaluation of Winning Solutions of 2025 Low Power Computer Vision Challenge

    • VLM
    • EfficientAI
    • Edge Deployment
  1. ACCV’24

    Neural Substitution for Branch-Level Network Re-parameterization

    • Vision
    • Re-parameterization
  2. Sci Rep’24

    Analyzing to Discover Origins of CNNs and ViT Architectures in Medical Images

    • Vision
    • Architecture
    • Analysis
  1. IJS’23IF 15.3, JCR top 1%

    Deep Learning Using Computed Tomography to Identify High-Risk Patients for Acute Small Bowel Obstruction

    • Vision
    • 3D CNN
    • Clinical Prediction

Patents

  • System and Method for Compressing a Deep Learning Model Based on Layer-Wise Curriculum Learning

    Jongbin Ryu, Dooyeon Na, Seungmin Oh, Donggeon Lee

    Korean Patent Application No. 10-2026-0123632, filed Jul 2026

  • Electronic Device and Method for Classifying Small Bowel Obstruction Using Abdominal Computed Tomography Images

    Hojung Shin, Jongbin Ryu, Seungmin Oh

    PCT International Patent Application No. PCT/KR2024/014604, filed Sep 2024

Projects

  • Real-time detection transformer for autonomous driving, 42dot

  • Source-free domain adaptation for on-device face recognition, ETRI

  • Masked-face recognition with domain adaptation, ETRI

  • Lymphoma recognition and survival analysis from 3D CT, NIA

Research funding

  • Doctoral Research Grant, $36K

    NRF Korea, Sep 2025 – Aug 2027

    Progressive Linear Activation for Depth-wise Reparameterization of Large-scale Models

  • Lesion-Class Re-labeling in Medical Image Training Data, $20K

    NIA Korea, Oct 2022 – Dec 2023

Honors and awards

  • First place, IEEE Low-Power Computer Vision Challenge

    Track 1 of 45 teams, CVPR 2025 workshop

    Layer Imitation: Efficient Vision-Language Model on the Mobile NPU

  • Global Top 100, Google Solution Challenge

    Google, 2023

    Smiler: An Expression-Training App for Children with ASD

  • Excellence Award, ICT Mentoring Conference

    ACK, KOSIA, 2021

    Recommender System for Web Search Based on NLP to Improve User Search Environment

  • First Prize, Student Paper Competition

    Korea Digital Contents Society, 2021

    Lightweight Video Search Using Video-to-Text Generation and Retrieval

In progress

  • New VLA training mechanism

    Changing what the policy is trained to predict, so skills carry across robots instead of binding to one.

  • Efficient VLA inference

    Cutting the compute spent on every control step while keeping task success.

  • Closed-loop failure detection

    Noticing that an action is going wrong early enough for the policy to recover.

  • Adaptive regularization

    Letting regularization respond to the data instead of applying one fixed strength.

Beyond papers

I built and operated our lab's GPU cluster, which consists of about 20 nodes with eight RTX 3090s each. This work included containerized provisioning, per-node CUDA isolation, and training jobs that ran unattended for days. Outside of research, I taught AI tutorials for undergraduate research assistants and helped launch the Google Developer Student Club chapter at Ajou University.

Seungmin Oh (오승민) is a Ph.D. candidate at Ajou University in Suwon, South Korea.아주대학교 오승민, 인공지능학과 MMAI 연구실 seungmin.oh16@gmail.com