nils-herrmann/clean_scirepeval huggingface dataset:
Beyond ΛCDM with H i intensity mapping: robustness of cosmological constraints in the presence of astrophysics

Mapping the unresolved intensity of 21-cm emission of neutral hydrogen (HI) is now regarded as one the most promising tools for cosmological investigation in the coming decades. Here, we investigate, for the first time, extensions of the standard cosmological model, such as modified gravity and primordial non-Gaussianity, taking the present constraints on the astrophysics of HI clustering in the treatment of the brightness temperature fluctuations self-consistently into account. To understand the boundaries within which results thus obtained can be considered reliable, we examine the robustness of cosmological parameter estimation performed via studies of 21-cm intensity mapping, against our knowledge of the astrophysical processes leading to HI clustering. Modelling of astrophysical effects affects cosmological observables through the relation linking the overall HI mass in a bound object, to the mass of the underlying dark matter halo that hosts it. We quantify the biases in standard cosmological parameters and those describing modified gravity and primordial non-Gaussianity, that are obtained if one misconceives the slope of the relation between HI mass and halo mass, or the lower virial velocity cut-off for a dark matter halo to be able to host HI. Remarkably, we find that astrophysical uncertainties will not affect searches for primordial non-Gaussianity - one of the strongest science cases for HI intensity mapping - despite the signal being deeply linked to the HI bias.
Neural Canonical Transformation with Symplectic Flows

Canonical transformation plays a fundamental role in simplifying and solving classical Hamiltonian systems. We construct flexible and powerful canonical transformations as generative models using symplectic neural networks. The model transforms physical variables towards a latent representation with an independent harmonic oscillator Hamiltonian. Correspondingly, the phase space density of the physical system flows towards a factorized Gaussian distribution in the latent space. Since the canonical transformation preserves the Hamiltonian evolution, the model captures nonlinear collective modes in the learned latent representation. We present an efficient implementation of symplectic neural coordinate transformations and two ways to train the model. The variational free energy calculation is based on the analytical form of physical Hamiltonian. While the phase space density estimation only requires samples in the coordinate space for separable Hamiltonians. We demonstrate appealing features of neural canonical transformation using toy problems including two-dimensional ring potential and harmonic chain. Finally, we apply the approach to real-world problems such as identifying slow collective modes in alanine dipeptide and conceptual compression of the MNIST dataset.
Graded modal logic and counting bisimulation

This note sketches the extension of the basic characterisation theorems as the bisimulation-invariant fragment of first-order logic to modal logic with graded modalities and matching adaptation of bisimulation. We focus on showing expressive completeness of graded multi-modal logic for those first-order properties of pointed Kripke structures that are preserved under counting bisimulation equivalence among all or among just all finite pointed Kripke structures.
CAPP-8TB: Search for Axion Dark Matter in a Mass Range of 6.62 to 7.04 μeV

The axion is a hypothetical particle proposed to solve the strong $CP$ problem, and also a candidate for dark matter. This non-relativistic particle in the galactic halo can be converted into a photon under a strong magnetic field and detected with a microwave resonant cavity. Relying on this detection method, many experiments have excluded some mass regions with certain sensitivities in terms of axion-photon coupling ($g_{a\gamma\gamma}$) for decades, but no axion dark matter has been discovered to date. CAPP-8TB is an axion haloscope experiment at IBS/CAPP designed to search for the axion in a mass range of 6.62 to 7.04 $\mu$eV. The experiment aims for the most sensitive axion dark matter search in this particular mass range with its first-phase sensitivity reaching the QCD axion band. In this presentation, we discuss the overview of the experiment, and present the first result. We also discuss an upgrade of the experiment to achieve higher sensitivity.
Weakly Supervised Attention Networks for Fine-Grained Opinion Mining and Public Health

In many review classification applications, a fine-grained analysis of the reviews is desirable, because different segments (e.g., sentences) of a review may focus on different aspects of the entity in question. However, training supervised models for segment-level classification requires segment labels, which may be more difficult or expensive to obtain than review labels. In this paper, we employ Multiple Instance Learning (MIL) and use only weak supervision in the form of a single label per review. First, we show that when inappropriate MIL aggregation functions are used, then MIL-based networks are outperformed by simpler baselines. Second, we propose a new aggregation function based on the sigmoid attention mechanism and show that our proposed model outperforms the state-of-the-art models for segment-level sentiment classification (by up to 9.8% in F1). Finally, we highlight the importance of fine-grained predictions in an important public-health application: finding actionable reports of foodborne illness. We show that our model achieves 48.6% higher recall compared to previous models, thus increasing the chance of identifying previously unknown foodborne outbreaks.
POIROT: Aligning Attack Behavior with Kernel Audit Records for Cyber Threat Hunting

