nils-herrmann/clean_scirepeval huggingface dataset:
Fault Diagnosis of Rotary Machines using Deep Convolutional Neural Network with three axis signal input

Recent trends focusing on Industry 4.0 concept and smart manufacturing arise a data-driven fault diagnosis as key topic in condition-based maintenance. Fault diagnosis is considered as an essential task in rotary machinery since possibility of an early detection and diagnosis of the faulty condition can save both time and money. Traditional data-driven techniques of fault diagnosis require signal processing for feature extraction, as they are unable to work with raw signal data, consequently leading to need for expert knowledge and human work. The emergence of deep learning architectures in condition-based maintenance promises to ensure high performance fault diagnosis while lowering necessity for expert knowledge and human work. This paper presents developed technique for deep learning-based data-driven fault diagnosis of rotary machinery. The proposed technique input raw three axis accelerometer signal as high-definition image into deep learning layers which automatically extract signal features, enabling high classification accuracy.
Bridging the Gap between Training and Inference for Neural Machine Translation

Neural Machine Translation (NMT) generates target words sequentially in the way of predicting the next word conditioned on the context words. At training time, it predicts with the ground truth words as context while at inference it has to generate the entire sequence from scratch. This discrepancy of the fed context leads to error accumulation among the way. Furthermore, word-level training requires strict matching between the generated sequence and the ground truth sequence which leads to overcorrection over different but reasonable translations. In this paper, we address these issues by sampling context words not only from the ground truth sequence but also from the predicted sequence by the model during training, where the predicted sequence is selected with a sentence-level optimum. Experiment results on Chinese->English and WMT’14 English->German translation tasks demonstrate that our approach can achieve significant improvements on multiple datasets.
Joint Optimization of Cooperative Communication and Computation in Two-Way Relay MEC Systems

Considering two users exchange computational results through a two-way relay equipped with a mobile-edge computing server, we investigate the joint optimization problem of cooperative communication and computation, whose objective is the total energy consumption minimization subject to the delay constraint. To derive the low-complexity optimal solution, by assuming that the transmit power of the relay is given, we theoretically derive the optimal values of computation task partition factors. Thus, the optimal solution to the total energy consumption minimization problem can be found by one-dimensional search over the transmit power of the relay. Simulation results show that our proposed scheme performs better than that where all computational tasks are allocated to the relay or users.
The emerging sectoral diversity of startup ecosystems

Thanks to the recent availability of comprehensive and detailed online databases of startup companies, it has become possible to more directly investigate startup ecosystems i.e. startup populations in specific regions. In this paper, we analyze the emergence of 20+ such ecosystems in Europe and the USA, with a specific focus on their sectoral diversity. Analyzing the sectoral landscapes of these ecosystems using a new visualization tool indeed highlights marked differences in terms of diversity, which we characterize using metrics derived from ecological sciences. Numerical simulations suggest that the emerging diversity of startup ecosystems can be explained using a simple preferential attachment model based on sectoral funding.
Clustered Reinforcement Learning

Exploration strategy design is one of the challenging problems in reinforcement learning~(RL), especially when the environment contains a large state space or sparse rewards. During exploration, the agent tries to discover novel areas or high reward~(quality) areas. In most existing methods, the novelty and quality in the neighboring area of the current state are not well utilized to guide the exploration of the agent. To tackle this problem, we propose a novel RL framework, called \underline{c}lustered \underline{r}einforcement \underline{l}earning~(CRL), for efficient exploration in RL. CRL adopts clustering to divide the collected states into several clusters, based on which a bonus reward reflecting both novelty and quality in the neighboring area~(cluster) of the current state is given to the agent. Experiments on a continuous control task and several \emph{Atari 2600} games show that CRL can outperform other state-of-the-art methods to achieve the best performance in most cases.
ALICE Highlights

