nils-herrmann/clean_scirepeval huggingface dataset:
The motivic zeta functions of a matroid

We introduce motivic zeta functions for matroids. These zeta functions are defined as sums over the lattice points of Bergman fans, and in the realizable case, they coincide with the motivic Igusa zeta functions of hyperplane arrangements. We show that these motivic zeta functions satisfy a functional equation arising from matroid Poincaré duality in the sense of Adiprasito–Huh–Katz. In the process, we obtain a formula for the Hilbert series of the cohomology ring of a matroid, in the sense of Feichtner–Yuzvinsky. We then show that our motivic zeta functions specialize to the topological zeta functions for matroids introduced by van der Veer, and we compute the first two coefficients in the Taylor expansion of these topological zeta functions, providing affirmative answers to two questions posed by van der Veer.
Best-first Search Algorithm for Non-convex Sparse Minimization

Non-convex sparse minimization (NSM), or $\ell_0$-constrained minimization of convex loss functions, is an important optimization problem that has many machine learning applications. NSM is generally NP-hard, and so to exactly solve NSM is almost impossible in polynomial time. As regards the case of quadratic objective functions, exact algorithms based on quadratic mixed-integer programming (MIP) have been studied, but no existing exact methods can handle more general objective functions including Huber and logistic losses; this is unfortunate since those functions are prevalent in practice. In this paper, we consider NSM with $\ell_2$-regularized convex objective functions and develop an algorithm by leveraging the efficiency of best-first search (BFS). Our BFS can compute solutions with objective errors at most $\Delta\ge0$, where $\Delta$ is a controllable hyper-parameter that balances the trade-off between the guarantee of objective errors and computation cost. Experiments demonstrate that our BFS is useful for solving moderate-size NSM instances with non-quadratic objectives and that BFS is also faster than the MIP-based method when applied to quadratic objectives.
Evolutionary dimension reduction in phenotypic space

In general, cellular phenotypes, as measured by concentrations of cellular components, involve large degrees of freedom. However, recent measurement has demonstrated that phenotypic changes resulting from adaptation and evolution in response to environmental changes are effectively restricted to a low-dimensional subspace. Thus, uncovering the origin and nature of such a drastic dimension reduction is crucial to understanding the general characteristics of biological adaptation and evolution. Herein, we first formulated the dimension reduction in terms of dynamical systems theory: considering the steady growth state of cells, the reduction is represented by the separation of a few large singular values of the inverse Jacobian matrix around a fixed point. We then examined this dimension reduction by numerical evolution of cells consisting of thousands of chemicals whose concentrations determine phenotype. As a result of the evolution, phenotypic changes due to mutations and external perturbations were found to be mainly restricted to a one-dimensional subspace. One singular value of the inverse Jacobian matrix at a fixed point of concentrations was significantly larger than the others. The major phenotypic changes due to mutations and external perturbations occur along the corresponding left-singular vector, which leads to phenotypic constraint, and fitness dominantly changes in the same direction. Once such phenotypic constraint is acquired, phenotypic evolution to a novel environment takes advantage of this restricted phenotypic direction. This results in the convergence of phenotypic pathways across genetically different strains, as is experimentally observed, while accelerating further evolution.
Hitachi at MRP 2019: Unified Encoder-to-Biaffine Network for Cross-Framework Meaning Representation Parsing

This paper describes the proposed system of the Hitachi team for the Cross-Framework Meaning Representation Parsing (MRP 2019) shared task. In this shared task, the participating systems were asked to predict nodes, edges and their attributes for five frameworks, each with different order of “abstraction” from input tokens. We proposed a unified encoder-to-biaffine network for all five frameworks, which effectively incorporates a shared encoder to extract rich input features, decoder networks to generate anchorless nodes in UCCA and AMR, and biaffine networks to predict edges. Our system was ranked fifth with the macro-averaged MRP F1 score of 0.7604, and outperformed the baseline unified transition-based MRP. Furthermore, post-evaluation experiments showed that we can boost the performance of the proposed system by incorporating multi-task learning, whereas the baseline could not. These imply efficacy of incorporating the biaffine network to the shared architecture for MRP and that learning heterogeneous meaning representations at once can boost the system performance.
Assessing the predictive ability of the UPDRS for falls classification in early stage Parkinson's disease

