pwc-archive/papers-with-abstracts huggingface dataset:
NEWTS: A Corpus for News Topic-Focused Summarization
Authors: Seyed Ali Bahrainian, Sheridan Feucht, Carsten Eickhoff
Date: 2022-05-31 00:00:00
Proceeding: Findings (ACL) 2022 5
Tasks: Benchmarking, Text Summarization

Text summarization models are approaching human levels of fidelity. Existing benchmarking corpora provide concordant pairs of full and abridged versions of Web, news or, professional content. To date, all summarization datasets operate under a one-size-fits-all paradigm that may not reflect the full range of organic summarization needs. Several recently proposed models (e.g., plug and play language models) have the capacity to condition the generated summaries on a desired range of themes. These capacities remain largely unused and unevaluated as there is no dedicated dataset that would support the task of topic-focused summarization. This paper introduces the first topical summarization corpus NEWTS, based on the well-known CNN/Dailymail dataset, and annotated via online crowd-sourcing. Each source article is paired with two reference summaries, each focusing on a different theme of the source document. We evaluate a representative range of existing techniques and analyze the effectiveness of different prompting methods.
APPReddit: a Corpus of Reddit Posts Annotated for Appraisal
Authors: Marco Antonio Stranisci, Simona Frenda, Eleonora Ceccaldi, Valerio Basile, Rossana Damiano, Viviana Patti
Date: 2022-05-31 00:00:00
Proceeding: LREC 2022 6
Tasks: Emotion Recognition

Despite the large number of computational resources for emotion recognition, there is a lack of data sets relying on appraisal models. According to Appraisal theories, emotions are the outcome of a multi-dimensional evaluation of events. In this paper, we present APPReddit, the first corpus of non-experimental data annotated according to this theory. After describing its development, we compare our resource with enISEAR, a corpus of events created in an experimental setting and annotated for appraisal. Results show that the two corpora can be mapped notwithstanding different typologies of data and annotations schemes. A SVM model trained on APPReddit predicts four appraisal dimensions without significant loss. Merging both corpora in a single training set increases the prediction of 3 out of 4 dimensions. Such findings pave the way to a better performing classification model for appraisal prediction.
Preparing an Endangered Language for the Digital Age: The Case of Judeo-Spanish
Authors: Alp Öktem, Rodolfo Zevallos, Yasmin Moslem, Güneş Öztürk, Karen Şarhon
Date: 2022-05-31 00:00:00
Proceeding: EURALI (LREC) 2022 6
Tasks: Machine Translation, Speech Synthesis, text-to-speech, Text to Speech, Text-To-Speech Synthesis, Translation

We develop machine translation and speech synthesis systems to complement the efforts of revitalizing Judeo-Spanish, the exiled language of Sephardic Jews, which survived for centuries, but now faces the threat of extinction in the digital age. Building on resources created by the Sephardic community of Turkey and elsewhere, we create corpora and tools that would help preserve this language for future generations. For machine translation, we first develop a Spanish to Judeo-Spanish rule-based machine translation system, in order to generate large volumes of synthetic parallel data in the relevant language pairs: Turkish, English and Spanish. Then, we train baseline neural machine translation engines using this synthetic data and authentic parallel data created from translations by the Sephardic community. For text-to-speech synthesis, we present a 3.5 hour single speaker speech corpus for building a neural speech synthesis engine. Resources, model weights and online inference engines are shared publicly.
hmBERT: Historical Multilingual Language Models for Named Entity Recognition
Authors: Stefan Schweter, Luisa März, Katharina Schmid, Erion Çano
Date: 2022-05-31 00:00:00
Tasks: Language Modeling, Language Modelling, Named Entity Recognition, Named Entity Recognition (NER), Optical Character Recognition, Optical Character Recognition (OCR)

