nils-herrmann/clean_scirepeval huggingface dataset:
Visual analytics for team-based invasion sports with significant events and Markov reward process

In team-based invasion sports such as soccer and basketball, analytics is important for teams to understand their performance and for audiences to understand matches better. The present work focuses on performing visual analytics to evaluate the value of any kind of event occurring in a sports match with a continuous parameter space. Here, the continuous parameter space involves the time, location, score, and other parameters. Because the spatiotemporal data used in such analytics is a low-level representation and has a very large size, however, traditional analytics may need to discretize the continuous parameter space (e.g., subdivide the playing area) or use a local feature to limit the analysis to specific events (e.g., only shots). These approaches make evaluation impossible for any kind of event with a continuous parameter space. To solve this problem, we consider a whole match as a Markov chain of significant events, so that event values can be estimated with a continuous parameter space by solving the Markov chain with a machine learning model. The significant events are first extracted by considering the time-varying distribution of players to represent the whole match. Then, the extracted events are redefined as different states with the continuous parameter space and built as a Markov chain so that a Markov reward process can be applied. Finally, the Markov reward process is solved by a customized fitted-value iteration algorithm so that the event values with the continuous parameter space can be predicted by a regression model. As a result, the event values can be visually inspected over the whole playing field under arbitrary given conditions. Experimental results with real soccer data show the effectiveness of the proposed system.
Size matters for OTC market makers: viscosity approach and dimensionality reduction technique

In most OTC markets, a small number of market makers provide liquidity to clients from the buy side. More precisely, they set prices at which they agree to buy and sell the assets they cover. Market makers face therefore an interesting optimization problem: they need to choose bid and ask prices for making money out of their bid-ask spread while mitigating the risk associated with holding inventory in a volatile market. Many market making models have been proposed in the academic literature, most of them dealing with single-asset market making whereas market makers are usually in charge of a long list of assets. The rare models tackling multi-asset market making suffer however from the curse of dimensionality when it comes to the numerical approximation of the optimal quotes. The goal of this paper is to propose a dimensionality reduction technique to address multi-asset market making with grid methods. Moreover, we generalize existing market making models by the addition of an important feature for OTC markets: the variability of transaction sizes and the possibility for the market maker to answer different prices to requests with different sizes.
Dual Network Architecture for Few-view CT - Trained on ImageNet Data and Transferred for Medical Imaging

X-ray computed tomography (CT) reconstructs cross-sectional images from projection data. However, ionizing X-ray radiation associated with CT scanning might induce cancer and genetic damage. Therefore, the reduction of radiation dose has attracted major attention. Few-view CT image reconstruction is an important topic to reduce the radiation dose. Recently, data-driven algorithms have shown great potential to solve the few-view CT problem. In this paper, we develop a dual network architecture (DNA) for reconstructing images directly from sinograms. In the proposed DNA method, a point-based fully-connected layer learns the backprojection process requesting significantly less memory than the prior arts do. Proposed method uses O(C*N*N_c) parameters where N and N_c denote the dimension of reconstructed images and number of projections respectively. C is an adjustable parameter that can be set as low as 1. Our experimental results demonstrate that DNA produces a competitive performance over the other state-of-the-art methods. Interestingly, natural images can be used to pre-train DNA to avoid overfitting when the amount of real patient images is limited.
Role of dust in the microwave emission of galactic halos

The contribution of the thermal dust component in galactic halo rotation is explored based on the microwave data of Planck satellite. The temperature asymmetry of Doppler nature revealed for several edge-on galaxies at several microwave frequencies is analyzed regarding the contribution of the thermal dust emission. We derive the dust contribution to the galactic halo rotation using the data in three bands, 353GHz, 545GHz and 857GHz for two nearby galaxies M81 and M82. The relevance of the revealed properties on the halo rotation is then discussed in the context of the modified gravity theories proposed to describe the dark matter configurations.
Conditioned-U-Net: Introducing a Control Mechanism in the U-Net for Multiple Source Separations

Data-driven models for audio source separation such as U-Net or Wave-U-Net are usually models dedicated to and specifically trained for a single task, e.g. a particular instrument isolation. Training them for various tasks at once commonly results in worse performances than training them for a single specialized task. In this work, we introduce the Conditioned-U-Net (C-U-Net) which adds a control mechanism to the standard U-Net. The control mechanism allows us to train a unique and generic U-Net to perform the separation of various instruments. The C-U-Net decides the instrument to isolate according to a one-hot-encoding input vector. The input vector is embedded to obtain the parameters that control Feature-wise Linear Modulation (FiLM) layers. FiLM layers modify the U-Net feature maps in order to separate the desired instrument via affine transformations. The C-U-Net performs different instrument separations, all with a single model achieving the same performances as the dedicated ones at a lower cost.
Learning the Arrow of Time