Deconfined strongly interacting QCD matter is produced in the laboratory at the highest energy densities in heavy-ion collisions at the LHC. A selection of recent results from ALICE is presented, spanning observables from the soft sector (bulk particle production and correlations), the hard probes (charmed hadrons and jets) and signatures of possible collective effects in pp and p–Pb collisions with high multiplicity. Finally, the perspectives after the detectors upgrades, taking place in the period 2019–2020, are presented.
StyleNAS: An Empirical Study of Neural Architecture Search to Uncover Surprisingly Fast End-to-End Universal Style Transfer Networks

Neural Architecture Search (NAS) has been widely studied for designing discriminative deep learning models such as image classification, object detection, and semantic segmentation. As a large number of priors have been obtained through the manual design of architectures in the fields, NAS is usually considered as a supplement approach. In this paper, we have significantly expanded the application areas of NAS by performing an empirical study of NAS to search generative models, or specifically, auto-encoder based universal style transfer, which lacks systematic exploration, if any, from the architecture search aspect. In our work, we first designed a search space where common operators for image style transfer such as VGG-based encoders, whitening and coloring transforms (WCT), convolution kernels, instance normalization operators, and skip connections were searched in a combinatorial approach. With a simple yet effective parallel evolutionary NAS algorithm with multiple objectives, we derived the first group of end-to-end deep networks for universal photorealistic style transfer. Comparing to random search, a NAS method that is gaining popularity recently, we demonstrated that carefully designed search strategy leads to much better architecture design. Finally compared to existing universal style transfer networks for photorealistic rendering such as PhotoWCT that stacks multiple well-trained auto-encoders and WCT transforms in a non-end-to-end manner, the architectures designed by StyleNAS produce better style-transferred images with details preserving, using a tiny number of operators/parameters, and enjoying around 500x inference time speed-up.
Bi-Lipschitz embeddings of $SRA$-free spaces into Euclidean spaces

$SRA$-free spaces is a wide class of metric spaces including finite dimensional Alexandrov spaces of non-negative curvature, complete Berwald spaces of nonnegative flag curvature, Cayley Graphs of virtually abelian groups and doubling metric spaces of non-positive Busemann curvature with extendable geodesics. This class also includes arbitrary big balls in complete, locally compact $CAT(k)$-spaces $(k \in \mathbb R)$ with locally extendable geodesics, finite-dimensional Alexandrov spaces of curvature $\ge k$ with $k \in R$ and complete Finsler manifolds satisfying the doubling condition. 
We show that $SRA$-free spaces allow bi-Lipschitz embeddings in Euclidean spaces. As a corollary we obtain a quantitative bi-Lipschitz embedding theorem for balls in finite dimensional Alexandrov spaces of curvature bounded from below conjectured by S. Eriksson-Bique. 
The main tool of the proof is an extension theorem for bi-Lipschitz maps into Euclidean spaces. This extension theorem is close in nature with the embedding theorem of J. Seo and may be of independent interest.
Production of 
Pc
 states from 
Λb
 decay

In the present work, we investigate Pc(4312), Pc(4440), and Pc(4457) production from Λb decay in a molecular scenario by using an effective Lagrangian approach. We predict the ratio of the branching fraction of Λb→PcK, which is weakly dependent on our model parameter. We also find the ratios of the productions of the branching fractions of Λb→PcK and Pc→J/ψp can be well interpreted in the molecular scenario. Moreover, the estimated branching fractions of Λb→PcK are of order 10-6, which could be tested by further measurements by the LHCb Collaboration.
The Open Vault Challenge - Learning how to build calibration-free interactive systems by cracking the code of a vault

This demo takes the form of a challenge to the IJCAI community. A physical vault, secured by a 4-digit code, will be placed in the demo area. The author will publicly open the vault by entering the code on a touch-based interface, and as many times as requested. The challenge to the IJCAI participants will be to crack the code, open the vault, and collect its content. The interface is based on previous work on calibration-free interactive systems that enables a user to start instructing a machine without the machine knowing how to interpret the user’s actions beforehand. The intent and the behavior of the human are simultaneously learned by the machine. An online demo and videos are available for readers to participate in the challenge. An additional interface using vocal commands will be revealed on the demo day, demonstrating the scalability of our approach to continuous input signals.
The route to chaos in routing games: When is price of anarchy too optimistic?

