nils-herrmann/clean_scirepeval huggingface dataset:
Identity-Aware Deep Face Hallucination via Adversarial Face Verification

In this paper, we address the problem of face hallucination by proposing a novel multi-scale generative adversarial network (GAN) architecture optimized for face verification. First, we propose a multi-scale generator architecture for face hallucination with a high up-scaling ratio factor, which has multiple intermediate outputs at different resolutions. The intermediate outputs have the growing goal of synthesizing small to large images. Second, we incorporate a face verifier with the original GAN discriminator and propose a novel discriminator which learns to discriminate different identities while distinguishing fake generated HR face images from their ground truth images. In particular, the learned generator cares for not only the visual quality of hallucinated face images but also preserving the discriminative features in the hallucination process. In addition, to capture perceptually relevant differences we employ a perceptual similarity loss, instead of similarity in pixel space. We perform a quantitative and qualitative evaluation of our framework on the LFW and CelebA datasets. The experimental results show the advantages of our proposed method against the state-of-the-art methods on the 8x downsampled testing dataset.
Non-Markovian temporal networks with auto- and cross-correlated link dynamics.

Many of the biological, social and man-made networks around us are inherently dynamic, with their links switching on and off over time. The evolution of these networks is often observed to be non-Markovian, and the dynamics of their links are often correlated. Hence, to accurately model these networks, predict their evolution, and understand how information and other relevant quantities propagate over them, the inclusion of both memory and dynamical dependencies between links is key. In this article we introduce a general class of models of temporal networks based on discrete autoregressive processes for link dynamics. As a concrete and useful case study, we then concentrate on a specific model within this class, which allows to generate temporal networks with a specified underlying structural backbone, and with precise control over the dynamical dependencies between links and the strength and length of their memories. In this network model the presence of each link is influenced not only by its past activity, but also by the past activities of other links, as specified by a coupling matrix, which directly controls the causal relations, and hence the correlations, among links. We propose a maximum likelihood method for estimating the model's parameters from data, showing how the model allows a more realistic description of real-world temporal networks and also to predict their evolution. Due to the flexibility of maximum likelihood inference, we illustrate how to deal with heterogeneity and time-varying patterns, possibly including also nonstationary network dynamics. We then use our network model to investigate the role that, both the features of memory and the type of correlations in the dynamics of links have on the properties of processes occurring over a temporal network. Namely, we study the speed of a spreading process, as measured by the time it takes for diffusion to reach equilibrium. Through both numerical simulations and analytical results, we are able to separate the roles of autocorrelations and neighborhood correlations in link dynamics, showing that not only is the speed of diffusion nonmonotonically dependent on the memory length, but also that correlations among neighboring links help to speed up the spreading process, while autocorrelations slow it back down. Our results have implications in the study of opinion formation, the modeling of social networks, and the spreading of epidemics through mobile populations.
Extracting evidence of supplement-drug interactions from literature

To improve discovery of dietary supplement safety information, we demonstrate an automated method for extracting evidence of supplement-drug interactions (SDIs) from scientific text. To address the lack of labeled data in this domain, we use labels of the closely related task of identifying drug-drug interactions (DDIs) for supervision. We fine-tune the contextualized word representations of BERT-large using labeled data from the PDDI corpus. We process 22M abstracts from PubMed using this model, and extract evidence for 55946 unique interactions between 1923 supplements and 2727 drugs (precision: 0.74, accuracy: 0.83), demonstrating that learning the task of DDI classification transfers successfully to the related problem of SDI classification. We implement a freely-available public interface this http URL to browse and search evidence sentences extracted by our model.
Dynamics of Deep Neural Networks and Neural Tangent Hierarchy

The evolution of a deep neural network trained by the gradient descent can be described by its neural tangent kernel (NTK) as introduced in , where it was proven that in the infinite width limit the NTK converges to an explicit limiting kernel and it stays constant during training. The NTK was also implicit in some other recent papers [6,13,14]. In the overparametrization regime, a fully-trained deep neural network is indeed equivalent to the kernel regression predictor using the limiting NTK. And the gradient descent achieves zero training loss for a deep overparameterized neural network. However, it was observed in  that there is a performance gap between the kernel regression using the limiting NTK and the deep neural networks. This performance gap is likely to originate from the change of the NTK along training due to the finite width effect. The change of the NTK along the training is central to describe the generalization features of deep neural networks. 
In the current paper, we study the dynamic of the NTK for finite width deep fully-connected neural networks. We derive an infinite hierarchy of ordinary differential equations, the neural tangent hierarchy (NTH) which captures the gradient descent dynamic of the deep neural network. Moreover, under certain conditions on the neural network width and the data set dimension, we prove that the truncated hierarchy of NTH approximates the dynamic of the NTK up to arbitrary precision. This description makes it possible to directly study the change of the NTK for deep neural networks, and sheds light on the observation that deep neural networks outperform kernel regressions using the corresponding limiting NTK.
Decision-Directed Data Decomposition