We humans seem to have an innate understanding of the asymmetric progression of time, which we use to efficiently and safely perceive and manipulate our environment. Drawing inspiration from that, we address the problem of learning an arrow of time in a Markov (Decision) Process. We illustrate how a learned arrow of time can capture meaningful information about the environment, which in turn can be used to measure reachability, detect side-effects and to obtain an intrinsic reward signal. We show empirical results on a selection of discrete and continuous environments, and demonstrate for a class of stochastic processes that the learned arrow of time agrees reasonably well with a known notion of an arrow of time given by the celebrated Jordan-Kinderlehrer-Otto result.
Bandit Learning Through Biased Maximum Likelihood Estimation

We propose BMLE, a new family of bandit algorithms, that are formulated in a general way based on the Biased Maximum Likelihood Estimation method originally appearing in the adaptive control literature. We design the cost-bias term to tackle the exploration and exploitation tradeoff for stochastic bandit problems. We provide an explicit closed form expression for the index of an arm for Bernoulli bandits, which is trivial to compute. We also provide a general recipe for extending the BMLE algorithm to other families of reward distributions. We prove that for Bernoulli bandits, the BMLE algorithm achieves a logarithmic finite-time regret bound and hence attains order-optimality. Through extensive simulations, we demonstrate that the proposed algorithms achieve regret performance comparable to the best of several state-of-the-art baseline methods, while having a significant computational advantage in comparison to other best performing methods. The generality of the proposed approach makes it possible to address more complex models, including general adaptive control of Markovian systems.
Neural Network Verification for the Masses (of AI graduates)

Rapid development of AI applications has stimulated demand for, and has given rise to, the rapidly growing number and diversity of AI MSc degrees. AI and Robotics research communities, industries and students are becoming increasingly aware of the problems caused by unsafe or insecure AI applications. Among them, perhaps the most famous example is vulnerability of deep neural networks to ``adversarial attacks''. Owing to wide-spread use of neural networks in all areas of AI, this problem is seen as particularly acute and pervasive. 
Despite of the growing number of research papers about safety and security vulnerabilities of AI applications, there is a noticeable shortage of accessible tools, methods and teaching materials for incorporating verification into AI programs. LAIV -- the Lab for AI and Verification -- is a newly opened research lab at Heriot-Watt university that engages AI and Robotics MSc students in verification projects, as part of their MSc dissertation work. In this paper, we will report on successes and unexpected difficulties LAIV faces, many of which arise from limitations of existing programming languages used for verification. We will discuss future directions for incorporating verification into AI degrees.
Modified Actor-Critics

Robot Learning, from a control point of view, often involves continuous actions. In Reinforcement Learning, such actions are usually handled with actor-critic algorithms. They may build on Conservative Policy Iteration (e.g., Trust Region Policy Optimization, TRPO), on policy gradient (e.g., Reinforce), on entropy regularization (e.g., Soft Actor Critic, SAC), among others (e.g., Proximal Policy Optimization, PPO), but in all cases they can be seen as a form of soft policy iteration: they iterate policy evaluation followed by a soft policy improvement step. As so, they often are naturally on-policy. In this paper, we propose to combine (any kind of) soft greediness with Modified Policy Iteration (MPI). The proposed abstract framework applies repeatedly: (i) a partial policy evaluation step that allows off-policy learning and (ii) any soft greedy step. As a proof of concept, we instantiate this framework with the PPO soft greediness. Comparison to the original PPO shows that our algorithm is much more sample efficient. We also show that it is competitive with the state-of-art off-policy algorithm SAC.
L‐equivalence for degree five elliptic curves, elliptic fibrations and K3 surfaces

We construct non‐trivial L‐equivalence between curves of genus one and degree five, and between elliptic surfaces of multisection index five. These results give the first examples of L‐equivalence for curves (necessarily over non‐algebraically closed fields) and provide a new bit of evidence for the conjectural relationship between L‐equivalence and derived equivalence.
Sequence Labeling Parsing by Learning across Representations

We use parsing as sequence labeling as a common framework to learn across constituency and dependency syntactic abstractions.To do so, we cast the problem as multitask learning (MTL). First, we show that adding a parsing paradigm as an auxiliary loss consistently improves the performance on the other paradigm. Secondly, we explore an MTL sequence labeling model that parses both representations, at almost no cost in terms of performance and speed. The results across the board show that on average MTL models with auxiliary losses for constituency parsing outperform single-task ones by 1.05 F1 points, and for dependency parsing by 0.62 UAS points.
Predicting Retrosynthetic Reaction using Self-Corrected Transformer Neural Networks

