SearcharxivSearch

arXiv subjects

Nitin Auluck

Publications and source records attributed to Nitin Auluck.

3 recordsLinked to original sources

FedChronos: Federated Fine-Tuning of Time-Series Foundation Models for Privacy-Preserving Commodity Price Forecasting

Time-series foundation models (TSFMs) such as Chronos have demonstrated strong forecasting capabilities across domains, yet adapting them to institutionally fragmented settings, where data cannot be centralized due to regulatory, competitive, or sovereignty constraints, remains unexplored. We introduce FedChronos, a framework for federated parameter-efficient fine-tuning of an already pre-trained TSFM, a setting that existing federated time-series work has not addressed, since prior methods either pre-train from scratch or align prototypes rather than adapt a fixed backbone. Our approach applies Low-Rank Adaptation (LoRA) to the Chronos-T5 backbone and trains across distributed clients using FedAvg and FedProx, transmitting only lightweight adapter weights (384~KB per round, an 86$\times$ reduction over full-model exchange). We evaluate FedChronos on daily commodity prices from 15 Indian agricultural markets across 9 states, a naturally non-IID federated setting, and find that na\"ive LoRA fine-tuning overfits substantially on small per-client datasets, dropping below zero-shot performance. We further observe that differential privacy (DP) noise can act as implicit regularization and counteract this overfitting: in our experiments the strongest configuration ($\varepsilon = 5$) reduces mean absolute percentage error (MAPE) by 31% over zero-shot and 26% over the best traditional baseline, while bounding each round's information leakage via per-round $(\varepsilon, \delta)$-differential privacy. Because the model is compact and the updates are small, the approach also suits edge AI deployments where both the network link and the client device are constrained. Overall, our findings suggest that privacy and accuracy can be complementary rather than competing objectives in federated TSFM fine-tuning.

cs.LG

Knowledge Grafting: A Mechanism for Optimizing AI Model Deployment in Resource-Constrained Environments

The increasing adoption of Artificial Intelligence (AI) has led to larger, more complex models with numerous parameters that require substantial computing power -- resources often unavailable in many real-world application scenarios. Our paper addresses this challenge by introducing knowledge grafting, a novel mechanism that optimizes AI models for resource-constrained environments by transferring selected features (the scion) from a large donor model to a smaller rootstock model. The approach achieves an 88.54% reduction in model size (from 64.39 MB to 7.38 MB), while improving generalization capability of the model. Our new rootstock model achieves 89.97% validation accuracy (vs. donor's 87.47%), maintains lower validation loss (0.2976 vs. 0.5068), and performs exceptionally well on unseen test data with 90.45% accuracy. It addresses the typical size vs performance trade-off, and enables deployment of AI frameworks on resource-constrained devices with enhanced performance. We have tested our approach on an agricultural weed detection scenario, however, it can be extended across various edge computing scenarios, potentially accelerating AI adoption in areas with limited hardware/software support -- by mirroring in a similar manner the horticultural grafting enables productive cultivation in challenging agri-based environments.

cs.AI

Scheduling Algorithms for Hierarchical Fog Networks

Fog computing brings the functionality of the cloud near the edge of the network with the help of fog devices/micro data centers ($mdcs$). Job scheduling in such systems is a complex problem due to the hierarchical and geo-distributed nature of fog devices. We propose two fog scheduling algorithms, named $FiFSA$ (Hierarchical $Fi$rst $F$og $S$cheduling $A$lgorithm) and $EFSA$ ( Hierarchical $E$lected $F$og $S$cheduling $A$lgorithm). We consider a hierarchical model of fog devices, where the computation power of fog devices present in higher tiers is greater than those present in lower tiers. However, the higher tier fog devices are located at greater physical distance from data generation sources as compared to lower tier fog devices. Jobs with varying granularity and cpu requirements have been considered. In general, jobs with modest cpu requirements are scheduled on lower tier fog devices, and jobs with larger cpu requirements are scheduled on higher tier fog devices or the cloud data center $(cdc)$. The performance of $FiFSA$ and $EFSA$ has been evaluated using a real life workload trace on various simulated fog hierarchies as well as on a prototype testbed. Employing $FiFSA$ offers an average improvement of 27% and 57.9% in total completion time and an improvement of 32% and 61% in cost as compared to Longest Time First ($LTF$) and cloud-only ($cdc-only$) scheduling algorithms, respectively. Employing $EFSA$ offers an average improvement of 48% and 70% in total completion time and an improvement of 52% and 72% in cost as compared to $LTF$ and $cdc-only$ respectively.

cs.DC