nils-herrmann/clean_scirepeval huggingface dataset:
NTT’s Machine Translation Systems for WMT19 Robustness Task

This paper describes NTT’s submission to the WMT19 robustness task. This task mainly focuses on translating noisy text (e.g., posts on Twitter), which presents different difficulties from typical translation tasks such as news. Our submission combined techniques including utilization of a synthetic corpus, domain adaptation, and a placeholder mechanism, which significantly improved over the previous baseline. Experimental results revealed the placeholder mechanism, which temporarily replaces the non-standard tokens including emojis and emoticons with special placeholder tokens during translation, improves translation accuracy even with noisy texts.
Functional Brain Networks Discovery Using Dictionary Learning with Correlated Sparsity

Analysis of data from functional magnetic resonance imaging (fMRI) results in constructing functional brain networks. Principal component analysis (PCA) and independent component analysis (ICA) are widely used to generate functional brain networks. Moreover, dictionary learning and sparse representation provide some latent patterns that rules brain activities and they can be interpreted as brain networks. However, these methods lack modeling dependencies of the discovered networks. In this study an alternative to these conventional methods is presented in which dependencies of the networks are considered via correlated sparsity patterns. We formulate this challenge as a new dictionary learning problem and propose two approaches to solve the problem effectively.
Property Graph Exchange Format

Recently, a variety of database implementations adopting the property graph model have emerged. However, interoperable management of graph data on these implementations is challenging due to the differences in data models and formats. Here, we redefine the property graph model incorporating the differences in the existing models and propose interoperable serialization formats for property graphs. The model is independent of specific implementations and provides a basis of interoperable management of property graph data. The proposed serialization is not only general but also intuitive, thus it is useful for creating and maintaining graph data. To demonstrate the practical use of our model and serialization, we implemented converters from our serialization into existing formats, which can then be loaded into various graph databases. This work provides a basis of an interoperable platform for creating, exchanging, and utilizing property graph data.
Understanding Player Engagement and In-Game Purchasing Behavior with Ensemble Learning

As video games attract more and more players, the major challenge for game studios is to retain them. We present a deep behavioral analysis of churn (game abandonment) and what we called "purchase churn" (the transition from paying to non-paying user). A series of churning behavior profiles are identified, which allows a classification of churners in terms of whether they eventually return to the game (false churners)--or start purchasing again (false purchase churners)--and their subsequent behavior. The impact of excluding some or all of these churners from the training sample is then explored in several churn and purchase churn prediction models. Our results suggest that discarding certain combinations of "zombies" (players whose activity is extremely sporadic) and false churners has a significant positive impact in all models considered.
Estimating Mass Distribution of Articulated Objects through Physical Interaction

We explore the problem of estimating the mass distribution of an articulated object by an interactive agent. Our method predicts the mass distribution accurately only using information that can be reliably acquired by the limited sensing and actuating capabilities of a robotic agent that interacts with it. Inspired by the role of exploratory play in human infants, we take the combined approach of supervised and reinforcement learning to train the agent such that it learns to strategically interact with the object for estimating its mass distribution. Our method consists of two neural networks: the policy network which decides how to interact with the object, and the predictor network that estimates the mass distribution given a history of observations and interactions. Using our method, we train a robotic arm to estimate the mass distribution of an object with moving parts (e.g. an articulated rigid body system) by pushing it on a surface with unknown friction properties. We also test the robustness of our learned model by transferring it to another robot arm with different end-effector geometry. The empirical results show that our method significantly outperforms the baseline agent which uses random pushes to collect data for estimation.
Ranking-Based Reward Extrapolation without Rankings

The performance of imitation learning is typically upper-bounded by the performance of the demonstrator. Recent empirical results show that imitation learning via ranked demonstrations allows for better-than-demonstrator performance; however, ranked demonstrations may be difficult to obtain, and little is known theoretically about when such methods can be expected to outperform the demonstrator. To address these issues, we first contribute a sufficient condition for when better-than-demonstrator performance is possible and discuss why ranked demonstrations can contribute to better-than-demonstrator performance. Building on this theory, we then introduce Disturbance-based Reward Extrapolation (D-REX), a ranking-based imitation learning method that injects noise into a policy learned through behavioral cloning to automatically generate ranked demonstrations. By generating rankings automatically, ranking-based imitation learning can be applied in traditional imitation learning settings where only unlabeled demonstrations are available. We empirically validate our approach on standard MuJoCo and Atari benchmarks and show that D-REX can utilize automatic rankings to significantly surpass the performance of the demonstrator and outperform standard imitation learning approaches. D-REX is the first imitation learning approach to achieve significant extrapolation beyond the demonstrator's performance without additional side-information or supervision, such as rewards or human preferences.
Mean Spectral Normalization of Deep Neural Networks for Embedded Automation

