nils-herrmann/clean_scirepeval huggingface dataset:
Deep learning-based electroencephalography analysis: a systematic review

Electroencephalography (EEG) is a complex signal and can require several years of training, as well as advanced signal processing and feature extraction methodologies to be correctly interpreted. Recently, deep learning (DL) has shown great promise in helping make sense of EEG signals due to its capacity to learn good feature representations from raw data. Whether DL truly presents advantages as compared to more traditional EEG processing approaches, however, remains an open question.  In this work, we review 154 papers that apply DL to EEG, published between January 2010 and July 2018, and spanning different application domains such as epilepsy, sleep, brain–computer interfacing, and cognitive and affective monitoring. We extract trends and highlight interesting approaches from this large body of literature in order to inform future research and formulate recommendations.  Major databases spanning the fields of science and engineering were queried to identify relevant studies published in scientific journals, conferences, and electronic preprint repositories. Various data items were extracted for each study pertaining to (1) the data, (2) the preprocessing methodology, (3) the DL design choices, (4) the results, and (5) the reproducibility of the experiments. These items were then analyzed one by one to uncover trends.  Our analysis reveals that the amount of EEG data used across studies varies from less than ten minutes to thousands of hours, while the number of samples seen during training by a network varies from a few dozens to several millions, depending on how epochs are extracted. Interestingly, we saw that more than half the studies used publicly available data and that there has also been a clear shift from intra-subject to inter-subject approaches over the last few years. About of the studies used convolutional neural networks (CNNs), while used recurrent neural networks (RNNs), most often with a total of 3–10 layers. Moreover, almost one-half of the studies trained their models on raw or preprocessed EEG time series. Finally, the median gain in accuracy of DL approaches over traditional baselines was across all relevant studies. More importantly, however, we noticed studies often suffer from poor reproducibility: a majority of papers would be hard or impossible to reproduce given the unavailability of their data and code.  To help the community progress and share work more effectively, we provide a list of recommendations for future studies and emphasize the need for more reproducible research. We also make our summary table of DL and EEG papers available and invite authors of published work to contribute to it directly. A planned follow-up to this work will be an online public benchmarking portal listing reproducible results.
Testing emergent gravity on galaxy cluster scales

Verlinde's theory of Emergent Gravity (EG) describes gravity as an emergent phenomenon rather than a fundamental force. Applying this reasoning in de Sitter space leads to gravity behaving differently on galaxy and galaxy cluster scales; this excess gravity might offer an alternative to dark matter. Here we test these ideas using the data from the Coma cluster and from 58 stacked galaxy clusters. The X-ray surface brightness measurements of the clusters at 0.1 < z < 1.2 along with the weak lensing data are used to test the theory. We find that the simultaneous EG fits of the X-ray and weak lensing datasets are significantly worse than those provided by General Relativity (with cold dark matter). For the Coma cluster, the predictions from emergent gravity and general relativity agree in the range of 250 – 700 kpc, while at around 1 Mpc scales, EG total mass predictions are larger by a factor of 2. For the cluster stack the predictions are only in good agreement at around the 1 – 2 Mpc scales, while for r ≳ 10 Mpc EG is in strong tension with the data. According to the Bayesian information criterion analysis, GR is preferred in all tested datasets; however, we also discuss possible modifications of EG that greatly relax the tension with the data.
Multi-Agent Pathfinding (MAPF) with Continuous Time

Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents such that every agent reaches its goal and the agents do not collide. Most prior work on MAPF were on grids, assumed agents' actions have uniform duration, and that time is discretized into timesteps. In this work, we propose a MAPF algorithm that do not assume any of these assumptions, is complete, and provides provably optimal solutions. This algorithm is based on a novel combination of Safe Interval Path Planning (SIPP), a continuous time single agent planning algorithms, and Conflict-Based Search (CBS). We analyze this algorithm, discuss its pros and cons, and evaluate it experimentally on several standard benchmarks.
Fleet Prognosis with Physics-informed Recurrent Neural Networks

Services and warranties of large fleets of engineering assets is a very profitable business. The success of companies in that area is often related to predictive maintenance driven by advanced analytics. Therefore, accurate modeling, as a way to understand how the complex interactions between operating conditions and component capability define useful life, is key for services profitability. Unfortunately, building prognosis models for large fleets is a daunting task as factors such as duty cycle variation, harsh environments, inadequate maintenance, and problems with mass production can lead to large discrepancies between designed and observed useful lives. This paper introduces a novel physics-informed neural network approach to prognosis by extending recurrent neural networks to cumulative damage models. We propose a new recurrent neural network cell designed to merge physics-informed and data-driven layers. With that, engineers and scientists have the chance to use physics-informed layers to model parts that are well understood (e.g., fatigue crack growth) and use data-driven layers to model parts that are poorly characterized (e.g., internal loads). A simple numerical experiment is used to present the main features of the proposed physics-informed recurrent neural network for damage accumulation. The test problem consist of predicting fatigue crack length for a synthetic fleet of airplanes subject to different mission mixes. The model is trained using full observation inputs (far-field loads) and very limited observation of outputs (crack length at inspection for only a portion of the fleet). The results demonstrate that our proposed hybrid physics-informed recurrent neural network is able to accurately model fatigue crack growth even when the observed distribution of crack length does not match with the (unobservable) fleet distribution.
The information-theoretic value of unlabeled data in semi-supervised learning