We present an algorithm, Decision-Directed Data Decomposition (D4), which decomposes a dataset into two components. The first contains most of the useful information for a specified supervised learning task. The second orthogonal component contains little information about the task but retains associations and information that were not targeted. The algorithm is simple and scalable. We illustrate its application in image and text processing domains. Our results show that 1) post-hoc application of D4 to an image representation space can remove information about specified concepts without impacting other concepts, 2) D4 is able to improve predictive generalization in certain settings, and 3) applying D4 to word embedding representations produces state-of-the-art results in debiasing.
Multimodal Continuation-style Architectures for Human-Robot Interaction

We present an architecture for integrating real-time, multimodal input into a computational agent's contextual model. Using a human-avatar interaction in a virtual world, we treat aligned gesture and speech as an ensemble where content may be communicated by either modality. With a modified nondeterministic pushdown automaton architecture, the computer system: (1) consumes input incrementally using continuation-passing style until it achieves sufficient understanding the user's aim; (2) constructs and asks questions where necessary using established contextual information; and (3) maintains track of prior discourse items using multimodal cues. This type of architecture supports special cases of pushdown and finite state automata as well as integrating outputs from machine learning models. We present examples of this architecture's use in multimodal one-shot learning interactions of novel gestures and live action composition.
Recursive Graphical Neural Networks for Text Classification

The complicated syntax structure of natural language is hard to be explicitly modeled by sequence-based models. Graph is a natural structure to describe the complicated relation between tokens. The recent advance in Graph Neural Networks (GNN) provides a powerful tool to model graph structure data, but simple graph models such as Graph Convolutional Networks (GCN) suffer from over-smoothing problem, that is, when stacking multiple layers, all nodes will converge to the same value. In this paper, we propose a novel Recursive Graphical Neural Networks model (ReGNN) to represent text organized in the form of graph. In our proposed model, LSTM is used to dynamically decide which part of the aggregated neighbor information should be transmitted to upper layers thus alleviating the over-smoothing problem. Furthermore, to encourage the exchange between the local and global information, a global graph-level node is designed. We conduct experiments on both single and multiple label text classification tasks. Experiment results show that our ReGNN model surpasses the strong baselines significantly in most of the datasets and greatly alleviates the over-smoothing problem.
Weighed Domain-Invariant Representation Learning for Cross-domain Sentiment Analysis

Cross-domain sentiment analysis is currently a hot topic in both the research and industrial areas. One of the most popular framework for the task is domain-invariant representation learning (DIRL), which aims to learn a distribution-invariant feature representation across domains. However, in this work, we find out that applying DIRL may degrade domain adaptation performance when the label distribution \rm{P}(\rm{Y}) changes across domains. To address this problem, we propose a modification to DIRL, obtaining a novel weighted domain-invariant representation learning (WDIRL) framework. We show that it is easy to transfer existing models of the DIRL framework to the WDIRL framework. Empirical studies on extensive cross-domain sentiment analysis tasks verified our statements and showed the effectiveness of our proposed solution.
Multiple Human Tracking using Multi-Cues including Primitive Action Features

In this paper, we propose a Multiple Human Tracking method using multi-cues including Primitive Action Features (MHT-PAF). MHT-PAF can perform the accurate human tracking in dynamic aerial videos captured by a drone. PAF employs a global context, rich information by multi-label actions, and a middle level feature. The accurate human tracking result using PAF helps multi-frame-based action recognition. In the experiments, we verified the effectiveness of the proposed method using the Okutama-Action dataset. Our code is available online.
Rényi Differentially Private ADMM for Non-Smooth Regularized Optimization

In this paper we consider the problem of minimizing composite objective functions consisting of a convex differentiable loss function plus a non-smooth regularization term, such as $L_1$ norm or nuclear norm, under Rényi differential privacy (RDP). To solve the problem, we propose two stochastic alternating direction method of multipliers (ADMM) algorithms: ssADMM based on gradient perturbation and mpADMM based on output perturbation. Both algorithms decompose the original problem into sub-problems that have closed-form solutions. The first algorithm, ssADMM, applies the recent privacy amplification result for RDP to reduce the amount of noise to add. The second algorithm, mpADMM, numerically computes the sensitivity of ADMM variable updates and releases the updated parameter vector at the end of each epoch. We compare the performance of our algorithms with several baseline algorithms on both real and simulated datasets. Experimental results show that, in high privacy regimes (small ε), ssADMM and mpADMM outperform baseline algorithms in terms of classification and feature selection performance, respectively.
Self-boosted Time-series Forecasting with Multi-task and Multi-view Learning

