Searcharxiv⌕ Search

arXiv subjects

Md. Robiul Islam Niloy

Publications and source records attributed to Md. Robiul Islam Niloy.

2 recordsLinked to original sources

Autonomous OSS Threat Detection via Taxonomy-Aligned LLMs

Open source software (OSS) ecosystems face growing threats from sophisticated supply chain attacks including typosquatting, dependency confusion, Trojan Source obfuscation, malicious build injection, and CI/CD pipeline poisoning. Existing detection approaches rely on signature-based tools and rule-based systems that struggle to generalize across attack variants and emerging threat patterns. In this paper we propose a taxonomy-aligned large language model framework for automated detection and classification of OSS supply chain threats. We introduce a structured AV-xxx threat taxonomy covering five attack categories and construct a curated dataset of 999 verified real-world OSS supply chain incidents sourced from GitHub Security Advisories, CISA alerts, and security research reports spanning 2018 to 2026. Using taxonomy-aligned prompt engineering with GPT-4, our framework achieves 97.0\% multi-class classification accuracy and 97.0\% macro F1 score across all five threat categories. Comparative evaluation against five traditional machine learning baselines, one zero-shot open source LLM, and two fine-tuned neural models reveals a surprising finding: fine-tuned Llama 3.1 8B (70.5%) and SecRoBERTa (77.5%) both underperform simple TF-IDF classifiers (82.3%), while Mistral 7B without taxonomy alignment achieves only 65.7%. These results confirm that taxonomy-aligned prompting rather than model scale, domain pretraining, or fine-tuning is the critical factor enabling high classification accuracy. Our dataset and code are publicly available to support reproducible supply chain security research.

cs.CR↗

Black-Box Optimization of Mixed Binary-Continuous Variables: Challenges and Opportunities in Evolutionary Model Merging

Model merging has emerged as a cost-effective paradigm for combining capabilities of multiple large language models (LLMs) without additional training. Among existing approaches, Data Flow Space (DFS) merging operates by selectively activating parameter groups across model layers, offering greater flexibility than naive parameter averaging. However, the optimization challenges underlying DFS merging remain poorly understood. In this paper, we formally characterize the DFS merging problem as a mixed binary-continuous black-box optimization problem, identifying three fundamental challenges: (1) mixed binary-continuous variable types, (2) high-dimensional search spaces with up to 291 parameter groups, and (3) conditional variable dependencies corresponding to Type-I interaction as characterized by Akimoto et al. [1]. We demonstrate that this characterization directly motivates the application of evolutionary algorithms designed for mixed-variable optimization. Empirically, we evaluate Structured DFS with CMA-ES against Parameter Space (PS) merging, Unstructured DFS, TIES-Merging, DARE, and DELLA on Mistral-7B models across official GSM8K (1,319 questions) and MMLU (14,042 questions, 57 subjects) benchmarks. Our structured approach achieves a 49.5% reduction in effective search space while maintaining competitive performance. Results reveal that standard parameter space methods (TIES: 30.48%, DELLA: 26.93% on full MMLU) perform significantly worse than optimization-aware approaches, while also identifying an important tension between task-specific reasoning performance and general knowledge preservation.

cs.NE↗