Cyber threat intelligence (CTI) is being used to search for indicators of attacks that might have compromised an enterprise network for a long time without being discovered. To have a more effective analysis, CTI open standards have incorporated descriptive relationships showing how the indicators or observables are related to each other. However, these relationships are either completely overlooked in information gathering or not used for threat hunting. In this paper, we propose a system, called POIROT, which uses these correlations to uncover the steps of a successful attack campaign. We use kernel audits as a reliable source that covers all causal relations and information flows among system entities and model threat hunting as an inexact graph pattern matching problem. Our technical approach is based on a novel similarity metric which assesses an alignment between a query graph constructed out of CTI correlations and a provenance graph constructed out of kernel audit log records. We evaluate POIROT on publicly released real-world incident reports as well as reports of an adversarial engagement designed by DARPA, including ten distinct attack campaigns against different OS platforms such as Linux, FreeBSD, and Windows. Our evaluation results show that POIROT is capable of searching inside graphs containing millions of nodes and pinpoint the attacks in a few minutes, and the results serve to illustrate that CTI correlations could be used as robust and reliable artifacts for threat hunting.
Multi-Head Attention with Diversity for Learning Grounded Multilingual Multimodal Representations

With the aim of promoting and understanding the multilingual version of image search, we leverage visual object detection and propose a model with diverse multi-head attention to learn grounded multilingual multimodal representations. Specifically, our model attends to different types of textual semantics in two languages and visual objects for fine-grained alignments between sentences and images. We introduce a new objective function which explicitly encourages attention diversity to learn an improved visual-semantic embedding space. We evaluate our model in the German-Image and English-Image matching tasks on the Multi30K dataset, and in the Semantic Textual Similarity task with the English descriptions of visual content. Results show that our model yields a significant performance gain over other methods in all of the three tasks.
Tutorial on Implied Posterior Probability for SVMs

Implied posterior probability of a given model (say, Support Vector Machines (SVM)) at a point $\bf{x}$ is an estimate of the class posterior probability pertaining to the class of functions of the model applied to a given dataset. It can be regarded as a score (or estimate) for the true posterior probability, which can then be calibrated/mapped onto expected (non-implied by the model) posterior probability implied by the underlying functions, which have generated the data. In this tutorial we discuss how to compute implied posterior probabilities of SVMs for the binary classification case as well as how to calibrate them via a standard method of isotonic regression.
Q-Tree Search: An Information-Theoretic Approach Toward Hierarchical Abstractions for Agents With Computational Limitations

In this article, we develop a framework to obtain graph abstractions for decision-making where the abstractions emerge as a function of the agent's available resources. We discuss the connection of the proposed approach with information-theoretic signal compression and formulate a novel optimization problem to obtain tree-based abstractions that are a function of the agent's computational resources. The structural properties of the new problem are discussed in detail and two algorithmic approaches are proposed. We discuss the quality of, and prove relationships between, the solutions obtained by the two proposed algorithms. The framework is applied to a variety of environments to obtain hierarchical abstractions.
Lexical Features Are More Vulnerable, Syntactic Features Have More Predictive Power

Understanding the vulnerability of linguistic features extracted from noisy text is important for both developing better health text classification models and for interpreting vulnerabilities of natural language models. In this paper, we investigate how generic language characteristics, such as syntax or the lexicon, are impacted by artificial text alterations. The vulnerability of features is analysed from two perspectives: (1) the level of feature value change, and (2) the level of change of feature predictive power as a result of text modifications. We show that lexical features are more sensitive to text modifications than syntactic ones. However, we also demonstrate that these smaller changes of syntactic features have a stronger influence on classification performance downstream, compared to the impact of changes to lexical features. Results are validated across three datasets representing different text-classification tasks, with different levels of lexical and syntactic complexity of both conversational and written language.
Tightening bounds for variational inference by revisiting perturbation theory

Variational inference has become one of the most widely used methods in latent variable modeling. In its basic form, variational inference employs a fully factorized variational distribution and minimizes its Kullback–Leibler divergence to the posterior. As the minimization can only be carried out approximately, this approximation induces a bias. In this paper, we revisit perturbation theory as a powerful way of improving the variational approximation. Perturbation theory relies on a form of Taylor expansion of the log marginal likelihood, vaguely in terms of the log ratio of the true posterior and its variational approximation. While first order terms give the classical variational bound, higher-order terms yield corrections that tighten it. However, traditional perturbation theory does not provide a lower bound, making it inapt for stochastic optimization. In this paper, we derive a similar yet alternative way of deriving corrections to the evidence lower bound that resemble perturbation theory, but that result in a valid bound. We show in experiments on Gaussian processes and variational autoencoders that the new bounds are more mass covering, and that the resulting posterior covariances are closer to the true posterior and lead to higher likelihoods on held-out data.
Calibration of the CMS hadron calorimeters using proton-proton collision data at √s = 13 TeV

