Reviewerly/exHarmony huggingface dataset:
GAFM: A Knowledge Graph Completion Method Based on Graph Attention Faded Mechanism

Although the Knowledge Graph (KG) has been successfully applied to various applications, there is still a large amount of incomplete knowledge in the KG. This study proposes a Knowledge Graph Completion (KGC) method based on the Graph Attention Faded Mechanism (GAFM) to solve the problem of incomplete knowledge in KG. GAFM introduces a graph attention network that incorporates the information in multi-hop neighborhood nodes to embed the target entities into low dimensional space. To generate a more expressive entity representation, GAFM gives different weights to the neighborhood nodes of the target entity by adjusting the attention value of neighborhood nodes according to the variation of the path length. The attention value is adjusted by the attention faded coefficient, which decreases with the increase of the distance between the neighborhood node and the target entity. Then, considering that the capsule network has the ability to fit features, GAFM introduces the capsule network as the decoder to extract feature information from triple representations. To verify the effectiveness of the proposed method, we conduct a series of comparative experiments on public datasets (WN18RR and FB15k-237). Experimental results show that the proposed method outperforms baseline methods. The [email protected] metric is improved by 8% compared with the second-place KBGAT method.
An adaptive neighborhood-based search enhanced artificial ecosystem optimizer for UCAV path planning

Path planning is an essential component of the unmanned combat aerial vehicle (UCAV) system and is the precondition for achieving tasks such as aerial reconnaissance, monitoring, and fire attack. Its objective is to find a satisfactory route with full consideration of the threat area and constraints, which is a multi-constraint global optimization problem. The work proposes an adaptive neighborhood-based search enhanced artificial ecosystem optimizer (NSEAEO) to address the UCAV path planning problem. The new algorithm uses distance-fitness-based information in the consumption phase to construct an adaptive neighborhood for consumers, who choose the better individuals within the neighborhood for predation. The strategy not only facilitates a thorough search of the problem space but also enhances the global exploration capability of the algorithm. In addition, due to the lack of diversity of the population in the decomposition stage of the AEO algorithm, it is easy to fall into the local extremum. A novel updating decomposition mechanism is designed to dynamically choose the decomposition method according to the threshold in each iteration, which effectively averts insufficient diversity and increases the ability to escape from local extrema. Furthermore, to further improve the search capability of the algorithm, a quadratic interpolation (QI) operator is embedded in the AEO algorithm. The core idea is to choose three agents to match a quadratic function close to the goal function and adopt the extremum of the quadratic function to produce new agents. The above approach achieves a good balance between exploitation and exploration. The experimental results on a series of benchmark functions and UCAV path planning in complex environments demonstrate that NSEAEO outperforms other algorithms in terms of solution quality.
Nalin

Variable names are important to understand and maintain code. If a variable name and the value stored in the variable do not match, then the program suffers from a name-value inconsistency, which is due to one of two situations that developers may want to fix: Either a correct value is referred to through a misleading name, which negatively affects code understandability and maintainability, or the correct name is bound to a wrong value, which may cause unexpected runtime behavior. Finding name-value inconsistencies is hard because it requires an understanding of the meaning of names and knowledge about the values assigned to a variable at runtime. This paper presents Nalin, a technique to automatically detect name-value inconsistencies. The approach combines a dynamic analysis that tracks assignments of values to names with a neural machine learning model that predicts whether a name and a value fit together. To the best of our knowledge, this is the first work to formulate the problem of finding coding issues as a classification problem over names and runtime values. We apply Nalin to 106,652 real-world Python programs, where meaningful names are particularly important due to the absence of statically declared types. Our results show that the classifier detects name-value inconsistencies with high accuracy, that the warnings reported by Nalin have a precision of 80% and a recall of 76% w.r.t. a ground truth created in a user study, and that our approach complements existing techniques for finding coding issues.
Automated testing of software that uses machine learning APIs

An increasing number of software applications incorporate machine learning (ML) solutions for cognitive tasks that statistically mimic human behaviors. To test such software, tremendous human effort is needed to design image/text/audio inputs that are relevant to the software, and to judge whether the software is processing these inputs as most human beings do. Even when misbehavior is exposed, it is often unclear whether the culprit is inside the cognitive ML API or the code using the API.
Building the Future of Digital Advertising One Block at a Time: How Blockchain Technology Can Change Advertising Practice and Research