We quantify the separation between the numbers of labeled examples required to learn in two settings: Settings with and without the knowledge of the distribution of the unlabeled data. More specifically, we prove a separation by $\Theta(\log n)$ multiplicative factor for the class of projections over the Boolean hypercube of dimension $n$. We prove that there is no separation for the class of all functions on domain of any size. 
Learning with the knowledge of the distribution (a.k.a. fixed-distribution learning) can be viewed as an idealized scenario of semi-supervised learning where the number of unlabeled data points is so great that the unlabeled distribution is known exactly. For this reason, we call the separation the value of unlabeled data.
Survey of Bayesian Networks Applications to Intelligent Autonomous Vehicles

This article reviews the applications of Bayesian Networks to Intelligent Autonomous Vehicles (IAV) from the decision making point of view, which represents the final step for fully Autonomous Vehicles (currently under discussion). Until now, when it comes making high level decisions for Autonomous Vehicles (AVs), humans have the last word. Based on the works cited in this article and analysis done here, the modules of a general decision making framework and its variables are inferred. Many efforts have been made in the labs showing Bayesian Networks as a promising computer model for decision making. Further research should go into the direction of testing Bayesian Network models in real situations. In addition to the applications, Bayesian Network fundamentals are introduced as elements to consider when developing IAVs with the potential of making high level judgement calls.
The Rotation-disk Connection in Young Brown Dwarfs: Strong Evidence for Early Rotational Braking

We use Kepler/K2 light curves to measure rotation periods of brown dwarfs and very low mass stars in the Upper Scorpius star-forming region. Our sample comprises a total of 104 periods. Depending on the assumed age of Upper Scorpius, about a third of them are for brown dwarfs. The median period is 1.28 day for the full sample and 0.84 day for the probable brown dwarfs. With this period sample, we find compelling evidence for early rotational braking in brown dwarfs, caused by the interaction between the central object and the disk. The median period for objects with disks is at least 50% longer than for those without. Two brown dwarfs show direct signs of “disk-locking” in their light curves, in the form of dips that recur on a timescale similar to the rotation period. Comparing the period samples for brown dwarfs at different ages, there is a clear need to include rotational braking into period evolution tracks between 1 and 10 Myr. A locked period over several Myr followed by spin-up due to contraction fits the observational data. We conclude that young brown dwarfs are affected by the same rotational regulation as stars, though they start off with significantly faster rotation, presumably set by initial conditions.
Block-Randomized Stochastic Proximal Gradient for Low-Rank Tensor Factorization

This work considers the problem of computing the canonical polyadic decomposition (CPD) of large tensors. Prior works leverage data sparsity to handle this problem, which is not suitable for handling dense tensors that often arise in applications such as medical imaging, computer vision, and remote sensing. Stochastic optimization is known for its low memory cost and per-iteration complexity when handling dense data. However, existing stochastic CPD algorithms are not flexible to incorporate a variety of constraints/regularization terms that are of interest in signal and data analytics. Convergence properties of many such algorithms are also unclear. In this work, we propose a stochastic optimization framework for large-scale CPD with constraints/regularization terms. The framework works under a doubly randomized fashion, and can be regarded as a judicious combination of randomized block coordinate descent (BCD) and stochastic proximal gradient (SPG). The algorithm enjoys lightweight updates and small memory footprint. This framework entails considerable flexibility—many frequently used regularizers and constraints can be readily handled. The approach is supported by convergence analysis. Numerical results on large-scale dense tensors are presented to showcase the effectiveness of the proposed approach.
Response to "Visual Dialogue without Vision or Dialogue" (Massiceti et al., 2018)

In a recent workshop paper, Massiceti et al. presented a baseline model and subsequent critique of Visual Dialog (Das et al., CVPR 2017) that raises what we believe to be unfounded concerns about the dataset and evaluation. This article intends to rebut the critique and clarify potential confusions for practitioners and future participants in the Visual Dialog challenge.
Lagging Inference Networks and Posterior Collapse in Variational Autoencoders

