Abstract

Machine Learning Enabled Systems (MLS) are becoming integral to real-world applications, but ensuring their sustainable performance over time remains a significant challenge. These systems operate in dynamic environments and face runtime uncertainties like data drift and model degradation, which affect the sustainability of MLS across multiple dimensions: technical, economical, environmental, and social. While Machine Learning Operations (MLOps) addresses the technical dimension by streamlining the ML model lifecycle, it overlooks other dimensions. Furthermore, some traditional practices, such as frequent retraining, incur substantial energy and computational overhead, thus amplifying sustainability concerns. To address them, we introduce HarmonE, an architectural approach that enables self-adaptive capabilities in MLOps pipelines using the MAPE-K loop. HarmonE allows system architects to define explicit sustainability goals and adaptation thresholds at design time, and performs runtime monitoring of key metrics, such as prediction accuracy, energy consumption, and data distribution shifts, to trigger appropriate adaptation strategies. We validate our approach using a Digital Twin (DT) of an Intelligent Transportation System (ITS), focusing on traffic flow prediction as our primary use case. The DT employs time series ML models to simulate real-time traffic and assess various flow scenarios. Our results show that HarmonE adapts effectively to evolving conditions while maintaining accuracy and meeting sustainability goals.

Abstract

The robustness of precast concrete structures is primarily governed by connections between the precast structural components. Joint connections deliver a vital role in load transfer, restraining movement, and providing stability at local and global level. This calls for appropriate connection mechanism for precast elements providing integrity under different loading conditions and ease of construction. The connection details in literature or available in practice have been rarely evaluated. This paper discusses the numerical modelling of precast reinforced concrete structural wall-column with different joint connection systems and evaluates various seismic design parameters, simulated through in-plane lateral loading in a finite element software. The connection systems evaluated are reinforcement bar connection, headed bar connections, U-bar connection and steel wire loop connection, which are subsequently compared with a cast-in-situ reinforced concrete wall-column model having similar material and geometrical properties. The seismic behaviour of connections have been studied with regards to the damage pattern, stresses, lateral load capacity, base shear coefficient, stiffness, deformation characteristics, strength factors, and damage index. Among all the connection systems, U-bar connection and loop connection using steel wire ropes showed stresses within the yield limit, while other connection systems reached their yield capacity, indicating damage. Apparently, steel wire loop connection is found to be effective in transfer of lateral load between the precast reinforced concrete elements, as observed from the numerical analysis; whereas other connection systems yielded prior to the design load. However, all connections except the reinforcement bar connection surpassed design load prior to the peak limit.

Abstract

According to the cooperative principle (Grice 1975), utterances in a conversation adhere to the four maxims of conversational implicature – quantity, relation, quality and manner. An implicature arises when a maxim is flouted or contradicted, and the speaker is forced to infer a meaning. Consider the example: Speaker A: का िदलीप को परीकाएं आसान लग रही है? Kya Dilip ko parikshayein aasan lag rahi hain? (Does Dilip find the exam easy?) Speaker B: आज-कल वो सो नही पा रहा | [Aaj-kal wo so nahi pa raha.] (He hasn’t been able to sleep lately.) Speaker B flouts the maxim of relevance by not answering the question with a yes or no. Instead, his reply that Dilip has trouble sleeping implies that he doesn’t find the exams to be easy. While computational approaches have made some progress in English implicature benchmarks - GRICE (Zheng, 2021), IMPRESS (Jeretic 2020) and Conversational Implicature benchmark (CIB) (George and Mamidi, 2020), there are no benchmarks for Hindi. Hence, we propose a Hindi implicature benchmark- Indirect Questions Hi Implicature Benchmark - Toledo-Ronen (2020) found that translation- based methods lose nuances in argument evaluation. XCOPA benchmark (Ponti 2020) & Huang (2024) demonstrated that translated data hurts model performance for structurally divergent non- English languages. Hindi is a free word order, morphologically rich language. It is structurally different from English hence, translating English implicature benchmarks may not be unsuitable. Wang (2024) present indirect answers to yes-no questions in dialogues benchmark. Similar to their approach, we plan to collect Hindi interviews and extract indirect questions along with their answers involving implicature. We will annotate 5000 such questions. We will maintain a constraint that previous dialogues will be added to the question as a background to simplify the inference over a single dialogue turn. Evaluation will rely on ROUGE scores to measure correctness, as we leave exploration of suitable metrics for future work. For model evaluation, we plan to leverage a) English LLMs (meta-llama/Llama-3.3-70B (Grattafiori 2024) and the current state-of-the-art reported by Sravanthi (2024), FlanT5-XXL (Chung 2022) finetuned on Hindi translated GRICE (Zheng 2021), IMPRESS (Jeretic 2020) and CIB (George and Mamidi 2020) and b) Hindi LLMs (Llama-3-Nanda-10B-Chat (Choudhury 2024) and Airavata (Gala 2024)).

