nils-herrmann/clean_scirepeval huggingface dataset:
Automated prototype for asteroids detection

Near Earth Asteroids (NEAs) are discovered daily, mainly by few major surveys, nevertheless many of them remain unobserved for years, even decades. Even so, there is room for new discoveries, including those submitted by smaller projects and amateur astronomers. Besides the well-known surveys that have their own automated system of asteroid detection, there are only a few software solutions designed to help amateurs and mini-surveys in NEAs discovery. Some of these obtain their results based on the blink method in which a set of reduced images are shown one after another and the astronomer has to visually detect real moving objects in a series of images. This technique becomes harder with the increase in size of the CCD cameras. Aiming to replace manual detection we propose an automated pipeline prototype for asteroids detection, written in Python under Linux, which calls some 3rd party astrophysics libraries.
Efficient n-to-n Collision Detection for Space Debris using 4D AABB Trees (Extended Report)

Collision detection algorithms are used in aerospace, swarm robotics, automotive, video gaming, dynamics simulation and other domains. As many applications of collision detection run online, timing requirements are imposed on the algorithm runtime: algorithms must, at a minimum, keep up with the passage of time. In practice, this places a limit on the number of objects, n, that can be tracked at the same time. In this paper, we improve the scalability of collision detection, effectively raising the limit n for online object tracking. 
The key to our approach is the use of a four-dimensional axis-aligned bounding box (AABB) tree, which stores each object's three-dimensional occupancy region in space during a one-dimensional interval of time. This improves efficiency by permitting per-object variable times steps. Further, we describe partitioning strategies that can decompose the 4D AABB tree search into several smaller-dimensional problems that can be solved in parallel. We formalize the collision detection problem and prove our algorithm's correctness. We demonstrate the feasibility of online collision detection for an orbital space debris application, using publicly available data on the full catalog of n=16848 objects provided by .
Discretizing Continuous Action Space for On-Policy Optimization

In this work, we show that discretizing action space for continuous control is a simple yet powerful technique for on-policy optimization. The explosion in the number of discrete actions can be efficiently addressed by a policy with factorized distribution across action dimensions. We show that the discrete policy achieves significant performance gains with state-of-the-art on-policy optimization algorithms (PPO, TRPO, ACKTR) especially on high-dimensional tasks with complex dynamics. Additionally, we show that an ordinal parameterization of the discrete distribution can introduce the inductive bias that encodes the natural ordering between discrete actions. This ordinal architecture further significantly improves the performance of PPO/TRPO.
Time-Space Tradeoff in Deep Learning Models for Crop Classification on Satellite Multi-Spectral Image Time Series

In this article, we investigate several structured deep learning models for crop type classification on multi-spectral time series. In particular, our aim is to assess the respective importance of spatial and temporal structures in such data. With this objective, we consider several designs of convolutional, recurrent, and hybrid neural networks, and assess their performance on a large dataset of freely available Sentinel-2 imagery. We find that the best-performing approaches are hybrid configurations for which most of the parameters (up to 90%) are allocated to modeling the temporal structure of the data. Our results thus constitute a set of guidelines for the design of bespoke deep learning models for crop type classification.
Adversarial Examples Are a Natural Consequence of Test Error in Noise

Over the last few years, the phenomenon of adversarial examples --- maliciously constructed inputs that fool trained machine learning models --- has captured the attention of the research community, especially when the adversary is restricted to small modifications of a correctly handled input. Less surprisingly, image classifiers also lack human-level performance on randomly corrupted images, such as images with additive Gaussian noise. In this paper we provide both empirical and theoretical evidence that these are two manifestations of the same underlying phenomenon, establishing close connections between the adversarial robustness and corruption robustness research programs. This suggests that improving adversarial robustness should go hand in hand with improving performance in the presence of more general and realistic image corruptions. Based on our results we recommend that future adversarial defenses consider evaluating the robustness of their methods to distributional shift with benchmarks such as Imagenet-C.
Spectral Multi-scale Community Detection in Temporal Networks with an Application