The variational autoencoder (VAE) is a popular combination of deep latent variable model and accompanying variational learning technique. By using a neural inference network to approximate the model's posterior on latent variables, VAEs efficiently parameterize a lower bound on marginal data likelihood that can be optimized directly via gradient methods. In practice, however, VAE training often results in a degenerate local optimum known as "posterior collapse" where the model learns to ignore the latent variable and the approximate posterior mimics the prior. In this paper, we investigate posterior collapse from the perspective of training dynamics. We find that during the initial stages of training the inference network fails to approximate the model's true posterior, which is a moving target. As a result, the model is encouraged to ignore the latent encoding and posterior collapse occurs. Based on this observation, we propose an extremely simple modification to VAE training to reduce inference lag: depending on the model's current mutual information between latent variable and observation, we aggressively optimize the inference network before performing each model update. Despite introducing neither new model components nor significant complexity over basic VAE, our approach is able to avoid the problem of collapse that has plagued a large amount of previous work. Empirically, our approach outperforms strong autoregressive baselines on text and image benchmarks in terms of held-out likelihood, and is competitive with more complex techniques for avoiding collapse while being substantially faster.
Women in Physics: Scissors Effect from the Brazilian Olympiad of Physics to Professional Life

Despite the legislation in force in most countries and the discourse on gender equality, the observed reality, still today, shows a clear picture of inequality and restrictions for women, particularly when the issue is the choice of a career and the subsequent promotions. In many professions, although women represent the majority in the entrance to undergraduate courses, their participation is dramatically reduced as the career progresses to the highest levels. While the participation of men increases, that of women decreases as the academic levels move towards the top ranks. This kind of evolution of two groups in opposed directions is usually referred as the "scissors effect". This effect with respect to sexes also occurs in the area of physics, both in Brazil and in the rest of the world. But at what age does this effect begin? What is its intensity in the different stages of women's lives? In this article we aim to shed some light on these questions by analyzing data of the Brazilian Olympiad of Physics and of fellowships for physicists in Brazil. We observe the systematic occurrence of scissors effect throughout the full studied data, ranging from the first years of participation in the Olympiads (13 years old) to the highest stages of the scientific career.
An analysis of the Geodesic Distance and other comparative metrics for tree-like structures

Graphs are interesting structures: extremely useful to depict real-life problems, extremely easy to understand given a sketch, extremely complicated to represent formally, extremely complicated to compare. Phylogeny is the study of the relations between biological entities. From it, the interest in comparing tree graphs grew more than in other fields of science. Since there is no definitive way to compare them, multiple distances were formalized over the years since the early sixties, when the first effective numerical method to compare dendrograms was described. This work consists of formalizing, completing (with original work) and give a universal notation to analyze and compare the discriminatory power and time complexity of computing the thirteen here formalized metrics. We also present a new way to represent tree graphs, reach deeper in the details of the Geodesic Distance and discuss its worst-case time complexity in a suggested implementation. Our contribution ends up as a clean, valuable resource for anyone looking for an introduction to comparative metrics for tree graphs.
Truly Generalizable Radiograph Segmentation With Conditional Domain Adaptation

Digitization techniques for biomedical images yield disparate visual patterns in radiological exams. These pattern differences, which can be viewed as a domain-shift problem, may hamper the use of data-driven approaches for inference over these images, such as Deep Neural Networks. Another noticeable difficulty in this field is the lack of labeled data, even though in many cases there is an abundance of unlabeled data available. Therefore, an important step in improving the generalization capabilities of these methods and mitigate domain-shift effects is to perform unsupervised or semi-supervised adaptation between different domains of biomedical images. In this work, we propose a novel approach for segmentation of biomedical images based on Generative Adversarial Networks. The proposed method, named Conditional Domain Adaptation Generative Adversarial Network (CoDAGAN), merges unsupervised networks with supervised deep semantic segmentation architectures in order to create a semi-supervised method capable of learning from both unlabeled and labeled data, whenever labeling is available. We conducted experiments to compare our method with traditional and state-of-the-art baselines by using several domains, datasets, and segmentation tasks. The proposed method yielded consistently better results than the baselines in scarce labeled data scenarios, achieving Jaccard values greater than 0.9 and good segmentation quality in most tasks. Unsupervised Domain Adaptation results were observed to be close to the Fully Supervised Domain Adaptation used in the traditional procedure of fine-tuning pretrained networks.
Primitive-Based 3d Building Modeling, Sensor Simulation, and Estimation