Identification of risk factors associated with falls in people with Parkinson's Disease (PD) is important due to their high risk of falling. In this study, various ways of utilizing the Unified Parkinson's Disease Rating Scale (UPDRS) were assessed for the identification of risk factors and for the prediction of falls. Three statistical methods for classification were considered:decision trees, random forests, and logistic regression. UPDRS measurements on 51 participants with early stage PD, who completed monthly falls diaries for 12 months of follow-up were analyzed. All classification methods applied produced similar results in regards to classification accuracy and the selected important variables. The highest classification rates were obtained from model with individual items of the UPDRS with 80% accuracy (85% sensitivity and 77% specificity), higher than in any previous study. A comparison of the independent performance of the four parts of the UPDRS revealed the comparably high classification rates for Parts II and III of the UPDRS. Similar patterns with slightly different classification rates were observed for the 6- and 12-month of follow-up times. Consistent predictors for falls selected by all classification methods at two follow-up times are: thought disorder for UPDRS I, dressing and falling for UPDRS II, hand pronate/supinate for UPDRS III, and sleep disturbance and symptomatic orthostasis for UPDRS IV. While for the aggregate measures, subtotal 2 (sum of UPDRS II items) and bradykinesia showed high association with fall/non-fall. Fall/non-fall occurrences were more associated with individual items of the UPDRS than with the aggregate measures. UPDRS parts II and III produced comparably high classification rates for fall/non-fall prediction. Similar results were obtained for modelling data at 6-month and 12-month follow-up times.
Orbit Computation for Atomically Generated Subgroups of Isometries of $\mathbb{Z}^n$

Isometries and their induced symmetries are ubiquitous in the world. Taking a computational perspective, this paper considers isometries of $\mathbb{Z}^n$ (since values are discrete in digital computers), and tackles the problem of orbit computation under various isometry subgroup actions on $\mathbb{Z}^n$. Rather than just conceptually, we aim for a practical algorithm that can partition any finite subset of $\mathbb{Z}^n$ based on the orbit relation. In this paper, instead of all subgroups of isometries, we focus on a special class of subgroups, namely atomically generated subgroups. This newly introduced notion is key to inheriting the semidirect-product structure from the whole group of isometries, and in turn, the semidirect-product structure is key to our proposed algorithm for efficient orbit computation.
An empirical study of pretrained representations for few-shot classification

Recent algorithms with state-of-the-art few-shot classification results start their procedure by computing data features output by a large pretrained model. In this paper we systematically investigate which models provide the best representations for a few-shot image classification task when pretrained on the Imagenet dataset. We test their representations when used as the starting point for different few-shot classification algorithms. We observe that models trained on a supervised classification task have higher performance than models trained in an unsupervised manner even when transferred to out-of-distribution datasets. Models trained with adversarial robustness transfer better, while having slightly lower accuracy than supervised models.
Homogeneity and heterogeneity of cryptocurrencies.

Thousands of cryptocurrencies have been issued and publicly exchanged since Bitcoin was invented in 2008. The total cryptocurrency market value exceeds 300 billion US dollars as of 2019. This paper analyzes the prices, volumes, blockchain transactions, coin difficulties and public opinion popularities of 3607 actively exchanged cryptocurrencies. We aim to reveal and explain the homogeneity, i.e., the strong correlation of market performance, and the heterogeneity, i.e., the imbalance of popularities and sophistications, of the cryptocurrencies.
TexTrolls: Identifying Russian Trolls on Twitter from a Textual Perspective

The online new emerging suspicious users, that usually are called trolls, are one of the main sources of hate, fake, and deceptive online messages. Some agendas are utilizing these harmful users to spread incitement tweets, and as a consequence, the audience get deceived. The challenge in detecting such accounts is that they conceal their identities which make them disguised in social media, adding more difficulty to identify them using just their social network information. Therefore, in this paper, we propose a text-based approach to detect the online trolls such as those that were discovered during the US 2016 presidential elections. Our approach is mainly based on textual features which utilize thematic information, and profiling features to identify the accounts from their way of writing tweets. We deduced the thematic information in a unsupervised way and we show that coupling them with the textual features enhanced the performance of the proposed model. In addition, we find that the proposed profiling features perform the best comparing to the textual features.
Pay Attention: Leveraging Sequence Models to Predict the Useful Life of Batteries

We use data on 124 batteries released by Stanford University to first try to solve the binary classification problem of determining if a battery is "good" or "bad" given only the first 5 cycles of data (i.e., will it last longer than a certain threshold of cycles), as well as the prediction problem of determining the exact number of cycles a battery will last given the first 100 cycles of data. We approach the problem from a purely data-driven standpoint, hoping to use deep learning to learn the patterns in the sequences of data that the Stanford team engineered by hand. For both problems, we used a similar deep network design, that included an optional 1-D convolution, LSTMs, an optional Attention layer, followed by fully connected layers to produce our output. For the classification task, we were able to achieve very competitive results, with validation accuracies above 90%, and a test accuracy of 95%, compared to the 97.5% test accuracy of the current leading model. For the prediction task, we were also able to achieve competitive results, with a test MAPE error of 12.5% as compared with a 9.1% MAPE error achieved by the current leading model (Severson et al. 2019).
On the Efficacy of Knowledge Distillation

