nils-herrmann/clean_scirepeval huggingface dataset:
MLR (Memory, Learning and Recognition): A General Cognitive Model - applied to Intelligent Robots and Systems Control

This paper introduces a new perspective of intelligent robots and systems control. The presented and proposed cognitive model: Memory, Learning and Recognition (MLR), is an effort to bridge the gap between Robotics, AI, Cognitive Science, and Neuroscience. The currently existing gap prevents us from integrating the current advancement and achievements of these four research fields which are actively trying to define intelligence in either application-based way or in generic way. This cognitive model defines intelligence more specifically, parametrically and detailed. The proposed MLR model helps us create a general control model for robots and systems independent of their application domains and platforms since it is mainly based on the dataset provided for robots and systems controls. This paper is mainly proposing and introducing this concept and trying to prove this concept in a small scale, firstly through experimentation. The proposed concept is also applicable to other different platforms in real-time as well as in simulation.
Relationship between the Metallicity of the Circumgalactic Medium and Galaxy Orientation

We investigate the geometric distribution of gas metallicities in the circumgalactic medium (CGM) around 47, z < 0.7 galaxies from the “Multiphase Galaxy Halos” Survey. Using a combination of quasar spectra from Hubble Space Telescope (HST)/COS and from Keck/HIRES or Very Large Telescope/UVES, we measure column densities of, or determine limits on, CGM absorption lines. We then use a Markov Chain Monte Carlo approach with Cloudy to estimate the metallicity of cool (T ∼ 104 K) CGM gas. We also use HST images to determine host-galaxy inclination and quasar-galaxy azimuthal angles. Our sample spans a H i column density range of 13.8 cm−2 < < 19.9 cm−2. We find (1) while the metallicity distribution appears bimodal, a Hartigan dip test cannot rule out a unimodal distribution (0.4σ). (2) CGM metallicities are independent of halo mass, spanning three orders of magnitude at a fixed halo mass. (3) The CGM metallicity does not depend on the galaxy azimuthal and inclination angles regardless of H i column density, impact parameter, and galaxy color. (4) The ionization parameter does not depend on azimuthal angle. We suggest that the partial Lyman limit metallicity bimodality is not driven by a spatial azimuthal bimodality. Our results are consistent with simulations where the CGM is complex and outflowing, accreting, and recycled gas are well-homogenized at z < 0.7. The presence of low-metallicity gas at all orientations suggests that cold streams of accreting filaments are not necessarily aligned with the galaxy plane at low redshifts or intergalactic transfer may dominate. Finally, our results support simulations showing that strong metal absorption can mask the presence of low-metallicity gas in integrated line-of-sight CGM metallicities.
NPA: Neural News Recommendation with Personalized Attention

News recommendation is very important to help users find interested news and alleviate information overload. Different users usually have different interests and the same user may have various interests. Thus, different users may click the same news article with attention on different aspects. In this paper, we propose a neural news recommendation model with personalized attention (NPA). The core of our approach is a news representation model and a user representation model. In the news representation model we use a CNN network to learn hidden representations of news articles based on their titles. In the user representation model we learn the representations of users based on the representations of their clicked news articles. Since different words and different news articles may have different informativeness for representing news and users, we propose to apply both word- and news-level attention mechanism to help our model attend to important words and news articles. In addition, the same news article and the same word may have different informativeness for different users. Thus, we propose a personalized attention network which exploits the embedding of user ID to generate the query vector for the word- and news-level attentions. Extensive experiments are conducted on a real-world news recommendation dataset collected from MSN news, and the results validate the effectiveness of our approach on news recommendation.
ScenarioSA: A Large Scale Conversational Database for Interactive Sentiment Analysis

Interactive sentiment analysis is an emerging, yet challenging, subtask of the sentiment analysis problem. It aims to discover the affective state and sentimental change of each person in a conversation. Existing sentiment analysis approaches are insufficient in modelling the interactions among people. However, the development of new approaches are critically limited by the lack of labelled interactive sentiment datasets. In this paper, we present a new conversational emotion database that we have created and made publically available, namely ScenarioSA. We manually label 2,214 multi-turn English conversations collected from natural contexts. In comparison with existing sentiment datasets, ScenarioSA (1) covers a wide range of scenarios; (2) describes the interactions between two speakers; and (3) reflects the sentimental evolution of each speaker over the course of a conversation. Finally, we evaluate various state-of-the-art algorithms on ScenarioSA, demonstrating the need of novel interactive sentiment analysis models and the potential of ScenarioSA to facilitate the development of such models.
A Quantum-inspired Classical Algorithm for Separable Non-negative Matrix Factorization

