nils-herrmann/clean_scirepeval huggingface dataset:
Learning to Generate 3D Training Data Through Hybrid Gradient

Synthetic images rendered by graphics engines are a promising source for training deep networks. However, it is challenging to ensure that they can help train a network to perform well on real images, because a graphics-based generation pipeline requires numerous design decisions such as the selection of 3D shapes and the placement of the camera. In this work, we propose a new method that optimizes the generation of 3D training data based on what we call "hybrid gradient". We parametrize the design decisions as a real vector, and combine the approximate gradient and the analytical gradient to obtain the hybrid gradient of the network performance with respect to this vector. We evaluate our approach on the task of estimating surface normal, depth or intrinsic decomposition from a single image. Experiments on standard benchmarks show that our approach can outperform the prior state of the art on optimizing the generation of 3D training data, particularly in terms of computational efficiency.
A New Lower Bound for Kullback-Leibler Divergence Based on Hammersley-Chapman-Robbins Bound

In this paper, we derive a useful lower bound for the Kullback-Leibler divergence (KL-divergence) based on the Hammersley-Chapman-Robbins bound (HCRB).The HCRB states that the variance of an estimator is bounded from below by the Chi-square divergence and the expectation value of the estimator. By using the relation between the KL-divergence and the Chi-square divergence, we show that the lower bound for the KL-divergence which only depends on the expectation value and the variance of a function we choose. This lower bound can also be derived from an information geometric approach. Furthermore, we show that the equality holds for the Bernoulli distributions and show that the inequality converges to the Cram\'{e}r-Rao bound when two distributions are very close. We also describe application examples and examples of numerical calculation.
Tracking VIX with VIX Futures: Portfolio Construction and Performance

We study a series of static and dynamic portfolios of VIX futures and their effectiveness to track the VIX index. We derive each portfolio using optimization methods, and evaluate its tracking performance from both empirical and theoretical perspectives. Among our results, we show that static portfolios of different VIX futures fail to track VIX closely. VIX futures simply do not react quickly enough to movements in the spot VIX. In a discrete-time model, we design and implement a dynamic trading strategy that adjusts daily to optimally track VIX. The model is calibrated to historical data and a simulation study is performed to understand the properties exhibited by the strategy. In addition, comparing to the volatility ETN, VXX, we find that our dynamic strategy has a superior tracking performance.
Geodesic Distance Estimation with Spherelets

Many statistical and machine learning approaches rely on pairwise distances between data points. The choice of distance metric has a fundamental impact on performance of these procedures, raising questions about how to appropriately calculate distances. When data points are real-valued vectors, by far the most common choice is the Euclidean distance. This article is focused on the problem of how to better calculate distances taking into account the intrinsic geometry of the data, assuming data are concentrated near an unknown subspace or manifold. The appropriate geometric distance corresponds to the length of the shortest path along the manifold, which is the geodesic distance. When the manifold is unknown, it is challenging to accurately approximate the geodesic distance. Current algorithms are either highly complex, and hence often impractical to implement, or based on simple local linear approximations and shortest path algorithms that may have inadequate accuracy. We propose a simple and general alternative, which uses pieces of spheres, or spherelets, to locally approximate the unknown subspace and thereby estimate the geodesic distance through paths over spheres. Theory is developed showing lower error for many manifolds, with applications in clustering, conditional density estimation and mean regression. The conclusion is supported through multiple simulation examples and real data sets.
Fixed-point properties for predicate modal logics

It is well known that the propositional modal logic $\mathbf{GL}$ of provability satisfies the de Jongh-Sambin fixed-point property. On the other hand, Montagna showed that the predicate modal system $\mathbf{QGL}$, which is the natural variant of $\mathbf{GL}$, loses the fixed-point property. In this paper, we discuss some versions of the fixed-point property for predicate modal logics. First, we prove that several extensions of $\mathbf{QGL}$ including $\mathbf{NQGL}$ do not have the fixed-point property. Secondly, we prove the fixed-point theorem for the logic $\mathbf{QK} + \Box^{n+1} \bot$. As a consequence, we obtain that the class $\mathsf{FH}$ of Kripke frames which are transitive and finite height satisfies the fixed-point property locally. We also show the failure of the Craig interpolation property for $\mathbf{NQGL}$. Finally, we give a sufficient condition for formulas to have a fixed-point in $\mathbf{QGL}$.
Logical Clifford Synthesis for Stabilizer Codes