Synthesis planning is the process of recursively decomposing target molecules into available precursors. Computer-aided retrosynthesis can potentially assist chemists in designing synthetic routes, but at present it is cumbersome and can't provide results of satisfactory qualities. In this study, we have developed a template-free self-corrected retrosynthesis predictor (SCROP) to predict retrosynthesis by using Transformer neural networks. In the method, the retrosynthesis planning was converted to a machine translation problem from the products to molecular linear notations of reactants. By coupling with a neural network-based syntax corrector, our method achieved an accuracy of 59.0% on a standard benchmark dataset, which outperformed >21% over other deep learning methods and >6% over template-based methods. More importantly, our method was 1.7 times more accurate than other state-of-the-art methods for compounds not appearing in the training set.
A Model of Presidential Debates

Presidential debates are viewed as providing an important public good by revealing information on candidates to voters. We consider an endogenous model of presidential debates in which an incumbent and a challenger (who is privately informed about her own quality) publicly announce whether they are willing to participate in a public debate, taking into account that a voter's choice of candidate depends on her beliefs regarding the candidates' qualities and on the state of nature.It is found that in equilibrium a debate occurs or does not occur independently of the challenger's quality and therefore the candidates' announcements are uninformative. This is because opting-out is perceived to be worse than losing a debate and therefore the challenger never refuses to participate.
Analyzing Verbal and Nonverbal Features for Predicting Group Performance

This work analyzes the efficacy of verbal and nonverbal features of group conversation for the task of automatic prediction of group task performance. We describe a new publicly available survival task dataset that was collected and annotated to facilitate this prediction task. In these experiments, the new dataset is merged with an existing survival task dataset, allowing us to compare feature sets on a much larger amount of data than has been used in recent related work. This work is also distinct from related research on social signal processing (SSP) in that we compare verbal and nonverbal features, whereas SSP is almost exclusively concerned with nonverbal aspects of social interaction. A key finding is that nonverbal features from the speech signal are extremely effective for this task, even on their own. However, the most effective individual features are verbal features, and we highlight the most important ones.
Voting-Based Multi-Agent Reinforcement Learning

The recent success of single-agent reinforcement learning (RL) encourages the exploration of multi-agent reinforcement learning (MARL), which is more challenging due to the interactions among different agents. In this paper, we consider a voting-based MARL problem, in which the agents vote to make group decisions and the goal is to maximize the globally averaged returns. To this end, we formulate the MARL problem based on the linear programming form of the policy optimization problem and propose a distributed primal-dual algorithm to obtain the optimal solution. We also propose a voting mechanism through which the distributed learning achieves the same sub-linear convergence rate as centralized learning. In other words, the distributed decision making does not slow down the global consensus to optimal. We also verify the convergence of our proposed algorithm with numerical simulations and conduct case studies in practical multi-agent systems.
The Grothendieck group of unipotent representations: A new basis

<p>Let <inline-formula content-type="math/mathml">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper G left-parenthesis upper F Subscript q Baseline right-parenthesis">
  <mml:semantics>
    <mml:mrow>
      <mml:mi>G</mml:mi>
      <mml:mo stretchy="false">(</mml:mo>
      <mml:msub>
        <mml:mi>F</mml:mi>
        <mml:mi>q</mml:mi>
      </mml:msub>
      <mml:mo stretchy="false">)</mml:mo>
    </mml:mrow>
    <mml:annotation encoding="application/x-tex">G(F_q)</mml:annotation>
  </mml:semantics>
</mml:math>
</inline-formula> be the group of rational points of a simple algebraic group defined and split over a finite field <inline-formula content-type="math/mathml">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"  F Subscript q">
  <mml:semantics>
    <mml:msub>
      <mml:mi>F</mml:mi>
      <mml:mi>q</mml:mi>
    </mml:msub>
    <mml:annotation encoding="application/x-tex">F_q</mml:annotation>
  </mml:semantics>
</mml:math>
</inline-formula>. In this paper we define a new basis for the Grothendieck group of unipotent representations of <inline-formula content-type="math/mathml">
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper G left-parenthesis upper F Subscript q Baseline right-parenthesis">
  <mml:semantics>
    <mml:mrow>
      <mml:mi>G</mml:mi>
      <mml:mo stretchy="false">(</mml:mo>
      <mml:msub>
        <mml:mi>F</mml:mi>
        <mml:mi>q</mml:mi>
      </mml:msub>
      <mml:mo stretchy="false">)</mml:mo>
    </mml:mrow>
    <mml:annotation encoding="application/x-tex">G(F_q)</mml:annotation>
  </mml:semantics>
</mml:math>
</inline-formula>.</p>
Analysis of the Synergy between Modularity and Autonomy in an Artificial Intelligence Based Fleet Competition

