SearcharxivSearch

arXiv subjects

Nikhil Mittal

Publications and source records attributed to Nikhil Mittal.

3 recordsLinked to original sources

Beyond Static Evaluation: Building Simulation Environments for Scalable Agentic Reinforcement Learning

As Large Language Models (LLMs) evolve into autonomous agents, traditional static evaluation fails to capture multi-step decision-making. We introduce AgenticAI-Supervisor, an API and UI-driven RL Gym environment that decouples environment creation from scalable execution. By moving to verifiable execution outcomes, the platform generates high-fidelity traces and applies multi-dimensional reward shaping. Critically, our framework mitigates reward hacking through rigorous internal state validation and testing. This work provides a first look at our platform's core capabilities through a Customer Support Agent case study demonstrating a consistent closed-loop feedback for model optimization. Future work will focus on advanced features such as Computer Use, Tool Use, automated "stumping", and edge-case generation.

cs.AI

RE-AD: Real-Time Requirement Adherence for Data Labeling

Human-annotated data remains fundamental to training frontier Large Language Models (LLMs). However, crowd-sourced annotations often suffer from quality issues stemming from annotator misunderstanding or lack of engagement. To address this, we introduce a real-time requirement adherence (RE-AD) framework that leverages LLMs to proactively validate labeling quality. Our methodology involves decomposing Standard Operating Procedures (SOPs) into atomic rules via self-reflection, categorizing them by complexity, and applying tiered validation strategies. Evaluated on a synthetic benchmark, the system achieved an F1 score of 0.749. Furthermore, production deployment resulted in annotators accepting and fixing 82% of the errors flagged by the framework. We include ablation studies to demonstrate the impact of our core design decisions.

cs.CL

Efficient Cryptographic Substitution Box Design Using Travelling Salesman Problem and Chaos

Symmetric encryption has been a standout amongst the most reliable option by which security is accomplished. In modern block symmetric ciphers, the substitution-boxes have been playing a critical role of nonlinear components that drives the actual security of ciphers. In this paper, the travelling salesman problem and piecewise linear chaotic map are explored to synthesize an efficient configuration of 8x8 substitution-box. The proposed anticipated design has the consistency which is justified by the standard performance indexes. The statistical results manifest that the prospective substitution-box is cryptographically more impressive as compared to some recent investigations.

cs.CR