Compared to standard Named Entity Recognition (NER), identifying persons, locations, and organizations in historical texts constitutes a big challenge. To obtain machine-readable corpora, the historical text is usually scanned and Optical Character Recognition (OCR) needs to be performed. As a result, the historical corpora contain errors. Also, entities like location or organization can change over time, which poses another challenge. Overall, historical texts come with several peculiarities that differ greatly from modern texts and large labeled corpora for training a neural tagger are hardly available for this domain. In this work, we tackle NER for historical German, English, French, Swedish, and Finnish by training large historical language models. We circumvent the need for large amounts of labeled data by using unlabeled data for pretraining a language model. We propose hmBERT, a historical multilingual BERT-based language model, and release the model in several versions of different sizes. Furthermore, we evaluate the capability of hmBERT by solving downstream NER as part of this year's HIPE-2022 shared task and provide detailed analysis and insights. For the Multilingual Classical Commentary coarse-grained NER challenge, our tagger HISTeria outperforms the other teams' models for two out of three languages.
A Multi-level Supervised Contrastive Learning Framework for Low-Resource Natural Language Inference
Authors: Shu'ang Li, Xuming Hu, Li Lin, Aiwei Liu, Lijie Wen, Philip S. Yu
Date: 2022-05-31 00:00:00
Tasks: Contrastive Learning, Data Augmentation, Natural Language Inference, Natural Language Understanding, Sentence, text-classification, Text Classification

Natural Language Inference (NLI) is a growingly essential task in natural language understanding, which requires inferring the relationship between the sentence pairs (premise and hypothesis). Recently, low-resource natural language inference has gained increasing attention, due to significant savings in manual annotation costs and a better fit with real-world scenarios. Existing works fail to characterize discriminative representations between different classes with limited training data, which may cause faults in label prediction. Here we propose a multi-level supervised contrastive learning framework named MultiSCL for low-resource natural language inference. MultiSCL leverages a sentence-level and pair-level contrastive learning objective to discriminate between different classes of sentence pairs by bringing those in one class together and pushing away those in different classes. MultiSCL adopts a data augmentation module that generates different views for input samples to better learn the latent representation. The pair-level representation is obtained from a cross attention module. We conduct extensive experiments on two public NLI datasets in low-resource settings, and the accuracy of MultiSCL exceeds other models by 3.1% on average. Moreover, our method outperforms the previous state-of-the-art method on cross-domain tasks of text classification.
A Knowledge-Enhanced Adversarial Model for Cross-lingual Structured Sentiment Analysis
Authors: Qi Zhang, Jie zhou, Qin Chen, Qingchun Bai, Jun Xiao, Liang He
Date: 2022-05-31 00:00:00
Tasks: Cross-Lingual Transfer, Sentiment Analysis

Structured sentiment analysis, which aims to extract the complex semantic structures such as holders, expressions, targets, and polarities, has obtained widespread attention from both industry and academia. Unfortunately, the existing structured sentiment analysis datasets refer to a few languages and are relatively small, limiting neural network models' performance. In this paper, we focus on the cross-lingual structured sentiment analysis task, which aims to transfer the knowledge from the source language to the target one. Notably, we propose a Knowledge-Enhanced Adversarial Model (\texttt{KEAM}) with both implicit distributed and explicit structural knowledge to enhance the cross-lingual transfer. First, we design an adversarial embedding adapter for learning an informative and robust representation by capturing implicit semantic information from diverse multi-lingual embeddings adaptively. Then, we propose a syntax GCN encoder to transfer the explicit semantic information (e.g., universal dependency tree) among multiple languages. We conduct experiments on five datasets and compare \texttt{KEAM} with both the supervised and unsupervised methods. The extensive experimental results show that our \texttt{KEAM} model outperforms all the unsupervised baselines in various metrics.
Enhancing Event-Level Sentiment Analysis with Structured Arguments
Authors: Qi Zhang, Jie zhou, Qin Chen, Qinchun Bai, Liang He
Date: 2022-05-31 00:00:00
Tasks: Event Extraction, Sentiment Analysis