Non-negative Matrix Factorization (NMF) asks to decompose a (entry-wise) non-negative matrix into the product of two smaller-sized nonnegative matrices, which has been shown intractable in general. In order to overcome this issue, separability assumption is introduced which assumes all data points are in a conical hull. This assumption makes NMF tractable and widely used in text analysis and image processing, but still impractical for huge-scale datasets. In this paper, inspired by recent development on dequantizing techniques, we propose a new classical algorithm for separable NMF problem. Our new algorithm runs in polynomial time in the rank and logarithmic in the size of input matrices, which achieves an exponential speedup in the low-rank setting.
Dual Adversarial Semantics-Consistent Network for Generalized Zero-Shot Learning

Generalized zero-shot learning (GZSL) is a challenging class of vision and knowledge transfer problems in which both seen and unseen classes appear during testing. Existing GZSL approaches either suffer from semantic loss and discard discriminative information at the embedding stage, or cannot guarantee the visual-semantic interactions. To address these limitations, we propose the Dual Adversarial Semantics-Consistent Network (DASCN), which learns primal and dual Generative Adversarial Networks (GANs) in a unified framework for GZSL. In particular, the primal GAN learns to synthesize inter-class discriminative and semantics-preserving visual features from both the semantic representations of seen/unseen classes and the ones reconstructed by the dual GAN. The dual GAN enforces the synthetic visual features to represent prior semantic knowledge well via semantics-consistent adversarial learning. To the best of our knowledge, this is the first work that employs a novel dual-GAN mechanism for GZSL. Extensive experiments show that our approach achieves significant improvements over the state-of-the-art approaches.
R-Transformer: Recurrent Neural Network Enhanced Transformer

Recurrent Neural Networks have long been the dominating choice for sequence modeling. However, it severely suffers from two issues: impotent in capturing very long-term dependencies and unable to parallelize the sequential computation procedure. Therefore, many non-recurrent sequence models that are built on convolution and attention operations have been proposed recently. Notably, models with multi-head attention such as Transformer have demonstrated extreme effectiveness in capturing long-term dependencies in a variety of sequence modeling tasks. Despite their success, however, these models lack necessary components to model local structures in sequences and heavily rely on position embeddings that have limited effects and require a considerable amount of design efforts. In this paper, we propose the R-Transformer which enjoys the advantages of both RNNs and the multi-head attention mechanism while avoids their respective drawbacks. The proposed model can effectively capture both local structures and global long-term dependencies in sequences without any use of position embeddings. We evaluate R-Transformer through extensive experiments with data from a wide range of domains and the empirical results show that R-Transformer outperforms the state-of-the-art methods by a large margin in most of the tasks. We have made the code publicly available at \url{this https URL}.
Learning an Urban Air Mobility Encounter Model from Expert Preferences

Airspace models have played an important role in the development and evaluation of aircraft collision avoidance systems for both manned and unmanned aircraft. As Urban Air Mobility (UAM) systems are being developed, we need new encounter models that are representative of their operational environment. Developing such models is challenging due to the lack of data on UAM behavior in the airspace. While previous encounter models for other aircraft types rely on large datasets to produce realistic trajectories, this paper presents an approach to encounter modeling that instead relies on expert knowledge. In particular, recent advances in preference-based learning are extended to tune an encounter model from expert preferences. The model takes the form of a stochastic policy for a Markov decision process (MDP) in which the reward function is learned from pairwise queries of a domain expert. We evaluate the performance of two querying methods that seek to maximize the information obtained from each query. Ultimately, we demonstrate a method for generating realistic encounter trajectories with only a few minutes of an expert's time.
Singularities and Catastrophes in Economics: Historical Perspectives and Future Directions

Economic theory is a mathematically rich field in which there are opportunities for the formal analysis of singularities and catastrophes. This article looks at the historical context of singularities through the work of two eminent Frenchmen around the late 1960s and 1970s. Rene Thom (1923-2002) was an acclaimed mathematician having received the Fields Medal in 1958, whereas Gerard Debreu (1921-2004) would receive the Nobel Prize in economics in 1983. Both were highly influential within their fields and given the fundamental nature of their work, the potential for cross-fertilisation would seem to be quite promising. This was not to be the case: Debreu knew of Thom's work and cited it in the analysis of his own work, but despite this and other applied mathematicians taking catastrophe theory to economics, the theory never achieved a lasting following and relatively few results were published. This article reviews Debreu's analysis of the so called ${\it regular}$ and ${\it crtitical}$ economies in order to draw some insights into the economic perspective of singularities before moving to how singularities arise naturally in the Nash equilibria of game theory. Finally a modern treatment of stochastic game theory is covered through recent work on the quantal response equilibrium. In this view the Nash equilibrium is to the quantal response equilibrium what deterministic catastrophe theory is to stochastic catastrophe theory, with some caveats regarding when this analogy breaks down discussed at the end.
From small markets to big markets

