nils-herrmann/clean_scirepeval huggingface dataset:
A Note on Universal Bilinear Portfolios

This note provides a neat and enjoyable expansion and application of the magnificent Ordentlich-Cover theory of “universal portfolios”. I generalize Cover’s benchmark of the best constant-rebalanced portfolio (or 1-linear trading strategy) in hindsight by considering the best bilinear trading strategy determined in hindsight for the realized sequence of asset prices. A bilinear trading strategy is a mini two-period active strategy whose final capital growth factor is linear separately in each period’s gross return vector for the asset market. I apply Thomas Cover’s ingenious performance-weighted averaging technique to construct a universal bilinear portfolio that is guaranteed (uniformly for all possible market behavior) to compound its money at the same asymptotic rate as the best bilinear trading strategy in hindsight. Thus, the universal bilinear portfolio asymptotically dominates the original (1-linear) universal portfolio in the same technical sense that Cover’s universal portfolios asymptotically dominate all constant-rebalanced portfolios and all buy-and-hold strategies. In fact, like so many Russian dolls, one can get carried away and use these ideas to construct an endless hierarchy of ever more dominant H-linear universal portfolios.
2D-CTC for Scene Text Recognition

Scene text recognition has been an important, active research topic in computer vision for years. Previous approaches mainly consider text as 1D signals and cast scene text recognition as a sequence prediction problem, by feat of CTC or attention based encoder-decoder framework, which is originally designed for speech recognition. However, different from speech voices, which are 1D signals, text instances are essentially distributed in 2D image spaces. To adhere to and make use of the 2D nature of text for higher recognition accuracy, we extend the vanilla CTC model to a second dimension, thus creating 2D-CTC. 2D-CTC can adaptively concentrate on most relevant features while excluding the impact from clutters and noises in the background; It can also naturally handle text instances with various forms (horizontal, oriented and curved) while giving more interpretable intermediate predictions. The experiments on standard benchmarks for scene text recognition, such as IIIT-5K, ICDAR 2015, SVP-Perspective, and CUTE80, demonstrate that the proposed 2D-CTC model outperforms state-of-the-art methods on the text of both regular and irregular shapes. Moreover, 2D-CTC exhibits its superiority over prior art on training and testing speed. Our implementation and models of 2D-CTC will be made publicly available soon later.
Towards Unsupervised Grammatical Error Correction using Statistical Machine Translation with Synthetic Comparable Corpus

We introduce unsupervised techniques based on phrase-based statistical machine translation for grammatical error correction (GEC) trained on a pseudo learner corpus created by Google Translation. We verified our GEC system through experiments on various GEC dataset, includi ng a low resource track of the shared task at Building Educational Applications 2019 (BEA 2019). As a result, we achieved an F_0.5 score of 28.31 points with the test data of the low resource track.
Robust Nucleus Detection With Partially Labeled Exemplars

Quantitative analysis of cell nuclei in microscopic images is an essential yet challenging source of biological and pathological information. The major challenge is accurate detection and segmentation of densely packed nuclei in images acquired under a variety of conditions. Mask R-CNN-based methods have achieved state-of-the-art nucleus segmentation. However, the current pipeline requires fully annotated training images, which are time consuming to create and sometimes noisy. Importantly, nuclei often appear similar within the same image. This similarity could be utilized to segment nuclei with only partially labeled training examples. We propose a simple yet effective region-proposal module for the current Mask R-CNN pipeline to perform few-exemplar learning. To capture the similarities between unlabeled regions and labeled nuclei, we apply decomposed self-attention to learned features. On the self-attention map, we observe strong activation at the centers and edges of all nuclei, including unlabeled nuclei. On this basis, our region-proposal module propagates partial annotations to the whole image and proposes effective bounding boxes for the bounding box-regression and binary mask-generation modules. Our method effectively learns from unlabeled regions thereby improving detection performance. We test our method with various nuclear images. When trained with only 1/4 of the nuclei annotated, our approach retains a detection accuracy comparable to that from training with fully annotated data. Moreover, our method can serve as a bootstrapping step to create full annotations of datasets, iteratively generating and correcting annotations until a predetermined coverage and accuracy are reached. The source code is available at https://github.com/feng-lab/nuclei.
Position Focused Attention Network for Image-Text Matching