Routing games are amongst the most studied classes of games. Their two most well-known properties are that learning dynamics converge to equilibria and that all equilibria are approximately optimal. In this work, we perform a stress test for these classic results by studying the ubiquitous dynamics, Multiplicative Weights Update, in different classes of congestion games, uncovering intricate non-equilibrium phenomena. As the system demand increases, the learning dynamics go through period-doubling bifurcations, leading to instabilities, chaos and large inefficiencies even in the simplest case of non-atomic routing games with two paths of linear cost where the Price of Anarchy is equal to one. 
Starting with this simple class, we show that every system has a carrying capacity, above which it becomes unstable. If the equilibrium flow is a symmetric $50-50\%$ split, the system exhibits one period-doubling bifurcation. A single periodic attractor of period two replaces the attracting fixed point. Although the Price of Anarchy is equal to one, in the large population limit the time-average social cost for all but a zero measure set of initial conditions converges to its worst possible value. For asymmetric equilibrium flows, increasing the demand eventually forces the system into Li-Yorke chaos with positive topological entropy and periodic orbits of all possible periods. Remarkably, in all non-equilibrating regimes, the time-average flows on the paths converge exactly to the equilibrium flows, a property akin to no-regret learning in zero-sum games. These results are robust. We extend them to routing games with arbitrarily many strategies, polynomial cost functions, non-atomic as well as atomic routing games and heteregenous users. Our results are also applicable to any sequence of shrinking learning rates, e.g., $1/\sqrt{T}$, by allowing for a dynamically increasing population size.
Non-uniqueness Phenomenon of Object Representation in Modeling IT Cortex by Deep Convolutional Neural Network (DCNN)

Recently DCNN (Deep Convolutional Neural Network) has been advocated as a general and promising modeling approach for neural object representation in primate inferotemporal cortex. In this work, we show that some inherent non-uniqueness problem exists in the DCNN-based modeling of image object representations. This non-uniqueness phenomenon reveals to some extent the theoretical limitation of this general modeling approach, and invites due attention to be taken in practice.
Phenomenological studies on the 
Bd,s0→J/ψf0(500)[f0(980)]
 decays

Encouraged by the global agreement between theoretical predictions and experimental measurements for $B \to J/\psi V$ decays, we extend that perturbative QCD formalism to $B_{d,s}^0 \to J/\psi f_0(500) [f_0(980)]$ decays at the presently known next-to-leading order in the quark-antiquark description of $f_0(500)$ and $f_0(980)$. With the angle $\phi_f \approx 25^\circ$ of the $f_0(500)-f_0(980)$ mixing in the quark-flavor basis, we find that the branching ratios of the $B_d^0 \to J/\psi f_0(500) (\to \pi^+ \pi^-)$ and $B_{d,s}^0 \to J/\psi f_0(980) (\to \pi^+ \pi^-)$ modes generally agree with the current data or the upper limits within uncertainties, except for the seemingly challenging $B_s^0 \to J/\psi f_0(500) (\to \pi^+\pi^-)$ one. Then, we further explore the relevant observables of the $B_{d,s}^0 \to J/\psi f_0(500) [f_0(980)]$ decays, which could provide further constraints on the mixing angle $\phi_f$ and/or SU(3) flavor symmetry breaking effects. As a byproduct, we predict ${\rm BR}(B_{d}^0 \to J/\psi f_0(980)(\to K^+ K^-))=5.8^{+3.1}_{-2.9} \times 10^{-7}$ and ${\rm BR}(B_{s}^0 \to J/\psi f_0(980)(\to K^+ K^-)) =4.6^{+2.6}_{-2.3} \times 10^{-5}$. All theoretical predictions await the future examinations with high precision.
Optimized Deployment of Millimeter Wave Networks for In-Venue Regions With Stochastic Users’ Orientation