The analysis of temporal networks has a wide area of applications in a world of technological advances. An important aspect of temporal network analysis is the discovery of community structures. Real data networks are often very large and the communities are observed to have a hierarchical structure referred to as multi-scale communities. Changes in the community structure over time might take place either at one scale or across all scales of the community structure. The multilayer formulation of the modularity maximization (MM) method introduced captures the changing multi-scale community structure of temporal networks. This method introduces a coupling between communities in neighboring time layers by allowing inter-layer connections, while different values of the resolution parameter enable the detection of multi-scale communities. However, the range of this parameter's values must be manually selected. When dealing with real life data, communities at one or more scales can go undiscovered if appropriate parameter ranges are not selected. A novel Temporal Multi-scale Community Detection (TMSCD) method overcomes the obstacles mentioned above. This is achieved by using the spectral properties of the temporal network represented as a multilayer network. In this framework we select automatically the range of relevant scales within which multi-scale community partitions are sought.
Comprehensive evaluation of deep learning architectures for prediction of DNA/RNA sequence binding specificities

Deep learning architectures have recently demonstrated their power in predicting DNA- and RNA-binding specificity. Existing methods fall into three classes: Some are based on convolutional neural networks (CNNs), others use recurrent neural networks (RNNs) and others rely on hybrid architectures combining CNNs and RNNs. However, based on existing studies the relative merit of the various architectures remains unclear.  In this study we present a systematic exploration of deep learning architectures for predicting DNA- and RNA-binding specificity. For this purpose, we present deepRAM, an end-to-end deep learning tool that provides an implementation of a wide selection of architectures; its fully automatic model selection procedure allows us to perform a fair and unbiased comparison of deep learning architectures. We find that deeper more complex architectures provide a clear advantage with sufficient training data, and that hybrid CNN/RNN architectures outperform other methods in terms of accuracy. Our work provides guidelines that can assist the practitioner in choosing an appropriate network architecture, and provides insight on the difference between the models learned by convolutional and recurrent networks. In particular, we find that although recurrent networks improve model accuracy, this comes at the expense of a loss in the interpretability of the features learned by the model. Availability and implementation The source code for deepRAM is available at https://github.com/MedChaabane/deepRAM. Supplementary information Supplementary data are available at Bioinformatics online.
Investigating Limit Order Book Characteristics for Short Term Price Prediction: a Machine Learning Approach

With the proliferation of algorithmic high-frequency trading in financial markets, the Limit Order Book has generated increased research interest. Research is still at an early stage and there is much we do not understand about the dynamics of Limit Order Books. In this paper, we employ a machine learning approach to investigate Limit Order Book features and their potential to predict short term price movements. This is an initial broad-based investigation that results in some novel observations about LOB dynamics and identifies several promising directions for further research. Furthermore, we obtain prediction results that are significantly superior to a baseline predictor.
Abstract I/O Specification

We recently proposed an approach for the specification and modular formal verification of the interactive (I/O) behavior of programs, based on an embedding of Petri nets into separation logic. While this approach is scalable and modular in terms of the I/O APIs available to a program, enables composing low-level I/O actions into high-level ones, and enables a convenient verification experience, it does not support high-level I/O actions that involve memory manipulation as well as low-level I/O (such as buffered I/O), or that are in fact "virtual I/O" actions that are implemented purely through memory manipulation. Furthermore, it does not allow rewriting an I/O specification into an equivalent one. 
In this paper, we propose a refined approach that does have these properties. The essential insight is to fix the set of places of the Petri net to be the set of separation logic assertions, thus making available the full power of separation logic for abstractly stating an arbitrary operation's specification in Petri net form, for composing operations into an I/O specification, and for equivalence reasoning on I/O specifications. Our refinement resolves the issue of the justification of the choice of Petri nets over other formalisms such as general state transition systems, in that it "refines them away" into the more essential constructs of separating conjunction and abstract nested triples. To enable a convenient treatment of input operations, we propose the use of prophecy variables to eliminate their non-determinism. 
We illustrate the approach through a number of example programs, including one where subroutines specified and verified using I/O specifications run as threads communicating through shared memory. The theory and examples of the paper have been machine-checked using the Iris library for program verification in the Coq proof assistant.
Quantum Brownian oscillator for the stock market

We pursue the quantum-mechanical challenge to the efficient market hypothesis for the stock market by employing the quantum Brownian motion model. We utilize the quantum Caldeira-Leggett master equation as a possible phenomenological model for the stock-market-prices fluctuations while introducing the external harmonic field for the Brownian particle. Two quantum regimes are of particular interest: the exact regime as well as the approximate regime of the pure decoherence ("recoilless") limit of the Caldeira-Leggett equation. By calculating the standard deviation and the kurtosis for the particle's position observable, we can detect deviations of the quantum-mechanical behavior from the classical counterpart, which bases the efficient market hypothesis. By varying the damping factor, temperature as well as the oscillator's frequency, we are able to provide interpretation of different economic scenarios and possible situations that are not normally recognized by the efficient market hypothesis. Hence we recognize the quantum Brownian oscillator as a possibly useful model for the realistic behavior of stock prices.
Latent Normalizing Flows for Discrete Sequences

