pwc-archive/papers-with-abstracts huggingface dataset:
Towards Human-Free Automatic Quality Evaluation of German Summarization
Authors: Neslihan Iskender, Oleg Vasilyev, Tim Polzehl, John Bohannon, Sebastian Möller
Date: 2021-05-13 00:00:00
Tasks: Informativeness, Language Modeling, Language Modelling

Evaluating large summarization corpora using humans has proven to be expensive from both the organizational and the financial perspective. Therefore, many automatic evaluation metrics have been developed to measure the summarization quality in a fast and reproducible way. However, most of the metrics still rely on humans and need gold standard summaries generated by linguistic experts. Since BLANC does not require golden summaries and supposedly can use any underlying language model, we consider its application to the evaluation of summarization in German. This work demonstrates how to adjust the BLANC metric to a language other than English. We compare BLANC scores with the crowd and expert ratings, as well as with commonly used automatic metrics on a German summarization data set. Our results show that BLANC in German is especially good in evaluating informativeness.
Designing Multimodal Datasets for NLP Challenges
Authors: James Pustejovsky, Eben Holderness, Jingxuan Tu, Parker Glenn, Kyeongmin Rim, Kelley Lynch, Richard Brutti
Date: 2021-05-12 00:00:00
Tasks: Diagnostic

