nils-herrmann/clean_scirepeval huggingface dataset:
MRCNet: Crowd Counting and Density Map Estimation in Aerial and Ground Imagery

In spite of the many advantages of aerial imagery for crowd monitoring and management at mass events, datasets of aerial images of crowds are still lacking in the field. As a remedy, in this work we introduce a novel crowd dataset, the DLR Aerial Crowd Dataset (DLR-ACD), which is composed of 33 large aerial images acquired from 16 flight campaigns over mass events with 226,291 persons annotated. To the best of our knowledge, DLR-ACD is the first aerial crowd dataset and will be released publicly. To tackle the problem of accurate crowd counting and density map estimation in aerial images of crowds, this work also proposes a new encoder-decoder convolutional neural network, the so-called Multi-Resolution Crowd Network (MRCNet). The encoder is based on the VGG-16 network and the decoder is composed of a set of bilinear upsampling and convolutional layers. Using two losses, one at an earlier level and another at the last level of the decoder, MRCNet estimates crowd counts and high-resolution crowd density maps as two different but interrelated tasks. In addition, MRCNet utilizes contextual and detailed local information by combining high- and low-level features through a number of lateral connections inspired by the Feature Pyramid Network (FPN) technique. We evaluated MRCNet on the proposed DLR-ACD dataset as well as on the ShanghaiTech dataset, a CCTV-based crowd counting benchmark. The results demonstrate that MRCNet outperforms the state-of-the-art crowd counting methods in estimating the crowd counts and density maps for both aerial and CCTV-based Images.
On the use of BERT for Neural Machine Translation

Exploiting large pretrained models for various NMT tasks have gained a lot of visibility recently. In this work we study how BERT pretrained models could be exploited for supervised Neural Machine Translation. We compare various ways to integrate pretrained BERT model with NMT model and study the impact of the monolingual data used for BERT training on the final translation quality. We use WMT-14 English-German, IWSLT15 English-German and IWSLT14 English-Russian datasets for these experiments. In addition to standard task test set evaluation, we perform evaluation on out-of-domain test sets and noise injected test sets, in order to assess how BERT pretrained representations affect model robustness.
On-Device User Intent Prediction for Context and Sequence Aware Recommendation

The pursuit of improved accuracy in recommender systems has led to the incorporation of user context. Context-aware recommender systems typically handle large amounts of data which must be uploaded and stored on the cloud, putting the user's personal information at risk. While there have been previous studies on privacy-sensitive and context-aware recommender systems, there has not been a full-fledged system deployed in an isolated mobile environment. We propose a secure and efficient on-device mechanism to predict a user's next intention. The knowledge of the user's real-time intention can help recommender systems to provide more relevant recommendations at the right moment. Our proposed algorithm is both context and sequence aware. We embed user intentions as weighted nodes in an n-dimensional vector space where each dimension represents a specific user context factor. Through a neighborhood searching method followed by a sequence matching algorithm, we search for the most relevant node to make the prediction. An evaluation of our methodology was done on a diverse real-world dataset where it was able to address practical scenarios like behavior drifts and sequential patterns efficiently and robustly. Our system also outperformed most of the state-of-the-art methods when evaluated for a similar problem domain on standard datasets.
Improving Semantic Parsing with Neural Generator-Reranker Architecture

Semantic parsing is the problem of deriving machine interpretable meaning representations from natural language utterances. Neural models with encoder-decoder architectures have recently achieved substantial improvements over traditional methods. Although neural semantic parsers appear to have relatively high recall using large beam sizes, there is room for improvement with respect to one-best precision. In this work, we propose a generator-reranker architecture for semantic parsing. The generator produces a list of potential candidates and the reranker, which consists of a pre-processing step for the candidates followed by a novel critic network, reranks these candidates based on the similarity between each candidate and the input sentence. We show the advantages of this approach along with how it improves the parsing performance through extensive analysis. We experiment our model on three semantic parsing datasets (GEO, ATIS, and OVERNIGHT). The overall architecture achieves the state-of-the-art results in all three datasets.
Global Sparse Momentum SGD for Pruning Very Deep Neural Networks