Image-text matching tasks
have recently attracted a lot of attention in the computer vision field. The
key point of this cross-domain problem is how to accurately measure the
similarity between the visual and the textual contents, which demands a fine
understanding of both modalities. In this paper, we propose a novel position
focused attention network (PFAN) to investigate the relation between the visual
and the textual views. In this work, we integrate the object position clue to
enhance the visual-text joint-embedding learning. We first split the images into blocks, by which we
infer the relative position of region in the image. Then, an attention
mechanism is proposed to model the relations between the image region and
blocks and generate the valuable position feature, which will be further
utilized to enhance the region expression and model a more reliable
relationship between the visual image and the textual sentence. 
on the popular datasets Flickr30K and MS-COCO show the effectiveness of the
proposed method. Besides the public datasets, we also conduct experiments on
our collected practical news dataset (Tencent-News) to validate the practical
application value of proposed method. As far as we know, this is the first
attempt to test the performance on the practical application. Our method can achieve
the state-of-art performance on all of these three datasets.
Adaptive Regularization via Residual Smoothing in Deep Learning Optimization

We present an adaptive regularization algorithm that can be effectively applied to the optimization problem in deep learning framework. Our regularization algorithm aims to take into account the fitness of data to the current state of model in the determination of regularity to achieve better generalization. The degree of regularization at each element in the target space of the neural network architecture is determined based on the residual at each optimization iteration in an adaptive way. Our adaptive regularization algorithm is designed to apply a diffusion process driven by the heat equation with spatially varying diffusivity depending on the probability density function following a certain distribution of residual. Our data-driven regularity is imposed by adaptively smoothing a simplified objective function in which the explicit regularization term is omitted in an alternating manner between the evaluation of residual and the determination of the degree of its regularity. The effectiveness of our algorithm is empirically demonstrated by the numerical experiments in the application of image classification problems, indicating that our algorithm outperforms other commonly used optimization algorithms in terms of generalization using popular deep learning models and benchmark datasets.
Accelerated share repurchase and other buyback programs: what neural networks can bring

When firms want to buy back their own shares, they have a choice between several alternatives. If they often carry out open market repurchase, they also increasingly rely on banks through complex buyback contracts involving option components, e.g. accelerated share repurchase contracts, VWAP-minus profit-sharing contracts, etc. The entanglement between the execution problem and the option hedging problem makes the management of these contracts a difficult task that should not boil down to simple Greek-based risk hedging, contrary to what happens with classical books of options. In this paper, we propose a machine learning method to optimally manage several types of buyback contract. In particular, we recover strategies similar to those obtained in the literature with partial differential equation and recombinant tree methods and show that our new method, which does not suffer from the curse of dimensionality, enables to address types of contract that could not be addressed with grid or tree methods.
Constraining the evolution of the baryon fraction in the IGM with FRB and H(z) data

Extragalactic dispersion measures (DMs) obtained from observations of fast radio bursts (FRBs) are an excellent tool for probing intergalactic medium (IGM) and for conducting cosmography. However, the DM contribution from the IGM (DMIGM) depends on the fraction of baryon mass in the IGM, fIGM, which is not properly constrained. As fIGM(z) is geometrically related to the Hubble parameter H(z) and DMIGM(z), here we propose that combining two independent measurements of FRBs and H(z) in similar redshift ranges provides a novel and cosmology-free method to constrain the evolution of fIGM(z). Under the assumption that fIGM is evolving with redshift in a functional form, we forecast that the evolution of fIGM(z) can be well inferred in a combined analysis of ∼3000 DMIGM(z) derived from FRBs and ∼50 H(z) derived from the Hubble parameter data. Though the efficiency of our method is not as good as that of the other model-independent method involving the joint measurements of DM and luminosity distance of FRBs, our method offers a new model-independent way to constrain fIGM(z).
Modeling Artist Preferences of Users with Different Music Consumption Patterns for Fair Music Recommendations

Music recommender systems have become central parts of popular streaming platforms such as Last.fm, Pandora, or Spotify to help users find music that fits their preferences. These systems learn from the past listening events of users to recommend music a user will likely listen to in the future. Here, current algorithms typically employ collaborative filtering (CF) utilizing similarities between users' listening behaviors. Some approaches also combine CF with content features into hybrid recommender systems. While music recommender systems can provide quality recommendations to listeners of mainstream music artists, recent research has shown that they tend to discriminate listeners of unorthodox, low-mainstream artists. This is foremost due to the scarcity of usage data of low-mainstream music as music consumption patterns are biased towards popular artists. Thus, the objective of our work is to provide a novel approach for modeling artist preferences of users with different music consumption patterns and listening habits.
Genetic Algorithms for Starshade Retargeting in Space-Based Telescopes