Normalizing flows are a powerful class of generative models for continuous random variables, showing both strong model flexibility and the potential for non-autoregressive generation. These benefits are also desired when modeling discrete random variables such as text, but directly applying normalizing flows to discrete sequences poses significant additional challenges. We propose a VAE-based generative model which jointly learns a normalizing flow-based distribution in the latent space and a stochastic mapping to an observed discrete space. In this setting, we find that it is crucial for the flow-based distribution to be highly multimodal. To capture this property, we propose several normalizing flow architectures to maximize model flexibility. Experiments consider common discrete sequence tasks of character-level language modeling and polyphonic music generation. Our results indicate that an autoregressive flow-based model can match the performance of a comparable autoregressive baseline, and a non-autoregressive flow-based model can improve generation speed with a penalty to performance.
Stochastic Estimated Risk for Storage Capacity

Managing data storage growth is of crucial importance to businesses. Poor practices can lead to large data and financial losses. Access to storage information along with timely action, or capacity forecasting, are essential to avoid these losses. In addition, ensuring high accuracy of capacity forecast estimates along with ease of interpretability plays an important role for any customer facing tool. In this paper, we introduce Stochastic Estimated Risk (SER), a tool developed at Nutanix that has been in production. SER shifts the focus from forecasting a single estimate for date of attaining full capacity to predicting the risk associated with running out of storage capacity. Using a Brownian motion with drift model, SER estimates the probability that a system will run out of capacity within a specific time frame. Our results showed that a probabilistic approach is more accurate and credible, for systems with non-linear patterns, compared to a regression or ensemble forecasting models.
Possibilistic investment models with background risk

In the study of investment problem, aside from the investment risk the background risk appears. Both the investment risk and the background risk are probabilistically described by random variables. This paper starts from the hypothesis that the two types of risk can be represented both probabilistically (by random variables) and possibilistically (by fuzzy numbers). We will study three models in which the investment risk and the background risk can be: fuzzy numbers, a random variabl-a fuzzy number and a fuzzy number-a random variable. A portfolio problem is formulated for each model and an approximate calculation formula of the optimal solution is proved.
Fair regression for health care spending

The distribution of health care payments to insurance plans has substantial consequences for social policy. Risk adjustment formulas predict spending in health insurance markets in order to provide fair benefits and health care coverage for all enrollees, regardless of their health status. Unfortunately, current risk adjustment formulas are known to underpredict spending for specific groups of enrollees leading to undercompensated payments to health insurers. This incentivizes insurers to design their plans such that individuals in undercompensated groups will be less likely to enroll, impacting access to health care for these groups. To improve risk adjustment formulas for undercompensated groups, we expand on concepts from the statistics, computer science, and health economics literature to develop new fair regression methods for continuous outcomes by building fairness considerations directly into the objective function. We additionally propose a novel measure of fairness while asserting that a suite of metrics is necessary in order to evaluate risk adjustment formulas more fully. Our data application using the IBM MarketScan Research Databases and simulation studies demonstrates that these new fair regression methods may lead to massive improvements in group fairness (eg, 98%) with only small reductions in overall fit (eg, 4%).
A Review on Energy, Environmental, and Sustainability Implications of Connected and Automated Vehicles

Connected and automated vehicles (CAVs) are poised to reshape transportation and mobility by replacing humans as the driver and service provider. While the primary stated motivation for vehicle automation is to improve safety and convenience of road mobility, this transformation also provides a valuable opportunity to improve vehicle energy efficiency and reduce emissions in the transportation sector. Progress in vehicle efficiency and functionality, however, does not necessarily translate to net positive environmental outcomes. Here, we examine the interactions between CAV technology and the environment at four levels of increasing complexity: vehicle, transportation system, urban system, and society. We find that environmental impacts come from CAV-facilitated transformations at all four levels, rather than from CAV technology directly. We anticipate net positive environmental impacts at the vehicle, transportation system, and urban system levels, but expect greater vehicle utilization and shifts in travel patterns at the society level to offset some of these benefits. Focusing on the vehicle-level improvements associated with CAV technology is likely to yield excessively optimistic estimates of environmental benefits. Future research and policy efforts should strive to clarify the extent and possible synergetic effects from a systems level to envisage and address concerns regarding the short- and long-term sustainable adoption of CAV technology.
Trading-Off Accuracy and Energy of Deep Inference on Embedded Systems: A Co-Design Approach

