Reviewerly/exHarmony huggingface dataset:
From Buzzword to Biz World: R<scp>ealizing</scp> B<scp>lockchain’s</scp> P<scp>otential in the</scp> I<scp>nternational</scp> B<scp>usiness</scp> C<scp>ontext</scp>

Initially making its name as the backbone technology of Bitcoin, blockchain has been referred to as a distributed ledger, public database, Internet of value, digital infrastructure, network, and platform. Compared with fluctuating cryptocurrency and non-fungible token (NFT) markets, applications of blockchain technology in more diverse business scenarios have received less attention. By analyzing 16 international business use cases under eight categories of blockchain-based solutions, this article offers a contextualized understanding of the potential for blockchain to become a general-purpose technology (GPT). It discusses how the extensiveness, evolvability, and enabling (3Es) aspects of blockchain influence the value, vision, and viability (3Vs) required for successful real-world applications. The article discusses how firms can draw on lessons from failed cases and good practices of existing cases to enhance the 3Vs for blockchain adoption.
Demand for Digital Skills in Primary Education

The content of education and the philosophy of education are subjects of constant review, evaluation, and changes that are reflected in school curricula. This should also be reflected in the content of pre-service teacher studies as reforms might change the skills and competences of graduates, which facilitate new graduates' success in the workplace. The article discusses the use of digital tools in primary education, reflecting on the situation in Slovak schools. The aim of the present study was to analyze teachers' readiness to apply them, as well as their perception of the effectiveness of using ICT in the educational process after the pandemic situation. A total of 122 Slovak teachers took part in the study, which involved completing a questionnaire. The results indicate that, in general, teachers use technologies and see the benefits of its use. However, regardless of the length of their teaching practice, they do not feel prepared for its effective application. The results of this study further support the idea of implementing ICT in university courses for future teachers, which will help them in their work. This study lays the groundwork for future research into the problem of implementing ICT in university courses for future teachers.
A new trend in Chinese address and its theoretical implications

This study examines the factors that affect people’s impressions of chat commerce in contemporary Chinese e-commerce, where various types of address terms and related expressions are used by online shop assistants. Our survey revealed that interpersonal distance was the strongest factor influencing the favourability of chat styles. Specifically, the distant type was rated the highest, whereas the close and mixed types were rated low, although they are used in practice increasingly frequently. We argue that this overt contradiction can be accounted for in terms of two perspectives: One is the district of residence, which was the second-strongest factor in our survey, and the other is the traditional Chinese “family culture”, in which people are treated both on a generational basis and on a closeness basis simultaneously. Moreover, we also discuss that the rusty pick-up lines, which express sympathetic proximity in content, combined with reverential distance in address form, perform a “bifocal” function.
PLEASE: Generating Personalized Explanations in Human-Aware Planning

Model Reconciliation Problems (MRPs) and their variant, Logic-based MRPs (L-MRPs), have emerged as popular methods for explainable planning problems. Both MRP and L-MRP approaches assume that the explaining agent has access to an assumed model of the human user receiving the explanation, and it reconciles its own model with the human model to find the differences such that when they are provided as explanations to the human, they will understand them. However, in practical applications, the agent is likely to be fairly uncertain on the actual model of the human and wrong assumptions can lead to incoherent or unintelligible explanations. In this paper, we propose a less stringent requirement: The agent has access to a task-specific vocabulary known by the human and, if available, a human model capturing confidently-known information. Our goal is to find a personalized explanation, which is an explanation that is at an appropriate abstraction level with respect to the human’s vocabulary and model. Using a logic-based method called knowledge forgetting for generating abstractions, we propose a simple framework compatible with L-MRP approaches, and evaluate its efficacy through computational and human user experiments.
Adversarial Erasing with Pruned Elements: Towards Better Graph Lottery Tickets

Graph Lottery Ticket (GLT), a combination of core subgraph and sparse subnetwork, has been proposed to mitigate the computational cost of deep Graph Neural Networks (GNNs) on large input graphs while preserving original performance. However, the winning GLTs in exisiting studies are obtained by applying iterative magnitude-based pruning (IMP) without re-evaluating and re-considering the pruned information, which disregards the dynamic changes in the significance of edges/weights during graph/model structure pruning, and thus limits the appeal of the winning tickets. In this paper, we formulate a conjecture, i.e., existing overlooked valuable information in the pruned graph connections and model parameters which can be re-grouped into GLT to enhance the final performance. Specifically, we propose an adversarial complementary erasing (ACE) framework to explore the valuable information from the pruned components, thereby developing a more powerful GLT, referred to as the ACE-GLT. The main idea is to mine valuable information from pruned edges/weights after each round of IMP, and employ the ACE technique to refine the GLT processing. Finally, experimental results demonstrate that our ACE-GLT outperforms existing methods for searching GLT in diverse tasks. Our code is available at https://github.com/Wangyuwen0627/ACE-GLT.
Unsupervised Zero-Shot Learning for Achieve Cross-Modal Alignment with Counterfactuals