Future space-based telescopes will leverage starshades as components that can be independently positioned. Starshades will adjust the light coming in from exoplanet host stars and enhance the direct imaging of exoplanets and other phenomena. In this context, scheduling of space-based telescope observations is subject to a large number of dynamic constraints, including target observability, fuel, and target priorities. We present an application of genetic algorithm (GA) scheduling on this problem that not only takes physical constraints into account, but also considers direct human suggestions on schedules. By allowing direct suggestions on schedules, this type of heuristic can capture the scheduling preferences and expertise of stakeholders without the need to always formally codify such objectives. Additionally, this approach allows schedules to be constructed from existing ones when scenarios change; for example, this capability allows for optimization without the need to recompute schedules from scratch after changes such as new discoveries or new targets of opportunity. We developed a specific graph-traversal-based framework upon which to apply GA for telescope scheduling, and use it to demonstrate the convergence behavior of a particular implementation of GA. From this work, difficulties with regards to assigning values to observational targets are also noted, and recommendations are made for different scenarios.
PointAtrousGraph: Deep Hierarchical Encoder-Decoder with Atrous Convolution for Point Clouds

Motivated by the success of encoding multi-scale contextual information for image analysis, we present our PointAtrousGraph (PAG) - a deep permutation-invariant hierarchical encoder-decoder architecture for learning multi-scale edge features in unorganized 3D points. Our PAG is constructed by several novel modules, such as point atrous convolution, edge-preserved pooling and edge-preserved unpooling. Similar with atrous convolution, our point atrous convolution can effectively enlarge the receptive fields of filters for learning point features without increasing computation amount. Following the idea of non-overlapping max-pooling operation, we propose our edge-preserved pooling to preserve critical edge features during subsampling. In a similar spirit, our edge-preserved unpooling propagates high-dimensional edge features while recovering the spatial information. In addition, we introduce chained skip subsampling/upsampling modules to directly propagate edge features from different hierarchies to the final stage. Experimental results show that our PAG achieves better performance compared to previous state-of-the-art methods in various applications.
E-HBA: Using Action Policies for Expert Advice and Agent Typification

Past research has studied two approaches to utilise pre-defined policy sets in repeated interactions: as experts, to dictate our own actions, and as types, to characterise the behaviour of other agents. In this work, we bring these complementary views together in the form of a novel meta-algorithm, called Expert-HBA (E-HBA), which can be applied to any expert algorithm that considers the average (or total) payoff an expert has yielded in the past. E-HBA gradually mixes the past payoff with a predicted future payoff, which is computed using the type-based characterisation. We present results from a comprehensive set of repeated matrix games, comparing the performance of several well-known expert algorithms with and without the aid of E-HBA. Our results show that E-HBA has the potential to significantly improve the performance of expert algorithms.
The Expressive Power of Higher-Order Datalog