A novel approach is provided for evaluating the benefits and burdens from vehicle modularity in fleets/units through the analysis of a game theoretical model of the competition between autonomous vehicle fleets in an attacker-defender game. We present an approach to obtain the heuristic operational strategies through fitting a decision tree on high-fidelity simulation results of an intelligent agent-based model. A multi-stage game theoretical model is also created for decision making considering military resources and impacts of past decisions. Nash equilibria of the operational strategy are revealed, and their characteristics are explored. The benefits of fleet modularity are also analyzed by comparing the results of the decision making process under diverse operational situations.
Constructing large scale biomedical knowledge bases from scratch with rapid annotation of interpretable patterns

Knowledge base construction is crucial for summarising, understanding and inferring relationships between biomedical entities. However, for many practical applications such as drug discovery, the scarcity of relevant facts (e.g. gene X is therapeutic target for disease Y) severely limits a domain expert’s ability to create a usable knowledge base, either directly or by training a relation extraction model. In this paper, we present a simple and effective method of extracting new facts with a pre-specified binary relationship type from the biomedical literature, without requiring any training data or hand-crafted rules. Our system discovers, ranks and presents the most salient patterns to domain experts in an interpretable form. By marking patterns as compatible with the desired relationship type, experts indirectly batch-annotate candidate pairs whose relationship is expressed with such patterns in the literature. Even with a complete absence of seed data, experts are able to discover thousands of high-quality pairs with the desired relationship within minutes. When a small number of relevant pairs do exist - even when their relationship is more general (e.g. gene X is biologically associated with disease Y) than the relationship of interest - our system leverages them in order to i) learn a better ranking of the patterns to be annotated or ii) generate weakly labelled pairs in a fully automated manner. We evaluate our method both intrinsically and via a downstream knowledge base completion task, and show that it is an effective way of constructing knowledge bases when few or no relevant facts are already available.
Where are the Masks: Instance Segmentation with Image-level Supervision

A major obstacle in instance segmentation is that existing methods often need many per-pixel labels in order to be effective. These labels require large human effort and for certain applications, such labels are not readily available. To address this limitation, we propose a novel framework that can effectively train with image-level labels, which are significantly cheaper to acquire. For instance, one can do an internet search for the term "car" and obtain many images where a car is present with minimal effort. Our framework consists of two stages: (1) train a classifier to generate pseudo masks for the objects of interest; (2) train a fully supervised Mask R-CNN on these pseudo masks. Our two main contribution are proposing a pipeline that is simple to implement and is amenable to different segmentation methods; and achieves new state-of-the-art results for this problem setup. Our results are based on evaluating our method on PASCAL VOC 2012, a standard dataset for weakly supervised methods, where we demonstrate major performance gains compared to existing methods with respect to mean average precision.
An End-to-End Neural Network for Image Cropping by Learning Composition from Aesthetic Photos

As one of the fundamental techniques for image editing, image cropping discards unrelevant contents and remains the pleasing portions of the image to enhance the overall composition and achieve better visual/aesthetic perception. In this paper, we primarily focus on improving the accuracy of automatic image cropping, and on further exploring its potential in public datasets with high efficiency. From this respect, we propose a deep learning based framework to learn the objects composition from photos with high aesthetic qualities, where an anchor region is detected through a convolutional neural network (CNN) with the Gaussian kernel to maintain the interested objects' integrity. This initial detected anchor area is then fed into a light weighted regression network to obtain the final cropping result. Unlike the conventional methods that multiple candidates are proposed and evaluated iteratively, only a single anchor region is produced in our model, which is mapped to the final output directly. Thus, low computational resources are required for the proposed approach. The experimental results on the public datasets show that both cropping accuracy and efficiency achieve the state-ofthe-art performances.
Geometric and obstacle scattering at low energy

We consider scattering theory of the Laplace Beltrami operator on differential forms on a Riemannian manifold that is Euclidean at infinity. The manifold may have several boundary components caused by obstacles at which relative boundary conditions are imposed. Scattering takes place because of the presence of these obstacles and possible non-trivial topology and geometry. Unlike in the case of functions eigenvalues generally exist at the bottom of the continuous spectrum and the corresponding eigenforms represent cohomology classes. We show that these eigenforms appear in the expansion of the resolvent, the scattering matrix, and the spectral measure in terms of the spectral parameter λ near zero, and we determine the first terms in this expansion explicitly. In dimension two an additional cohomology class appears as a resonant state in the presence of an obstacle. In even dimensions the expansion is in terms of λ and log λ. The theory of Hahn holomorphic functions is used to describe these expansions effectively. We also give a Birman-Krein formula in this context. The case of one-forms with relative boundary conditions has direct applications in physics as it describes the scattering of electromagnetic waves.