In this article we provide a primer for blockchain technology (BT) and explain ways that it has been applied (or can be applied) to the field of advertising research and practice. We situate this primer inside a critical look at the evolution of digital advertising that has been driven largely by immediate technological need for the maximization of profit rather than considerations for societal well-being. We discuss arenas in which the current state of digital advertising is not well positioned to maximize societal well-being and has built a consumer distrust of digital advertising, specifically with regard to the areas of privacy invasion, value to consumers, technology companies' power, inaccuracies of personalizations, and misinformation spread. Throughout this article we discuss how blockchain technologies can be used as a research environment for testing new paths for digital advertising that could tackle these issues and be more beneficial to society. We also provide an overview of avenues for future research on BT application in the digital advertising ecosystem.
Document Expansion Baselines and Learned Sparse Lexical Representations for MS MARCO V1 and V2

With doc2query, we train a neural sequence-to-sequence model that, given an input span of text, predicts a natural language query that the text might answer. These predictions can be viewed as document expansions that feed standard bag-of-words term weighting models such as BM25 or neural retrieval models based on learned sparse lexical representations such as uniCOIL. Previous experiments on the MS MARCO datasets have demonstrated the effectiveness of these methods, and they serve as baselines that are widely used by the community today. Following the recent release of the MS MARCO V2 passage and document ranking test collections, we have refreshed our doc2query and uniCOIL models. This work describes a number of resources that support competitive, reproducible baselines for both the MS MARCO V1 and V2 test collections using our Anserini and Pyserini IR toolkits. Together, they provide a solid foundation for future research on neural retrieval models using the MS MARCO datasets and beyond.
Enhancing Hypergraph Neural Networks with Intent Disentanglement for Session-based Recommendation

Session-based recommendation (SBR) aims at the next-item prediction with a short behavior session. Existing solutions fail to address two main challenges: 1) user interests are shown as dynamically coupled intents, and 2) sessions always contain noisy signals. To address them, in this paper, we propose a hypergraph-based solution, HIDE. Specifically, HIDE first constructs a hypergraph for each session to model the possible interest transitions from distinct perspectives. HIDE then disentangles the intents under each item click in micro and macro manners. In the micro-disentanglement, we perform intent-aware embedding propagation on session hypergraph to adaptively activate disentangled intents from noisy data. In the macro-disentanglement, we introduce an auxiliary intent-classification task to encourage the independence of different intents. Finally, we generate the intent-specific representations for the given session to make the final recommendation. Benchmark evaluations demonstrate the significant performance gain of our HIDE over the state-of-the-art methods.
H-ERNIE

The pre-trained language models (PLMs), such as BERT and ERNIE, have achieved outstanding performance in many natural language understanding tasks. Recently, PLMs-based Information Retrieval models have also been investigated and showed substantially state-of-the-art effectiveness, e.g., MORES, PROP and ColBERT. Moreover, most of the PLMs-based rankers only focus on a single level relevance matching (e.g., character-level), while ignore the other granularity information (e.g., words and phrases), which easily lead to the ambiguity of query understanding and inaccurate matching issues in web search.
Solar Radiation Forecasting Using Artificial Neural Networks Considering Feature Selection

Due to various factors, including worries about greenhouse gas emissions, supporting government policies, and decreased equipment costs, the expansion of solar-based energy generation, notably in the form of photovoltaics, has accelerated significantly in recent years. Solar panels continue to face several challenges regarding their practical integration and reliability. These concerns originate from the variable nature of the solar resource. Solar generation has inherent variability, which poses problems associated with the costs of supplemental generation and grid reliability. Therefore, high accuracy solar forecasting is required. Several machine learning strategies are broadly employed for solar power forecasting. However, analyzing solar radiation characteristics in order to select the features that have a meaningful correlation between inputs and outputs of machine learning algorithms has received less attention. This study uses a multilayer perceptron (MLP) artificial neural network (ANN) with Bayesian optimization to forecasting solar radiation. The Pearson Correlation Coefficients (PCCs) are used to select effective features. The simulation findings reveal that the accuracy assessment metrics are higher when employing feature selection for prediction.
Privacy-Preserving Synthetic Data Generation for Recommendation Systems