Quantum error-correcting codes are used to protect qubits involved in quantum computation. This process requires logical operators to be translated into physical operators acting on physical quantum states. In this article, we propose a mathematical framework for synthesizing physical circuits that implement logical Clifford operators for stabilizer codes. Circuit synthesis is enabled by representing the desired physical Clifford operator in <inline-formula><tex-math notation="LaTeX">$\mathbb {C}^{N \times N}$</tex-math></inline-formula> as a <inline-formula><tex-math notation="LaTeX">$2m \times 2m$</tex-math></inline-formula> binary symplectic matrix, where <inline-formula><tex-math notation="LaTeX">$N = 2^m$</tex-math></inline-formula>. We prove two theorems that use symplectic transvections to efficiently enumerate all binary symplectic matrices that satisfy a system of linear equations. As a corollary, we prove that for an <inline-formula><tex-math notation="LaTeX">$[\![m,k ]\!]$</tex-math></inline-formula> stabilizer code every logical Clifford operator has <inline-formula><tex-math notation="LaTeX">$2^{r(r+1)/2}$</tex-math></inline-formula> symplectic solutions, where <inline-formula><tex-math notation="LaTeX">$r = m-k$</tex-math></inline-formula>, up to stabilizer degeneracy. The desired physical circuits are then obtained by decomposing each solution into a product of elementary symplectic matrices, that correspond to elementary circuits. This enumeration of all physical realizations enables optimization over the ensemble with respect to a suitable metric. Furthermore, we show that any circuit that normalizes the stabilizer can be transformed into a circuit that centralizes the stabilizer, while realizing the same logical operation. Our method of circuit synthesis can be applied to any stabilizer code, and this paper discusses a proof of concept synthesis for the <inline-formula><tex-math notation="LaTeX">$[\![6,4,2 ]\!]$</tex-math></inline-formula> CSS code. Programs implementing the algorithms in this article, which includes routines to solve for binary symplectic solutions of general linear systems and our overall LCS (logical circuit synthesis) algorithm, can be found at <uri>https://github.com/nrenga/symplectic-arxiv18a</uri>
Wide-Angle Spectrally Selective Absorbers and Thermal Emitters Based on Inverse Opals

Engineered optical absorbers are of substantial interest for applications ranging from stray light reduction to energy conversion. We demonstrate a large-area (centimeter-scale) metamaterial that features near-unity frequency-selective absorption in the mid-infrared wavelength range. The metamaterial comprises a self-assembled porous structure known as an inverse opal, here made of silica. The structure's large volume fraction of voids, together with the vibrational resonances of silica in the mid-infrared spectral range, reduce the metamaterial's refractive index to close to that of air and introduce considerable optical absorption. As a result, the frequency-selective structure efficiently absorbs incident light of both polarizations even at very oblique incidence angles. The absorber remains stable at high temperatures (measured up to ~900 degrees C), enabling its operation as a frequency-selective thermal emitter. The excellent performance of this absorber/emitter and ease of fabrication make it a promising surface coating for passive radiative cooling, laser safety, and other large-area applications.
Mechanisms of Artistic Creativity in Deep Learning Neural Networks

The generative capabilities of deep learning neural networks (DNNs) have been attracting increasing attention for both the remarkable artifacts they produce, but also because of the vast conceptual difference between how they are programmed and what they do. DNNs are 'black boxes' where high-level behavior is not explicitly programmed, but emerges from the complex interactions of thousands or millions of simple computational elements. Their behavior is often described in anthropomorphic terms that can be misleading, seem magical, or stoke fears of an imminent singularity in which machines become 'more' than human. In this paper, we examine 5 distinct behavioral characteristics associated with creativity, and provide an example of a mechanisms from generative deep learning architectures that give rise to each these characteristics. All 5 emerge from machinery built for purposes other than the creative characteristics they exhibit, mostly classification. These mechanisms of creative generative capabilities thus demonstrate a deep kinship to computational perceptual processes. By understanding how these different behaviors arise, we hope to on one hand take the magic out of anthropomorphic descriptions, but on the other, to build a deeper appreciation of machinic forms of creativity on their own terms that will allow us to nurture their further development.
Collaboration of AI Agents via Cooperative Multi-Agent Deep Reinforcement Learning

There are many AI tasks involving multiple interacting agents where agents should learn to cooperate and collaborate to effectively perform the task. Here we develop and evaluate various multi-agent protocols to train agents to collaborate with teammates in grid soccer. We train and evaluate our multi-agent methods against a team operating with a smart hand-coded policy. As a baseline, we train agents concurrently and independently, with no communication. Our collaborative protocols were parameter sharing, coordinated learning with communication, and counterfactual policy gradients. Against the hand-coded team, the team trained with parameter sharing and the team trained with coordinated learning performed the best, scoring on 89.5% and 94.5% of episodes respectively when playing against the hand-coded team. Against the parameter sharing team, with adversarial training the coordinated learning team scored on 75% of the episodes, indicating it is the most adaptable of our methods. The insights gained from our work can be applied to other domains where multi-agent collaboration could be beneficial.
Large-scale, real-time visual–inertial localization revisited