: Methods are presented for calibrating the hadron calorimeter system of the CMS detector at the LHC. The hadron calorimeters of the CMS experiment are sampling calorimeters of brass and scintillator, and are in the form of one central detector and two endcaps. These calorimeters cover pseudorapidities | η | < 3 and are positioned inside the solenoidal magnet. An outer calorimeter, outside the magnet coil, covers | η | < 1 . 26, and a steel and quartz-ﬁber Cherenkov forward calorimeter extends the coverage to | η | < 5 . 19. The initial calibration of the calorimeters was based on results from test beams, augmented with the use of radioactive sources and lasers. The calibration was improved substantially using proton-proton collision data collected at √ s = 7, 8, and 13 TeV, as well as cosmic ray muon data collected during the periods when the LHC beams were not present. The present calibration is performed using the 13 TeV data collected during 2016 corresponding to an integrated luminosity of 35.9 fb − 1 . The intercalibration of channels exploits the approximate uniformity of energy collection over the azimuthal angle. The absolute energy scale of the central and endcap calorimeters is set using isolated charged hadrons. The energy scale for the electromagnetic portion of the forward calorimeters is set using Z → ee data. The energy scale of the outer calorimeters has been determined with test beam data and is conﬁrmed through data with high transverse momentum jets. In this paper, we present the details of the calibration methods and accuracy.
Contextual Graph Attention for Answering Logical Queries over Incomplete Knowledge Graphs

Recently, several studies have explored methods for using KG embedding to answer logical queries. These approaches either treat embedding learning and query answering as two separated learning tasks, or fail to deal with the variability of contributions from different query paths. We proposed to leverage a graph attention mechanism to handle the unequal contribution of different query paths. However, commonly used graph attention assumes that the center node embedding is provided, which is unavailable in this task since the center node is to be predicted. To solve this problem we propose a multi-head attention-based end-to-end logical query answering model, called Contextual Graph Attention model (CGA), which uses an initial neighborhood aggregation layer to generate the center embedding, and the whole model is trained jointly on the original KG structure as well as the sampled query-answer pairs. We also introduce two new datasets, DB18 and WikiGeo19, which are rather large in size compared to the existing datasets and contain many more relation types, and use them to evaluate the performance of the proposed model. Our result shows that the proposed CGA with fewer learnable parameters consistently outperforms the baseline models on both datasets as well as Bio dataset.
Respect Your Emotion: Human-Multi-Robot Teaming based on Regret Decision Model

Often, when modeling human decision-making behaviors in the context of human-robot teaming, the emotion aspect of human is ignored. Nevertheless, the influence of emotion, in some cases, is not only undeniable but beneficial. This work studies the human-like characteristics brought by regret emotion in one-human-multirobot teaming for the application of domain search. In such applications, the task management load is outsourced to the robots to reduce the human’s workload, freeing the human to do more important work. The regret decision model is first used by each robot for deciding whether to request human service, then is extended for optimally queuing the requests from multiple robots. For the movement of the robots in the domain search, we designed a path planning algorithm based on dynamic programming for each robot. The simulation shows that the human-like characteristics, namely, risk-seeking and risk-aversion, indeed bring some appealing effects for balancing the workload and performance in the human-multi-robot team.
Mining Uncertain Event Data in Process Mining

Nowadays, more and more process data are automatically recorded by information systems, and made available in the form of event logs. Process mining techniques enable process-centric analysis of data, including automatically discovering process models and checking if event data conform to a certain model. In this paper we analyze the previously unexplored setting of uncertain event logs: logs where quantified uncertainty is recorded together with the corresponding data. We define a taxonomy of uncertain event logs and models, and we examine the challenges that uncertainty poses on process discovery and conformance checking. Finally, we show how upper and lower bounds for conformance can be obtained aligning an uncertain trace onto a regular process model.
Landscape solution to the SUSY flavor and 
CP
 problems

