Abstract

Engaging in political discussions is crucial in democratic societies, yet many individuals remain politically disinclined due to various factors such as perceived knowledge gaps, conflict avoidance, or a sense of disconnection from the political system. In this paper, we explore the potential of personal narratives—short, first-person ac- counts emphasizing personal experiences—as a means to empower these individuals to participate in online political discussions. Using a text classifier that identifies personal narratives, we conducted a large-scale computational analysis to evaluate the relationship between the use of personal narratives and participation in po- litical discussions on Reddit. We find that politically disinclined individuals (PDIs) are more likely to use personal narratives than more politically active users. Personal narratives are more likely to attract and retain politically disinclined individuals in political discussions than other comments. Importantly, personal narratives posted by politically disinclined individuals are received more posi- tively than their other comments in political communities. These results emphasize the value of personal narratives in promoting inclusive political discourse.

Abstract

Large Language Models (LLMs) often inherit biases from the web data they are trained on, which contains stereotypes and prejudices. Current methods for evaluating and mitigating these biases rely on bias-benchmark datasets. These benchmarks measure bias by observing an LLM’s behavior on biased statements. However, these statements lack contextual considerations of the situations they try to present. To address this, we introduce a contextual reliability framework, which evaluates model robustness to biased statements by considering the various contexts in which they may appear. We develop the Context-Oriented Bias Indicator and Assessment Score (COBIAS) to measure a biased statement’s reliability in detecting bias, based on the variance in model behavior across different contexts. To evaluate the metric, we augmented 2,291 stereotyped statements from two existing benchmark datasets by adding contextual information. We show that COBIAS aligns with human judgment on the contextual reliability of biased statements (Spearman’s 𝜌 = 0.65, 𝑝 = 3.4 ∗ 10−60) and can be used to create reliable benchmarks, which would assist bias mitigation works.

Abstract

Graph Neural Networks (GNNs) have emerged as powerful tools for learning representations of graph-structured data, demonstrating remarkable performance across various tasks. Recognising their importance, there has been extensive research focused on explaining GNN predictions, aiming to enhance their interpretability and trustworthiness. However, GNNs and their explainers face a notable challenge: graphs are primarily designed to model pair-wise relationships between nodes, which can make it tough to capture higher-order, multi-node interactions. This characteristic can pose difficulties for existing explainers in fully representing multi-node relationships. To address this gap, we present Framework For Higher-Order Representations In Graph Explanations (FORGE), a framework that enables graph explainers to capture such interactions by incorporating higher-order structures, resulting in more accurate and faithful explanations. Extensive evaluation shows that on average real-world datasets from the GraphXAI benchmark and synthetic datasets across various graph explainers, FORGE improves average explanation accuracy by 1.9x and 2.25x, respectively. We perform ablation studies to confirm the importance of higher-order relations in improving explanations, while our scalability analysis demonstrates FORGE's efficacy on large graphs.

Abstract

Machine Learning models increasingly face data integrity challenges due to the use of large-scale training datasets drawn from the Internet. We study what model developers can do if they detect that some data was manipulated or incorrect. Such manipulated data can cause adverse effects including vulnerability to backdoored samples, systemic biases, and reduced accuracy on certain input domains. Realistically, all manipulated training samples cannot be identified, and only a small, representative subset of the affected data can be flagged. We formalize ``Corrective Machine Unlearning'' as the problem of mitigating the impact of data affected by unknown manipulations on a trained model, only having identified a subset of the corrupted data. We demonstrate that the problem of corrective unlearning has significantly different requirements from traditional privacy-oriented unlearning. We find most existing unlearning methods, including retraining-from-scratch without the deletion set, require most of the manipulated data to be identified for effective corrective unlearning. However, one approach, Selective Synaptic Dampening, achieves limited success, unlearning adverse effects with just a small portion of the manipulated samples in our setting, which shows encouraging signs for future progress. We hope our work spurs research towards developing better methods for corrective unlearning and offers practitioners a new strategy to handle data integrity challenges arising from web-scale training.

Abstract

Stress has a significant mental health problem of the 21st century. The number of people suffering from stress is increasing rapidly. Thus, easy-to-use, inexpensive, and accurate biomarkers are needed to detect stress during its inception. Early detection of stress-related diseases allows people to access health-care services and leads to the development of new therapies. Thus, for the early detection of stress, a biomarker would be beneficial. We aim to find if there are significant differences between stressed and non-stressed groups of participants and which brain region gets impacted during stress. We conducted experiments to acquire EEG signals to identify the most significant brain region that gets affected due to stress. This research investigates if Higuchi Fractal Dimension (HFD) extracted from EEG signals can act as potential stress biomarkers. A gamified mobile application, known as Color Word and Memory Test (CWMT), was developed, inspired by the well-known Stroop Test, to elicit mental stress at two different difficulty levels. A MUSE headband with four EEG sensors (TP9, AF7, AF8, TP10) was used to collect the EEG signals at the two difficulty levels. The Higuchi Fractal Dimension (HFD) was extracted from EEG signals acquired from 32 participants while they were exposed to stress stimuli (using the proposed CWMT application) and we then performed three experimental analyses, i.e., Analysis I, II and III. Analysis I was performed on all the 32 participants performing low and high difficulty tasks on CWMT application. Analysis II was performed on sub-groups of participants. These sub-groups were made based on score obtained by participants while using CWMT application. Analysis II aimed to find the most significantly impacted brain region during stress. For Analysis III, we used the same sub-groups as Analysis II and it aimed to identify any differences between the left and right hemispheres during stress. We conducted the statistical analysis, and p-values were calculated between the two groups (non-stressed and stressed) to detect EEG channels and brain frequency significantly associated with stress. We performed three experimental analyses (Analysis I and II are intra-hemisphere, and analysis III is inter-hemisphere). In Analysis I, we inferred that beta and alpha frequencies from the AF8 region of the brain are affected during stress. In Analysis II, we inferred that beta waves from the AF8 region are a characteristic indicator of stress. In Analysis III, we identified significant differences between the left and right parts of the brain during stress. We found a significant difference (p<0.05) between HFD value in stress and non-stressed groups in the AF8 region. Our results indicated that stressed patients have a significantly higher value of HFD in the frontal areas.