As we begin to consider modeling large, realistic 3D building scenes, it becomes necessary to consider a more compact representation over the polygonal mesh model. Due to the large amounts of annotated training data, which is costly to obtain, we leverage synthetic data to train our system for the satellite image domain. By utilizing the synthetic data, we formulate the building decomposition as an application of instance segmentation and primitive fitting to decompose a building into a set of primitive shapes. Experimental results on WorldView-3 satellite image dataset demonstrate the effectiveness of our 3D building modeling approach.
Set-Codes with Small Intersections and Small Discrepancies

We are concerned with the problem of designing large families of subsets over a common labeled ground set that have small pairwise intersections and the property that the maximum discrepancy of the label values within each of the sets is less than or equal to one. Our results, based on transversal designs, factorizations of packings and Latin rectangles, show that by jointly constructing the sets and labeling scheme, one can achieve optimal family sizes for many parameter choices. Probabilistic arguments akin to those used for pseudorandom generators lead to significantly suboptimal results when compared to the proposed combinatorial methods. The design problem considered is motivated by applications in molecular data storage.
Off-Policy Evaluation of Probabilistic Identity Data in Lookalike Modeling

We evaluate the impact of probabilistically-constructed digital identity data collected between Sep. 2017 and Dec. 2017, approximately, in the context of Lookalike-targeted campaigns. The backbone of this study is a large set of probabilistically-constructed "identities", represented as small bags of cookies and mobile ad identifiers with associated metadata, that are likely all owned by the same underlying user. The identity data allows to generate "identity-based", rather than "identifier-based", user models, giving a fuller picture of the interests of the users underlying the identifiers. We employ off-policy evaluation techniques to evaluate the potential of identity-powered lookalike models without incurring the risk of allowing untested models to direct large amounts of ad spend or the large cost of performing A/B tests. We add to historical work on off-policy evaluation by noting a significant type of "finite-sample bias" that occurs for studies combining modestly-sized datasets and evaluation metrics based on ratios involving rare events (e.g., conversions). We illustrate this bias using a simulation study that later informs the handling of inverse propensity weights in our analyses on real data. We demonstrate significant lift in identity-powered lookalikes versus an identity-ignorant baseline: on average ~70% lift in conversion rate, CVR, with a concordant drop in cost-per-acquisition, CPA. This rises to factors of ~(4-32)x for identifiers having little data themselves, but that can be inferred to belong to users with substantial data to aggregate across identifiers. This implies that identity-powered user modeling is especially important in the context of identifiers having very short lifespans (i.e., frequently churned cookies). Our work motivates and informs the use of probabilistically-constructed digital identities in the marketing context. It also deepens the canon of examples in which off-policy learning has been employed to evaluate the complex systems of the internet economy.
Distance-Guided GA-Based Approach to Distributed Data-Intensive Web Service Composition

Distributed computing which uses Web services as fundamental elements, enables high-speed development of software applications through composing many interoperating, distributed, re-usable, and autonomous services. As a fundamental challenge for service developers, service composition must fulfil functional requirements and optimise Quality of Service (QoS) attributes, simultaneously. On the other hand, huge amounts of data have been created by advances in technologies, which may be exchanged between services. Data-intensive Web services are of great interest to implement data-intensive processes. However, current approaches to Web service composition have omitted either the effect of data, or the distribution of services. Evolutionary Computing (EC) techniques allow for the creation of compositions that meet all the above factors. In this paper, we will develop Genetic Algorithm (GA)-based approach for solving the problem of distributed data-intensive Web service composition (DWSC). In particular, we will introduce two new heuristics, i.e. Longest Common Subsequence(LCS) distance of services, in designing crossover operators. Additionally, a new local search technique incorporating distance of services will be proposed.
Application of Stochastic and Deterministic Techniques for Uncertainty Quantification and Sensitivity Analysis of Energy Systems

Sensitivity analysis (SA) and uncertainty quantification (UQ) are used to assess and improve engineering models. In this study, various methods of SA and UQ are described and applied in theoretical and practical examples for use in energy system analysis. This paper includes local SA (one-at-a-time linear perturbation), global SA (Morris screening), variance decomposition (Sobol indices), and regression-based SA. For UQ, stochastic methods (Monte Carlo sampling) and deterministic methods (using SA profiles) are used. Simple test problems are included to demonstrate the described methods where input parameter interactions, linear correlation, model nonlinearity, local sensitivity, output uncertainty, and variance contribution are explored. Practical applications of analyzing the efficiency and power output uncertainty of a molten carbonate fuel cell (MCFC) are conducted. Using different methods, the uncertainty in the MCFC responses is about 10%. Both SA and UQ methods agree on the importance ranking of the fuel cell operating temperature and cathode activation energy as the most influential parameters. Both parameters contribute to more than 90% of the maximum power and efficiency variance. The methods applied in this paper can be used to achieve a comprehensive mathematical understanding of a particular energy model, which can lead to better performance.