Previous studies about event-level sentiment analysis (SA) usually model the event as a topic, a category or target terms, while the structured arguments (e.g., subject, object, time and location) that have potential effects on the sentiment are not well studied. In this paper, we redefine the task as structured event-level SA and propose an End-to-End Event-level Sentiment Analysis ($\textit{E}^{3}\textit{SA}$) approach to solve this issue. Specifically, we explicitly extract and model the event structure information for enhancing event-level SA. Extensive experiments demonstrate the great advantages of our proposed approach over the state-of-the-art methods. Noting the lack of the dataset, we also release a large-scale real-world dataset with event arguments and sentiment labelling for promoting more researches\footnote{The dataset is available at https://github.com/zhangqi-here/E3SA}.
FinBERT-MRC: financial named entity recognition using BERT under the machine reading comprehension paradigm
Authors: Yuzhe Zhang, Hong Zhang
Date: 2022-05-31 00:00:00
Tasks: Machine Reading Comprehension, named-entity-recognition, Named Entity Recognition, Named Entity Recognition (NER), Reading Comprehension

Financial named entity recognition (FinNER) from literature is a challenging task in the field of financial text information extraction, which aims to extract a large amount of financial knowledge from unstructured texts. It is widely accepted to use sequence tagging frameworks to implement FinNER tasks. However, such sequence tagging models cannot fully take advantage of the semantic information in the texts. Instead, we formulate the FinNER task as a machine reading comprehension (MRC) problem and propose a new model termed FinBERT-MRC. This formulation introduces significant prior information by utilizing well-designed queries, and extracts start index and end index of target entities without decoding modules such as conditional random fields (CRF). We conduct experiments on a publicly available Chinese financial dataset ChFinAnn and a real-word bussiness dataset AdminPunish. FinBERT-MRC model achieves average F1 scores of 92.78% and 96.80% on the two datasets, respectively, with average F1 gains +3.94% and +0.89% over some sequence tagging models including BiLSTM-CRF, BERT-Tagger, and BERT-CRF. The source code is available at https://github.com/zyz0000/FinBERT-MRC.
Analyzing Modality Robustness in Multimodal Sentiment Analysis
Authors: Devamanyu Hazarika, Yingting Li, Bo Cheng, Shuai Zhao, Roger Zimmermann, Soujanya Poria
Date: 2022-05-30 00:00:00
Proceeding: NAACL 2022 7
Tasks: Diagnostic, Multimodal Sentiment Analysis, Sentiment Analysis

Building robust multimodal models are crucial for achieving reliable deployment in the wild. Despite its importance, less attention has been paid to identifying and improving the robustness of Multimodal Sentiment Analysis (MSA) models. In this work, we hope to address that by (i) Proposing simple diagnostic checks for modality robustness in a trained multimodal model. Using these checks, we find MSA models to be highly sensitive to a single modality, which creates issues in their robustness; (ii) We analyze well-known robust training strategies to alleviate the issues. Critically, we observe that robustness can be achieved without compromising on the original performance. We hope our extensive study-performed across five models and two benchmark datasets-and proposed procedures would make robustness an integral component in MSA research. Our diagnostic checks and robust training solutions are simple to implement and available at https://github. com/declare-lab/MSA-Robustness.
Correlation versus RMSE Loss Functions in Symbolic Regression Tasks
Authors: Nathan Haut, Wolfgang Banzhaf, Bill Punch
Date: 2022-05-31 00:00:00
Tasks: regression, Symbolic Regression

The use of correlation as a fitness function is explored in symbolic regression tasks and the performance is compared against the typical RMSE fitness function. Using correlation with an alignment step to conclude the evolution led to significant performance gains over RMSE as a fitness function. Using correlation as a fitness function led to solutions being found in fewer generations compared to RMSE, as well it was found that fewer data points were needed in the training set to discover the correct equations. The Feynman Symbolic Regression Benchmark as well as several other old and recent GP benchmark problems were used to evaluate performance.
The Environmental Discontinuity Hypothesis for Down-Sampled Lexicase Selection
Authors: Ryan Boldi, Thomas Helmuth, Lee Spector
Date: 2022-05-31 00:00:00
Tasks: Program Synthesis

Down-sampling training data has long been shown to improve the generalization performance of a wide range of machine learning systems. Recently, down-sampling has proved effective in genetic programming (GP) runs that utilize the lexicase parent selection technique. Although this down-sampling procedure has been shown to significantly improve performance across a variety of problems, it does not seem to do so due to encouraging adaptability through environmental change. We hypothesize that the random sampling that is performed every generation causes discontinuities that result in the population being unable to adapt to the shifting environment. We investigate modifications to down-sampled lexicase selection in hopes of promoting incremental environmental change to scaffold evolution by reducing the amount of jarring discontinuities between the environments of successive generations. In our empirical studies, we find that forcing incremental environmental change is not significantly better for evolving solutions to program synthesis problems than simple random down-sampling. In response to this, we attempt to exacerbate the hypothesized prevalence of discontinuities by using only disjoint down-samples to see if it hinders performance. We find that this also does not significantly differ from the performance of regular random down-sampling. These negative results raise new questions about the ways in which the composition of sub-samples, which may include synonymous cases, may be expected to influence the performance of machine learning systems that use down-sampling.
An Effective and Efficient Evolutionary Algorithm for Many-Objective Optimization
Authors: Yani Xue, Miqing Li, Xiaohui Liu
Date: 2022-05-31 00:00:00
Tasks: Density Estimation, Evolutionary Algorithms, Multiobjective Optimization

In evolutionary multiobjective optimization, effectiveness refers to how an evolutionary algorithm performs in terms of converging its solutions into the Pareto front and also diversifying them over the front. This is not an easy job, particularly for optimization problems with more than three objectives, dubbed many-objective optimization problems. In such problems, classic Pareto-based algorithms fail to provide sufficient selection pressure towards the Pareto front, whilst recently developed algorithms, such as decomposition-based ones, may struggle to maintain a set of well-distributed solutions on certain problems (e.g., those with irregular Pareto fronts). Another issue in some many-objective optimizers is rapidly increasing computational requirement with the number of objectives, such as hypervolume-based algorithms and shift-based density estimation (SDE) methods. In this paper, we aim to address this problem and develop an effective and efficient evolutionary algorithm (E3A) that can handle various many-objective problems. In E3A, inspired by SDE, a novel population maintenance method is proposed to select high-quality solutions in the environmental selection procedure. We conduct extensive experiments and show that E3A performs better than 11 state-of-the-art many-objective evolutionary algorithms in quickly finding a set of well-converged and well-diversified solutions.
Biological Evolution and Genetic Algorithms: Exploring the Space of Abstract Tile Self-Assembly
Authors: Christian Schroeder de Witt
Date: 2022-05-28 00:00:00
Tasks: CPU, GPU

A physically-motivated genetic algorithm (GA) and full enumeration for a tile-based model of self-assembly (JaTAM) is implemented using a graphics processing unit (GPU). We observe performance gains with respect to state-of-the-art implementations on CPU of factor 7.7 for the GA and 2.9 for JaTAM. The correctness of our GA implementation is demonstrated using a test-bed fitness function, and our JaTAM implementation is verified by classifying a well-known search space $S_{2,8}$ based on two tile types. The performance gains achieved allow for the classification of a larger search space $S^{32}_{3,8}$ based on three tile types. The prevalence of structures based on two tile types demonstrates that simple organisms emerge preferrably even in complex ecosystems. The modularity of the largest structures found motivates the assumption that to first order, $S_{2,8}$ forms the building blocks of $S_{3,8}$. We conclude that GPUs may play an important role in future studies of evolutionary dynamics.
Hedging option books using neural-SDE market models
Authors: Samuel N. Cohen, Christoph Reisinger, Sheng Wang
Date: 2022-05-31 00:00:00
Tasks: Sensitivity

We study the capability of arbitrage-free neural-SDE market models to yield effective strategies for hedging options. In particular, we derive sensitivity-based and minimum-variance-based hedging strategies using these models and examine their performance when applied to various option portfolios using real-world data. Through backtesting analysis over typical and stressed market periods, we show that neural-SDE market models achieve lower hedging errors than Black--Scholes delta and delta-vega hedging consistently over time, and are less sensitive to the tenor choice of hedging instruments. In addition, hedging using market models leads to similar performance to hedging using Heston models, while the former tends to be more robust during stressed market periods.
Interactive Query Clarification and Refinement via User Simulation
Authors: Pierre Erbacher, Ludovic Denoyer, Laure Soulier
Date: 2022-05-31 00:00:00
Tasks: Document Ranking, Information Retrieval, Retrieval, User Simulation

When users initiate search sessions, their queries are often unclear or might lack of context; this resulting in inefficient document ranking. Multiple approaches have been proposed by the Information Retrieval community to add context and retrieve documents aligned with users' intents. While some work focus on query disambiguation using users' browsing history, a recent line of work proposes to interact with users by asking clarification questions or/and proposing clarification panels. However, these approaches count either a limited number (i.e., 1) of interactions with user or log-based interactions. In this paper, we propose and evaluate a fully simulated query clarification framework allowing multi-turn interactions between IR systems and user agents.
Distributed Ledger Technology based Integrated Healthcare Solution for Bangladesh
Authors: Md. Ariful Islam, Md. Antonin Islam, Md. Amzad Hossain Jacky, Md. Al-Amin, M. Saef Ullah Miah, Md Muhidul Islam Khan, Md. Iqbal Hossain
Date: 2022-05-30 00:00:00

Healthcare data is sensitive and requires great protection. Encrypted electronic health records (EHRs) contain personal and sensitive data such as names and addresses. Having access to patient data benefits all of them. This paper proposes a blockchain-based distributed healthcare application platform for Bangladeshi public and private healthcare providers. Using data immutability and smart contracts, the suggested application framework allows users to create safe digital agreements for commerce or collaboration. Thus, all enterprises may securely collaborate using the same blockchain network, gaining data openness and read/write capacity. The proposed application consists of various application interfaces for various system users. For data integrity, privacy, permission and service availability, the proposed solution leverages Hyperledger fabric and Blockchain as a Service. Everyone will also have their own profile in the portal. A unique identity for each person and the installation of digital information centres across the country have greatly eased the process. It will collect systematic health data from each person which will be beneficial for research institutes and health-related organisations. A national data warehouse in Bangladesh is feasible for this application and It is also possible to keep a clean health sector by analysing data stored in this warehouse and conducting various purification algorithms using technologies like Data Science. Given that Bangladesh has both public and private health care, a straightforward digital strategy for all organisations is essential.
A Design Space for Explainable Ranking and Ranking Models
Authors: I. Al Hazwani, J. Schmid, M. Sachdeva, J. Bernard
Date: 2022-05-27 00:00:00
Tasks: Decision Making, Descriptive, Recommendation Systems

Item ranking systems support users in multi-criteria decision-making tasks. Users need to trust rankings and ranking algorithms to reflect user preferences nicely while avoiding systematic errors and biases. However, today only few approaches help end users, model developers, and analysts to explain rankings. We report on the study of explanation approaches from the perspectives of recommender systems, explainable AI, and visualization research and propose the first cross-domain design space for explainers of item rankings. In addition, we leverage the descriptive power of the design space to characterize a) existing explainers and b) three main user groups involved in ranking explanation tasks. The generative power of the design space is a means for future designers and developers to create more target-oriented solutions in this only weakly exploited space.