A classical result in descriptive complexity theory states that Datalog expresses exactly the class of polynomially computable queries on ordered databases (Papadimitriou 1985; Grädel 1992; Vardi 1982; Immerman 1986; Leivant 1989). In this paper we extend this result to the case of higher-order Datalog. In particular, we demonstrate that on ordered databases, for all k ≥ 2, k-order Datalog captures (k − . This result suggests that higher-order extensions of Datalog possess superior expressive power and they are worthwhile of further investigation both in theory and in practice.
About Epistemic Negation and World Views in Epistemic Logic Programs

In this paper we consider Epistemic Logic Programs, which extend Answer Set Programming (ASP) with “ epistemic operators” and “ epistemic negation”, and a recent approach to the semantics of such programs in terms of World Views. We propose some observations on the existence and number of world views. We show how to exploit an extended ASP semantics in order to: (i) provide a characterization of world views, different from existing ones; (ii) query world views and query the whole set of world views.
Compton scattering energy spectrum for Si and Ge systems

In the present work, we study the atomic Compton Scattering which could have great impacts on dark matter direct detection experiments. We give a quantitative analysis of the Compton scattering energy spectrum for Si and Ge atomic systems. The theoretical results on Compton scattering are calculated within the frameworks of free electron approximation (FEA) and relativistic impulse approximation (RIA). The low-energy transfer and near photoionization threshold regions are especially considered in this work. In RIA calculation, to obtain the atomic ground states, we adopt an \emph{ab initio} calculation in the fully relativistic Dirac-Fock theory.
Efficient solution of the anisotropic spherically aligned axisymmetric Jeans equations of stellar hydrodynamics for galactic dynamics

I present a flexible solution for the axisymmetric Jeans equations of stellar hydrodynamics under the assumption of an anisotropic (three-integral) velocity ellipsoid aligned with the spherical polar coordinate system. I describe and test a robust and efficient algorithm for its numerical computation. I outline the evaluation of the intrinsic velocity moments and the projection of all first and second velocity moments, including both the line-of-sight velocities and the proper motions. This spherically aligned Jeans anisotropic modelling (JAMsph) method can describe in detail the photometry and kinematics of real galaxies. It allows for a spatially varying anisotropy, or stellar mass-to-light ratio gradients, as well as for the inclusion of general dark matter distributions and supermassive black holes. The JAMsph method complements my previously derived cylindrically aligned JAMcyl and spherical Jeans solutions, which I also summarize in this paper. Comparisons between results obtained with either JAMsph or JAMcyl can be used to assess the robustness of inferred dynamical quantities. As an illustration, I modelled the ATLAS3D sample of 260 early-type galaxies with high-quality integral-field spectroscopy, using both methods. I found that they provide statistically indistinguishable total density logarithmic slopes. This may explain the previously reported success of the JAM method in recovering density profiles of real or simulated galaxies. A reference software implementation of JAMsph is included in the publicly available jam software package.
Eye-based Continuous Affect Prediction

Eye-based information channels include the pupils, gaze, saccades, fixational movements, and numerous forms of eye opening and closure. Pupil size variation indicates cognitive load and emotion, while a person's gaze direction is said to be congruent with the motivation to approach or avoid stimuli. The eyelids are involved in facial expressions that can encode basic emotions. Additionally, eye-based cues can have implications for human annotators of affect. Despite these facts, the use of eye-based cues in affective computing is in its infancy and this work is intended to start to address this. Eye-based feature sets, incorporating data from all of the aforementioned information channels, that can be estimated from video are proposed. Feature set refinement is provided by way of continuous arousal and valence learning and prediction experiments on the RECOLA validation set. The eye-based features are then combined with a speech feature set to provide confirmation of their usefulness and assess affect prediction performance compared with group-of-humans-level performance on the RECOLA test set. The core contribution of this paper, a refined eye-based feature set, is shown to provide benefits for affect prediction. It is hoped that this work stimulates further research into eye-based affective computing.
Modeling question asking using neural program generation

People ask questions that are far richer, more informative, and more creative than current AI systems. We propose a neural program generation framework for modeling human question asking, which represents questions as formal programs and generates programs with an encoder-decoder based deep neural network. From extensive experiments using an information-search game, we show that our method can ask optimal questions in synthetic settings, and predict which questions humans are likely to ask in unconstrained settings. We also propose a novel grammar-based question generation framework trained with reinforcement learning, which is able to generate creative questions without supervised data.
Dynamical complexity measure to distinguish organized from disorganized dynamics.

We propose a metric to characterize the complex behavior of a dynamical system and to distinguish between organized and disorganized complexity. The approach combines two quantities that separately assess the degree of unpredictability of the dynamics and the lack of describability of the structure in the Poincaré plane constructed from a given time series. As for the former, we use the permutation entropy S_{p}, while for the latter, we introduce an indicator, the structurality Δ, which accounts for the fraction of visited points in the Poincaré plane. The complexity measure thus defined as the sum of those two components is validated by classifying in the (S_{p},Δ) space the complexity of several benchmark dissipative and conservative dynamical systems. As an application, we show how the metric can be used as a powerful biomarker for different cardiac pathologies and to distinguish the dynamical complexity of two electrochemical dissolutions.
Explosive phenomena in complex networks

The emergence of large-scale connectivity and synchronization are crucial to the structure, function and failure of many complex socio-technical networks. Thus, there is great interest in analyzing phase transitions to large-scale connectivity and to global synchronization, including how to enhance or delay the onset. These phenomena are traditionally studied as second-order phase transitions where, at the critical threshold, the order parameter increases rapidly but continuously. In 2009, an extremely abrupt transition was found for a network growth process where links compete for addition in an attempt to delay percolation. This observation of ‘explosive percolation’ was ultimately revealed to be a continuous transition in the thermodynamic limit, yet with very atypical finite-size scaling, and it started a surge of work on explosive phenomena and their consequences. Many related models are now shown to yield discontinuous percolation transitions and even hybrid transitions. Explosive percolation enables many other features such as multiple giant components, modular structures, discrete scale invariance and non-self-averaging, relating to properties found in many real phenomena such as explosive epidemics, electric breakdowns and the emergence of molecular life. Models of explosive synchronization provide an analytic framework for the dynamics of abrupt transitions and reveal the interplay between the distribution in natural frequencies and the network structure, with applications ranging from epileptic seizures to waking from anesthesia. Here we review the vast literature on explosive phenomena in networked systems and synthesize the fundamental connections between models and survey the application areas. We attempt to classify explosive phenomena based on underlying mechanisms and to provide a coherent overview and perspective for future research to address the many vital questions that remained unanswered.