nils-herrmann/clean_scirepeval huggingface dataset:
Baseline predictions of elliptic flow and fluctuations for the RHIC Beam Energy Scan using response coefficients

Currently the RHIC Beam Energy Scan is exploring a new region of the Quantum Chromodynamic phase diagram at large baryon densities that approaches nuclear astrophysics regimes. This provides an opportunity to study relativistic hydrodynamics in a regime where the net conserved charges of baryon number, strangeness, and electric charge play a role, which will significantly change the theoretical approach to simulating the baryon-dense Quark-Gluon Plasma. Here we detail many of the important changes needed to adapt both initial conditions and the medium to baryon-rich matter. Then, we make baseline predictions for the elliptical flow and fluctuations based on extrapolating the physics at LHC and top RHIC energies to support future analyses of where and how the new baryon-dense physics causes these extrapolations to break down. First we compare eccentricities across beam energies, exploring their underlying assumptions; we find the the extrapolated initial state is predicted to be nearly identical to that at AuAu $\sqrt{s_{NN}}=200$ GeV. Then the final flow harmonic predictions are based on linear+cubic response. We discuss preliminary STAR results in order to determine the implications that they have for linear+cubic response coefficients at the lowest beam energy of AuAu $\sqrt{s_{NN}}=7$ GeV.
NADS-Net: A Nimble Architecture for Driver and Seat Belt Detection via Convolutional Neural Networks

A new convolutional neural network (CNN) architecture for 2D driver/passenger pose estimation and seat belt detection is proposed in this paper. The new architecture is more nimble and thus more suitable for in-vehicle monitoring tasks compared to other generic pose estimation algorithms. The new architecture, named NADS-Net, utilizes the feature pyramid network (FPN) backbone with multiple detection heads to achieve the optimal performance for driver/passenger state detection tasks. The new architecture is validated on a new data set containing video clips of 100 drivers in 50 driving sessions that are collected for this study. The detection performance is analyzed under different demographic, appearance, and illumination conditions. The results presented in this paper may provide meaningful insights for the autonomous driving research community and automotive industry for future algorithm development and data collection.
AutoML using Metadata Language Embeddings

As a human choosing a supervised learning algorithm, it is natural to begin by reading a text description of the dataset and documentation for the algorithms you might use. We demonstrate that the same idea improves the performance of automated machine learning methods. We use language embeddings from modern NLP to improve state-of-the-art AutoML systems by augmenting their recommendations with vector embeddings of datasets and of algorithms. We use these embeddings in a neural architecture to learn the distance between best-performing pipelines. The resulting (meta-)AutoML framework improves on the performance of existing AutoML frameworks. Our zero-shot AutoML system using dataset metadata embeddings provides good solutions instantaneously, running in under one second of computation. Performance is competitive with AutoML systems OBOE, AutoSklearn, AlphaD3M, and TPOT when each framework is allocated a minute of computation. We make our data, models, and code publicly available.
Approximation of an algebra by evolution algebras

It is known that any multiplication of a finite dimensional algebra is determined by a matrix of structural constants. In general, this is a cubic matrix. Difficulty of investigation of an algebra depends on the cubic matrix. Such a cubic matrix defines a quadratic mapping called an evolution operator. In the case of evolution algebras, the cubic matrix consists many zeros allowing to reduce it to a square matrix. 
In this paper for any finite dimensional algebra we construct a family of evolution algebras corresponding to Jacobian of the evolution operator at a point of the algebra. We obtain some results answering how properties of an algebra depends on the properties of the corresponding family of evolution algebras. Moreover, we consider evolution algebras corresponding to 2 and 3-dimensional nilpotent Leibniz algebras. We prove that such evolution algebras are nilpotent too. Also we classify such evolution algebras.
Investigation on the generalization of the Sampled Policy Gradient algorithm

The Sampled Policy Gradient (SPG) algorithm is a new offline actor-critic variant that samples in the action space to approximate the policy gradient. It does so by using the critic to evaluate the sampled actions. SPG offers theoretical promise over similar algorithms such as DPG as it searches the action-Q-value space independently of the local gradient, enabling it to avoid local minima. This paper aims to compare SPG to two similar actor-critic algorithms, CACLA and DPG. The comparison is made across two different environments, two different network architectures, as well as training on on-policy transitions in contrast to using an experience buffer. Results seem to show that although SPG does often not perform the worst, it doesn't always match the performance of the best performing algorithm at a particular task. Further experiments are required to get a better estimate of the qualities of SPG.
ExpertMatcher: Automating ML Model Selection for Clients using Hidden Representations

