nils-herrmann/clean_scirepeval huggingface dataset:
Zero-shot Text-to-SQL Learning with Auxiliary Task

Recent years have seen great success in the use of neural seq2seq models on the text-to-SQL task. However, little work has paid attention to how these models generalize to realistic unseen data, which naturally raises a question: does this impressive performance signify a perfect generalization model, or are there still some limitations? 
In this paper, we first diagnose the bottleneck of text-to-SQL task by providing a new testbed, in which we observe that existing models present poor generalization ability on rarely-seen data. The above analysis encourages us to design a simple but effective auxiliary task, which serves as a supportive model as well as a regularization term to the generation task to increase the models generalization. Experimentally, We evaluate our models on a large text-to-SQL dataset WikiSQL. Compared to a strong baseline coarse-to-fine model, our models improve over the baseline by more than 3% absolute in accuracy on the whole dataset. More interestingly, on a zero-shot subset test of WikiSQL, our models achieve 5% absolute accuracy gain over the baseline, clearly demonstrating its superior generalizability.
Leveraging Frequent Query Substructures to Generate Formal Queries for Complex Question Answering

Formal query generation aims to generate correct executable queries for question answering over knowledge bases (KBs), given entity and relation linking results. Current approaches build universal paraphrasing or ranking models for the whole questions, which are likely to fail in generating queries for complex, long-tail questions. In this paper, we propose SubQG, a new query generation approach based on frequent query substructures, which helps rank the existing (but nonsignificant) query structures or build new query structures. Our experiments on two benchmark datasets show that our approach significantly outperforms the existing ones, especially for complex questions. Also, it achieves promising performance with limited training data and noisy entity/relation linking results.
Targeted Source Detection for Environmental Data

In the face of growing needs for water and energy, a fundamental understanding of the environmental impacts of human activities becomes critical for managing water and energy resources, remedying water pollution, and making regulatory policy wisely. Among activities that impact the environment, oil and gas production, wastewater transport, and urbanization are included. In addition to the occurrence of anthropogenic contamination, the presence of some contaminants (e.g., methane, salt, and sulfate) of natural origin is not uncommon. Therefore, scientists sometimes find it difficult to identify the sources of contaminants in the coupled natural and human systems. In this paper, we propose a technique to simultaneously conduct source detection and prediction, which outperforms other approaches in the interdisciplinary case study of the identification of potential groundwater contamination within a region of high-density shale gas development.
A Deep Neural Information Fusion Architecture for Textual Network Embeddings

Textual network embeddings aim to learn a low-dimensional representation for every node in the network so that both the structural and textual information from the networks can be well preserved in the representations. Traditionally, the structural and textual embeddings were learned by models that rarely take the mutual influences between them into account. In this paper, a deep neural architecture is proposed to effectively fuse the two kinds of informations into one representation. The novelties of the proposed architecture are manifested in the aspects of a newly defined objective function, the complementary information fusion method for structural and textual features, and the mutual gate mechanism for textual feature extraction. Experimental results show that the proposed model outperforms the comparing methods on all three datasets.
StarNet: Targeted Computation for Object Detection in Point Clouds

Detecting objects from LiDAR point clouds is an important component of self-driving car technology as LiDAR provides high resolution spatial information. Previous work on point-cloud 3D object detection has re-purposed convolutional approaches from traditional camera imagery. In this work, we present an object detection system called StarNet designed specifically to take advantage of the sparse and 3D nature of point cloud data. StarNet is entirely point-based, uses no global information, has data dependent anchors, and uses sampling instead of learned region proposals. We demonstrate how this design leads to competitive or superior performance on the large Waymo Open Dataset and the KITTI detection dataset, as compared to convolutional baselines. In particular, we show how our detector can outperform a competitive baseline on Pedestrian detection on the Waymo Open Dataset by more than 7 absolute mAP while being more computationally efficient. We show how our redesign---namely using only local information and using sampling instead of learned proposals---leads to a significantly more flexible and adaptable system: we demonstrate how we can vary the computational cost of a single trained StarNet without retraining, and how we can target proposals towards areas of interest with priors and heuristics. Finally, we show how our design allows for incorporating temporal context by using detections from previous frames to target computation of the detector, which leads to further improvements in performance without additional computational cost.
Solving Discounted Stochastic Two-Player Games with Near-Optimal Time and Sample Complexity