Deep Neural Network (DNN) is powerful but computationally expensive and memory intensive, thus impeding its practical usage on resource-constrained front-end devices. DNN pruning is an approach for deep model compression, which aims at eliminating some parameters with tolerable performance degradation. In this paper, we propose a novel momentum-SGD-based optimization method to reduce the network complexity by on-the-fly pruning. Concretely, given a global compression ratio, we categorize all the parameters into two parts at each training iteration which are updated using different rules. In this way, we gradually zero out the redundant parameters, as we update them using only the ordinary weight decay but no gradients derived from the objective function. As a departure from prior methods that require heavy human works to tune the layer-wise sparsity ratios, prune by solving complicated non-differentiable problems or finetune the model after pruning, our method is characterized by 1) global compression that automatically finds the appropriate per-layer sparsity ratios; 2) end-to-end training; 3) no need for a time-consuming re-training process after pruning; and 4) superior capability to find better winning tickets which have won the initialization lottery.
Hamiltonian Graph Networks with ODE Integrators

We introduce an approach for imposing physically informed inductive biases in learned simulation models. We combine graph networks with a differentiable ordinary differential equation integrator as a mechanism for predicting future states, and a Hamiltonian as an internal representation. We find that our approach outperforms baselines without these biases in terms of predictive accuracy, energy accuracy, and zero-shot generalization to time-step sizes and integrator orders not experienced during training. This advances the state-of-the-art of learned simulation, and in principle is applicable beyond physical domains.
How robust is MovieLens? A dataset analysis for recommender systems

Research publication requires public datasets. In recommender systems, some datasets are largely used to compare algorithms against a --supposedly-- common benchmark.  for various reasons, these datasets are heavily preprocessed, making the comparison of results across papers difficult. This paper makes explicit the variety of preprocessing and evaluation protocols to test the robustness of a dataset (or lack of flexibility). While robustness is good to compare results across papers, for flexible datasets we propose a method to select a preprocessing protocol and share results more transparently.
A Generalized Training Approach for Multiagent Learning

This paper investigates a population-based training regime based on game-theoretic principles called Policy-Spaced Response Oracles (PSRO). PSRO is general in the sense that it (1) encompasses well-known algorithms such as fictitious play and double oracle as special cases, and (2) in principle applies to general-sum, many-player games. Despite this, prior studies of PSRO have been focused on two-player zero-sum games, a regime wherein Nash equilibria are tractably computable. In moving from two-player zero-sum games to more general settings, computation of Nash equilibria quickly becomes infeasible. Here, we extend the theoretical underpinnings of PSRO by considering an alternative solution concept, $\alpha$-Rank, which is unique (thus faces no equilibrium selection issues, unlike Nash) and applies readily to general-sum, many-player settings. We establish convergence guarantees in several games classes, and identify links between Nash equilibria and $\alpha$-Rank. We demonstrate the competitive performance of $\alpha$-Rank-based PSRO against an exact Nash solver-based PSRO in 2-player Kuhn and Leduc Poker. We then go beyond the reach of prior PSRO applications by considering 3- to 5-player poker games, yielding instances where $\alpha$-Rank achieves faster convergence than approximate Nash solvers, thus establishing it as a favorable general games solver. We also carry out an initial empirical validation in MuJoCo soccer, illustrating the feasibility of the proposed approach in another complex domain.
Decision Models for Workforce and Technology Planning in Services

Many of today’s service companies operate in a technology-oriented and knowledge-intensive environment while recruiting and training individuals from an increasingly diverse population. One of the resulting challenges for these service companies is ensuring strategic alignment between their two key resources—technology and workforce—through the resource planning and allocation processes. The traditional hierarchical decision approach to resource planning and allocation considers only technology planning as a strategic-level decision, with workforce recruiting and training planning as a subsequent tactical-level decision. However, two other decision approaches—joint and integrated—elevate workforce planning to the same strategic level as technology planning. Thus, we investigate the impact of strategically aligning technology and workforce decisions through the comparison of joint and integrated models to each other and to a baseline hierarchical model in terms of total cost. Numerical experiments are conducted to characterize key features of solutions provided by these approaches under conditions typically found in this type of service company. Our results show that the integrated model has the lowest cost across all conditions. This is because the integrated approach maintains a small but skilled workforce that can operate new and more advanced technology with higher capacity. However, the cost performance of the joint model is very close to the integrated model under a number of conditions and is easier to implement computationally and managerially, making it a good choice in many environments. Managerial insights derived from this study can serve as a valuable guide for choosing the proper decision approach for technology-oriented and knowledge-intensive service companies.
SegMap: Segment-based mapping and localization using data-driven descriptors