The overarching goals in image-based localization are scale, robustness, and speed. In recent years, approaches based on local features and sparse 3D point-cloud models have both dominated the benchmarks and seen successful real-world deployment. They enable applications ranging from robot navigation, autonomous driving, virtual and augmented reality to device geo-localization. Recently, end-to-end learned localization approaches have been proposed which show promising results on small-scale datasets. However, the positioning accuracy, scalability, latency, and compute and storage requirements of these approaches remain open challenges. We aim to deploy localization at a global scale where one thus relies on methods using local features and sparse 3D models. Our approach spans from offline model building to real-time client-side pose fusion. The system compresses the appearance and geometry of the scene for efficient model storage and lookup leading to scalability beyond what has been demonstrated previously. It allows for low-latency localization queries and efficient fusion to be run in real-time on mobile platforms by combining server-side localization with real-time visual–inertial-based camera pose tracking. In order to further improve efficiency, we leverage a combination of priors, nearest-neighbor search, geometric match culling, and a cascaded pose candidate refinement step. This combination outperforms previous approaches when working with large-scale models and allows deployment at unprecedented scale. We demonstrate the effectiveness of our approach on a proof-of-concept system localizing 2.5 million images against models from four cities in different regions of the world achieving query latencies in the 200 ms range.
Instability of social network dynamics with stubborn links

This paper studies the signed networks in the presence of stubborn links, based on the structural balance theory. Each agent in the network has a mixture of positive and negative links represent friendly and antagonistic interactions and his stubbornness about interactions. Structural balance theory affirms that in signed social networks with simultaneous friendly/hostile interactions, there is a general tendency of evolving over time to reduce the tensions. From this perspective, individuals iteratively invert their own sentiments to reduce the felt tensions induced by imbalance. In this paper, we investigate the consequences of the agents' stubbornness on their interactions. We define stubbornness as an extreme antagonistic interaction which is resistant to change. In the current paper, we investigated if the presence of stubborn links renders an impact on the balance state of the network and whether or not the degree of balance in a signed network depends on the location of stubborn links. Our results show that a poorly balanced configuration consists of multiple antagonistic groups. Both analytical and simulation results demonstrate that the global level of balance of the network is more influenced by the locations of stubborn links in the resulting network topology than by the fraction of stubborn links. This means that even with a large fraction of stubborn links the network would evolve towards a balanced state. On the other hand, if a small fraction of stubborn links are clustered in five stubborn communities, the network evolves to an unbalanced state.
Regularities in stock markets

From the stock markets of six countries with high GDP, we study the stock indices, S&P 500 (NYSE, USA), SSE Composite (SSE, China), Nikkei (TSE, Japan), DAX (FSE, Germany), FTSE 100 (LSE, Britain) and NIFTY (NSE, India). The daily mean growth of the stock values is exponential. The daily price fluctuations about the mean growth are Gaussian, but with a finite asymptotic convergence. The growth of the monthly average of stock values is statistically self-similar to their daily growth. The monthly fluctuations of the price follow a Wiener process, with a decline of the volatility. The mean growth of the daily volume of trade is exponential. These observations are globally applicable and underline regularities across global stock markets.
Nearest-Neighbour-Induced Isolation Similarity and its Impact on Density-Based Clustering

A recent proposal of data dependent similarity called Isolation Kernel/Similarity has enabled SVM to produce better classification accuracy. We identify shortcomings of using a tree method to implement Isolation Similarity; and propose a nearest neighbour method instead. We formally prove the characteristic of Isolation Similarity with the use of the proposed method. The impact of Isolation Similarity on densitybased clustering is studied here. We show for the first time that the clustering performance of the classic density-based clustering algorithm DBSCAN can be significantly uplifted to surpass that of the recent density-peak clustering algorithm DP. This is achieved by simply replacing the distance measure with the proposed nearest-neighbour-induced Isolation Similarity in DBSCAN, leaving the rest of the procedure unchanged. A new type of clusters called mass-connected clusters is formally defined. We show that DBSCAN, which detects density-connected clusters, becomes one which detects mass-connected clusters, when the distance measure is replaced with the proposed similarity. We also provide the condition under which mass-connected clusters can be detected, while density-connected clusters cannot.
Adversarially Trained Deep Neural Semantic Hashing Scheme for Subjective Search in Fashion Inventory