Zero-Shot Learning (ZSL) is a technique that transfers knowledge from seen classes to unseen classes by establishing cross-modal mapping relationships. However, traditional ZSL methods heavily rely on a large number of expensive labeled data, which may not be readily available in practical applications. In practical applications there is often a lack of labels, and the approach implies that the lack of effective supervised information in the transfer process of seen classes can lead to ’negative causality’ problem between different modalities. Therefore, we propose an unsupervised counterfactual approach to solve the above problem. Therefore, we propose an unsupervised counterfactual approach to solve the above problem. In this paper, we propose an unsupervised learning model and use a Counterfactual Causal Inference framework to cross-modal mapping relationship adjustment (CMRA). Specifically, we aim to regard images as cause and Wikipedia text as effect form a causal relationship diagram. First, it uses multiple attributes attention to learn the visual semantic attributes of images and the corresponding Wikipedia text description words to form cross-modal alignment. Then, we combine contrastive learning and stop-gradient techniques to create a novel cross-modal mapping relationship. Finally, we conducted an investigation to assess the consistency of the multiple attribute attention in the distribution of visual semantic attributes before and after image transformation. To tackle this issue, we implemented a deactivation strategy specifically designed to eliminate the multiple attribute attention of visual semantic attributes that displayed noticeable distribution gaps at different stages. This approach also involves eliminating the mapping relationships between their corresponding Wikipedia text description words. This model evaluates the classification accuracy in AWA, CUB, APY, SUN. The experimental results show that the algorithm outperforms the state-of-the-art algorithms technology approaches.
DPBERT: Efficient Inference for BERT Based on Dynamic Planning

Large-scale pre-trained language models such as BERT have contributed significantly to the development of NLP. However, those models require large computational resources, making it difficult to be applied to mobile devices where computing power is limited. In this paper we aim to address the weakness of existing input-adaptive inference methods which fail to take full advantage of the structure of BERT. We propose Dynamic Planning in BERT, a novel fine-tuning strategy that can accelerate the inference process of BERT through selecting a subsequence of transformer layers list of backbone as a computational path for an input sample. To do this, our approach adds a planning module to the original BERT model to determine whether a layer is included or bypassed during inference. Experimental results on the GLUE benchmark exhibit that our method reduces latency to 75% while maintaining 98% accuracy, yielding a better accuracy-speed trade-off compared to state-of-the-art input-adaptive methods.
Ada-QPacknet – Multi-Task Forget-Free Continual Learning with Quantization Driven Adaptive Pruning

Continual learning (CL) is a challenging machine learning setting that is attracting the interest of an increasing number of researchers. Among recent CL works, architectural strategies appear particularly promising due to their potential to expand and adapt the model architecture as new tasks are presented. However, existing solutions do not efficiently exploit model sparsity due to the adoption of constant pruning ratios. Moreover, current approaches exhibit a tendency to quickly saturate model capacity since the number of weights is limited and each weight is restricted to a single value. In this paper, we propose Ada-QPacknet, a novel architectural CL method that resorts to adaptive pruning and quantization. These two features allow our model to overcome the two crucial issues of effective exploitation of model sparsity and efficient use of model capacity. Specifically, adaptive pruning restores model capacity by reducing the number of weights assigned to each task to a smaller subset of weights that preserves the performance of the full set, allowing other weights to be used for future tasks. Adaptive quantization separates each weight into multiple components with adaptively reduced bit-width, allowing a single weight to solve more than one task without significant performance drops, leading to improved exploitation of model capacity. Experimental results on benchmark CL scenarios show that our proposed method achieves better results in terms of accuracy than existing rehearsal, regularization, and architectural CL strategies. Moreover, our method significantly outperforms forget-free competitors in terms of efficient exploitation of model capacity.
Motivated Agent with Semantic Memory