In this paper, we argue that the design and development of multimodal datasets for natural language processing (NLP) challenges should be enhanced in two significant respects: to more broadly represent commonsense semantic inferences; and to better reflect the dynamics of actions and events, through a substantive alignment of textual and visual information. We identify challenges and tasks that are reflective of linguistic and cognitive competencies that humans have when speaking and reasoning, rather than merely the performance of systems on isolated tasks. We introduce the distinction between challenge-based tasks and competence-based performance, and describe a diagnostic dataset, Recipe-to-Video Questions (R2VQ), designed for testing competence-based comprehension over a multimodal recipe collection (http://r2vq.org/). The corpus contains detailed annotation supporting such inferencing tasks and facilitating a rich set of question families that we use to evaluate NLP systems.
Go Beyond Plain Fine-tuning: Improving Pretrained Models for Social Commonsense
Authors: Ting-Yun Chang, Yang Liu, Karthik Gopalakrishnan, Behnam Hedayatnia, Pei Zhou, Dilek Hakkani-Tur
Date: 2021-05-12 00:00:00

Pretrained language models have demonstrated outstanding performance in many NLP tasks recently. However, their social intelligence, which requires commonsense reasoning about the current situation and mental states of others, is still developing. Towards improving language models' social intelligence, we focus on the Social IQA dataset, a task requiring social and emotional commonsense reasoning. Building on top of the pretrained RoBERTa and GPT2 models, we propose several architecture variations and extensions, as well as leveraging external commonsense corpora, to optimize the model for Social IQA. Our proposed system achieves competitive results as those top-ranking models on the leaderboard. This work demonstrates the strengths of pretrained language models, and provides viable ways to improve their performance for a particular task.
Black or White but never neutral: How readers perceive identity from yellow or skin-toned emoji
Authors: Alexander Robertson, Walid Magdy, Sharon Goldwater
Date: 2021-05-12 00:00:00
Tasks: Sociology

Research in sociology and linguistics shows that people use language not only to express their own identity but to understand the identity of others. Recent work established a connection between expression of identity and emoji usage on social media, through use of emoji skin tone modifiers. Motivated by that finding, this work asks if, as with language, readers are sensitive to such acts of self-expression and use them to understand the identity of authors. In behavioral experiments (n=488), where text and emoji content of social media posts were carefully controlled before being presented to participants, we find in the affirmative -- emoji are a salient signal of author identity. That signal is distinct from, and complementary to, the one encoded in language. Participant groups (based on self-identified ethnicity) showed no differences in how they perceive this signal, except in the case of the default yellow emoji. While both groups associate this with a White identity, the effect was stronger in White participants. Our finding that emoji can index social variables will have experimental applications for researchers but also implications for designers: supposedly ``neutral`` defaults may be more representative of some users than others.
Loosely Conditioned Emulation of Global Climate Models With Generative Adversarial Networks
Authors: Alexis Ayala, Christopher Drazic, Brian Hutchinson, Ben Kravitz, Claudia Tebaldi
Date: 2021-04-29 00:00:00

Climate models encapsulate our best understanding of the Earth system, allowing research to be conducted on its future under alternative assumptions of how human-driven climate forces are going to evolve. An important application of climate models is to provide metrics of mean and extreme climate changes, particularly under these alternative future scenarios, as these quantities drive the impacts of climate on society and natural systems. Because of the need to explore a wide range of alternative scenarios and other sources of uncertainties in a computationally efficient manner, climate models can only take us so far, as they require significant computational resources, especially when attempting to characterize extreme events, which are rare and thus demand long and numerous simulations in order to accurately represent their changing statistics. Here we use deep learning in a proof of concept that lays the foundation for emulating global climate model output for different scenarios. We train two "loosely conditioned" Generative Adversarial Networks (GANs) that emulate daily precipitation output from a fully coupled Earth system model: one GAN modeling Fall-Winter behavior and the other Spring-Summer. Our GANs are trained to produce spatiotemporal samples: 32 days of precipitation over a 64x128 regular grid discretizing the globe. We evaluate the generator with a set of related performance metrics based upon KL divergence, and find the generated samples to be nearly as well matched to the test data as the validation data is to test. We also find the generated samples to accurately estimate the mean number of dry days and mean longest dry spell in the 32 day samples. Our trained GANs can rapidly generate numerous realizations at a vastly reduced computational expense, compared to large ensembles of climate models, which greatly aids in estimating the statistics of extreme events.
Optimal transport with some directed distances
Authors: Wolfgang Stummer
Date: 2021-05-12 00:00:00

We present a toolkit of directed distances between quantile functions. By employing this, we solve some new optimal transport (OT) problems which e.g. considerably flexibilize some prominent OTs expressed through Wasserstein distances.
Semantic Table Retrieval using Keyword and Table Queries
Authors: Shuo Zhang, Krisztian Balog
Date: 2021-05-13 00:00:00
Tasks: Retrieval, Table Retrieval

Tables on the Web contain a vast amount of knowledge in a structured form. To tap into this valuable resource, we address the problem of table retrieval: answering an information need with a ranked list of tables. We investigate this problem in two different variants, based on how the information need is expressed: as a keyword query or as an existing table ("query-by-table"). The main novel contribution of this work is a semantic table retrieval framework for matching information needs (keyword or table queries) against tables. Specifically, we (i) represent queries and tables in multiple semantic spaces (both discrete sparse and continuous dense vector representations) and (ii) introduce various similarity measures for matching those semantic representations. We consider all possible combinations of semantic representations and similarity measures and use these as features in a supervised learning model. Using two purpose-built test collections based on Wikipedia tables, we demonstrate significant and substantial improvements over state-of-the-art baselines.
Causal Intervention for Leveraging Popularity Bias in Recommendation
Authors: Yang Zhang, Fuli Feng, Xiangnan He, Tianxin Wei, Chonggang Song, Guohui Ling, Yongdong Zhang
Date: 2021-05-13 00:00:00
Tasks: Collaborative Filtering, Recommendation Systems

Recommender system usually faces popularity bias issues: from the data perspective, items exhibit uneven (long-tail) distribution on the interaction frequency; from the method perspective, collaborative filtering methods are prone to amplify the bias by over-recommending popular items. It is undoubtedly critical to consider popularity bias in recommender systems, and existing work mainly eliminates the bias effect. However, we argue that not all biases in the data are bad -- some items demonstrate higher popularity because of their better intrinsic quality. Blindly pursuing unbiased learning may remove the beneficial patterns in the data, degrading the recommendation accuracy and user satisfaction. This work studies an unexplored problem in recommendation -- how to leverage popularity bias to improve the recommendation accuracy. The key lies in two aspects: how to remove the bad impact of popularity bias during training, and how to inject the desired popularity bias in the inference stage that generates top-K recommendations. This questions the causal mechanism of the recommendation generation process. Along this line, we find that item popularity plays the role of confounder between the exposed items and the observed interactions, causing the bad effect of bias amplification. To achieve our goal, we propose a new training and inference paradigm for recommendation named Popularity-bias Deconfounding and Adjusting (PDA). It removes the confounding popularity bias in model training and adjusts the recommendation score with desired popularity bias via causal intervention. We demonstrate the new paradigm on latent factor model and perform extensive experiments on three real-world datasets. Empirical studies validate that the deconfounded training is helpful to discover user real interests and the inference adjustment with popularity bias could further improve the recommendation accuracy.
"Who can help me?": Knowledge Infused Matching of Support Seekers and Support Providers during COVID-19 on Reddit
Authors: Manas Gaur, Kaushik Roy, Aditya Sharma, Biplav Srivastava, Amit Sheth
Date: 2021-05-12 00:00:00
Tasks: Natural Language Inference

During the ongoing COVID-19 crisis, subreddits on Reddit, such as r/Coronavirus saw a rapid growth in user's requests for help (support seekers - SSs) including individuals with varying professions and experiences with diverse perspectives on care (support providers - SPs). Currently, knowledgeable human moderators match an SS with a user with relevant experience, i.e, an SP on these subreddits. This unscalable process defers timely care. We present a medical knowledge-infused approach to efficient matching of SS and SPs validated by experts for the users affected by anxiety and depression, in the context of with COVID-19. After matching, each SP to an SS labeled as either supportive, informative, or similar (sharing experiences) using the principles of natural language inference. Evaluation by 21 domain experts indicates the efficacy of incorporated knowledge and shows the efficacy the matching system.
LANA: Towards Personalized Deep Knowledge Tracing Through Distinguishable Interactive Sequences
Authors: Yuhao Zhou, Xihua Li, Yunbo Cao, Xuemin Zhao, Qing Ye, Jiancheng Lv
Date: 2021-04-21 00:00:00
Tasks: Decoder, Knowledge Tracing

In educational applications, Knowledge Tracing (KT), the problem of accurately predicting students' responses to future questions by summarizing their knowledge states, has been widely studied for decades as it is considered a fundamental task towards adaptive online learning. Among all the proposed KT methods, Deep Knowledge Tracing (DKT) and its variants are by far the most effective ones due to the high flexibility of the neural network. However, DKT often ignores the inherent differences between students (e.g. memory skills, reasoning skills, ...), averaging the performances of all students, leading to the lack of personalization, and therefore was considered insufficient for adaptive learning. To alleviate this problem, in this paper, we proposed Leveled Attentive KNowledge TrAcing (LANA), which firstly uses a novel student-related features extractor (SRFE) to distill students' unique inherent properties from their respective interactive sequences. Secondly, the pivot module was utilized to dynamically reconstruct the decoder of the neural network on attention of the extracted features, successfully distinguishing the performance between students over time. Moreover, inspired by Item Response Theory (IRT), the interpretable Rasch model was used to cluster students by their ability levels, and thereby utilizing leveled learning to assign different encoders to different groups of students. With pivot module reconstructed the decoder for individual students and leveled learning specialized encoders for groups, personalized DKT was achieved. Extensive experiments conducted on two real-world large-scale datasets demonstrated that our proposed LANA improves the AUC score by at least 1.00% (i.e. EdNet 1.46% and RAIEd2020 1.00%), substantially surpassing the other State-Of-The-Art KT methods.
Edge Augmentation with Controllability Constraints in Directed Laplacian Networks
Authors: Waseem Abbas, Mudassir Shabbir, Yasin Yazicioglu, Xenofon Koutsoukos
Date: 2021-05-13 00:00:00

In this paper, we study the maximum edge augmentation problem in directed Laplacian networks to improve their robustness while preserving lower bounds on their strong structural controllability (SSC). Since adding edges could adversely impact network controllability, the main objective is to maximally densify a given network by selectively adding missing edges while ensuring that SSC of the network does not deteriorate beyond certain levels specified by the SSC bounds. We consider two widely used bounds: first is based on the notion of zero forcing (ZF), and the second relies on the distances between nodes in a graph. We provide an edge augmentation algorithm that adds the maximum number of edges in a graph while preserving the ZF-based SSC bound, and also derive a closed-form expression for the exact number of edges added to the graph. Then, we examine the edge augmentation problem while preserving the distance-based bound and present a randomized algorithm that guarantees an approximate solution with high probability. Finally, we numerically evaluate and compare these edge augmentation solutions.
Calibration of a SEIR-SEI epidemic model to describe the Zika virus outbreak in Brazil
Authors: Eber Dantas, Michel Tosin, Americo Cunha Jr
Date: 2021-05-13 00:00:00

Multiple instances of Zika virus epidemic have been reported around the world in the last two decades, turning the related illness into an international concern. In this context the use of mathematical models for epidemics is of great importance, since they are useful tools to study the underlying outbreak numbers and allow one to test the effectiveness of different strategies used to combat the associated diseases. This work deals with the development and calibration of an epidemic model to describe the 2016 outbreak of Zika virus in Brazil. A system of 8 differential equations with 8 parameters is employed to model the evolution of the infection through two populations. Nominal values for the model parameters are estimated from the literature. An inverse problem is formulated and solved by comparing the system response to real data from the outbreak. The calibrated results presents realistic parameters and returns reasonable descriptions, with the curve shape similar to the outbreak evolution and peak value close to the highest number of infected people during 2016. Considerations about the lack of data for some initial conditions are also made through an analysis over the response behavior according to their change in value.
Coarse-to-Fine Imitation Learning: Robot Manipulation from a Single Demonstration
Authors: Edward Johns
Date: 2021-05-13 00:00:00
Tasks: Imitation Learning, Object, Robot Manipulation, State Estimation

We introduce a simple new method for visual imitation learning, which allows a novel robot manipulation task to be learned from a single human demonstration, without requiring any prior knowledge of the object being interacted with. Our method models imitation learning as a state estimation problem, with the state defined as the end-effector's pose at the point where object interaction begins, as observed from the demonstration. By then modelling a manipulation task as a coarse, approach trajectory followed by a fine, interaction trajectory, this state estimator can be trained in a self-supervised manner, by automatically moving the end-effector's camera around the object. At test time, the end-effector moves to the estimated state through a linear path, at which point the original demonstration's end-effector velocities are simply replayed. This enables convenient acquisition of a complex interaction trajectory, without actually needing to explicitly learn a policy. Real-world experiments on 8 everyday tasks show that our method can learn a diverse range of skills from a single human demonstration, whilst also yielding a stable and interpretable controller.
Data-Driven Strategies for Hierarchical Predictive Control in Unknown Environments
Authors: Charlott Vallon, Francesco Borrelli
Date: 2021-05-13 00:00:00
Tasks: Model Predictive Control

This article proposes a hierarchical learning architecture for safe data-driven control in unknown environments. We consider a constrained nonlinear dynamical system and assume the availability of state-input trajectories solving control tasks in different environments. In addition to task-invariant system state and input constraints, a parameterized environment model generates task-specific state constraints, which are satisfied by the stored trajectories. Our goal is to use these trajectories to find a safe and high-performing policy for a new task in a new, unknown environment. We propose using the stored data to learn generalizable control strategies. At each time step, based on a local forecast of the new task environment, the learned strategy consists of a target region in the state space and input constraints to guide the system evolution to the target region. These target regions are used as terminal sets by a low-level model predictive controller. We show how to i) design the target sets from past data and then ii) incorporate them into a model predictive control scheme with shifting horizon that ensures safety of the closed-loop system when performing the new task. We prove the feasibility of the resulting control policy, and apply the proposed method to robotic path planning, racing, and computer game applications.
Robust Dual Control based on Gain Scheduling
Authors: Janani Venkatasubramanian, Johannes Köhler, Julian Berberich, Frank Allgöwer
Date: 2020-04-09 00:00:00
Tasks: Scheduling