Recently, there has been the development of Split Learning, a framework for distributed computation where model components are split between the client and server (Vepakomma et al., 2018b). As Split Learning scales to include many different model components, there needs to be a method of matching client-side model components with the best server-side model components. A solution to this problem was introduced in the ExpertMatcher (Sharma et al., 2019) framework, which uses autoencoders to match raw data to models. In this work, we propose an extension of ExpertMatcher, where matching can be performed without the need to share the client's raw data representation. The technique is applicable to situations where there are local clients and centralized expert ML models, but the sharing of raw data is constrained.
Towards De-identification of Legal Texts

In many countries, personal information that can be published or shared between organizations is regulated and, therefore, documents must undergo a process of de-identification to eliminate or obfuscate confidential data. Our work focuses on the de-identification of legal texts, where the goal is to hide the names of the actors involved in a lawsuit without losing the sense of the story. We present a first evaluation on our corpus of NLP tools in tasks such as segmentation, tokenization and recognition of named entities, and we analyze several evaluation measures for our de-identification task.  84% of the documents have at least one name not covered by NER tools, something that might lead to the re-identification of involved names. We conclude that tools must be strongly adapted for processing texts of this particular domain.
Multiple-objective Reinforcement Learning for Inverse Design and Identification

The aim of the inverse chemical design is to develop new molecules with given optimized molecular properties or objectives. Recently, generative deep learning (DL) networks are considered as the state-of-the-art in inverse chemical design and have achieved early success in generating molecular structures with desired properties in the pharmaceutical and material chemistry fields. However, satisfying a large number (larger than 10 objectives) of molecular objectives is a limitation of current generative models. To improve the model's ability to handle a large number of molecule design objectives, we developed a Reinforcement Learning (RL) based generative framework to optimize chemical molecule generation. Our use of Curriculum Learning (CL) to fine-tune the pre-trained generative network allowed the model to satisfy up to 21 objectives and increase the generative network's robustness. The experiments show that the proposed multiple-objective RL-based generative model can correctly identify unknown molecules with an 83 to 100 percent success rate, compared to the baseline approach of 0 percent. Additionally, this proposed generative model is not limited to just chemistry research challenges; we anticipate that problems that utilize RL with multiple-objectives will benefit from this framework.
Greedy Convex Ensemble

We consider learning a convex combination of basis models, and present some new theoretical and empirical results that demonstrate the effectiveness of a greedy approach. Theoretically, we first consider whether we can use linear, instead of convex, combinations, and obtain generalization results similar to existing ones for learning from a convex hull. We obtain a negative result that even the linear hull of very simple basis functions can have unbounded capacity, and is thus prone to overfitting; on the other hand, convex hulls are still rich but have bounded capacities. Secondly, we obtain a generalization bound for a general class of Lipschitz loss functions. Empirically, we first discuss how a convex combination can be greedily learned with early stopping, and how a convex combination can be non-greedily learned when the number of basis models is known a priori. Our experiments suggest that the greedy scheme is competitive with or better than several baselines, including boosting and random forests. The greedy algorithm requires little effort in hyper-parameter tuning, and also seems able to adapt to the underlying complexity of the problem. Our code is available at https://github.com/tan1889/gce.
Model-based Reinforcement Learning for Predictions and Control for Limit Order Books

We build a profitable electronic trading agent with Reinforcement Learning that places buy and sell orders in the stock market. An environment model is built only with historical observational data, and the RL agent learns the trading policy by interacting with the environment model instead of with the real-market to minimize the risk and potential monetary loss. Trained in unsupervised and self-supervised fashion, our environment model learned a temporal and causal representation of the market in latent space through deep neural networks. We demonstrate that the trading policy trained entirely within the environment model can be transferred back into the real market and maintain its profitability. We believe that this environment model can serve as a robust simulator that predicts market movement as well as trade impact for further studies.
Alternating Recurrent Dialog Model with Large-scale Pre-trained Language Models

Existing dialog system models require extensive human annotations and are difficult to generalize to different tasks. The recent success of large pre-trained language models such as BERT and GPT-2 (Devlin et al., 2019; Radford et al., 2019) have suggested the effectiveness of incorporating language priors in down-stream NLP tasks. However, how much pre-trained language models can help dialog response generation is still under exploration. In this paper, we propose a simple, general, and effective framework: Alternating Recurrent Dialog Model (ARDM). ARDM models each speaker separately and takes advantage of the large pre-trained language model. It requires no supervision from human annotations such as belief states or dialog acts to achieve effective conversations. ARDM outperforms or is on par with state-of-the-art methods on two popular task-oriented dialog datasets: CamRest676 and MultiWOZ. Moreover, we can generalize ARDM to more challenging, non-collaborative tasks such as persuasion. In persuasion tasks, ARDM is capable of generating human-like responses to persuade people to donate to a charity.
HuggingFace's Transformers: State-of-the-art Natural Language Processing