This paper introduces a motivated agent scheme that enables an agent to create its own goals using prior knowledge about its environment. A motivated agent operates in a dynamically changing environment and is capable of setting and achieving its own goals, as well as those set by the designer. The agent has access to additional knowledge about the environment, which is represented in associative semantic memory. This memory is constructed based on ANAKG associative knowledge graphs, which have been shown to have several advantages over other semantic memories for processing symbolic sequential inputs. They are easy to organize and train. In this paper, we demonstrate that a motivated agent with semantic memory learns to achieve its goals more easily and utilizes environmental resources more effectively. To simplify comparisons with reinforcement learning, we represent the environment as an environmental graph that shows the principles governing it. By exploring the environment, the agent learns these principles and can use them to accomplish its tasks. Our experiments and tests confirm our claims about the higher efficiency of agents with memory. Moreover, an extensive comparison with reinforcement learning agents highlights the advantages of motivated learning over reinforcement learning.
Specifying Prior Beliefs over DAGs in Deep Bayesian Causal Structure Learning

We consider the principled incorporation of prior knowledge in deep learning based Bayesian approaches to causal structure learning via the prior belief. In particular, we investigate how to include knowledge about individual edges and causal dependencies in the prior over the underlying directed acyclic graph (DAG). While conceptually simple, substantial challenges arise because the acyclicity of a DAG limits the modeling choices of the marginal distributions over its edges. Specifying the marginals iteratively unveils their dependencies and ensures a sound formulation of the probability distribution over DAGs. We provide recipes for formulating valid priors over DAGs for two recent deep learning based Bayesian approaches to causal structure learning and demonstrate empirically that using this prior knowledge can enable significantly more sample-efficient causal structure search.
Online Evaluation of Tail Project Boosting in Citizen Science

In citizen science, regular people provide invaluable information by contributing to scientific projects. Citizen science platforms, such as SciStarter, provide easy access to numerous such projects. Often, users contribute mainly to a relatively small set of popular projects, while it is difficult for many projects to draw the attention of users. Thus, increasing the contribution of users to such low-popularity projects may increase scientific and societal impact. In this paper, we explore the power of a recommender system to draw attention to less popular projects. Standard use of recommendation systems often leads to limited exposure of less popular (tail) projects. We thus propose a re-ranking approach based on “lift boosting,” which uses the statistical lift measure to enhance the exposure of tail projects. By combining lift and traditional relevance measures, our method re-ranks the recommendation list to emphasize projects that are both relevant to the user while also have a high lift value. We implement our approach on SciStarter, one of the biggest citizen science platforms on the web. We conduct an online experiment involving over 2000 real users. Our results show a positive shift towards less popular projects without compromising overall contribution rates. This work demonstrates the potential of our lift-boosting method for promoting the discovery of tail projects in citizen science platforms, thereby fostering a more diverse range of scientific contributions.
Neuro-Symbolic Procedural Semantics for Reasoning-Intensive Visual Dialogue Tasks

This paper introduces a novel approach to visual dialogue that is based on neuro-symbolic procedural semantics. The approach builds further on earlier work on procedural semantics for visual question answering and expands it on the one hand with neuro-symbolic reasoning operations, and on the other hand with mechanisms that handle the challenges that are inherent to dialogue, in particular the incremental nature of the information that is conveyed. Concretely, we introduce (i) the use of a conversation memory as a data structure that explicitly and incrementally represents the information that is expressed during the subsequent turns of a dialogue, and (ii) the design of a neuro-symbolic procedural semantic representation that is grounded in both visual input and the conversation memory. We validate the methodology using the reasoning-intensive MNIST Dialog and CLEVR-Dialog benchmark challenges and achieve a question-level accuracy of 99.8% and 99.2% respectively. The methodology presented in this paper responds to the growing interest in the field of artificial intelligence in solving tasks that involve both low-level perception and high-level reasoning using a combination of neural and symbolic techniques.
Deep Unsupervised Hashing with Hyperbolic Multi-Structure Learning

Unsupervised hashing aims to learn a compact binary hash code to represent complex image content without label information. Existing deep unsupervised hashing methods typically first employ extracted image embeddings to construct semantic similarity structures and then map the images into compact hash codes while preserving the semantic similarity structure. However, the limited representation power of embeddings in Euclidean space and the inadequate exploration of the similarity structure in current methods often result in poorly discriminative hash codes. In this paper, we propose a novel method called Hyperbolic Multi-Structure Hashing (HMSH) to address these issues. Specifically, to increase the representation power of embeddings, we propose to map embeddings from Euclidean space to hyperbolic space and use the similarity structure constructed in hyperbolic space to guide hash learning. Meanwhile, to fully explore the structural information, we investigate four kinds of data structures, including local neighborhood structure, global clustering structure, inter/intra-class variation and variation under perturbation. Different data structures can complement each other, which is beneficial for hash learning. Extensive experimental results on three benchmark image datasets show that HMSH significantly outperforms state-of-the-art unsupervised hashing methods for image retrieval.
FMTESTING: A FEATUREIDE Plug-in for Automated Feature Model Analysis and Diagnosis