Deep neural networks have seen tremendous success for different modalities of data including images, videos, and speech. This success has led to their deployment in mobile and embedded systems for real-time applications. However, making repeated inferences using deep networks on embedded systems poses significant challenges due to constrained resources (e.g., energy and computing power). To address these challenges, we develop a principled co-design approach. Building on prior work, we develop a formalism referred as coarse-to-fine networks (C2F Nets) that allow us to employ classifiers of varying complexity to make predictions. We propose a principled optimization algorithm to automatically configure C2F Nets for a specified tradeoff between accuracy and energy consumption for inference. The key idea is to select a classifier on-the-fly whose complexity is proportional to the hardness of the input example: simple classifiers for easy inputs and complex classifiers for hard inputs. We perform comprehensive experimental evaluation using four different C2F Net architectures on multiple real-world image classification tasks. Our results show that optimized C2F Net can reduce the energy delay product by 27% to 60% with no loss in accuracy when compared to the baseline solution, where all predictions are made using the most complex classifier in C2F Net.
A Robust Time Series Model with Outliers and Missing Entries

This paper studies the problem of robustly learning the correlation function for a univariate time series with the presence of noise, outliers and missing entries. The outliers or anomalies considered here are sparse and rare events that deviate from normality which is depicted by a correlation function and an uncertainty condition. This general formulation is applied to univariate time series of event counts (or nonnegative time series) where the correlation is a log-linear function with the uncertainty condition following the Poisson distribution. Approximations to the sparsity constraint, such as `r, 0 < r ≤ 1, are used to obtain robustness in the presence of outliers. The `r constraint is also applied to the correlation function to reduce the number of active coefficients. This task also helps bypassing the model selection procedure. Simulated results are presented to validate the model.
Jones Representations of Thompson’s Group F Arising from Temperley–Lieb–Jones Algebras

Following a procedure due to Jones, using suitably normalized elements in a Temperley–Lieb–Jones (planar) algebra, we introduce a 3-parametric family of unitary representations of the Thompson’s group $F$ equipped with canonical (vacuum) vectors and study some of their properties. In particular, we discuss the behavior at infinity of their matrix coefficients, thus showing that these representations do not contain any finite-type component. We then focus on a particular representation known to be quasi-regular and irreducible and show that it is inequivalent to itself once composed with a classical automorphism of $F$. This allows us to distinguish three equivalence classes in our family. Finally, we investigate a family of stabilizer subgroups of $F$ indexed by subfactor Jones indices that are described in terms of the chromatic polynomial. In contrast to the 1st non-trivial index value for which the corresponding subgroup is isomorphic to the Brown–Thompson’s group $F_3$, we show that when the index is large enough, this subgroup is always trivial.
Numerically Recovering the Critical Points of a Deep Linear Autoencoder

Numerically locating the critical points of non-convex surfaces is a long-standing problem central to many fields. Recently, the loss surfaces of deep neural networks have been explored to gain insight into outstanding questions in optimization, generalization, and network architecture design. However, the degree to which recently-proposed methods for numerically recovering critical points actually do so has not been thoroughly evaluated. In this paper, we examine this issue in a case for which the ground truth is known: the deep linear autoencoder. We investigate two sub-problems associated with numerical critical point identification: first, because of large parameter counts, it is infeasible to find all of the critical points for contemporary neural networks, necessitating sampling approaches whose characteristics are poorly understood; second, the numerical tolerance for accurately identifying a critical point is unknown, and conservative tolerances are difficult to satisfy. We first identify connections between recently-proposed methods and well-understood methods in other fields, including chemical physics, economics, and algebraic geometry. We find that several methods work well at recovering certain information about loss surfaces, but fail to take an unbiased sample of critical points. Furthermore, numerical tolerance must be very strict to ensure that numerically-identified critical points have similar properties to true analytical critical points. We also identify a recently-published Newton method for optimization that outperforms previous methods as a critical point-finding algorithm. We expect our results will guide future attempts to numerically study critical points in large nonlinear neural networks.