activity
20202026
most citedComparative Analysis of Extreme Verification Latency Learning Algorithms

3 citations · 3 across the 6 of their papers we have counts for

collaborators

6 papers

cs.AI2026

Small Models Scout Bottleneck Order for Large-Model Data Control

Seungmin Choi, Jiwon Sung, Muhammad Umer +4

Small proxy models are commonly used to identify data mixtures for larger-scale training. We ask whether their training trajectories reveal another transferable structure: the orde…

cs.LG2026

Epistemic Uncertainty for Test-Time Discovery

Kainat Riaz, Muhammad Ahmed Mohsin, Ahsan Bilal +5

Automated scientific discovery using large language models relies on identifying genuinely novel solutions. Standard reinforcement learning penalizes high-variance mutations, which…

cs.LG2026

: Stratified Scaling Search for Test-Time in Diffusion Language Models

Ahsan Bilal, Muhammad Ahmed Mohsin, Muhammad Umer +6

Test-time scaling investigates whether a fixed diffusion language model (DLM) can generate better outputs when given more inference compute, without additional training. However, n…

cs.LG2025

Explainable AI in Genomics: Transcription Factor Binding Site Prediction with Mixture of Experts

Aakash Tripathi, Ian E. Nielsen, Muhammad Umer +2

Transcription Factor Binding Site (TFBS) prediction is crucial for understanding gene regulation and various biological processes. This study introduces a novel Mixture of Experts…

cs.LG2021

Adversarial Targeted Forgetting in Regularization and Generative Based Continual Learning Models

Muhammad Umer, Robi Polikar

Continual (or "incremental") learning approaches are employed when additional knowledge or tasks need to be learned from subsequent batches or from streaming data. However these ap…

cs.LG2020★ 3 cited

Comparative Analysis of Extreme Verification Latency Learning Algorithms

Muhammad Umer, Robi Polikar

One of the more challenging real-world problems in computational intelligence is to learn from non-stationary streaming data, also known as concept drift. Perhaps even a more chall…