We study the most famous example of a large financial market: the Arbitrage Pricing Model, where investors can trade in a one-period setting with countably many assets admitting a factor structure. We consider the problem of maximising expected utility in this setting. Besides establishing the existence of optimizers under weaker assumptions than previous papers, we go on studying the relationship between optimal investments in finite market segments and those in the whole market. We show that certain natural (but nontrivial) continuity rules hold: maximal satisfaction, reservation prices and (convex combinations of) optimizers computed in small markets converge to their respective counterparts in the big market.
Activity2Vec: Learning ADL Embeddings from Sensor Data with a Sequence-to-Sequence Model

Recognizing activities of daily living (ADLs) plays an essential role in analyzing human health and behavior. The widespread availability of sensors implanted in homes, smartphones, and smart watches have engendered collection of big datasets that reflect human behavior. To obtain a machine learning model based on these data,researchers have developed multiple feature extraction methods. In this study, we investigate a method for automatically extracting universal and meaningful features that are applicable across similar time series-based learning tasks such as activity recognition and fall detection. We propose creating a sequence-to-sequence (seq2seq) model to perform this feature learning. Beside avoiding feature engineering, the meaningful features learned by the seq2seq model can also be utilized for semi-supervised learning. We evaluate both of these benefits on datasets collected from wearable and ambient sensors.
Effective Incorporation of Speaker Information in Utterance Encoding in Dialog

In dialog studies, we often encode a dialog using a hierarchical encoder where each utterance is converted into an utterance vector, and then a sequence of utterance vectors is converted into a dialog vector. Since knowing who produced which utterance is essential to understanding a dialog, conventional methods tried integrating speaker labels into utterance vectors. We found the method problematic in some cases where speaker annotations are inconsistent among different dialogs. A relative speaker modeling method is proposed to address the problem. Experimental evaluations on dialog act recognition and response generation show that the proposed method yields superior and more consistent performances.
Estimating tropospheric and stratospheric winds using infrasound from explosions.

The receiver-to-source backazimuth of atmospheric infrasound signals is biased when cross-winds are present along the propagation path. Infrasound from 598 surface explosions from over 30 years in northern Finland is measured with high spatial resolution on an array 178 km almost due North. The array is situated in the classical shadow-zone distance from the explosions. However, strong infrasound is almost always observed, which is most plausibly due to partial reflections from stratospheric altitudes. The most probable propagation paths are subject to both tropospheric and stratospheric cross-winds, and the wave-propagation modelling in this study yields good correspondence between the observed backazimuth deviation and cross-winds from the European Centre for Medium-Range Weather Forecasts Reanalysis (ERA)-Interim reanalysis product. This study demonstrates that atmospheric cross-winds can be estimated directly from infrasound data using propagation time and backazimuth deviation observations. This study finds these cross-wind estimates to be in good agreement with the ERA-Interim reanalysis.
Gotzmann monomials in four variables

It is a widely open problem to determine which monomials in the n-variable polynomial ring K[x_1,...,x_n] over a field K have the Gotzmann property, i.e. induce a Borel-stable Gotzmann monomial ideal. Since 2007, only the case n ≤ 3 was known. Here we solve the problem for the case n = 4. The solution involves a surprisingly intricate characterization.
Towards Probabilistic Generative Models Harnessing Graph Neural Networks for Disease-Gene Prediction

Disease-gene prediction (DGP) refers to the computational challenge of predicting associations between genes and diseases. Effective solutions to the DGP problem have the potential to accelerate the therapeutic development pipeline at early stages via efficient prioritization of candidate genes for various diseases. In this work, we introduce the variational graph auto-encoder (VGAE) as a promising unsupervised approach for learning powerful latent embeddings in disease-gene networks that can be used for the DGP problem, the first approach using a generative model involving graph neural networks (GNNs). In addition to introducing the VGAE as a promising approach to the DGP problem, we further propose an extension (constrained-VGAE or C-VGAE) which adapts the learning algorithm for link prediction between two distinct node types in heterogeneous graphs. We evaluate and demonstrate the effectiveness of the VGAE on general link prediction in a disease-gene association network and the C-VGAE on disease-gene prediction in the same network, using popular random walk driven methods as baselines. While the methodology presented demonstrates potential solely based on utilizing the topology of a disease-gene association network, it can be further enhanced and explored through the integration of additional biological networks such as gene/protein interaction networks and additional biological features pertaining to the diseases and genes represented in the disease-gene association network.
Laplacian-regularized graph bandits: Algorithms and theoretical analysis