In this paper, we settle the sampling complexity of solving discounted two-player turn-based zero-sum stochastic games up to polylogarithmic factors. Given a stochastic game with discount factor $\gamma\in(0,1)$ we provide an algorithm that computes an $\epsilon$-optimal strategy with high-probability given $\tilde{O}((1 - \gamma)^{-3} \epsilon^{-2})$ samples from the transition function for each state-action-pair. Our algorithm runs in time nearly linear in the number of samples and uses space nearly linear in the number of state-action pairs. As stochastic games generalize Markov decision processes (MDPs) our runtime and sample complexities are optimal due to Azar et al (2013). We achieve our results by showing how to generalize a near-optimal Q-learning based algorithms for MDP, in particular Sidford et al (2018), to two-player strategy computation algorithms. This overcomes limitations of standard Q-learning and strategy iteration or alternating minimization based approaches and we hope will pave the way for future reinforcement learning results by facilitating the extension of MDP results to multi-agent settings with little loss.
Document Hashing with Mixture-Prior Generative Models

Hashing is promising for large-scale information retrieval tasks thanks to the efficiency of distance evaluation between binary codes. Generative hashing is often used to generate hashing codes in an unsupervised way. However, existing generative hashing methods only considered the use of simple priors, like Gaussian and Bernoulli priors, which limits these methods to further improve their performance. In this paper, two mixture-prior generative models are proposed, under the objective to produce high-quality hashing codes for documents. Specifically, a Gaussian mixture prior is first imposed onto the variational auto-encoder (VAE), followed by a separate step to cast the continuous latent representation of VAE into binary code. To avoid the performance loss caused by the separate casting, a model using a Bernoulli mixture prior is further developed, in which an end-to-end training is admitted by resorting to the straight-through (ST) discrete gradient estimator. Experimental results on several benchmark datasets demonstrate that the proposed methods, especially the one using Bernoulli mixture priors, consistently outperform existing ones by a substantial margin.
Vortex confinement transitions in the modified Goldstone model

The modified XY model is a variation of the XY model extended by a half periodic term, exhibiting a rich phase structure. As the Goldstone model, also known as the linear O(2) model, can be obtained as a continuum and regular model for the XY model, we define the modified Goldstone model as that of the modified XY model. We construct a vortex, a soliton (domain wall), and a molecule of two half-quantized vortices connected by a soliton as regular solutions of this model. Then we investigate its phase structure in two Euclidean dimensions via the functional renormalization group formalism and full numerical simulations. We argue that the field dependence of the wave function renormalization factor plays a crucial role in the existence of the line of fixed points describing the Berezinskii-Kosterlitz-Thouless (BKT) transition, which can ultimately terminate not only at one but at two end points in the modified model. This structure confirms that a two-step phase transition of the BKT and Ising types can occur in the system. We compare our renormalization group results with full numerical simulations, which also reveal that the phase transitions show a richer scenario than expected.
Going beneath the shoulders of giants: tracking the cumulative knowledge spreading in a comprehensive citation network

In all of science, the authors of publications depend on the knowledge presented by the previous publications. Thus they "stand on the shoulders of giants" and there is a flow of knowledge from previous publications to more recent ones. The dominating paradigm for tracking this flow of knowledge is to count the number of direct citations, but this neglects the fact that beneath the first layer of citations there is a full body of literature. In this study, we go underneath the "shoulders" by investigating the cumulative knowledge creation process in a citation network of around 35 million publications. In particular, we study stylized models of persistent influence and diffusion that take into account all the possible chains of citations. When we study the persistent influence values of publications and their citation counts, we find that the publications related to Nobel Prizes i.e. Nobel papers have higher ranks in terms of persistent influence than that due to citations, and that the most outperforming publications are typically early works leading to hot research topics of their time. The diffusion model reveals a significant variation in the rates at which different fields of research share knowledge. We find that these rates have been increasing systematically for several decades, which can be explained by the increase in the publication volumes. Overall, our results suggest that analyzing cumulative knowledge creation on a global scale can be useful in estimating the type and scale of scientific influence of individual publications and entire research areas as well as yielding insights which could not be discovered by using only the direct citation counts.
Centrality-oriented causality. A study of EU agricultural subsidies and digital development in Poland

Results of a convincing causal statistical inference related to socio-economic phenomena are treated as especially desired background for conducting various socio-economic programs or government interventions. Unfortunately, quite often real socio-economic issues do not fulfill restrictive assumptions of procedures of causal analysis proposed in the literature. This paper indicates certain empirical challenges and conceptual opportunities related to applications of procedures of data depth concept into a process of causal inference as to socio-economic phenomena. We show, how to apply a statistical functional depths in order to indicate factual and counterfactual distributions commonly used within procedures of causal inference. Thus a modification of Rubin causality concept is proposed, i.e., a centrality-oriented causality concept. The presented framework is especially useful in a context of conducting causal inference basing on official statistics, i.e., basing on already existing databases. Methodological considerations related to extremal depth, modified band depth, Fraiman-Muniz depth, and multivariate Wilcoxon sum rank statistic are illustrated by means of example related to a study of an impact of EU direct agricultural subsidies on a digital development in Poland in a period of 2012-2019.
Field-effect transistor based on surface negative refraction in Weyl nanowire