Abstract

Knowledge Graph Completion (KGC) aims to predict missing entities or relations in knowledge graph but it becomes computationally expensive as KG scales. Existing research focuses on bilinear pooling-based factorization methods (LowFER, TuckER) to solve this problem. These approaches introduce too many trainable parameters which obstruct the deployment of these techniques in many real-world scenarios. In this paper, we introduce a novel parameter-efficient framework, KGRP which a) approximates bilinear pooling using Kernelized Random Projection matrix b) employs CNN for the better fusion of entities and relations to infer missing links. Our experimental results show that KGRP has 73% fewer parameters as compared to the state-of-theart approaches (LowFER, TuckER) for the knowledge graph completion task while retaining 88% performance for the best baseline. Furthermore, we also provide novel insights on the interpretability of relation embeddings. We also test the effectiveness of KGRP on a large-scale recruitment knowledge graph of 0.25 M entities.

Abstract

Graph neural networks (GNNs) are increasingly being used on sensitive graph-structured data, necessitating techniques for handling unlearning requests on the trained models, particularly node unlearning. However, unlearning nodes on GNNs is challenging due to the interdependence between the nodes in a graph. We compare MEGU, a state-of-the-art graph unlearning method, and SCRUB, a general unlearning method for classification, to investigate the efficacy of graph unlearning methods over traditional unlearning methods. Surprisingly, we find that SCRUB performs comparably or better than MEGU on random node removal and on removing an adversarial node injection attack. Our results suggest that 1) graph unlearning studies should incorporate general unlearning methods like SCRUB as baselines, and 2) there is a need for more rigorous behavioral evaluations that reveal the differential advantages of proposed graph unlearning methods. Our work, therefore, motivates future research into more comprehensive evaluations for assessing the true utility of graph unlearning algorithms.

Abstract

Distracted driving is a leading cause of road accidents globally. Identifying distracted driving involves reliably detecting and classifying various forms of driver distraction (e.g., texting, eating, or using in-car devices) from in-vehicle camera feeds to enhance road safety. This task is challenging due to the need for robust models that can generalize to a diverse set of driver behaviors without requiring extensive annotated datasets. In this paper, we propose KiD3, a novel method for distracted driver detection (DDD) that infuses auxiliary knowledge about semantic relations between entities in a scene and the structural configuration of the driver’s pose. Specifically, we construct a unified framework that integrates scene graphs and driver pose information with visual cues from video frames to create a holistic representation of the driver’s actions. Our results indicate that KiD3 achieves a 13.64% accuracy improvement over the vision-only baseline by incorporating auxiliary knowledge with visual information.

Abstract

Large Language Models (LLMs) have emerged as powerful tools to per- form various tasks in the legal domain, ranging from generating summaries to pre- dicting judgments. Despite their immense potential, these models have been proven to learn and exhibit societal biases and make unfair predictions. Hence, it is es- sential to evaluate these models prior to deployment. In this study, we explore the ability of LLMs to perform Binary Statutory Reasoning in the Indian legal land- scape across various societal disparities. We present a novel metric, β -weighted Le- gal Safety Score (LSSβ ), to evaluate the legal usability of the LLMs. Additionally, we propose a finetuning pipeline, utilising specialised legal datasets, as a potential method to reduce bias. Our proposed pipeline effectively reduces bias in the model, as indicated by improved LSSβ . This highlights the potential of our approach to enhance fairness in LLMs, making them more reliable for legal tasks in socially diverse contexts.

Abstract

The pursuit of habit building is challenging, and most people struggle with it. Research on successful habit formation is mainly based on small human trials focusing on the same habit for all the participants as conducting long-term heterogonous habit studies can be logistically expensive. With the advent of self-help, there has been an increase in online communities and applications that are centered around habit building and logging. Habit building applications can provide large-scale data on real-world habit building attempts and unveil the commonalities among successful ones. We collect public data on stickk.com, which allows users to track progress on habit building attempts called commitments. A commitment can have an external referee, regular check-ins about the progress, and a monetary stake in case of failure. Our data consists of 742,923 users and 397,456 commitments. In addition to the dataset, rooted in theories like Fresh Start Effect, Accountablity, and Loss Aversion, we ask questions about how commitment properties like start date, external accountability, monitory stake, and pursuing multiple habits together affects the odds of success. We found that people tend to start habits on temporal landmarks, but that does not affect the probability of their success. Practices like accountability and stakes are not often used but are strong determents of success. Commitments of 6 to 8 weeks in length, weekly reporting with an external referee, and a monetary amount at stake tend to be most successful. Finally, around 40% of all commitments are attempted simultaneously with other goals. Simultaneous attempts of pursuing commitments may fail early, but if pursued through the initial phase, they are statistically more successful than building one habit at a time.