A robust model for time series forecasting is highly important in many domains, including but not limited to financial forecast, air temperature and electricity consumption. To improve forecasting performance, traditional approaches usually require additional feature sets. However, adding more feature sets from different sources of data is not always feasible due to its accessibility limitation. In this paper, we propose a novel self-boosted mechanism in which the original time series is decomposed into multiple time series. These time series played the role of additional features in which the closely related time series group is used to feed into multi-task learning model, and the loosely related group is fed into multi-view learning part to utilize its complementary information. We use three real-world datasets to validate our model and show the superiority of our proposed method over existing state-of-the-art baseline methods.
Predicting Electricity Consumption using Deep Recurrent Neural Networks

Electricity consumption has increased exponentially during the past few decades. This increase is heavily burdening the electricity distributors. Therefore, predicting the future demand for electricity consumption will provide an upper hand to the electricity distributor. Predicting electricity consumption requires many parameters. The paper presents two approaches with one using a Recurrent Neural Network (RNN) and another one using a Long Short Term Memory (LSTM) network, which only considers the previous electricity consumption to predict the future electricity consumption. These models were tested on the publicly available London smart meter dataset. To assess the applicability of the RNN and the LSTM network to predict electricity consumption, they were tested to predict for an individual house and a block of houses for a given time period. The predictions were done for daily, trimester and 13 months, which covers short term, mid-term and long term prediction. Both the RNN and the LSTM network have achieved an average Root Mean Square error of 0.1.
A local-global theorem for p-adic supercongruences

Let ℤ p {\mathbb{Z}_{p}} denote the ring of all p-adic integers and call 𝒰 = { ( x 1 , … , x n ) : a 1 ⁢ x 1 + … + a n ⁢ x n + b = 0 } {\mathcal{U}}=\{(x_{1},\dots,x_{n}):a_{1}x_{1}+\dots+a_{n}x_{n}+b=0\} a hyperplane over ℤ p n {\mathbb{Z}_{p}^{n}} , where at least one of a 1 , … , a n {a_{1},\dots,a_{n}} is not divisible by p. We prove that if a sufficiently regular n-variable function is zero modulo p r {p^{r}} over some suitable collection of r hyperplanes, then it is zero modulo p r {p^{r}} over the whole ℤ p n {\mathbb{Z}_{p}^{n}} . We provide various applications of this general criterion by establishing several p-adic analogues of hypergeometric identities. For example, we confirm a conjecture of Deines et al. as follows: ∑ k = 0 p - 1 ( 2 5 ) k 5 ( k ! ) 5 ≡ - Γ p ⁢ ( 1 5 ) 5 ⁢ Γ p ⁢ ( 2 5 ) 5 ⁢ ( mod ⁢ p 5 ) \sum_{k=0}^{p-1}\frac{(\frac{2}{5})_{k}^{5}}{(k!)^{5}}\equiv-\Gamma_{p}\bigg{(% }\frac{1}{5}\bigg{)}^{5}\Gamma_{p}\bigg{(}\frac{2}{5}\bigg{)}^{5}~{}(\mathrm{% mod}\,p^{5}) for each p ≡ 1 ⁢ ( mod ⁢  5 ) {p\equiv 1~{}(\mathrm{mod}\,5)} , where ( x ) k = x ⁢ ( x + 1 ) ⁢ ⋯ ⁢ ( x + k - 1 ) {(x)_{k}=x(x+1)\cdots(x+k-1)} and Γ p {\Gamma_{p}} denotes the p-adic Gamma function.
Two Computational Models for Analyzing Political Attention in Social Media

Understanding how political attention is divided and over what subjects is crucial for research on areas such as agenda setting, framing, and political rhetoric. Existing methods for measuring attention, such as manual labeling according to established codebooks, are expensive and can be restrictive. We describe two computational models that automatically distinguish topics in politicians' social media content. Our models---one supervised classifier and one unsupervised topic model---provide different benefits. The supervised classifier reduces the labor required to classify content according to pre-determined topic list. However, tweets do more than communicate policy positions. Our unsupervised model uncovers both political topics and other Twitter uses (e.g., constituent service). These models are effective, inexpensive computational tools for political communication and social media research. We demonstrate their utility and discuss the different analyses they afford by applying both models to the tweets posted by members of the 115th U.S. Congress.
Rapid and efficient mass collection by a supersonic cloud–cloud collision as a major mechanism of high-mass star formation