Deep Neural Networks (DNNs) have begun to thrive in the field of automation systems, owing to the recent advancements in standardising various aspects such as architecture, optimization techniques, and regularization. In this paper, we take a step towards a better understanding of Spectral Normalization (SN) and its potential for standardizing regularization of a wider range of Deep Learning models, following an empirical approach. We conduct several experiments to study their training dynamics, in comparison with the ubiquitous Batch Normalization (BN) and show that SN increases the gradient sparsity and controls the gradient variance. Furthermore, we show that SN suffers from a phenomenon, we call the mean-drift effect, which mitigates its performance. We, then, propose a weight reparameterization called as the Mean Spectral Normalization (MSN) to resolve the mean drift, thereby significantly improving the network’s performance. Our model performs $\sim$ 16% faster as compared to BN in practice, and has fewer trainable parameters. We also show the performance of our MSN for small, medium, and large CNNs – 3-layer CNN, VGG7 and DenseNet-BC, respectively and unsupervised image generation tasks using Generative Adversarial Networks (GANs) to evaluate its applicability for a broad range of embedded automation tasks.
Loss of transmission on directed networks due to link deletion

We investigate the effects of link deletion on a 1 - to - 1 transmission process occurring on various models of directed networks and characterize them in terms of the fraction of successful transmissions and average transmission time. We make intuitive arguments and numerically show that the probability of successful transmission depends, on an average, on the fractional size of the Strongly Connected Component (SCC) and the average transmission time depends on the Average Path Length (APL) of the SCC. In the context of a specific road-network, we study the roles of various process parameters. Finally, we provide remedial strategies to improve transmission during link deletion in such networks.
UnsuperPoint: End-to-end Unsupervised Interest Point Detector and Descriptor

It is hard to create consistent ground truth data for interest points in natural images, since interest points are hard to define clearly and consistently for a human annotator. This makes interest point detectors non-trivial to build. In this work, we introduce an unsupervised deep learning-based interest point detector and descriptor. Using a self-supervised approach, we utilize a siamese network and a novel loss function that enables interest point scores and positions to be learned automatically. The resulting interest point detector and descriptor is UnsuperPoint. We use regression of point positions to 1) make UnsuperPoint end-to-end trainable and 2) to incorporate non-maximum suppression in the model. Unlike most trainable detectors, it requires no generation of pseudo ground truth points, no structure-from-motion-generated representations and the model is learned from only one round of training. Furthermore, we introduce a novel loss function to regularize network predictions to be uniformly distributed. UnsuperPoint runs in real-time with 323 frames per second (fps) at a resolution of $224\times320$ and 90 fps at $480\times640$. It is comparable or better than state-of-the-art performance when measured for speed, repeatability, localization, matching score and homography estimation on the HPatch dataset.
Data-Independent Neural Pruning via Coresets

Previous work showed empirically that large neural networks can be significantly reduced in size while preserving their accuracy. Model compression became a central research topic, as it is crucial for deployment of neural networks on devices with limited computational and memory resources. The majority of the compression methods are based on heuristics and offer no worst-case guarantees on the trade-off between the compression rate and the approximation error for an arbitrarily new sample. We propose the first efficient, data-independent neural pruning algorithm with a provable trade-off between its compression rate and the approximation error for any future test sample. Our method is based on the coreset framework, which finds a small weighted subset of points that provably approximates the original inputs. Specifically, we approximate the output of a layer of neurons by a coreset of neurons in the previous layer and discard the rest. We apply this framework in a layer-by-layer fashion from the top to the bottom. Unlike previous works, our coreset is data independent, meaning that it provably guarantees the accuracy of the function for any input $x\in \mathbb{R}^d$, including an adversarial one. We demonstrate the effectiveness of our method on popular network architectures. In particular, our coresets yield 90\% compression of the LeNet-300-100 architecture on MNIST while improving the accuracy.
A class of solvable multidimensional stopping problems in the presence of Knightian uncertainty