Abstract

In recent years, widespread internet adoption and the growth in user base of various social media platforms have led to an increase in the prolifera tion of extreme speech online. While traditional language models have demon strated proficiency in distinguishing between neutral text and non-neutral text (i.e. extreme speech), categorizing the diverse types of extreme speech presents significant challenges [1][2]. The task of extreme speech classification is par ticularly nuanced, as it requires a deep understanding of socio-cultural contexts to accurately interpret the intent of the language used by the speaker. Even hu man annotators often disagree on the appropriate classification of such content, emphasizing the complex and subjective nature of this task [3]. The use of hu man moderators also presents a scaling issue, necessitating the need for auto mated systems for extreme speech classification. The recent launch of ChatGPT has drawn global attention to the potential applications of Large Language Models (LLMs) across a diverse variety of tasks. Trained on vast and diverse corpora, and demonstrating the ability to effectively capture and encode contex tual information, LLMs emerge as highly promising tools for tackling this spe cific task of extreme speech classification. In this paper, we leverage the Indian subset of the extreme speech dataset from [3] to develop an effective classifica tion framework using LLMs. We evaluate open-source Llama models against closed-source OpenAI models, finding that while pre-trained LLMs show mod erate efficacy, fine-tuning with domain-specific data significantly enhances per formance, highlighting their adaptability to linguistic and contextual nuances. Although GPT-based models outperform Llama models in zero-shot settings, the performance gap disappears after fine-tuning.

Abstract

Modeling process, operating condition, reliability, and technological variation in transistor level design introduce significant variance in device and performance parameters. This paper presents a machine-learning-based architectural approach that enhances model performance, as a step towards developing Foundation Models tailored for circuit data, accurately capturing technology and process-induced variations in leakage power, voltage, and current. The architecture incorporates the impact of varying operating conditions, including temperatures from -55°C to 125°C and supply voltage fluctuations of ±10% on 16nm HP FinFET, and 16nm, 22nm, 32nm, and 45nm HPMGK CMOS technology nodes. By enhancing the performance of baseline machine-learning models using a chained architecture to cater to the high variance in target, our C-Arch serves as a versatile framework for circuit modeling when the data spread is high. Experimental results on current, voltage, and leakage power estimation, demonstrate average improvements of up to 93.76%, 96.17%, and 88.82% in Mean Absolute Percentage Error compared to baseline models, underscoring the computational savings and viability of Foundation Models in circuit design.

Abstract

The Facility Location Problem (FLP) is a well-studied optimization problem with applications in many real-world scenarios. Past literature has explored the solutions from different perspectives to tackle FLPs. These include investigating FLPs under objective functions such as utilitarian, egalitarian, Nash welfare, etc. Also, there is no treatment for asymmetric welfare functions around the facility. We propose a unified framework, FLIGHT, to accommodate a broad class of welfare notions. The framework undergoes rigorous theoretical analysis, and we prove some structural properties of the solution to FLP. Additionally, we provide approximation bounds, which provide insight into an interesting fact: as the number of agents arbitrarily increases, the choice of welfare notion is irrelevant. Furthermore, the paper also includes results around concentration bounds under certain distributional assumptions over the preferred locations of agents.

Abstract