Weyl semimetals are characterized by their bulk Weyl points -- conical band touching points that carry a topological monopole charge -- and Fermi arc states that span between the Weyl points on the surface of the material. Recently, significant progress has been made towards understanding and measuring the physical properties of Weyl semimetals. Yet, potential applications remain relatively sparse. Here, we propose Weyl semimetal nanowires as field-effect transistors, dubbed WEYLFETs. Specifically, applying gradient gate voltage along the nanowire, an electrical field is generated that effectively tilts the open surfaces, thus, varying the relative orientation between Fermi arcs on different surfaces. As a result, perfect negative refraction between adjacent surfaces can occur and longitudinal conductance along the wire is suppressed. The WEYLFET offers a high on/off ratio with low power consumption. Adverse effects due to dispersive Fermi arcs and surface disorder are studied.
FunSeqSet: Towards a Purely Functional Data Structure for the Linearisation Case of Dynamic Trees Problem

Dynamic trees, originally described by Sleator and Tarjan, have been studied deeply for non persistent structures providing $\mathcal{O}(\log n)$ time for update and lookup operations as shown in theory and practice by Werneck. However, discussions on how the most common dynamic trees operations (i.e. link and cut) are computed over a purely functional data structure have not been studied. Even more, asking whether vertices $u$ and $v$ are connected (i.e. within the same forest) assumes that corresponding indices or locations for $u$ and $v$ are taken for granted in most of the literature, and not performed as part of the whole computation for such a question. We present FunSeqSet, based on the primitive version of finger trees, i.e. the de facto sequence data structure for the purely functional programming language Haskell, augmented with variants of the collection (i.e. sets) data structures in order to manage efficiently $k$-ary trees for the linearisation case of the dynamic trees problem. Different implementations are discussed, and the performance is measured.
Improving Self-Supervised Single View Depth Estimation by Masking Occlusion

Single view depth estimation models can be trained from video footage using a self-supervised end-to-end approach with view synthesis as the supervisory signal. This is achieved with a framework that predicts depth and camera motion, with a loss based on reconstructing a target video frame from temporally adjacent frames. In this context, occlusion relates to parts of a scene that can be observed in the target frame but not in a frame used for image reconstruction. Since the image reconstruction is based on sampling from the adjacent frame, and occluded areas by definition cannot be sampled, reconstructed occluded areas corrupt to the supervisory signal. In previous work  occlusion is handled based on reconstruction error; at each pixel location, only the reconstruction with the lowest error is included in the loss. The current study aims to determine whether performance improvements of depth estimation models can be gained by during training only ignoring those regions that are affected by occlusion. 
In this work we introduce occlusion mask, a mask that during training can be used to specifically ignore regions that cannot be reconstructed due to occlusions. Occlusion mask is based entirely on predicted depth information. We introduce two novel loss formulations which incorporate the occlusion mask. The method and implementation of  serves as the foundation for our modifications as well as the baseline in our experiments. We demonstrate that (i) incorporating occlusion mask in the loss function improves the performance of single image depth prediction models on the KITTI benchmark. (ii) loss functions that select from reconstructions based on error are able to ignore some of the reprojection error caused by object motion.
Nanoparticle mobility over a surface as a probe for weak transient disordered peptide-peptide interactions.

Weak interactions form the core basis of a vast number of biological processes, in particular, those involving intrinsically disordered proteins. Here, we establish a new technique capable of probing these weak interactions between synthetic unfolded polypeptides using a convenient yet efficient, quantitative method based on single particle tracking of peptide-coated gold nanoparticles over peptide-coated surfaces. We demonstrate that our technique is sensitive enough to observe the influence of a single amino acid mutation on the transient peptide-peptide interactions. Furthermore, the effects of buffer salinity, expected to alter weak electrostatic interactions, are also readily detected and examined in detail. The method presented here has the potential to evaluate in a high throughput manner, weak interactions for a wide range of disordered proteins, polypeptides, and other biomolecules.
Probing Representations Learned by Multimodal Recurrent and Transformer Models