In this paper, we present a thorough evaluation of the efficacy of knowledge distillation and its dependence on student and teacher architectures. Starting with the observation that more accurate teachers often don’t make good teachers, we attempt to tease apart the factors that affect knowledge distillation performance. We find crucially that larger models do not often make better teachers. We show that this is a consequence of mismatched capacity, and that small students are unable to mimic large teachers. We find typical ways of circumventing this (such as performing a sequence of knowledge distillation steps) to be ineffective. Finally, we show that this effect can be mitigated by stopping the teacher’s training early. Our results generalize across datasets and models.
Running Alchemist on Cray XC and CS Series Supercomputers: Dask and PySpark Interfaces, Deployment Options, and Data Transfer Times

Newly developed interfaces for Python, Dask, and PySpark enable the use of Alchemist with additional data analysis frameworks. We also briefly discuss the combination of Alchemist with RLlib, an increasingly popular library for reinforcement learning, and consider the benefits of leveraging HPC simulations in reinforcement learning. Finally, since data transfer between the client applications and Alchemist are the main overhead Alchemist encounters, we give a qualitative assessment of these transfer times with respect to different~factors.
Mapping (Dis-)Information Flow about the MH17 Plane Crash

Digital media enables not only fast sharing of information, but also disinformation. One prominent case of an event leading to circulation of disinformation on social media is the MH17 plane crash. Studies analysing the spread of information about this event on Twitter have focused on small, manually annotated datasets, or used proxys for data annotation. In this work, we examine to what extent text classifiers can be used to label data for subsequent content analysis, in particular we focus on predicting pro-Russian and pro-Ukrainian Twitter content related to the MH17 plane crash. Even though we find that a neural classifier improves over a hashtag based baseline, labeling pro-Russian and pro-Ukrainian content with high precision remains a challenging problem. We provide an error analysis underlining the difficulty of the task and identify factors that might help improve classification in future work. Finally, we show how the classifier can facilitate the annotation task for human annotators.
Expansion of eigenvalues of rank-one perturbations of the discrete bilaplacian

We consider the family $\hat h_\mu:=\hat\varDelta\hat \varDelta - \mu \hat v,$ $\mu\in\mathbb{R}, $ of discrete Schrodinger-type operators in $d$-dimensional lattice $\mathbb{Z}^d$, where $\hat \varDelta$ is the discrete Laplacian and $\hat v$ is of rank-one. We prove that there exist coupling constant thresholds $\mu_o,\mu^o\ge0$ such that for any $\mu\in[-\mu^o,\mu_o]$ the discrete spectrum of $\hat h_\mu$ is empty and for any $\mu\in \mathbb{R}\setminus[-\mu^o,\mu_o]$ the discrete spectrum of $\hat h_\mu$ is a singleton $\{e(\mu)\},$ and $e(\mu) \mu_o$ and $e(\mu)>4d^2$ for $\mu<-\mu^o.$ Moreover, we study the asymptotics of $e(\mu)$ as $\mu\to\mu_o$ and $\mu\to -\mu^o$ as well as $\mu\to\pm\infty.$ The asymptotics highly depend on $d$ and $\hat v.$
A Cryptanalysis of Two Cancelable Biometric Schemes Based on Index-of-Max Hashing

Cancelable biometric schemes generate secure biometric templates by combining user specific tokens and biometric data. The main objective is to create irreversible, unlinkable, and revocable templates, with high accuracy of comparison. In this paper, we cryptanalyze two recent cancelable biometric schemes based on a particular locality sensitive hashing function, index-of-max (IoM): Gaussian Random Projection-IoM (GRP-IoM) and Uniformly Random Permutation-IoM (URP-IoM). As originally proposed, these schemes were claimed to be resistant against reversibility, authentication, and linkability attacks under the stolen token scenario. We propose several attacks against GRP-IoM and URP-IoM, and argue that both schemes are severely vulnerable against authentication and linkability attacks. We also propose better, but not yet practical, reversibility attacks against GRP-IoM. The correctness and practical impact of our attacks are verified over the same dataset provided by the authors of these two schemes.
Group-Like Uninorms