Millimeter wave (mmW) communication is a promising solution for providing high-capacity wireless network access. However, the benefits of mmW are limited by the fact that the channel between a mmW access point and the user equipment can stochastically change due to severe blockage of mmW links by obstacles such as the human body. Thus, one main challenge of mmW network coverage is to enable directional line-of-sight links between access points and mobile devices. In this paper, a novel framework is proposed for optimizing mmW network coverage within hotspots and in-venue regions, while being cognizant of the body blockage of the network’s users. In the studied model, the locations of potential access points and users are assumed as predefined parameters while the orientation of the users is assumed to be stochastic. Hence, a joint stochastic access point placement and beam steering problem subjected to stochastic users’ body blockage is formulated, under desired network coverage constraints. Then, a greedy algorithm is introduced to find an approximation solution for the joint deployment and assignment problem using a new “size constrained weighted set cover” approach. A closed-form expression for the ratio between the optimal solution and approximate one (resulting from the greedy algorithm) is analytically derived. The proposed algorithm is simulated for three in-venue regions: the meeting room in the Alumni Assembly Hall of Virginia Tech, an airport gate, and one side of a stadium football. The simulation results show that, in order to guarantee network coverage for different in-venue regions, the greedy algorithm uses at most three more access points (APs) compared to the optimal solution. The results also show that, due to the use of the additional APs, the greedy algorithm will yield a network coverage up to 11.7% better than the optimal, AP-minimizing solution.
Anytime Lane-Level Intersection Estimation Based on Trajectories of Other Traffic Participants

Estimating and understanding the current scene is an inevitable capability of automated vehicles. Usually, maps are used as prior for interpreting sensor measurements in order to drive safely and comfortably. Only few approaches take into account that maps might be outdated and lead to wrong assumptions on the environment. This work estimates a lane-level intersection topology without any map prior by observing the trajectories of other traffic participants.We are able to deliver both a coarse lane-level topology as well as the lane course inside and outside of the intersection using Markov chain Monte Carlo sampling. The model is neither limited to a number of lanes or arms nor to the topology of the intersection.We present our results on an evaluation set of 1000 simulated intersections and achieve 99.9% accuracy on the topology estimation that takes only 36ms, when utilizing tracked object detections. The precise lane course on these intersections is estimated with an error of 15cm on average after 140ms. Our approach shows a similar level of precision on 14 real-world intersections with 18cm average deviation on simple intersections and 27cm for more complex scenarios. Here the estimation takes only 113ms in total.
Derivational Morphological Relations in Word Embeddings

Derivation is a type of a word-formation process which creates new words from existing ones by adding, changing or deleting affixes. In this paper, we explore the potential of word embeddings to identify properties of word derivations in the morphologically rich Czech language. We extract derivational relations between pairs of words from DeriNet, a Czech lexical network, which organizes almost one million Czech lemmas into derivational trees. For each such pair, we compute the difference of the embeddings of the two words, and perform unsupervised clustering of the resulting vectors. Our results show that these clusters largely match manually annotated semantic categories of the derivational relations (e.g. the relation ‘bake–baker’ belongs to category ‘actor’, and a correct clustering puts it into the same cluster as ‘govern–governor’).
Removing Rain in Videos: A Large-Scale Database and a Two-Stream ConvLSTM Approach

Rain removal has recently attracted increasing research attention, as it is able to enhance the visibility of rain videos. However, the existing learning based rain removal approaches for videos suffer from insufficient training data, especially when applying deep learning to remove rain. In this paper, we establish a large-scale video database for rain removal (LasVR), which consists of 316 rain videos. Then, we observe from our database that there exist the temporal correlation of clean content and similar patterns of rain across video frames. According to these two observations, we propose a two-stream convolutional long-and short-term memory (ConvLSTM) approach for rain removal in videos. The first stream is composed of the subnet for rain detection, while the second stream is the subnet of rain removal that leverages the features from the rain detection subnet. Finally, the experimental results on both synthetic and real rain videos show the proposed approach performs better than other state-of-the-art approaches.
Can You Trust Your Model's Uncertainty? Evaluating Predictive Uncertainty Under Dataset Shift