Precisely estimating a robot’s pose in a prior, global map is a fundamental capability for mobile robotics, e.g., autonomous driving or exploration in disaster zones. This task, however, remains challenging in unstructured, dynamic environments, where local features are not discriminative enough and global scene descriptors only provide coarse information. We therefore present SegMap: a map representation solution for localization and mapping based on the extraction of segments in 3D point clouds. Working at the level of segments offers increased invariance to view-point and local structural changes, and facilitates real-time processing of large-scale 3D data. SegMap exploits a single compact data-driven descriptor for performing multiple tasks: global localization, 3D dense map reconstruction, and semantic information extraction. The performance of SegMap is evaluated in multiple urban driving and search and rescue experiments. We show that the learned SegMap descriptor has superior segment retrieval capabilities, compared with state-of-the-art handcrafted descriptors. As a consequence, we achieve a higher localization accuracy and a 6% increase in recall over state-of-the-art handcrafted descriptors. These segment-based localizations allow us to reduce the open-loop odometry drift by up to 50%. SegMap is open-source available along with easy to run demonstrations.
Quantifying the Effect of Black Hole Feedback from the Central Galaxy on the Satellite Populations of Groups and Clusters

Supermassive black holes are fundamental ingredients in our theoretical understanding of galaxy formation. They are likely the only sources energetic enough to regulate star formation within massive dark matter halos, but observational evidence of this process remains elusive. The effect of black hole feedback is expected to be a strong function of halo mass, and galaxy groups and clusters are among the most massive structures in the universe. At fixed halo mass, we find an enhanced fraction of quiescent satellite galaxies and a hotter X-ray intragroup and intracluster medium (IGM/ICM) in those groups and clusters hosting more massive black holes in their centers. These results indicate that black hole feedback makes quenching processes more efficient through a cumulative heating of the gaseous IGM and ICM.
Constraining axion inflation with gravitational waves from preheating

We study gravitational wave production from gauge preheating in a variety of inflationary models, detailing its dependence on both the energy scale and the shape of the potential. We show that preheating into Abelian gauge fields generically leads to a large gravitational wave background that contributes significantly to the effective number of relativistic degrees of freedom in the early universe, $N_\mathrm{eff}$. We demonstrate that the efficiency of gravitational wave production is correlated with the tensor-to-scalar ratio, $r$. In particular, we show that efficient gauge preheating in models whose tensor-to-scalar ratio would be detected by next-generation cosmic microwave background experiments ($r \gtrsim 10^{-3}$) will be either detected through its contribution to $N_\mathrm{eff}$ or ruled out. Furthermore, we show that bounds on $N_\mathrm{eff}$ provide the most sensitive probe of the possible axial coupling of the inflaton to gauge fields regardless of the potential.
Transition from inspiral to plunge: A complete near-extremal trajectory and associated waveform

We extend the Ori and Thorne (OT) procedure to compute the transition from an adiabatic inspiral into a geodesic plunge for any spin. Our analysis revisits the validity of the approximations made in OT. In particular, we discuss possible effects coming from eccentricity and non-geodesic past-history of the orbital evolution. We find three different scaling regimes according to whether the mass ratio is much smaller, of the same order or much larger than the near extremal parameter describing how fast the primary black hole rotates. Eccentricity and non-geodesic past-history corrections are always sub-leading, indicating that the quasi-circular approximation applies throughout the transition regime. However, we show that the OT assumption that the energy and angular momentum evolve linearly with proper time must be modified in the near-extremal regime. Using our transition equations, we describe an algorithm to compute the full worldline in proper time for an extreme mass ratio inspiral (EMRI) and the full gravitational waveform in the high spin limit.
A full treatment of peculiar velocities on the reionization light cone

Accurate simulations of the 21-cm signal from the Epoch of Reionization require the generation of maps at specific frequencies given the values of astrophysical and cosmological parameters. The peculiar velocities of the hydrogen atoms producing the 21-cm radiation result in a shift in the observed frequency of the 21-cm radiation and changes the amplitude of the signal itself. This is not an effect we can remove but instead needs to be accurately modelled to ensure we infer the correct physical parameters from an observation. We describe the full calculation of the distortion of the 21-cm signal, and propose a new code that integrates the 21-cm intensity along the line of sight for each individual light cone pixel to fully capture the intensity contributions from multiple redshifts. This algorithm naturally deals with the typical divergences found in standard approaches, allowing for large optical depths and 21-cm absorption events at high redshifts. We find the new method results in up to a 60 per cent decrease in power on the largest scales on the sky, and an increase of over 80 per cent on the smallest scales on the sky. We find that the new implementation of the light cone results in a longer tail of bright temperatures in the brightness temperature distribution, as a result of the successful circumventing of a previous cap that had to be implemented to avoid a divergence in the brightness temperature. We conclude that this full treatment of the evolution of the light cone pixel can be an important effect.
Measurement of the cosmic ray proton spectrum from 40 GeV to 100 TeV with the DAMPE satellite