Uninorms, a.k.a. FL$_e$-algebras over $[0,1]$, play a prominent role both in the theory and the applications of Aggregations and Mathematical Fuzzy Logic. In this paper the class of group-like uninorms is introduced and characterized. First, two variants of a general construction -- called partial-lexicographic product -- will be recalled; these construct group-like FL$_e$-algebras. Then two particular ways of applying the partial-lexicographic product construction will be specified. The first method constructs, starting from $\mathbb R$ and modifying it in some way by $\mathbb Z$'s, what we call basic group-like uninorms, whereas with second method one may modify any group-like uninorm by using $\mathbb Z$ and a basic group-like uninorm to obtain another group-like uninorm. All group-like uninorms obtained this way have finitely many idempotent elements. On the other hand, we prove that given any group-like uninorm which has finitely many idempotent elements, it can be constructed by consecutive applications of the second construction (finitely many times) using only basic group-like uninorms. So any basic group-like uninorm can be built using the first method, and any group-like uninorm which has finitely many idempotent elements can be built by the second method using only basic group-like uninorms. In this way a complete characterization for group-like uninorms which possess finitely many idempotents is given. The paper is illustrated with several 3D plots of group-like uninorms.
Face Manifold: Manifold Learning for Synthetic Face Generation

Face is one of the most important things for communication with the world around us. It also forms our identity and expressions. Estimating the face structure is a fundamental task in computer vision with applications in different areas such as face recognition and medical surgeries. Recently, deep learning techniques achieved significant results for 3D face reconstruction from flat images. The main challenge of such techniques is a vital need for large 3D face datasets. Usually, this challenge is handled by synthetic face generation. However, synthetic datasets suffer from the existence of non-possible faces. Here, we propose a face manifold learning method for synthetic diverse face dataset generation. First, the face structure is divided into the shape and expression groups. Then, a fully convolutional autoencoder network is exploited to deal with the non-possible faces, and, simultaneously, preserving the dataset diversity. Simulation results show that the proposed method is capable of denoising highly corrupted faces. The diversity of the generated dataset is evaluated qualitatively and quantitatively and compared to the existing methods. Experiments show that our manifold learning method outperforms the state of the art methods significantly.
A Tale of Two Sentiment Scales: Disentangling Short-Run and Long-Run Components in Multivariate Sentiment Dynamics

We propose a novel approach to sentiment data filtering for a portfolio of assets. In our framework, a dynamic factor model drives the evolution of the observed sentiment and allows to identify two distinct components: a long-term component, modeled as a random walk, and a short-term component driven by a stationary VAR(1) process. Our model encompasses alternative approaches available in literature and can be readily estimated by means of Kalman filtering and expectation maximization. This feature makes it convenient when the cross-sectional dimension of the portfolio increases. By applying the model to a portfolio of Dow Jones stocks, we find that the long term component co-integrates with the market principal factor, while the short term one captures transient swings of the market associated with the idiosyncratic components and captures the correlation structure of returns. Using quantile regressions, we assess the significance of the contemporaneous and lagged explanatory power of sentiment on returns finding strong statistical evidence when extreme returns, especially negative ones, are considered. Finally, the lagged relation is exploited in a portfolio allocation exercise.
A General Upper Bound for Unsupervised Domain Adaptation

In this work, we present a novel upper bound of target error to address the problem for unsupervised domain adaptation. Recent studies reveal that a deep neural network can learn transferable features which generalize well to novel tasks. Furthermore, a theory proposed by Ben-David et al. (2010) provides a upper bound for target error when transferring the knowledge, which can be summarized as minimizing the source error and distance between marginal distributions simultaneously. However, common methods based on the theory usually ignore the joint error such that samples from different classes might be mixed together when matching marginal distribution. And in such case, no matter how we minimize the marginal discrepancy, the target error is not bounded due to an increasing joint error. To address this problem, we propose a general upper bound taking joint error into account, such that the undesirable case can be properly penalized. In addition, we utilize constrained hypothesis space to further formalize a tighter bound as well as a novel cross margin discrepancy to measure the dissimilarity between hypotheses which alleviates instability during adversarial learning. Extensive empirical evidence shows that our proposal outperforms related approaches in image classification error rates on standard domain adaptation benchmarks.
Excited Electronic States in Total Isotropic Scattering from Molecules.

Ultrafast X-ray scattering experiments are routinely analyzed in terms of the isotropic scattering component. Here, we present an analytical method for calculating total isotropic scattering for ground and excited electronic states directly from ab initio two-electron densities. The method is generalized to calculate the isotropic elastic, inelastic, and coherent mixed scattering. The presented computational results focus on the potential for differentiating between electronic states and the decomposition of the total scattering in terms of elastic and inelastic scattering. For the specific example of the umbrella motion in the first excited state of ammonia, we show that the redistribution of electron density along this coordinate leaves a comparably constant fingerprint in the total scattering that is similar in magnitude to the effect of changes in molecular geometry.