Recent progress in natural language processing has been driven by advances in both model architecture and model pretraining. Transformer architectures have facilitated building higher-capacity models and pretraining has made it possible to effectively utilize this capacity for a wide variety of tasks. \textit{Transformers} is an open-source library with the goal of opening up these advances to the wider machine learning community. The library consists of carefully engineered state-of-the art Transformer architectures under a unified API. Backing this library is a curated collection of pretrained models made by and available for the community. \textit{Transformers} is designed to be extensible by researchers, simple for practitioners, and fast and robust in industrial deployments. The library is available at \url{this https URL}.
Knowledge Induced Deep Q-Network for a Slide-to-Wall Object Grasping

In robotic grasping tasks, robots usually avoid any collisions with the environment and exclusively interact with the target objects. However, the environment can facilitate grasping rather than being obstacles. Indeed, interacting with the environment sometimes provides an alternative strategy when it is not possible to grasp from the top. One example of such tasks is the Slide-to-Wall grasping, where the target object needs to be pushed towards a wall before a feasible grasp can be applied. In this paper, we propose an approach that actively exploits the environment to grasp objects. We formulate the Slide-to-Wall grasping problem as a Markov Decision Process and propose a reinforcement learning approach. Though a standard Deep Q-Network (DQN) method is capable of solving MDP problems, it does not effectively generalize to unseen environment settings that are different from training. To tackle the generalization challenge, we propose a Knowledge Induced DQN (KI-DQN) that not only trains more effectively, but also outperforms the standard DQN significantly in testing cases with unseen walls, and can be directly tested on real robots without fine-tuning while DQN cannot.
Growth of ultra-high purity NaI(Tl) crystals for dark matter searches

The annual modulation of scintillation event rate observed by the DAMA/LIBRA experiment has been a long-standing controversy in the quest of the direct detection of dark matter. The effort to definitively confirm or refute the annual modulation has turned out to be challenging due to the lack of NaI(Tl) crystals with high enough radio-purity. Most recently, we successfully grew a 6-kg ingot free from contamination during growth, from which a 3.4-kg crystal scintillator was made. The $^{39}$K concentration in the final crystal is estimated to be 4.3$\pm$0.2~ppb, unprecedented for NaI(Tl) crystals. The $^{210}$Pb activity is estimated to be 0.34$\pm$0.04~mBq/kg via $\alpha$ counting of $^{210}$Po, among the lowest of currently-running NaI-based dark matter experiments except DAMA/LIBRA. More importantly, the techniques and protocols we have developed will further contribute to the growth of higher purity NaI(Tl) crystals for dark matter searches.
Creating a unique mobile financial services framework for Myanmar: A Review

Myanmar is languishing at the bottom of key international indexes. United Nations considers the country as a structurally weak and vulnerable economy. Yet, from 2011 when Myanmar ended decades of military rule and isolationism and transited towards democracy, its breakneck development has led to many considering the country to be one of the final frontiers for growth in the Asia region. One such industry that has benefitted from the opening of the country is telecommunications. The mobile penetration rate at 4.8% in 2011 has increased significantly to 90% in 2016. Despite renewed optimism and development in the economy, one statistic remains disappointing. According to a report by Asian Development Bank (ADB), only 23% of the adult population have access to a bank account. This highlights a need to reach out and increase access to financial resources to a population that is severely unbanked and underbanked. This creates an interesting proposition of allowing both the telecommunications and financial sector to form the mobile financial services (MFS) sector and meet the need of improving access to financial resources for the population. This report explores the government role in supporting, growing and sustaining the MFS sector and conducts a comparative research into Singapore, Malaysia and Thailand to understand the steps taken by these governments to develop their own Financial Technology (FinTech), specifically MFS, industry. Finally, the report will present preliminary recommendations that the Myanmar government could consider implementing to drive growth in its MFS sector.
Art Pricing with Computer Graphic Techniques