Modern machine learning methods including deep learning have achieved great success in predictive accuracy for supervised learning tasks, but may still fall short in giving useful estimates of their predictive {\em uncertainty}. Quantifying uncertainty is especially critical in real-world settings, which often involve input distributions that are shifted from the training distribution due to a variety of factors including sample bias and non-stationarity. In such settings, well calibrated uncertainty estimates convey information about when a model's output should (or should not) be trusted. Many probabilistic deep learning methods, including Bayesian-and non-Bayesian methods, have been proposed in the literature for quantifying predictive uncertainty, but to our knowledge there has not previously been a rigorous large-scale empirical comparison of these methods under dataset shift. We present a large-scale benchmark of existing state-of-the-art methods on classification problems and investigate the effect of dataset shift on accuracy and calibration. We find that traditional post-hoc calibration does indeed fall short, as do several other previous methods. However, some methods that marginalize over models give surprisingly strong results across a broad spectrum of tasks.
Symbol Message Passing Decoding of Nonbinary Low-Density Parity-Check Codes

We present a novel decoding algorithm for q-ary low-density parity- check codes, termed symbol message passing. The proposed algorithm can be seen as a generalization of Gallager B and the binary message passing algorithm by Lechner et al. to q-ary codes. We derive density evolution equations for the q-ary symmetric channel, compute thresholds for a number of regular low-density parity-check code ensembles, and verify those by Monte Carlo simulations of long channel codes. The proposed algorithm shows performance advantages with respect to an algorithm of comparable complexity from the literature.
STN-Homography: estimate homography parameters directly

In this paper, we introduce the STN-Homography model to directly estimate the homography matrix between image pair. Different most CNN-based homography estimation methods which use an alternative 4-point homography parameterization, we use prove that, after coordinate normalization, the variance of elements of coordinate normalized $3\times3$ homography matrix is very small and suitable to be regressed well with CNN. Based on proposed STN-Homography, we use a hierarchical architecture which stacks several STN-Homography models and successively reduce the estimation error. Effectiveness of the proposed method is shown through experiments on MSCOCO dataset, in which it significantly outperforms the state-of-the-art. The average processing time of our hierarchical STN-Homography with 1 stage is only 4.87 ms on the GPU, and the processing time for hierarchical STN-Homography with 3 stages is 17.85 ms. The code will soon be open sourced.
Combining Generative and Discriminative Models for Hybrid Inference

A graphical model is a structured representation of the data generating process. The traditional method to reason over random variables is to perform inference in this graphical model. However, in many cases the generating process is only a poor approximation of the much more complex true data generating process, leading to suboptimal estimation. The subtleties of the generative process are however captured in the data itself and we can `learn to infer', that is, learn a direct mapping from observations to explanatory latent variables. In this work we propose a hybrid model that combines graphical inference with a learned inverse model, which we structure as in a graph neural network, while the iterative algorithm as a whole is formulated as a recurrent neural network. By using cross-validation we can automatically balance the amount of work performed by graphical inference versus learned inference. We apply our ideas to the Kalman filter, a Gaussian hidden Markov model for time sequences, and show, among other things, that our model can estimate the trajectory of a noisy chaotic Lorenz Attractor much more accurately than either the learned or graphical inference run in isolation.
Deep PPDEs for Rough Local Stochastic Volatility

We introduce the notion of rough local stochastic volatility models, extending the classical concept to the case where volatility is driven by some Volterra process. In this setting, we show that the pricing function is the solution to a path-dependent PDE, for which we develop a numerical scheme based on Deep Learning techniques. Numerical simulations suggest that the latter is extremely efficient, and provides a good alternative to classical Monte Carlo simulations.