In a fertile patch of the string landscape which includes the Minimal Supersymmetric Standard Model (MSSM) as the low energy effective theory, rather general arguments from Douglas suggest a power-law statistical selection of soft breaking terms (m(soft)^n where n=2n_F+n_D-1 with n_F the number of hidden sector F-SUSY breaking fields and n_D the number of D-term SUSY breaking fields). The statistical draw towards large soft terms must be tempered by requiring an appropriate breakdown of electroweak (EW) symmetry with no contributions to the weak scale larger than a factor 2-5 of its measured value, lest one violates the (anthropic) atomic principle. Such a simple picture of stringy naturalness generates a light Higgs boson with mass m_h~ 125 GeV with sparticles (other than higgsinos) typically beyond LHC reach. Then we expect first and second generation matter scalars to be drawn independently to the tens of TeV regime where the upper cutoff arises from two-loop RGE terms which drive third generation soft masses towards tachyonic values. Since the upper bounds on m_0(1,2) are the same for each generation, and flavor independent, then these will be drawn toward quasi-degenerate values. This mechanism leads to a natural mixed decoupling/quasi-degeneracy solution to the SUSY flavor problem and a decoupling solution to the SUSY CP problem.
Deep Coordination Graphs

This paper introduces the deep coordination graph (DCG) for collaborative multi-agent reinforcement learning. DCG strikes a flexible trade-off between representational capacity and generalization by factorizing the joint value function of all agents according to a coordination graph into payoffs between pairs of agents. The value can be maximized by local message passing along the graph, which allows training of the value function end-to-end with Q-learning. Payoff functions are approximated with deep neural networks and parameter sharing improves generalization over the state-action space. We show that DCG can solve challenging predator-prey tasks that are vulnerable to the relative overgeneralization pathology and in which all other known value factorization approaches fail.
Fitting IVIM with Variable Projection and Simplicial Optimization

Fitting multi-exponential models to Diffusion MRI (dMRI) data has always been challenging due to various underlying complexities. In this work, we introduce a novel and robust fitting framework for the standard two-compartment IVIM microstructural model. This framework provides a significant improvement over the existing methods and helps estimate the associated diffusion and perfusion parameters of IVIM in an automatic manner. As a part of this work we provide capabilities to switch between more advanced global optimization methods such as simplicial homology (SH) and differential evolution (DE). Our experiments show that the results obtained from this simultaneous fitting procedure disentangle the model parameters in a reduced subspace. The proposed framework extends the seminal work originated in the MIX framework, with improved procedures for multi-stage fitting. This framework has been made available as an open-source Python implementation and disseminated to the community through the DIPY project.
CMTS: A Conditional Multiple Trajectory Synthesizer for Generating Safety-Critical Driving Scenarios

Naturalistic driving trajectory generation is crucial for the development of autonomous driving algorithms. However, most of the data is collected in collision-free scenarios leading to the sparsity of the safety-critical cases. When considering safety, testing algorithms in near-miss scenarios that rarely show up in off-the-shelf datasets and are costly to accumulate is a vital part of the evaluation. As a remedy, we propose a safety-critical data synthesizing framework based on variational Bayesian methods and term it as Conditional Multiple Trajectory Synthesizer (CMTS). We extend a generative model to connect safe and collision driving data by representing their distribution in the latent space and use conditional probability to adapt to different maps. Sampling from the mixed distribution enables us to synthesize the safety-critical data not shown in the safe or collision datasets. Experimental results demonstrate that the generated dataset covers many different realistic scenarios, especially the near-misses. We conclude that the use of data generated by CMTS can improve the accuracy of trajectory predictions and autonomous vehicle safety.
Deep Cooking: Predicting Relative Food Ingredient Amounts from Images

In this paper, we study the novel problem of not only predicting ingredients from a food image, but also predicting the relative amounts of the detected ingredients. We propose two prediction-based models using deep learning that output sparse and dense predictions, coupled with important semi-automatic multi-database integrative data pre-processing, to solve the problem. Experiments on a dataset of recipes collected from the Internet show the models generate encouraging experimental results.
Risk-Aware Planning by Confidence Estimation using Deep Learning-Based Perception

This work proposes the use of Bayesian approximations of uncertainty from deep learning in a robot planner, showing that this produces more cautious actions in safety-critical scenarios. The case study investigated is motivated by a setup where an aerial robot acts as a "scout" for a ground robot. This is useful when the below area is unknown or dangerous, with applications in space exploration, military, or search-and-rescue. Images taken from the aerial view are used to provide a less obstructed map to guide the navigation of the robot on the ground. Experiments are conducted using a deep learning semantic image segmentation, followed by a path planner based on the resulting cost map, to provide an empirical analysis of the proposed method. A comparison with similar approaches is presented to portray the usefulness of certain techniques, or variations within a technique, in similar experimental settings. The method is analyzed to assess the impact of variations in the uncertainty extraction, as well as the absence of an uncertainty metric, on the overall system with the use of a defined metric which measures surprise to the planner. The analysis is performed on multiple datasets, showing a similar trend of lower surprise when uncertainty information is incorporated in the planning, given threshold values of the hyperparameters in the uncertainty extraction have been met. We find that taking uncertainty into account leads to paths that could be 18% less risky on an average.