The simple approach of retrieving a closest match of a query image from one in the gallery, compares an image pair using sum of absolute difference in pixel or feature space. The process is computationally expensive, ill-posed to illumination, background composition, pose variation, as well as inefficient to be deployed on gallery sets with more than 1000 elements. Hashing is a faster alternative which involves representing images in reduced dimensional simple feature spaces. Encoding images into binary hash codes enables similarity comparison in an image-pair using the Hamming distance measure. The challenge, however, lies in encoding the images using a semantic hashing scheme that lets subjective neighbors lie within the tolerable Hamming radius. This work presents a solution employing adversarial learning of a deep neural semantic hashing network for fashion inventory retrieval. It consists of a feature extracting convolutional neural network (CNN) learned to (i) minimize error in classifying type of clothing, (ii) minimize hamming distance between semantic neighbors and maximize distance between semantically dissimilar images, (iii) maximally scramble a discriminator's ability to identify the corresponding hash code-image pair when processing a semantically similar query-gallery image pair. Experimental validation for fashion inventory search yields a mean average precision (mAP) of 90.65% in finding the closest match as compared to 53.26% obtained by the prior art of deep Cauchy hashing for hamming space retrieval.
A Novel Bi-directional Interrelated Model for Joint Intent Detection and Slot Filling

A spoken language understanding (SLU) system includes two main tasks, slot filling (SF) and intent detection (ID). The joint model for the two tasks is becoming a tendency in SLU. But the bi-directional interrelated connections between the intent and slots are not established in the existing joint models. In this paper, we propose a novel bi-directional interrelated model for joint intent detection and slot filling. We introduce an SF-ID network to establish direct connections for the two tasks to help them promote each other mutually. Besides, we design an entirely new iteration mechanism inside the SF-ID network to enhance the bi-directional interrelated connections. The experimental results show that the relative improvement in the sentence-level semantic frame accuracy of our model is 3.79% and 5.42% on ATIS and Snips datasets, respectively, compared to the state-of-the-art model.
Variational Quantum Circuits for Deep Reinforcement Learning

The state-of-the-art machine learning approaches are based on classical von Neumann computing architectures and have been widely used in many industrial and academic domains. With the recent development of quantum computing, researchers and tech-giants have attempted new quantum circuits for machine learning tasks. However, the existing quantum computing platforms are hard to simulate classical deep learning models or problems because of the intractability of deep quantum circuits. Thus, it is necessary to design feasible quantum algorithms for quantum machine learning for noisy intermediate scale quantum (NISQ) devices. This work explores variational quantum circuits for deep reinforcement learning. Specifically, we reshape classical deep reinforcement learning algorithms like experience replay and target network into a representation of variational quantum circuits. Moreover, we use a quantum information encoding scheme to reduce the number of model parameters compared to classical neural networks. To the best of our knowledge, this work is the first proof-of-principle demonstration of variational quantum circuits to approximate the deep $Q$ -value function for decision-making and policy-selection reinforcement learning with experience replay and target network. Besides, our variational quantum circuits can be deployed in many near-term NISQ machines.
YouTube Chatter: Understanding Online Comments Discourse on Misinformative and Political YouTube Videos

We conduct a preliminary analysis of comments on political YouTube content containing misinformation in comparison to comments on trustworthy or apolitical videos, labelling the bias and factual ratings of our channels according to Media Bias Fact Check where applicable. One of our most interesting discoveries is that especially-polarized or misinformative political channels (Left-Bias, Right-Bias, PragerU, Conspiracy-Pseudoscience, and Questionable Source) generate 7.5x more comments per view and 10.42x more replies per view than apolitical or Pro-Science channels; in particular, Conspiracy-Pseudoscience and Questionable Sources generate 8.3x more comments per view and 11.0x more replies per view than apolitical and Pro-Science channels. We also compared average thread lengths, average comment lengths, and profanity rates across channels, and present simple machine learning classifiers for predicting the bias category of a video based on these statistics.
Self-Supervised Dialogue Learning

The sequential order of utterances is often meaningful in coherent dialogues, and the order changes of utterances could lead to low-quality and incoherent conversations. We consider the order information as a crucial supervised signal for dialogue learning, which, however, has been neglected by many previous dialogue systems. Therefore, in this paper, we introduce a self-supervised learning task, inconsistent order detection, to explicitly capture the flow of conversation in dialogues. Given a sampled utterance pair triple, the task is to predict whether it is ordered or misordered. Then we propose a sampling-based self-supervised network SSN to perform the prediction with sampled triple references from previous dialogue history. Furthermore, we design a joint learning framework where SSN can guide the dialogue systems towards more coherent and relevant dialogue learning through adversarial training. We demonstrate that the proposed methods can be applied to both open-domain and task-oriented dialogue scenarios, and achieve the new state-of-the-art performance on the OpenSubtitiles and Movie-Ticket Booking datasets.