Search arXiv⌕ Search

arXiv subjects

Nanduni Nimalsiri

Publications and source records attributed to Nanduni Nimalsiri.

4 recordsLinked to original sources

Stepwise Intrinsic Rewards for Reasoning in Large Language Models

Reinforcement learning (RL) has become a widely used paradigm for improving the reasoning abilities of large language models (LLMs) and Vision-language models (VLMs). Sparse binary outcome rewards, however, score only final correctness and cannot identify which intermediate steps contributed to it; in multimodal tasks, they may also reward answers driven by linguistic priors rather than visual evidence. Process reward models (PRMs) densify supervision but usually require process annotations, auxiliary models, or inference-time search. In this paper, we introduce Stepwise Marginal Information Gain (MIG), an intrinsic process reward computed from the policy itself. MIG measures how each structured reasoning prefix changes the length-normalized, teacher-forced log-likelihood of the reference answer. A monotonic historical watermark rewards only new likelihood maxima, avoiding duplicate credit after sub-record detours. We combine this signal with outcome and format rewards and a gated self-distillation objective that retains only structurally valid and correct trajectories. For VLMs, a real-versus-blank likelihood gate down-weights rewards when answers remain predictable without the image. Across eight task-specific benchmarks, the full method exceeds outcome-only GRPO in every single-run comparison. In broad-data transfer, it improves average accuracy by up to 4.8 points over binary-reward training and gains 12.6 points on MathVerse. At 7B, it exceeds an external PRM-BoN@16 baseline by 12.9 points on vision-language transfer without inference-time reranking. These results support policy-derived stepwise credit as an annotation-free alternative to explicit process reward modeling.

cs.AI↗

HetGPS: Scalable Graph Multi-Agent Reinforcement Learning with Physics-Anchored Adaptive Safety for EV Charging

Safety interventions for large populations of network-coupled agents must protect shared constraints without unnecessarily overriding task-oriented policy decisions. We present HetGPS, a hybrid graph-control framework synergizing learned graph risk with physics-anchored correction by separating intervention magnitude from corrective direction. An action-conditioned graph residual model schedules state-dependent intervention authority, while a physics model determines its direction. For electric vehicle (EV) charging, we couple this filter with a parameter-shared heterogeneous graph soft actor-critic policy, enabling topology-aware coordination with a learned model size independent of fleet size. Across five nested distribution networks with 200--3,218 EVs and 100 evaluation days, Adaptive Authority reduces bus--step voltage violations from 3.93--7.74\% without filtering to 0.52--3.44\%, while maintaining 99.06--100\% departure success. Relative to the same physics-directed projection with fixed authority, it improves mean reward on all five networks and lowers the mean safety score on four. The deployed policy-and-risk model contains 383,702 learned parameters at every scale; at 3,218 EVs, a matched centralized SAC actor is about $170\times$ larger. A policy trained on the eight-transformer system transfers zero-shot to the 16- and 32-transformer systems, attaining 0.57--0.75\% violation rates and at least 99.99\% departure success. These results show that learned graph risk can allocate intervention authority at scale while feeder physics anchors corrective action.

cs.AI↗

Network-aware EV charging and discharging in unbalanced distribution grids: A distributed, robust approach against communication failures

This paper proposes a distributed optimization-based algorithm for electric vehicle (EV) charging and discharging, incorporating EV customer economics and distribution network constraints enforced on an unbalanced distribution grid. Building on a consensus-based alternating direction method of multipliers (ADMM), the algorithm is designed such that EVs coordinate by means of exchanging limited information with their neighboring EVs in a connected communication network. Specifically, an iterative routine is executed, whereby EVs cooperatively determine their charge-discharge profiles that maintain the distribution grid voltages and transformer core temperatures within safe operating limits. Importantly, the algorithm is robust against communication failures potentially arising in real-world implementations. Numerical simulations are conducted to verify the efficacy of the proposed EV charging algorithm in terms of network-aware operation and communication-failure tolerant operation.

eess.SY↗

Communication-Censored-ADMM for Electric Vehicle Charging in Unbalanced Distribution Grids

We propose an alternating direction method of multipliers (ADMM)-based algorithm for coordinating the charge and discharge of electric vehicles (EVs) to manage grid voltages while minimizing EV time-of-use energy costs. We prove that by including a Communication-Censored strategy, the algorithm maintains its solution integrity, while reducing peer-to-peer communications. By means of a case study on a representative unbalanced two node circuit, we demonstrate that our proposed Communication-Censored-ADMM (CC-ADMM) EV charging strategy reduces peer-to-peer communications by up to 80%, compared to a benchmark ADMM approach.

math.OC↗