This paper considers the problem of fair probabilistic binary classification with binary protected groups. The classifier assigns scores, and a practitioner predicts labels using a certain cut-off threshold based on the desired trade-off between false positives vs. false negatives. It derives these thresholds from the ROC of the classifier. The resultant classifier may be unfair to one of the two protected groups in the dataset. It is desirable that no matter what threshold the practitioner uses, the classifier should be fair to both the protected groups; that is, the ℒₚ norm between FPRs and TPRs of both the protected groups should be at most ε. We call such fairness on ROCs of both the protected attributes εₚ-Equalized ROC. Given a classifier not satisfying ε₁-Equalized ROC, we aim to design a post-processing method to transform the given (potentially unfair) classifier's output (score) to a suitable randomized yet fair classifier. That is, the resultant classifier must satisfy ε₁-Equalized ROC. First, we introduce a threshold query model on the ROC curves for each protected group. The resulting classifier is bound to face a reduction in AUC. With the proposed query model, we provide a rigorous theoretical analysis of the minimal AUC loss to achieve ε₁-Equalized ROC. To achieve this, we design a linear time algorithm, namely FROC, to transform a given classifier's output to a probabilistic classifier that satisfies ε₁-Equalized ROC. We prove that under certain theoretical conditions, FROC achieves the theoretical optimal guarantees. We also study the performance of our FROC on multiple real-world datasets with many trained classifiers.

Abstract

Abstract— Transgenic crops have become widespread but have associated health concerns. Testing for transgenic corn is slow and lengthy. In this paper, we used UV-Vis spectroscopy in combination with chemometrics and the PCA-SVM classifier to identify different types of corn samples from each other, including transgenic varieties. The presented methodology and the classifier can differentiate very well between the three different varieties of corn considered in this paper. Although there is a slight improvement in prediction accuracies compared to the state-of-the-art methods, our method is considerably more cost-effective and less time-consuming.

Abstract

Disenchanted Tales from the Old Home in Qissa: A Tale of a Lonely Ghost Abstract: The temporal fixity of the event of Independence/Partition in nationalist historiography has allowed generations of Indians to imagine the Partition and the accompanying genocide as restricted to the year and event of 1947, and yet continue to repeat its violence in an attempt to complete the task of securing religious identities to their assigned national spaces. Just as the political histories of the nations created by the Partition continue to live with the spectres of its violence through repeated wars, so do citizen-subjects spawned by the new nations live in the shadows of old identities. This paper proposes that Singh’s Qissa: A Tale of a Lonely Ghost presents the viewer with the spectre of a partition that never ended. This paper shall explore the function of memory in Anup Singh’s 2013 feature Qissa: A Tale of a Lonely Ghost in producing and de-stabilizing gender, communal and familial identities, and real and imaginary histories. The paper shall look at specific stylistic choices of the film’s form to suggest that this historic cleavage the film populates with an indeterminacy of the corporal/non-corporal body, of the tentative presence of a ghost of days past, and the dead who didn’t stay buried. The site of memory here is inhabited by fluid bodies that lie between genders, in between the past, present and the future, and ultimately in between the living and the dead. Memory here serves as an imaginary history.

Abstract

Graph Neural Network (GNN) research is rapidly advancing due to GNNs’ capacity to learn distributed representations from graph-structured data. However, centralizing large volumes of real-world graph data for GNN training is often impractical due to privacy concerns, regulatory restrictions, and commercial competition. Federated learning (FL), a distributed learning paradigm, offers a solution by preserving data privacy with collaborative model training. Despite progress in training huge vision and language models, federated learning for GNNs remains underexplored. To address this challenge, we present a novel method for federated learning on GNNs based on spectral GNNs equipped with neural ordinary differential equations (ODE) for better information capture, showing promising results across both homophilic and heterophilic graphs. Our approach effectively handles non-Independent and Identically Distributed (non-IID) data, while also achieving performance comparable to existing methods that only operate on IID data. It is designed to be privacy-preserving and bandwidth-optimized, making it suitable for real-world applications such as social network analysis, recommendation systems, and fraud detection, which often involve complex, non-IID, and heterophilic graph structures. Our results in the area of federated learning on non-IID heterophilic graphs demonstrate significant improvements while also achieving better performance on homophilic graphs. This work highlights the potential of federated learning in diverse and challenging graph settings.