We present a novel strategy for robust dual control of linear time-invariant systems based on gain scheduling with performance guarantees. This work relies on prior results of determining uncertainty bounds of system parameters estimated through exploration. Existing approaches are unable to account for changes of the mean of system parameters in the exploration phase and thus to accurately capture the dual effect. We address this limitation by selecting the future (uncertain) mean as a scheduling variable in the control design. The result is a semi-definite program-based design that computes a suitable exploration strategy and a robust gain-scheduled controller with probabilistic quadratic performance bounds after the exploration phase.
Participation Analysis in Impedance Models: The Grey-Box Approach for Power System Stability
Authors: Yue Zhu, Yunjie Gu, Yitong Li, Timothy C. Green
Date: 2021-02-08 00:00:00
Tasks: Sensitivity

This paper develops a grey-box approach to small-signal stability analysis of complex power systems that facilitates root-cause tracing without requiring disclosure of the full details of the internal control structure of apparatus connected to the system. The grey-box enables participation analysis in impedance models, which is popular in power electronics and increasingly accepted in power systems for stability analysis. The Impedance participation factor is proposed and defined in terms of the residue of the whole-system admittance matrix. It is proved that, the so defined impedance participation factor equals the sensitivity of the whole-system eigenvalue with respect to apparatus impedance. The classic state participation factor is related to the impedance participation factor via a chain-rule. Based on the chain-rule, a three-layer grey-box approach, with three degrees of transparency, is proposed for root-cause tracing to different depths, i.e. apparatus, states, and parameters, according to the available information. The association of impedance participation factor with eigenvalue sensitivity points to the re-tuning that would stabilize the system. The impedance participation factor can be measured in the field or calculated from the black-box impedance spectra with little prior knowledge required.
A Service-oriented Metro Traffic Regulation Method for Improving Operation Performance
Authors: Jiate Luo, Yin Tong, Graziana Cavone, Mariagrazia Dotoli
Date: 2021-05-13 00:00:00

For high-density metro traffic, nowadays the time-variant passenger flow is the main cause of train delays and stranded passengers. Typically, the main objective of automatic metro traffic regulation methods is to minimize the delay time of trains while passengers' satisfaction is not considered. Instead, in this work, a novel framework that integrates a passenger flow module (PFM) and a train operation module (TOM) is proposed with the aim of simultaneously minimizing traffic delays and passengers' discomfort. In particular, the PFM is devoted to the optimization of the headway time in case of platform overcrowding, so as to reduce the passengers waiting time at platforms and increase the load rate of trains; while the TOM is devoted to the minimization of trains' delays. The two modules interact with each other so that the headway time is automatically adjusted when a platform is overcrowded, and the train traffic is immediately regulated according to the new headway time. As a result, the number of passengers on the platform and their total waiting time can be significantly reduced. Numerical results are provided to show the effectiveness of the proposed method in improving the operation performance while minimizing the passengers' discomfort.