The increasing size and complexity of feature models (FMs) can trigger anomalies or faults, challenging stakeholders in keeping FMs consistent with the domain requirements. Existing quality assurance tools do not provide advanced techniques to point out possibilities to adapt an FM for consistency recovery. In this paper, we present FMTESTING, which is a plug-in for FEATUREIDE, an ECLIPSE-based IDE supporting different phases of feature-oriented software development. FMTESTING is capable of automatically generating property-based test cases based on six different types of FM analysis operations. Furthermore, for violated test cases, diagnoses are provided to precisely indicate faulty FM elements (constraints) that should be adapted to restore consistency. Our tool provides user interfaces inside FEATUREIDE to ensure convenient use, even for users who are not domain experts.
Associative Memories in the Feature Space

An autoassociative memory model is a function that, given a set of data points, takes as input an arbitrary vector and outputs the most similar data point from the memorized set. However, popular memory models fail to retrieve images even when the corruption is mild and easy to detect for a human evaluator. This is because similarities are evaluated in the raw pixel space, which does not contain any semantic information about the images. This problem can be easily solved by computing similarities in an embedding space instead of the pixel space. We show that an effective way of computing such embeddings is via a network pretrained with a contrastive loss. As the dimension of embedding spaces is often significantly smaller than the pixel space, we also have a faster computation of similarity scores. We test this method on complex datasets such as CIFAR10 and STL10. An additional drawback of current models is the need of storing the whole dataset in the pixel space, which is often extremely large. We relax this condition and propose a class of memory models that only stores low-dimensional semantic embeddings, and uses them to retrieve similar, but not identical, memories. We demonstrate a proof of concept of this method on a simple task on the MNIST dataset.
QCCDM: A Q-Augmented Causal Cognitive Diagnosis Model for Student Learning

Cognitive diagnosis is vital for intelligent education to determine students’ knowledge mastery levels from their response logs. The Q-matrix, representing the relationships between exercises and knowledge attributes, improves the interpretability of cognitive diagnosis models. However, completing the Q-matrix poses an expensive and challenging task due to the fine-grained division of knowledge attributes. Moreover, a manually sparse Q-matrix can also compromise the accuracy and interpretability of deducing students’ mastery levels, especially for infrequently observed or unseen knowledge attributes. To address this issue, this paper proposes a Q-augmented Causal Cognitive Diagnosis Model (QCCDM) for student learning. Specifically, QCCDM incorporates the structure causal model (SCM) to capture the causality between students’ mastery levels on different attributes, which enables to infer their proficiency on rarely observed knowledge attributes with better accuracy and interpretability. Notably, with SCM, one can guide students on how to realize their self-improvement through intervention. Furthermore, we propose to augment the Q-matrix in QCCDM, which uses the manual Q-matrix as a prior to deduce the relationships between exercises and explicit as well as latent knowledge attributes, resulting in a complete and comprehensive assessment of students’ abilities. We assess the efficacy of Q-augmentation across the widely-used Q-based cognitive diagnosis models and conduct the ablation study. The extensive experimental results on real-world datasets show that QCCDM outperforms the compared methods in terms of both accuracy and interpretability.
Rationale-Guided Few-Shot Classification to Detect Abusive Language

Abusive language is a concerning problem in online social media. Past research on detecting abusive language covers different platforms, languages, demographies, etc. However, models trained using these datasets do not perform well in cross-domain evaluation settings. To overcome this, a common strategy is to use a few samples from the target domain to train models to get better performance in that domain (cross-domain few-shot training). However, this might cause the models to overfit the artefacts of those samples. A compelling solution could be to guide the models toward rationales, i.e., spans of text that justify the text’s label. This method has been found to improve model performance in the in-domain setting across various NLP tasks. In this paper, we propose RGFS (Rationale-Guided Few-Shot Classification) for abusive language detection. We first build a multitask learning setup to jointly learn rationales, targets, and labels, and find a significant improvement of 6% macro F1 on the rationale detection task over training solely rationale classifiers. We introduce two rationale-integrated BERT-based architectures (the RGFS models) and evaluate our systems over five different abusive language datasets, finding that in the few-shot classification setting, RGFS-based models outperform baseline models by about 7% in macro F1 scores and perform competitively to models finetuned on other source domains. Furthermore, RGFS-based models outperform LIME/SHAP-based approaches in terms of plausibility and are close in performance in terms of faithfulness. Disclaimer: This paper contains material that many will find offensive or hateful. However, this cannot be avoided owing to the nature of the work.