We investigate the impact of Knightian uncertainty on the optimal timing policy of an ambiguity-averse decision-maker in the case where the underlying factor dynamics follow a multidimensional Brownian motion and the exercise payoff depends on either a linear combination of the factors or the radial part of the driving factor dynamics. We present a general characterization of the value of the optimal timing policy and the worst-case measure in terms of a family of explicitly identified excessive functions generating an appropriate class of supermartingales. In line with previous findings based on linear diffusions, we find that ambiguity accelerates timing in comparison with the unambiguous setting. Somewhat surprisingly, we find that ambiguity may lead to stationarity in models which typically do not possess stationary behavior. In this way, our results indicate that ambiguity may act as a stabilizing mechanism.
Domain Adaptation in Multi-Channel Autoencoder based Features for Robust Face Anti-Spoofing

While the performance of face recognition systems has improved significantly in the last decade, they are proved to be highly vulnerable to presentation attacks (spoofing). Most of the research in the field of face presentation attack detection (PAD), was focused on boosting the performance of the systems within a single database. Face PAD datasets are usually captured with RGB cameras, and have very limited number of both bona-fide samples and presentation attack instruments. Training face PAD systems on such data leads to poor performance, even in the closed-set scenario, especially when sophisticated attacks are involved. We explore two paths to boost the performance of the face PAD system against challenging attacks. First, by using multichannel (RGB, Depth and NIR) data, which is still easily accessible in a number of mass production devices. Second, we develop a novel Autoencoders + MLP based face PAD algorithm. Moreover, instead of collecting more data for training of the proposed deep architecture, the domain adaptation technique is proposed, transferring the knowledge of facial appearance from RGB to multi-channel domain. We also demonstrate, that learning the features of individual facial regions, is more discriminative than the features learned from an entire face. The proposed system is tested on a very recent publicly available multi-channel PAD database with a wide variety of presentation attacks.
Procedural Content Generation through Quality Diversity

Quality-diversity (QD) algorithms search for a set of good solutions which cover a space as defined by behavior metrics. This simultaneous focus on quality and diversity with explicit metrics sets QD algorithms apart from standard single- and multi-objective evolutionary algorithms, as well as from diversity preservation approaches such as niching. These properties open up new avenues for artificial intelligence in games, in particular for procedural content generation. Creating multiple systematically varying solutions allows new approaches to creative human-AI interaction as well as adaptivity. In the last few years, a handful of applications of QD to procedural content generation and game playing have been proposed; we discuss these and propose challenges for future work.
Multitask Learning for Blackmarket Tweet Detection

Online social media platforms have made the world more connected than ever before, thereby making it easier for everyone to spread their content across a wide variety of audiences. Twitter is one such popular platform where people publish tweets to spread their messages to everyone. Twitter allows users to Retweet other users' tweets in order to broadcast it to their network. The more retweets a particular tweet gets, the faster it spreads. This creates incentives for people to obtain artificial growth in the reach of their tweets by using certain blackmarket services to gain inorganic appraisals for their content. In this paper, we attempt to detect such tweets that have been posted on these blackmarket services in order to gain artificially boosted retweets. We use a multitask learning framework to leverage soft parameter sharing between a classification and a regression based task on separate inputs. This allows us to effectively detect tweets that have been posted to these blackmarket services, achieving an F1-score of 0.89 when classifying tweets as blackmarket or genuine.
A framework for the pre-specification of statistical analysis strategies in clinical trials (Pre-SPEC)

Bias can be introduced into clinical trials if statistical methods are chosen based on subjective assessment of the trial data. Pre-specification of the planned analysis approach is essential to help reduce such bias. However, many trials fail to adequately pre-specify their statistical analysis approach, thereby allowing analysts to choose the method which gives the most favourable result. We propose a five-point framework for the pre-specification of the statistical analysis strategy for a clinical trial's primary outcome (the Pre-SPEC framework); this framework is designed to ensure that methods cannot be chosen based on the trial data in order to give a more favourable result. The five points are: (1) Pre-specify before recruitment to the trial begins; (2) Specify a single primary analysis strategy; (3) Plan all aspects of the analysis; (4) Enough detail should be provided so that a third party could independently perform the analysis; and (5) Adaptive analysis strategies should use deterministic decision rules. This framework could be used as a template to help plan an analysis strategy, or to evaluate whether an existing strategy is at risk of bias due to inadequate pre-specification.
Resolution limit of data-driven coarse-grained models spanning chemical space.