We study contextual multi-armed bandit problems in the case of multiple users, where we exploit the structure in the user domain to reduce the cumulative regret. Specifically, we model user relation as a graph, and assume that the parameters (preferences) of users form smooth signals on the graph. This leads to a graph Laplacian-regularized estimator, for which we propose a novel bandit algorithm whose performance depends on a notion of local smoothness on the graph. We provide a closed-form solution to the estimator, enabling a theoretical analysis on the convergence property of the estimator as well as single-user upper confidence bound (UCB) and cumulative regret of the proposed bandit algorithm. Furthermore, we show that the regret scales linearly with the local smoothness measure, which approaches zero for densely connected graph. The single-user UCB also allows us to further propose an extension of the bandit algorithm, whose computational complexity scales linearly with the number of users. We support theoretical claims with empirical evidences, and demonstrate the advantage of the proposed algorithm in comparison with state-of-the-art graph-based bandit algorithms on both synthetic and real-world datasets.
Learning Self-Correctable Policies and Value Functions from Demonstrations with Negative Sampling

Imitation learning, followed by reinforcement learning algorithms, is a promising paradigm to solve complex control tasks sample-efficiently. However, learning from demonstrations often suffers from the covariate shift problem, which results in cascading errors of the learned policy. We introduce a notion of conservatively-extrapolated value functions, which provably lead to policies with self-correction. We design an algorithm Value Iteration with Negative Sampling (VINS) that practically learns such value functions with conservative extrapolation. We show that VINS can correct mistakes of the behavioral cloning policy on simulated robotics benchmark tasks. We also propose the algorithm of using VINS to initialize a reinforcement learning algorithm, which is shown to outperform significantly prior works in sample efficiency.
From Observability to Significance in Distributed Information Systems

To understand and explain process behaviour we need to be able to see it, and decide its significance, i.e. be able to tell a story about its behaviours. This paper describes a few of the modelling challenges that underlie monitoring and observation of processes in IT, by human or by software. The topic of the observability of systems has been elevated recently in connection with computer monitoring and tracing of processes for debugging and forensics. It raises the issue of well-known principles of measurement, in bounded contexts, but these issues have been left implicit in the Computer Science literature. This paper aims to remedy this omission, by laying out a simple promise theoretic model, summarizing a long standing trail of work on the observation of distributed systems, based on elementary distinguishability of observations, and classical causality, with history. Three distinct views of a system are sought, across a number of scales, that described how information is transmitted (and lost) as it moves around the system, aggregated into journals and logs.
Learning Functions over Sets via Permutation Adversarial Networks

In this paper, we consider the problem of learning functions over sets, i.e., functions that are invariant to permutations of input set items. Recent approaches of pooling individual element embeddings can necessitate extremely large embedding sizes for challenging functions. We address this challenge by allowing standard neural networks like LSTMs to succinctly capture the function over the set. However, to ensure invariance with respect to permutations of set elements, we propose a novel architecture called SPAN that simultaneously learns the function as well as adversarial or worst-case permutations for each input set. The learning problem reduces to a min-max optimization problem that is solved via a simple alternating block coordinate descent technique. We conduct extensive experiments on a variety of set-learning tasks and demonstrate that SPAN learns nearly permutation-invariant functions while still ensuring accuracy on test data. On a variety of tasks sampled from the domains of statistics, graph functions and linear algebra, we show that our method can significantly outperform state-of-the-art methods such as DeepSets and Janossy Pooling. Finally, we present a case study of how learning set-functions can help extract powerful features for recommendation systems, and show that such a method can be as much as 2% more accurate than carefully hand-tuned features on a real-world recommendation system.
A Teflon-based system for applying multidirectional voltages to lipid bilayers as a novel platform for membrane proteins

Artificial bilayer lipid membranes (BLMs), along with patch-clamped membranes, are frequently used for functional analyses of membrane proteins. In both methods, the electric properties of membranes are characterized by only one parameter, namely, transmembrane potential. Here the construction of a novel BLM system was reported, in which membrane voltages can be controlled in a lateral direction in addition to conventional transmembrane direction. A microaperture was fabricated in a Teflon film and Ti electrodes were evaporated around the aperture. BLMs were reproducibly formed in the aperture without being affected by the presence of the electrodes. The application of a lateral voltage induced no significant changes in the electric properties of the BLMs, such as baseline current, transmembrane resistance, and transmembrane capacitance. In contrast, lateral voltages clearly affected the activities of biological ion channels, suggesting that the lateral voltage might be a useful parameter for analyzing channel activities. The present Teflon-based system in which multidirectional voltages can be applied to BLMs represent a promising platform for the analysis of underlying functional properties of membrane proteins.