Recent literature shows that large-scale language modeling provides excellent reusable sentence representations with both recurrent and self-attentive architectures. However, there has been less clarity on the commonalities and differences in the representational properties induced by the two architectures. It also has been shown that visual information serves as one of the means for grounding sentence representations. In this paper, we present a meta-study assessing the representational quality of models where the training signal is obtained from different modalities, in particular, language modeling, image features prediction, and both textual and multimodal machine translation. We evaluate textual and visual features of sentence representations obtained using predominant approaches on image retrieval and semantic textual similarity. Our experiments reveal that on moderate-sized datasets, a sentence counterpart in a target language or visual modality provides much stronger training signal for sentence representation than language modeling. Importantly, we observe that while the Transformer models achieve superior machine translation quality, representations from the recurrent neural network based models perform significantly better over tasks focused on semantic relevance.
Texel-Att: Representing and Classifying Element-Based Textures by Attributes

Element-based textures are a kind of texture formed by nameable elements, the texels [1], distributed according to specific statistical distributions; it is of primary importance in many sectors, namely textile, fashion and interior design industry. State-of-theart texture descriptors fail to properly characterize element-based texture, so we present Texel-Att to fill this gap. Texel-Att is the first fine-grained, attribute-based representation and classification framework for element-based textures. It first individuates texels, characterizing them with individual attributes; subsequently, texels are grouped and characterized through layout attributes, which give the Texel-Att representation. Texels are detected by a Mask-RCNN, trained on a brand-new element-based texture dataset, ElBa, containing 30K texture images with 3M fully-annotated texels. Examples of individual and layout attributes are exhibited to give a glimpse on the level of achievable graininess. In the experiments, we present detection results to show that texels can be precisely individuated, even on textures "in the wild"; to this sake, we individuate the element-based classes of the Describable Texture Dataset (DTD), where almost 900K texels have been manually annotated, leading to the Element-based DTD (E-DTD). Subsequently, classification and ranking results demonstrate the expressivity of Texel-Att on ElBa and E-DTD, overcoming the alternative features and relative attributes, doubling the best performance in some cases; finally, we report interactive search results on ElBa and E-DTD: with Texel-Att on the E-DTD dataset we are able to individuate within 10 iterations the desired texture in the 90% of cases, against the 71% obtained with a combination of the finest existing attributes so far. Dataset and code is available at this https URL
On Efficient Data Transfers Across Geographically Dispersed Datacenters

As applications become more distributed to improve user experience and offer higher availability, businesses rely on geographically dispersed datacenters that host such applications more than ever. Dedicated inter-datacenter networks have been built that provide high visibility into the network status and flexible control over traffic forwarding to offer quality communication across the instances of applications hosted on many datacenters. These networks are relatively small, with tens to hundreds of nodes and are managed by the same organization that operates the datacenters which make centralized traffic engineering feasible. Using coordinated data transmission from the services and routing over the inter-datacenter network, one can optimize the network performance according to a variety of utility functions that take into account data transfer deadlines, network capacity consumption, and transfer completion times. 
In this dissertation, we study techniques and algorithms for fast and efficient data transfers across geographically dispersed datacenters over the inter-datacenter networks. We discuss different forms and properties of inter-datacenter transfers and present a generalized optimization framework to maximize an operator selected utility function. Next, in the several chapters that follow, we study, in detail, the problems of admission control for transfers with deadlines and inter-datacenter multicast transfers. For the admission control problem, our solutions offer significant speed up in the admission control process while offering almost identical performance in the total traffic admitted into the network. For the bulk multicasting problem, our techniques enable significant performance gain in receiver completion times with low computational complexity, which makes them highly applicable to inter-datacenter networks.
On The Geometry of a Triangle in the Elliptic and in the Extended Hyperbolic Plane

We investigate several topics of triangle geometry in the elliptic and in the extended hyperbolic plane, such as: centers based on orthogonality, centers related to circumcircles and incircles, radical centers and centers of similitude, orthology, Kiepert perspectors and related objects, Tucker circles, isoptics, substitutes for the Euler line. For both, the elliptic and the extended hyperbolic plane, a uniform metric is used.
PIE - Proving, Interpolating and Eliminating on the Basis of First-Order Logic

PIE is a Prolog-embedded environment for automated reasoning on the basis of first-order logic. It includes a versatile formula macro system and supports the creation of documents that intersperse macro definitions, reasoner invocations and LaTeX-formatted natural language text. Invocation of various reasoners is supported: External provers as well as sub-systems of PIE, which include preprocessors, a Prolog-based first-order prover, methods for Craig interpolation and methods for second-order quantifier elimination.