DAMPE satellite has directly measured the cosmic ray proton spectrum from 40 GeV to 100 TeV and revealed a new feature at about 13.6 TeV. The precise measurement of the spectrum of protons, the most abundant component of the cosmic radiation, is necessary to understand the source and acceleration of cosmic rays in the Milky Way. This work reports the measurement of the cosmic ray proton fluxes with kinetic energies from 40 GeV to 100 TeV, with 2 1/2 years of data recorded by the DArk Matter Particle Explorer (DAMPE). This is the first time that an experiment directly measures the cosmic ray protons up to ~100 TeV with high statistics. The measured spectrum confirms the spectral hardening at ~300 GeV found by previous experiments and reveals a softening at ~13.6 TeV, with the spectral index changing from ~2.60 to ~2.85. Our result suggests the existence of a new spectral feature of cosmic rays at energies lower than the so-called knee and sheds new light on the origin of Galactic cosmic rays.
Demand, Supply, and Performance of Street-Hail Taxi

Travel decisions are fundamental to understanding human mobility, urban economy, and sustainability, but measuring it is challenging and controversial. Previous studies of taxis are limited to taxi stands or hail markets at aggregate spatial units. Here we estimate the dynamic demand and supply of taxis in New York City (NYC) at street segment level, using in-vehicle Global Positioning System (GPS) data which preserve individual privacy. To this end, we model taxi demand and supply as non-stationary Poisson random fields on the road network, and pickups result from income-maximizing drivers searching for impatient passengers. With 868 million trip records of all 13,237 licensed taxis in NYC in 2009 – 2013, we show that while taxi demand are almost the same in 2011 and 2012, it declined about 2% in spring 2013, possibly caused by transportation network companies (TNCs) and fare raise. Contrary to common impression, street-hail taxis out-perform TNCs such as Uber in high-demand locations, suggesting a taxi/TNC regulation change to reduce congestion and pollution. We show that our demand estimates are stable at different supply levels and across years, a property not observed in existing matching functions. We also validate that taxi pickups can be modeled as Poisson processes. Our method is thus simple, feasible, and reliable in estimating street-hail taxi activities at a high spatial resolution; it helps quantify the ongoing discussion on congestion charges to taxis and TNCs.
Automatically Learning Data Augmentation Policies for Dialogue Tasks

Automatic data augmentation (AutoAugment) (Cubuk et al., 2019) searches for optimal perturbation policies via a controller trained using performance rewards of a sampled policy on the target task, hence reducing data-level model bias. While being a powerful algorithm, their work has focused on computer vision tasks, where it is comparatively easy to apply imperceptible perturbations without changing an image’s semantic meaning. In our work, we adapt AutoAugment to automatically discover effective perturbation policies for natural language processing (NLP) tasks such as dialogue generation. We start with a pool of atomic operations that apply subtle semantic-preserving perturbations to the source inputs of a dialogue task (e.g., different POS-tag types of stopword dropout, grammatical errors, and paraphrasing). Next, we allow the controller to learn more complex augmentation policies by searching over the space of the various combinations of these atomic operations. Moreover, we also explore conditioning the controller on the source inputs of the target task, since certain strategies may not apply to inputs that do not contain that strategy’s required linguistic features. Empirically, we demonstrate that both our input-agnostic and input-aware controllers discover useful data augmentation policies, and achieve significant improvements over the previous state-of-the-art, including trained on manually-designed policies.
A Topological Nomenclature for 3D Shape Analysis in Connectomics

One of the essential tasks in connectomics is the morphology analysis of neurons and organelles like mitochondria to shed light on their biological properties. However, these biological objects often have tangled parts or complex branching patterns, which make it hard to abstract, categorize, and manipulate their morphology. In this paper, we develop a novel topological nomenclature system to name these objects like the appellation for chemical compounds to promote neuroscience analysis based on their skeletal structures. We first convert the volumetric representation into the topology-preserving reduced graph to untangle the objects. Next, we develop nomenclature rules for pyramidal neurons and mitochondria from the reduced graph and finally learn the feature embedding for shape manipulation. In ablation studies, we quantitatively show that graphs generated by our proposed method align with the perception of experts. On 3D shape retrieval and decomposition tasks, we qualitatively demonstrate that the encoded topological nomenclature features achieve better results than state-of-the-art shape descriptors. To advance neuroscience, we will release a 3D segmentation dataset of mitochondria and pyramidal neurons reconstructed from a 100μm cube electron microscopy volume with their reduced graph and topological nomenclature annotations. Code is publicly available at https://github.com/donglaiw/ibexHelper.