Recommendation systems make predictions chiefly based on users' historical interaction data (e.g., items previously clicked or purchased). There is a risk of privacy leakage when collecting the users' behavior data for building the recommendation model. However, existing privacy-preserving solutions are designed for tackling the privacy issue only during the model training [32] and results collection [40] phases. The problem of privacy leakage still exists when directly sharing the private user interaction data with organizations or releasing them to the public. To address this problem, in this paper, we present a User Privacy Controllable Synthetic Data Generation model (short for UPC-SDG), which generates synthetic interaction data for users based on their privacy preferences. The generation model aims to provide certain privacy guarantees while maximizing the utility of the generated synthetic data at both data level and item level. Specifically, at the data level, we design a selection module that selects those items that contribute less to a user's preferences from the user's interaction data. At the item level, a synthetic data generation module is proposed to generate a synthetic item corresponding to the selected item based on the user's preferences. Furthermore, we also present a privacy-utility trade-off strategy to balance the privacy and utility of the synthetic data. Extensive experiments and ablation studies have been conducted on three publicly accessible datasets to justify our method, demonstrating its effectiveness in generating synthetic data under users' privacy preferences.
A Multi-Task Based Neural Model to Simulate Users in Goal Oriented Dialogue Systems

A human-like user simulator that anticipates users' satisfaction scores, actions, and utterances can help goal-oriented dialogue systems in evaluating the conversation and refining their dialogue strategies. However, little work has experimented with user simulators which can generate users' utterances. In this paper, we propose a deep learning-based user simulator that predicts users' satisfaction scores and actions while also jointly generating users' utterances in a multi-task manner. In particular, we show that 1) the proposed deep text-to-text multi-task neural model achieves state-of-the-art performance in the users' satisfaction scores and actions prediction tasks, and 2) in an ablation analysis, user satisfaction score prediction, action prediction, and utterance generation tasks can boost the performance with each other via positive transfers across the tasks. The source code and model checkpoints used for the experiments run in this paper are available at the following weblink: \urlhttps://github.com/kimdanny/user-simulation-t5.
ProFairRec

News recommendation aims to help online news platform users find their preferred news articles. Existing news recommendation methods usually learn models from historical user behaviors on news. However, these behaviors are usually biased on news providers. Models trained on biased user data may capture and even amplify the biases on news providers, and are unfair for some minority news providers. In this paper, we propose a provider fairness-aware news recommendation framework (named ProFairRec), which can learn news recommendation models fair for different news providers from biased user data. The core idea of ProFairRec is to learn provider-fair news representations and provider-fair user representations to achieve provider fairness. To learn provider-fair representations from biased data, we employ provider-biased representations to inherit provider bias from data. Provider-fair and -biased news representations are learned from news content and provider IDs respectively, which are further aggregated to build fair and biased user representations based on user click history. All of these representations are used in model training while only fair representations are used for user-news matching to achieve fair news recommendation. Besides, we propose an adversarial learning task on news provider discrimination to prevent provider-fair news representation from encoding provider bias. We also propose an orthogonal regularization on provider-fair and -biased representations to better reduce provider bias in provider-fair representations. Moreover, ProFairRec is a general framework and can be applied to different news recommendation methods. Extensive experiments on a public dataset verify that our ProFairRec approach can effectively improve the provider fairness of many existing methods and meanwhile maintain their recommendation accuracy.
Deep learning-based privacy-preserving framework for synthetic trajectory generation

Synthetic data generation based on state-of-the-art deep learning methods has recently emerged as a promising solution to replace the expensive and laborious collection of real data. Accordingly, several deep learning approaches have been developed to generate synthetic trajectories. These existing solutions assume that a dataset of true trajectories is available with sufficient size to train a deep learning model. However, considering that the trajectories usually contain sensitive information that individuals do not wish to disclose, this assumption is unrealistic in real world applications. We propose a novel privacy-preserving framework designed to effectively generate synthetic trajectories. In contrast to existing solutions to this problem, the proposed method exploits a differential privacy mechanism for collecting training data from individual users to protect the privacy of their locations. A deep learning model for trajectory generation is then trained using the perturbed training dataset collected under differential privacy. We present experimental results to demonstrate that the proposed framework effectively exploits a dataset of perturbed trajectories to train a deep learning model and can therefore generate synthetic trajectories with distributions similar to those of real data. Experimental results on real world datasets show that our method achieves significantly better performance than baseline approaches.
Neutralizing Popularity Bias in Recommendation Models

Most existing recommendation models learn vectorized representations for items, i.e., item embeddings to make predictions. Item embeddings inherit popularity bias from the data, which leads to biased recommendations. We use this observation to design two simple and effective strategies, which can be flexibly plugged into different backbone recommendation models, to learn popularity neutral item representations. One strategy isolates popularity bias in one embedding direction and neutralizes the popularity direction post-training. The other strategy encourages all embedding directions to be disentangled and popularity neutral. We demonstrate that the proposed strategies outperform state-of-the-art debiasing methods on various real-world datasets, and improve recommendation quality of shallow and deep backbone models.
Towards Explainable Search Results

