Under KV-cache compression, the model's behaviour degraded before the safety probe did.

MSc Data Science student and researcher at Universitaet Trier. I build efficient and reliable machine learning systems, currently focusing on memory-efficient LLM inference.
A retrieval assistant indexed over my papers, projects, and CV answers questions here.
I am a machine learning researcher and software engineer specializing in efficient LLM inference, numerical optimization, and reliable AI systems. At Universitaet Trier, I research KV cache compression under Prof. Dr. Volker Schulz, pairing graduate research with more than four years of enterprise software development experience at SAP Labs India.
My primary research tackles the memory wall in long-context language models. Through JoLT, an approach combining partial Tucker decomposition with low-bit residuals, I demonstrated near-lossless 2x to 3x KV cache compression across five models—maintaining accuracy within 2 percentage points on 64K-context and GSM8K benchmarks, with a custom fused kernel reducing peak decode memory by 3.61x. I also study model trust, exploring whether step-by-step explanations reflect actual model reasoning and analyzing how asymmetric penalties in RLVR steer model calibration.
Having designed large-scale distributed systems and compliance workflows at SAP, I hold machine learning to high engineering standards. I build complete systems—including a production RAG assistant on Google Cloud Run and a sub-100ms Two-Tower recommender on Azure—focused on rigorous empirical validation, measured performance, and transparent limitations.
Under KV-cache compression, the model's behaviour degraded before the safety probe did.
A probe can flag when a model is likely to follow a misleading hint, but neither probes nor an LLM monitor reading the CoT showed CoT-specific evidence that the hint caused the answer.
arXiv preprint, in preparation for Numerical Linear Algebra with Applications (NLAA), 2026
A companion to the JoLT paper that treats the KV cache as a fourth-order tensor, measures its singular-value spectra on Mistral-7B-v0.3 and LLaMA-2-13B, and compares Tucker, CP, tensor train and t-SVD at matched storage.
Token and feature modes are low-rank while head and layer modes are nearly full-rank. Tucker has the lowest reconstruction error at every compression ratio from 2x to 5x, and post-RoPE keys lose 41% to 64% of their pre-RoPE compressibility.
arXiv preprint, 2026
My MSc thesis preprint reports near-lossless 2x to 3x KV cache compression, with accuracy staying within 2 percentage points of the uncompressed model, across five models and four model families.
At 3x compression GSM8K moves -1.21 pp on Mistral-7B and RULER 64K moves -0.10 pp on LLaMA-3.1-8B, with perplexity within 0.3% of dense on all five models. The FlashJoLT fused decode kernel cuts peak decode KV memory by 3.61x.
Punishing wrong answers made the model skip more often, not more wisely.
72.5% pairwise accuracy and 95% precision on 500 story-comparison test cases spanning five languages
Under severe temperature mismatch between model and reality, CVaR control cut constraint violations from 100% of scenarios to 0%
Top-3 finish in all three university Kaggle challenges
Powers the live AI Q&A assistant embedded in this portfolio site
Two-Tower MLP reached NDCG@10 of 0.3342, up from 0.3051 for the baseline, with sub-100ms CPU inference
F1 = 0.81 on 10,000+ imbalanced YouTube comments, CI/CD to Docker Hub
Reflective CoT reduced bias susceptibility by about 7 percentage points over standard CoT across 650 cases
International Conference on Communication and Signal Processing (ICCSP), 2020
Undergraduate research on automated glaucoma screening from retinal fundus images using optic-disc and optic-cup segmentation with SVM classification.
Achieved an F1 score of 86% on the Drishti-GS dataset for SVM-based glaucoma detection.
Under KV-cache compression, the model's behaviour degraded before the safety probe did.
A probe can flag when a model is likely to follow a misleading hint, but neither probes nor an LLM monitor reading the CoT showed CoT-specific evidence that the hint caused the answer.
Near-lossless 2x to 3x KV cache compression with accuracy within 2 percentage points of the uncompressed model
Punishing wrong answers made the model skip more often, not more wisely.