This paper makes the first attempt to introduce the tools from computer graphics into the art pricing research. We argue that the creation of a painting calls for a combination of conceptual effort and painting effort from the artist. However, as the important price determinants, both efforts are long missing in the traditional hedonic model because they are hard to measure. This paper draws on the digital pictures of auctioned paintings from various renowned artists, and applies the image recognition techniques to measure the variances of lines and colors of these paintings. We then use them as the proxies for the artist's painting effort, and include them in the hedonic regression to test their significance. Our results show that the variances of lines and colors of a painting can significantly positively explain the sales price in a general context. Our suggested measurements can better capture the content heterogeneity of paintings hence improving on the traditional art pricing methodology. Our approach also provides a quantitative perspective for both valuation and authentication of paintings.
A Simple Proof of the Universality of Invariant/Equivariant Graph Neural Networks

We present a simple proof for the universality of invariant and equivariant tensorized graph neural networks. Our approach considers a restricted intermediate hypothetical model named Graph Homomorphism Model to reach the universality conclusions including an open case for higher-order output. We find that our proposed technique not only leads to simple proofs of the universality properties but also gives a natural explanation for the tensorization of the previously studied models. Finally, we give some remarks on the connection between our model and the continuous representation of graphs.
Is Multilingual BERT Fluent in Language Generation?

The multilingual BERT model is trained on 104 languages and meant to serve as a universal language model and tool for encoding sentences. We explore how well the model performs on several languages across several tasks: a diagnostic classification probing the embeddings for a particular syntactic property, a cloze task testing the language modelling ability to fill in gaps in a sentence, and a natural language generation task testing for the ability to produce coherent text fitting a given context. We find that the currently available multilingual BERT model is clearly inferior to the monolingual counterparts, and cannot in many cases serve as a substitute for a well-trained monolingual model. We find that the English and German models perform well at generation, whereas the multilingual model is lacking, in particular, for Nordic languages. The code of the experiments in the paper is available at: https://github.com/TurkuNLP/bert-eval
Adversarial Learning of Deepfakes in Accounting

Nowadays, organizations collect vast quantities of accounting relevant transactions, referred to as 'journal entries', in 'Enterprise Resource Planning' (ERP) systems. The aggregation of those entries ultimately defines an organization's financial statement. To detect potential misstatements and fraud, international audit standards demand auditors to directly assess journal entries using 'Computer Assisted AuditTechniques' (CAATs). At the same time, discoveries in deep learning research revealed that machine learning models are vulnerable to 'adversarial attacks'. It also became evident that such attack techniques can be misused to generate 'Deepfakes' designed to directly attack the perception of humans by creating convincingly altered media content. The research of such developments and their potential impact on the finance and accounting domain is still in its early stage. We believe that it is of vital relevance to investigate how such techniques could be maliciously misused in this sphere. In this work, we show an adversarial attack against CAATs using deep neural networks. We first introduce a real-world 'thread model' designed to camouflage accounting anomalies such as fraudulent journal entries. Second, we show that adversarial autoencoder neural networks are capable of learning a human interpretable model of journal entries that disentangles the entries latent generative factors. Finally, we demonstrate how such a model can be maliciously misused by a perpetrator to generate robust 'adversarial' journal entries that mislead CAATs.
Sequential VAE-LSTM for Anomaly Detection on Time Series

In order to support stable web-based applications and services, anomalies on the IT performance status have to be detected timely. Moreover, the performance trend across the time series should be predicted. In this paper, we propose SeqVL (Sequential VAE-LSTM), a neural network model based on both VAE (Variational Auto-Encoder) and LSTM (Long Short-Term Memory). This work is the first attempt to integrate unsupervised anomaly detection and trend prediction under one framework. Moreover, this model performs considerably better on detection and prediction than VAE and LSTM work alone. On unsupervised anomaly detection, SeqVL achieves competitive experimental results compared with other state-of-the-art methods on public datasets. On trend prediction, SeqVL outperforms several classic time series prediction models in the experiments of the public dataset.
Quasi Maximum Likelihood Estimation and Inference of Large Approximate Dynamic Factor Models via the EM algorithm

This paper studies Quasi Maximum Likelihood estimation of dynamic factor models for large panels of time series. Specifically, we consider the case in which the autocorrelation of the factors is explicitly accounted for and therefore the factor model has a state-space form. Estimation of the factors and their loadings is implemented by means of the Expectation Maximization algorithm, jointly with the Kalman smoother. We prove that, as both the dimension of the panel $n$ and the sample size $T$ diverge to infinity, the estimated loadings, factors, and common components are $\min(\sqrt n,\sqrt T)$-consistent and asymptotically normal. Although the model is estimated under the unrealistic constraint of independent idiosyncratic errors, this mis-specification does not affect consistency. Moreover, we give conditions under which the derived asymptotic distribution can still be used for inference even in case of mis-specifications. Our results are confirmed by a MonteCarlo simulation exercise where we compare the performance of our estimators with Principal Components.