It has been shown that the interpretability of search results is enhanced when query aspects covered by documents are explicitly provided. However, existing work on aspect-oriented explanation of search results explains each document independently. These explanations thus cannot describe the differences between documents. This issue is also true for existing models on query aspect generation. Furthermore, these models provide a single query aspect for each document, even though documents often cover multiple query aspects. To overcome these limitations, we propose LiEGe, an approach that jointly explains all documents in a search result list. LiEGe provides semantic representations at two levels of granularity -- documents and their tokens -- using different interaction signals including cross-document interactions. These allow listwise modeling of a search result list as well as the generation of coherent explanations for documents. To appropriately explain documents that cover multiple query aspects, we introduce two settings for search result explanation: comprehensive and novelty explanation generation. LiEGe is trained and evaluated for both settings. We evaluate LiEGe on datasets built from Wikipedia and real query logs of the Bing search engine. Our experimental results demonstrate that LiEGe outperforms all baselines, with improvements that are substantial and statistically significant.
Mitigating the Filter Bubble While Maintaining Relevance

Online recommendation systems are prone to create filter bubbles, whereby users are only recommended content narrowly aligned with their historical interests. In the case of media recommendation, this can reinforce political polarization by recommending topical content (e.g., on the economy) at one extreme end of the political spectrum even though this topic has broad coverage from multiple political viewpoints that would provide a more balanced and informed perspective for the user. Historically, Maximal Marginal Relevance (MMR) has been used to diversify result lists and even mitigate filter bubbles, but suffers from three key drawbacks: (1)~MMR directly sacrifices relevance for diversity, (2)~MMR typically diversifies across all content and not just targeted dimensions (e.g., political polarization), and (3)~MMR is inefficient in practice due to the need to compute pairwise similarities between recommended items. To simultaneously address these limitations, we propose a novel methodology that trains Concept Activation Vectors (CAVs) for targeted topical dimensions (e.g., political polarization). We then modulate the latent embeddings of user preferences in a state-of-the-art VAE-based recommender system to diversify along the targeted dimension while preserving topical relevance across orthogonal dimensions. Our experiments show that our Targeted Diversification VAE-based Collaborative Filtering (TD-VAE-CF) methodology better preserves relevance of content to user preferences across a range of diversification levels in comparison to both untargeted and targeted variations of Maximum Marginal Relevance (MMR); TD-VAE-CF is also much more computationally efficient than the post-hoc re-ranking approach of MMR.
Hybrid Multi‐Strategy Improved Wild Horse Optimizer

Wild Horse Optimizer (WHO), a new metaheuristic algorithm proposed in recent years, has some weaknesses in solving practical problems, such as low searching accuracy and slow convergence speed. Herein, a Hybrid Multi‐Strategy improved Wild Horse Optimizer (HMSWHO) is proposed, which includes four strategies to improve the optimization capability. The Halton sequence is used to initialize the foal population to make the population more diverse. The adaptive parameter TDR is improved to balance the global exploration and local exploitation. The simplex method is used to improve the worst position of the population. Wild horse escaping behavior is added to improve search efficiency and optimization accuracy. The main innovation strategies are the improvement of TDR and the addition of escaping behavior. To verify the effectiveness of the improved strategies, 12 benchmark test functions, CEC2017, and CEC2021 test functions are selected for simulation experiments. Mechanical design examples are added for optimization, and the optimization results are 16.61%, 1.65%, and 0.21% less than that of WHO. The results show that the improved algorithm has obvious advantages in convergence speed, accuracy, and stability. HMSWHO can be applied to more practical engineering optimization problems and provide new ideas for structural optimization methods.
EarIO

This paper presents EarIO, an AI-powered acoustic sensing technology that allows an earable (e.g., earphone) to continuously track facial expressions using two pairs of microphone and speaker (one on each side), which are widely available in commodity earphones. It emits acoustic signals from a speaker on an earable towards the face. Depending on facial expressions, the muscles, tissues, and skin around the ear would deform differently, resulting in unique echo profiles in the reflected signals captured by an on-device microphone. These received acoustic signals are processed and learned by a customized deep learning pipeline to continuously infer the full facial expressions represented by 52 parameters captured using a TruthDepth camera. Compared to similar technologies, it has significantly lower power consumption, as it can sample at 86 Hz with a power signature of 154 mW. A user study with 16 participants under three different scenarios, showed that EarIO can reliably estimate the detailed facial movements when the participants were sitting, walking or after remounting the device. Based on the encouraging results, we further discuss the potential opportunities and challenges on applying EarIO on future ear-mounted wearables.