Abstract

No Results Found

Abstract

No Results Found

Abstract

No Results Found

Abstract

Despite recent advancements showcasing the impressive capabilities of Large Language Models (LLMs) in conversational systems, we show that even state-of-the-art LLMs are morally inconsistent in their generations, questioning their reliability (and trustworthiness in general). Prior works in LLM evaluation focus on developing ground-truth data to measure accuracy on specific tasks. However, for moral scenarios that often lack universally agreed-upon answers, consistency in model responses becomes crucial for their reliability. To address this issue, we propose an information-theoretic measure called Semantic Graph Entropy (SaGE), grounded in the concept of "Rules of Thumb" (RoTs) to measure a model's moral consistency. RoTs are abstract principles learned by a model and can help explain their decision-making strategies effectively. To this extent, we construct the Moral Consistency Corpus (MCC), containing 50K moral questions, responses to them by LLMs, and the RoTs that these models followed. Furthermore, to illustrate the generalizability of SaGE, we use it to investigate LLM consistency on two popular datasets -- TruthfulQA and HellaSwag. Our results reveal that task-accuracy and consistency are independent problems, and there is a dire need to investigate these issues further.

Abstract

A Large Language Model (LLM) is considered consistent if semantically equivalent prompts produce semantically equivalent responses. Despite recent advancements showcasing the impressive capabilities of LLMs in conversational systems, we show that even state-of-the-art LLMs are highly inconsistent in their generations, questioning their reliability. Prior research has tried to measure this with task-specific accuracy. However, this approach is unsuitable for moral scenarios, such as the trolley problem, with no "correct" answer. To address this issue, we propose a novel information-theoretic measure called Semantic Graph Entropy (SGE) to measure the consistency of an LLM in moral scenarios. We leverage "Rules of Thumb" (RoTs) to explain a model's decision-making strategies and further enhance our metric. Compared to existing consistency metrics, SGE correlates better with human judgments across five LLMs. In the future, we aim to investigate the root causes of LLM inconsistencies and propose improvements.

Abstract

Malaria is a deadly disease caused by Plasmodium parasites. While potent drugs are available in the market for malaria treatment, over the years, Plasmodium parasites have successfully developed resistance against many, if not all, front-line drugs. This poses a serious threat to global malaria eradication efforts, and the continued discovery of new drugs is necessary to tackle this debilitating disease. With the advent of recent unprecedented progress in machine learning techniques, singlecell transcriptomic in Plasmodium offers a powerful tool for identifying crucial proteins as a drug target and subsequent computational prediction of potential drugs. In this study, We have implemented a mutual-information-based feature reduction algorithm with a classification algorithm to select important proteins from transcriptomic datasets (sexual and asexual stages) for Plasmodium falciparum and then constructed the protein-protein interaction (PPI) networks of the proteins. The analysis of this PPI network revealed key proteins vital for the survival of Plasmodium falciparum. Based on the function and identification of a few strong binding sites on a couple of these key proteins, we computationally predicted a set of potential drug molecules using a deep learning-based technique. Lead drug molecules that satisfy ADMET and drug-likeliness properties are finally reported out of the generated drugs. The study offers a general computational pipeline to identify crucial proteins using scRNA-seq data sets and further development of potential new drugs.

Abstract

The complexity and fluidity of emotions in the epic of Mahābhārata present before us an interesting case for delving into the phenomenology of emotions. In the rationalist tradition of Kant, emotions are considered as an impediment to moral discernment. The rationalist account of emotions considers it as an animal instinct which needs to be controlled through the exercise of Reason. The paper problematizes the rationalist interpretation of emotions mainly on two counts. First, it ignores the evaluative content of the emotions and considers it as a non-cognitive element. Second, it also overlooks the productive role of various emotions like guilt, shame, remorse in moral deliberation. The paper critically analyzes the episode of Yudhiṣṭhira’s grief in Śānti Parva and argues that the grief of Yudhiṣṭhira cannot be explained as personal loss

Abstract

For a point set, Euclidean distance matrix (EDM) is the matrix consisting of squared distances between every pair of points in the set. It frequently appears in wide ranging applications such as sensor networks, acoustic arrays, crystallography, and self localization among others. Often the measured EDM are inaccurate (due to noise) and incomplete (due to limited availability of measurements) requiring denoising and completion algorithms, frequently both. In literature, methods based on rank alternation and semi-definite relaxation (SDR) have been successful but are restricted to processing a single noisy and/or incomplete input EDM. In this paper we propose extensions of these two algorithms which can process multiple noisy and incomplete EDM simultaneously. Simulations show that the proposed joint algorithms (which process multiple EDM) outperform the corresponding individual algorithms (which process individual EDM and combine the results). We focus on the challenging case of multiplicative noise.

Abstract

Direction-of-arrival (DOA) estimation algorithms are crucial in localizing acoustic sources. Traditional localization methods rely on block-level processing to extract the directional information from multiple measurements processed together. However, these methods assume that DOA remains constant throughout the block, which may not be true in practical scenarios. Also, the performance of localization methods is limited when the true parameters do not lie on the parameter search grid. In this paper, two trajectory models are proposed, namely the polynomial and harmonic trajectory models, to capture the DOA dynamics. To estimate trajectory parameters, two gridless algorithms are adopted: (i) Sliding Frank–Wolfe (SFW), which solves the Beurling LASSO problem, and (ii) Newtonized orthogonal matching pursuit (NOMP), which is improved over orthogonal matching pursuit (OMP) using cyclic refinement. Furthermore, our analysis is extended to include multi-frequency processing. The proposed models and algorithms are validated using both simulated and real-world data. The results indicate that the proposed trajectory localization algorithms exhibit improved performance compared to grid-based methods in terms of resolution, robustness to noise, and computational efficiency.

Abstract

While user authentication happens before initiating or resuming a login session, de-authentication detects the absence of a previously-authenticated user to revoke her currently active login session. The absence of proper de-authentication can lead to well-known lunchtime attacks, where a nearby adversary takes over a carelessly departed user's running login session. The existing solutions for automatic de-authentication have distinct practical limitations, e.g., extraordinary deployment requirements or high initial cost of external equipment. In this paper, we propose "DE-authentication using Ambient Light sensor" (DEAL), a novel, inexpensive, fast, and user-friendly de-authentication approach. DEAL utilizes the built-in ambient light sensor of a modern computer to determine if the user is leaving her work-desk. DEAL, by design, is resilient to natural shifts in lighting conditions and can be configured to handle abrupt changes in ambient illumination (e.g., due to toggling of room lights). We collected data samples from 4800 sessions with 120 volunteers in 4 typical workplace settings and conducted a series of experiments to evaluate the quality of our proposed approach thoroughly. Our results show that DEAL can de-authenticate a departing user within 4 seconds with a hit rate of 89.15% and a fall-out of 7.35%. Finally, bypassing DEAL to launch a lunchtime attack is practically infeasible as it requires the attacker to either take the user's position within a few seconds or manipulate the sensor readings sophisticatedly in real-time.