Author

Amrita Kundu

3 papers indexed here

Fetches their full publication history.

Not the right person? Other researchers publish under this name.

Conference Jul 2026

Calibration of Variational Quantum Classifiers Under Depolarizing Noise: Expected Calibration Error, Ansatz Expressibility, and Post-Hoc Temperature Scaling

Variational Quantum Classifiers (VQCs) have emerged as prime candidates for machine learning on NISQ systems. It stands to reason that the same depolarizing noise that drives quantum states toward the maximally mixed state would also alleviate the overconfidence of VQCs. This paper tests that hypothesis through an empirical study on three datasets at six noise levels, validated across ten random seeds and supported by a formal analysis of how the depolarizing channel contracts the measured logits. The primary finding is that depolarizing noise does not reduce overconfidence in VQCs that remain in the learnable regime: expected calibration error (ECE) never decreases with noise on any dataset, and on the lowest-variance dataset it increases significantly (Wilcoxon signed-rank p < 0.005 over ten seeds). We derive why the optimizer compensates for the channel and confirm the mechanism through a confidence-trajectory experiment. A secondary finding is that a less expressive ansatz can appear well-calibrated only because it collapses to a degenerate solution, demonstrating that ECE must always be reported alongside accuracy. Any effect of noise on accuracy is small and seed-dependent, and it is decoupled from calibration. Post-hoc temperature scaling reduces VQC ECE by 64 to 77 percent across all datasets and is the recommended calibration method for NISQ-era classifiers.

Souvik Ghosh, Amrita Kundu, Mithaguru et al. · 0 citations
Conference Jul 2026

AdaptiReason: Adaptive Chain-of-Thought Compression for Efficient Large Language Model Inference

Large Language Models (LLMs) trained using Chain-of-Thought (CoT) supervision have achieved state-of-the-art performance on complex reasoning tasks. However, the generation of long reasoning chains introduces substantial computational overhead during inference, limiting their deployment in low-latency and resource-constrained environments. This paper proposes AdaptiReason, a novel framework that dynamically compresses intermediate reasoning steps based on task difficulty and model confidence without requiring retraining of the underlying base model. AdaptiReason employs a lightweight difficulty estimator to determine the appropriate reasoning depth for each input, followed by a learned token-pruning policy that eliminates redundant or low-information reasoning steps. Experimental evaluation on the MATH, GSM8K, and ARC-Challenge benchmarks demonstrates that AdaptiReason reduces the average number of generated tokens by 3.7× while preserving 98.2% of the baseline reasoning accuracy. Furthermore, the proposed framework is model-agnostic and can be seamlessly integrated with instruction-tuned LLMs without requiring access to model parameters, relying solely on output logits for adaptive reasoning compression. The results demonstrate that AdaptiReason significantly improves inference efficiency while maintaining high reasoning performance, making it suitable for real-time and resource-constrained LLM applications.

V. A, Mithaguru, Amrita Kundu et al. · 0 citations
Conference Jun 2026

Benchmarking Data Heterogeneity Challenges in Federated Learning for Distributed Renewable Energy Forecasting: A Systematic Gap Analysis

Federated Learning (FL) offers a privacy-preserving framework for training energy forecasting models across geographically distributed nodes without centralising raw metering data. However, the accuracy of classical FL algorithms degrades substantially when client data is heterogeneous, a condition that is the norm rather than the exception in distributed energy systems. This paper presents a novel systematic benchmark study quantifying accuracy degradation across four distinct heterogeneity axes: quantity skew (Dirichlet $\alpha$), covariate shift, temporal non-stationarity, and client availability. Here, five FL algorithms (FedAvg, FedProx, SCAFFOLD, Local-Only, and Centralized independent and identically distributed (IID) oracle) are evaluated with long short-term memory (LSTM) and Neural Basis Expansion Analysis for Time Series (N-BEATS) architectures across public datasets (NREL Solar, NREL Wind, Pecan Street, UK Smart Meter), generating over 190 experimental conditions. This degradation gap analysis reveals that standard FedAvg suffers up to 83.4% Mean Absolute Error (MAE) degradation relative to the centralised IID baseline under heavy quantity skew on solar data, with temporal non-stationarity emerging as the dominant single-axis contributor.

Souvik Ghosh, Amrita Kundu, Mithaguru et al. · 0 citations