A supersonic cloud–cloud collision produces a shock-compressed layer which leads to formation of high-mass stars via gravitational instability. We carried out a detailed analysis of the layer by using the numerical simulations of magneto-hydrodynamics which deal with colliding molecular flows at a relative velocity of 20 km s−1 (Inoue & Fukui 2013, ApJ, 774, L31). Maximum density in the layer increases from 1000 cm−3 to more than 105 cm−3 within 0.3 Myr by compression, and the turbulence and the magnetic field in the layer are amplified by a factor of ∼5, increasing the mass accretion rate by two orders of magnitude to more than 10−4 $ M_{\odot } $ yr−1. The layer becomes highly filamentary due to gas flows along the magnetic field lines, and dense cores are formed in the filaments. The massive dense cores have size and mass of 0.03–0.08 pc and 8–$ 50\, M_{\odot } $ and they are usually gravitationally unstable. The mass function of the dense cores is significantly top-heavy as compared with the universal initial mass function, indicating that the cloud–cloud collision preferentially triggers the formation of O and early B stars. We argue that the cloud–cloud collision is a versatile mechanism which creates a variety of stellar clusters from a single O star like RCW 120 and M 20 to tens of O stars of a super star cluster like RCW 38 and a mini-starburst W 43. The core mass function predicted by the present model is consistent with the massive dense cores obtained by recent ALMA observations in RCW 38 (Torii et al. 2021, PASJ, in press) and W 43 (Motte et al. 2018, . Considering the increasing evidence for collision-triggered high-mass star formation, we argue that cloud–cloud collision is a major mechanism of high-mass star formation.
Adaptive Graphical Model Network for 2D Handpose Estimation

In this paper, we propose a new architecture called Adaptive Graphical Model Network (AGMN) to tackle the task of 2D hand pose estimation from a monocular RGB image. The AGMN consists of two branches of deep convolutional neural networks for calculating unary and pairwise potential functions, followed by a graphical model inference module for integrating unary and pairwise potentials. Unlike existing architectures proposed to combine DCNNs with graphical models, our AGMN is novel in that the parameters of its graphical model are conditioned on and fully adaptive to individual input images. Experiments show that our approach outperforms the state-of-the-art method used in 2D hand keypoints estimation by a notable margin on two public datasets.
Modeling Conversation Structure and Temporal Dynamics for Jointly Predicting Rumor Stance and Veracity

Automatically verifying rumorous information has become an important and challenging task in natural language processing and social media analytics. Previous studies reveal that people’s stances towards rumorous messages can provide indicative clues for identifying the veracity of rumors, and thus determining the stances of public reactions is a crucial preceding step for rumor veracity prediction. In this paper, we propose a hierarchical multi-task learning framework for jointly predicting rumor stance and veracity on Twitter, which consists of two components. The bottom component of our framework classifies the stances of tweets in a conversation discussing a rumor via modeling the structural property based on a novel graph convolutional network. The top component predicts the rumor veracity by exploiting the temporal dynamics of stance evolution. Experimental results on two benchmark datasets show that our method outperforms previous methods in both rumor stance classification and veracity prediction.
Memory-Efficient Hierarchical Neural Architecture Search for Image Denoising

Recently, neural architecture search (NAS) methods have attracted much attention and outperformed manually designed architectures on a few high-level vision tasks. In this paper, we propose HiNAS (Hierarchical NAS), an effort towards employing NAS to automatically design effective neural network architectures for image denoising. HiNAS adopts gradient based search strategies and employs operations with adaptive receptive field to build an flexible hierarchical search space. During the search stage, HiNAS shares cells across different feature levels to save memory and employ an early stopping strategy to avoid the collapse issue in NAS, and considerably accelerate the search speed. The proposed HiNAS is both memory and computation efficient, which takes only about 4.5 hours for searching using a single GPU. We evaluate the effectiveness of our proposed HiNAS on two different datasets, namely an additive white Gaussian noise dataset BSD500, and a realistic noise dataset SIM1800. Experimental results show that the architecture found by HiNAS has fewer parameters and enjoys a faster inference speed, while achieving highly competitive performance compared with state-of-the-art methods. We also present analysis on the architectures found by NAS. HiNAS also shows good performance on experiments for image de-raining.
Exploiting Partial Knowledge in Declarative Domain-Specific Heuristics for ASP

Domain-specific heuristics are an important technique for solving combinatorial problems efficiently. We propose a novel semantics for declarative specifications of domain-specific heuristics in Answer Set Programming (ASP). Decision procedures that are based on a partial solution are a frequent ingredient of existing domain-specific heuristics, e.g., for placing an item that has not been placed yet in bin packing. Therefore, in our novel semantics negation as failure and aggregates in heuristic conditions are evaluated on a partial solver state. State-of-the-art solvers do not allow such a declarative specification. Our implementation in the lazy-grounding ASP system Alpha supports heuristic directives under this semantics. By that, we also provide the first implementation for incorporating declaratively specified domain-specific heuristics in a lazy-grounding setting. Experiments confirm that the combination of ASP solving with lazy grounding and our novel heuristics can be a vital ingredient for solving industrial-size problems.