Increasing the efficiency of materials design remains a significant challenge given the large size of chemical compound space (CCS). The use of a chemically transferable coarse-grained model enables different molecular fragments to map to the same bead type, significantly increasing screening efficiency. Here, we propose new criteria for the design of coarse-grained models allowing for the optimization of their chemical transferability and evaluate the Martini model within this framework. We further investigate the scope of this transferability by parameterizing three Martini-like models in which the number of bead types ranges from 5 to 16. These force fields are fully compatible with existing Martini environments because they are parameterized by interpolating the Martini interaction matrix. We then implement a Bayesian approach to determining which chemical groups are likely to be present on fragments corresponding to specific bead types for each model. We demonstrate that a level of accuracy comparable to Martini is obtained with a force field with fewer bead types, using the water/octanol partitioning free energy (ΔGW→Ol) as our metric for comparison. However, the advantage of including more bead types is a reduction of uncertainty when back-mapping these bead types to specific chemistries. Just as reducing the size of the coarse-grained particles leads to a finer mapping of conformational space, increasing the number of bead types yields a finer mapping of CCS. Finally, we note that, due to the large size of fragments mapping to a single Martini bead, a resolution limit arises when using ΔGW→Ol as the only descriptor when coarse-graining CCS.
Template-Based Posit Multiplication for Training and Inferring in Neural Networks

The posit number system is arguably the most promising and discussed topic in Arithmetic nowadays. The recent breakthroughs claimed by the format proposed by John L. Gustafson have put posits in the spotlight. In this work, we first describe an algorithm for multiplying two posit numbers, even when the number of exponent bits is zero. This configuration, scarcely tackled in literature, is particularly interesting because it allows the deployment of a fast sigmoid function. The proposed multiplication algorithm is then integrated as a template into the well-known FloPoCo framework. Synthesis results are shown to compare with the floating point multiplication offered by FloPoCo as well. Second, the performance of posits is studied in the scenario of Neural Networks in both training and inference stages. To the best of our knowledge, this is the first time that training is done with posit format, achieving promising results for a binary classification problem even with reduced posit configurations. In the inference stage, 8-bit posits are as good as floating point when dealing with the MNIST dataset, but lose some accuracy with CIFAR-10.
Efficient Pose Selection for Interactive Camera Calibration

The choice of poses for camera calibration with planar patterns is only rarely considered — yet the calibration precision heavily depends on it. This work presents a pose selection method that finds a compact and robust set of calibration poses and is suitable for interactive calibration. Consequently, singular poses that would lead to an unreliable solution are avoided explicitly, while poses reducing the uncertainty of the calibration are favoured. For this, we use uncertainty propagation. Our method takes advantage of a self-identifying calibration pattern to track the camera pose in real-time. This allows to iteratively guide the user to the target poses, until the desired quality level is reached. Therefore, only a sparse set of key-frames is needed for calibration. The method is evaluated on separate training and testing sets, as well as on synthetic data. Our approach performs better than comparable solutions while requiring 30% less calibration frames.
Deflation reveals dynamical structure in nondominant reaction coordinates

The output of molecular dynamics simulations is high-dimensional, and the degrees of freedom among the atoms are related in intricate ways. Therefore, a variety of analysis frameworks have been introduced in order to distill complex motions into lower-dimensional representations that model the system dynamics. These dynamical models have been developed to optimally approximate the system's global kinetics. However, the separate aims of optimizing global kinetics and modeling a process of interest diverge when the process of interest is not the slowest process in the system. Here, we introduce deflation into state-of-the-art methods in molecular kinetics in order to preserve the use of variational optimization tools when the slowest dynamical mode is not the same as the one we seek to model and understand. First, we showcase deflation for a simple toy system and introduce the deflated variational approach to Markov processes (dVAMP). Using dVAMP, we show that nondominant reaction coordinates produced using deflation are more informative than their counterparts generated without deflation. Then, we examine a protein folding system in which the slowest dynamical mode is not folding. Following a dVAMP analysis, we show that deflation can be used to obscure this undesired slow process from a kinetic model, in this case a VAMPnet. The incorporation of deflation into current methods opens the door for enhanced sampling strategies and more flexible, targeted model building.