nils-herrmann/clean_scirepeval huggingface dataset:
MaskGAN: Towards Diverse and Interactive Facial Image Manipulation

Facial image manipulation has achieved great progress in recent years. However, previous methods either operate on a predefined set of face attributes or leave users little freedom to interactively manipulate images. To overcome these drawbacks, we propose a novel framework termed MaskGAN, enabling diverse and interactive face manipulation. Our key insight is that semantic masks serve as a suitable intermediate representation for flexible face manipulation with fidelity preservation. MaskGAN has two main components: 1) Dense Mapping Network (DMN) and 2) Editing Behavior Simulated Training (EBST). Specifically, DMN learns style mapping between a free-form user modified mask and a target image, enabling diverse generation results. EBST models the user editing behavior on the source mask, making the overall framework more robust to various manipulated inputs. Specifically, it introduces dual-editing consistency as the auxiliary supervision signal. To facilitate extensive studies, we construct a large-scale high-resolution face dataset with fine-grained mask annotations named CelebAMask-HQ. MaskGAN is comprehensively evaluated on two challenging tasks: attribute transfer and style copy, demonstrating superior performance over other state-of-the-art methods. The code, models, and dataset are available at https://github.com/switchablenorms/CelebAMask-HQ.
Is BERT Really Robust? A Strong Baseline for Natural Language Attack on Text Classification and Entailment

Machine learning algorithms are often vulnerable to adversarial examples that have imperceptible alterations from the original counterparts but can fool the state-of-the-art models. It is helpful to evaluate or even improve the robustness of these models by exposing the maliciously crafted adversarial examples. In this paper, we present TextFooler, a simple but strong baseline to generate adversarial text. By applying it to two fundamental natural language tasks, text classification and textual entailment, we successfully attacked three target models, including the powerful pre-trained BERT, and the widely used convolutional and recurrent neural networks. We demonstrate three advantages of this framework: (1) effective—it outperforms previous attacks by success rate and perturbation rate, (2) utility-preserving—it preserves semantic content, grammaticality, and correct types classified by humans, and (3) efficient—it generates adversarial text with computational complexity linear to the text
Learnable Parameter Similarity

Most of the existing approaches focus on specific visual tasks while ignoring the relations between them. Estimating task relation sheds light on the learning of high-order semantic concepts, e.g., transfer learning. How to reveal the underlying relations between different visual tasks remains largely unexplored. In this paper, we propose a novel \textbf{L}earnable \textbf{P}arameter \textbf{S}imilarity (\textbf{LPS}) method that learns an effective metric to measure the similarity of second-order semantics hidden in trained models. LPS is achieved by using a second-order neural network to align high-dimensional model parameters and learning second-order similarity in an end-to-end way. In addition, we create a model set called ModelSet500 as a parameter similarity learning benchmark that contains 500 trained models. Extensive experiments on ModelSet500 validate the effectiveness of the proposed method. Code will be released at \url{this https URL}.
Real-time density-matrix coupled-cluster approach for closed and open systems at finite temperature.

We extend the coupled-cluster method to correlated quantum dynamics of both closed and open systems at finite temperatures using the thermofield formalism. The approach expresses the time-dependent density matrix in an exponential ansatz and describes time-evolution along the Keldysh path contour. A distinct advantage of the approach is exact trace-preservation as a function of time, ensuring conservation of probability and particle number. Furthermore, the method avoids the computation of correlated bra-states, simplifying the computational implementation. We develop the method in a thermal quasiparticle representation, which allows seamless connection to the projection method and diagrammatic techniques of the traditional coupled-cluster formalism. For comparison, we also apply the thermofield framework to the density-matrix renormalization-group method to obtain reference results for closed and open systems at finite temperature. We test the singles and doubles approximation to the density-matrix coupled-cluster method on the correlated electronic dynamics of the single-impurity Anderson model, demonstrating that the new method successfully captures the correlated dynamics of both closed systems at finite temperature and driven-dissipative open systems. This encouraging performance motivates future applications to nonequilibrium quantum many-body dynamics in realistic systems.
DynWalks: Global Topology and Recent Changes Awareness Dynamic Network Embedding

Learning topological representation of a network in dynamic environments has recently attracted considerable attention due to the time-evolving nature of many real-world networks i.e. nodes/links might be added/removed as time goes on. Dynamic network embedding aims to learn low dimensional embeddings for unseen and seen nodes by using any currently available snapshots of a dynamic network. For seen nodes, the existing methods either treat them equally important or focus on the $k$ most affected nodes at each time step. However, the former solution is time-consuming, and the later solution that relies on incoming changes may lose the global topology---an important feature for downstream tasks. To address these challenges, we propose a dynamic network embedding method called DynWalks, which includes two key components: 1) An online network embedding framework that can dynamically and efficiently learn embeddings based on the selected nodes; 2) A novel online node selecting scheme that offers the flexible choices to balance global topology and recent changes, as well as to fulfill the real-time constraint if needed. The empirical studies on six real-world dynamic networks under three different slicing ways show that DynWalks significantly outperforms the state-of-the-art methods in graph reconstruction tasks, and obtains comparable results in link prediction tasks. Furthermore, the wall-clock time and complexity analysis demonstrate its excellent time and space efficiency. The source code of DynWalks is available at this https URL
Blocking Bandits

We consider a novel stochastic multi-armed bandit setting, where playing an arm makes it unavailable for a fixed number of time slots thereafter. This models situations where reusing an arm too often is undesirable (e.g. making the same product recommendation repeatedly) or infeasible (e.g. compute job scheduling on machines). We show that with prior knowledge of the rewards and delays of all the arms, the problem of optimizing cumulative reward does not admit any pseudo-polynomial time algorithm (in the number of arms) unless randomized exponential time hypothesis is false, by mapping to the PINWHEEL scheduling problem. Subsequently, we show that a simple greedy algorithm that plays the available arm with the highest reward is asymptotically $(1-1/e)$ optimal. When the rewards are unknown, we design a UCB based algorithm which is shown to have $c \log T + o(\log T)$ cumulative regret against the greedy algorithm, leveraging the free exploration of arms due to the unavailability. Finally, when all the delays are equal the problem reduces to Combinatorial Semi-bandits providing us with a lower bound of $c' \log T+ \omega(\log T)$.
Towards Understanding and Modeling Empathy for Use in Motivational Design Thinking

Thinking workshops are used by companies to help generate new ideas for technologies and products by engaging subjects in exercises to understand their users' wants and become more empathetic towards their needs. The "aha moment" experienced during these thought-provoking, step outside the yourself activities occurs when a group of persons iterate over several problems and converge upon a solution that will fit seamlessly everyday life. With the increasing use and cost of Design workshops being offered, it is important that technology be developed that can help identify empathy and its onset in humans. This position paper presents an approach to modeling empathy using Gaussian mixture models and heart rate and skin conductance. This paper also presents an updated approach to Design Thinking that helps to ensure participants are thinking outside of their own race's, culture's, or other affiliations' motives.
Fusing location and text features for sentiment classification

Geo-tagged Twitter data has been used recently to infer insights on the human aspects of social media. Insights related to demographics, spatial distribution of cultural activities, space-time travel trajectories for humans as well as happiness has been mined from geo-tagged twitter data in recent studies. To date, not much study has been done on the impact of the geolocation features of a Tweet on its sentiment. This observation has inspired us to propose the usage of geo-location features as a method to perform sentiment classification. In this method, the sentiment classification of geo-tagged tweets is performed by concatenating geo-location features and one-hot encoded word vectors as inputs for convolutional neural networks (CNN) and long short-term memory (LSTM) networks. The addition of language-independent features in the form of geo-location features has helped to enrich the tweet representation in order to combat the sparse nature of short tweet message. The results achieved has demonstrated that concatenating geo-location features to one-hot encoded word vectors can achieve higher accuracy as compared to the usage of word vectors alone for the purpose of sentiment classification.
What Should I Ask? Using Conversationally Informative Rewards for Goal-oriented Visual Dialog.

The ability to engage in goal-oriented conversations has allowed humans to gain knowledge, reduce uncertainty, and perform tasks more efficiently. Artificial agents, however, are still far behind humans in having goal-driven conversations. In this work, we focus on the task of goal-oriented visual dialogue, aiming to automatically generate a series of questions about an image with a single objective. This task is challenging since these questions must not only be consistent with a strategy to achieve a goal, but also consider the contextual information in the image. We propose an end-to-end goal-oriented visual dialogue system, that combines reinforcement learning with regularized information gain. Unlike previous approaches that have been proposed for the task, our work is motivated by the Rational Speech Act framework, which models the process of human inquiry to reach a goal. We test the two versions of our model on the GuessWhat?! dataset, obtaining significant results that outperform the current state-of-the-art models in the task of generating questions to find an undisclosed object in an image.
DAR-Net: Dynamic Aggregation Network for Semantic Scene Segmentation

Traditional grid/neighbor-based static pooling has become a constraint for point cloud geometry analysis. In this paper, we propose DAR-Net, a novel network architecture that focuses on dynamic feature aggregation. The central idea of DAR-Net is generating a self-adaptive pooling skeleton that considers both scene complexity and local geometry features. Providing variable semi-local receptive fields and weights, the skeleton serves as a bridge that connect local convolutional feature extractors and a global recurrent feature integrator. Experimental results on indoor scene datasets show advantages of the proposed approach compared to state-of-the-art architectures that adopt static pooling methods.
Emergence of cooperative bistability and robustness of gene regulatory networks

Gene regulatory networks (GRNs) are complex systems in which many genes regulate mutually to adapt the cell state to environmental conditions. In addition to function, the GRNs possess several kinds of robustness. This robustness means that systems do not lose their functionality when exposed to disturbances such as mutations or noise, and is widely observed at many levels in living systems. Both function and robustness have been acquired through evolution. In this respect, GRNs utilized in living systems are rare among all possible GRNs. In this study, we explored the fitness landscape of GRNs and investigated how robustness emerged in highly-fit GRNs. We considered a toy model of GRNs with one input gene and one output gene. The difference in the expression level of the output gene between two input states, “on” and “off”, was considered as fitness. Thus, the determination of the fitness of a GRN was based on how sensitively it responded to the input. We employed the multicanonical Monte Carlo method, which can sample GRNs randomly in a wide range of fitness levels, and classified the GRNs according to their fitness. As a result, the following properties were found: (1) Highly-fit GRNs exhibited bistability for intermediate input between “on” and “off”. This means that such GRNs responded to two input states by using different fixed points of dynamics. This bistability emerges necessarily as fitness increases. (2) These highly-fit GRNs were robust against noise because of their bistability. In other words, noise robustness is a byproduct of high fitness. (3) GRNs that were robust against mutations were not extremely rare among the highly-fit GRNs. This implies that mutational robustness is readily acquired through the evolutionary process. These properties are universal irrespective of the evolutionary pathway, because the results do not rely on evolutionary simulation.
Probabilistic Models of Relational Implication

Relational data in its most basic form is a static collection of known facts. However, by learning to infer and deduct additional information and structure, we can massively increase the usefulness of the underlying data. One common form of inferential reasoning in knowledge bases is implication discovery. Here, by learning when one relation implies another, we can extend our knowledge representation. There are several existing models for relational implication, however we argue they are motivated but not principled. To this end, we define a formal probabilistic model of relational implication. By using estimators based on the empirical distribution of our dataset, we demonstrate that our model outperforms existing approaches. While previous work achieves a best score of 0.7812 AUC on an evaluatory dataset, our ProbE model improves this to 0.7915. Furthermore, we demonstrate that our model can be improved substantially through the use of link prediction models and dense latent representations of the underlying argument and relations. This variant, denoted ProbL, improves the state of the art on our evaluation dataset to 0.8143. In addition to developing a new framework and providing novel scores of relational implication, we provide two pragmatic resources to assist future research. First, we motivate and develop an improved crowd framework for constructing labelled datasets of relational implication. Using this, we reannotate and make public a dataset comprised of 17,848 instances of labelled relational implication. We demonstrate that precision (as evaluated by expert consensus with the crowd labels) on the resulting dataset improves from 53% to 95%.
Dark matter/ new physics searches at BESIII

Many new physics models beyond the Standard Model, motivated by the recent astrophysical anomalies, include the possibility of several new types of light weak-interacting particles. Typical models, such as Next-to-Minimal Supersymmetric Standard Model and Hidden Dark-sector Model, predict the light Higgs and dark bosons, respectively. The masses of these particles are expected to be a few GeV and thus making them accessible at BESIII. BESIII has recently explored the possibility of light Higgs and dark bosons in several decay modes using the data-sets collected at $J/\psi$, $\psi(3686)$ and $\psi(3770)$ resonances. The $J/\psi$ data have further utilized to search for invisible decays of light vector ($V=\omega, \phi$) and pseudo-scalar ($P=\eta, \eta'$) mesons via $J/\psi \to VP$ decays. This report summarizes the recent results of the BESIII experiment on these new physics topics.
Collective dynamics of random Janus oscillator networks

Janus oscillators have been recently introduced as a remarkably simple phase oscillator model that exhibits non-trivial dynamical patterns -- such as chimeras, explosive transitions, and asymmetry-induced synchronization -- that once were only observed in specifically tailored models. Here we study ensembles of Janus oscillators coupled on large homogeneous and heterogeneous networks. By virtue of the Ott-Antonsen reduction scheme, we find that the rich dynamics of Janus oscillators persists in the thermodynamic limit of random regular, Erdős-Renyi and scale-free random networks. We uncover for all these networks the coexistence between partially synchronized state and a multitude of states displaying global oscillations. Furthermore, abrupt transitions of the global and local order parameters are observed for all topologies considered. Interestingly, only for scale-free networks, it is found that states displaying global oscillations vanish in the thermodynamic limit.
Charting the Right Manifold: Manifold Mixup for Few-shot Learning

Few-shot learning algorithms aim to learn model parameters capable of adapting to unseen classes with the help of only a few labeled examples. A recent regularization technique - Manifold Mixup focuses on learning a general-purpose representation, robust to small changes in the data distribution. Since the goal of few-shot learning is closely linked to robust representation learning, we study Manifold Mixup in this problem setting. Self-supervised learning is another technique that learns semantically meaningful features, using only the inherent structure of the data. This work investigates the role of learning relevant feature manifold for few-shot tasks using self-supervision and regularization techniques. We observe that regularizing the feature manifold, enriched via self-supervised techniques, with Manifold Mixup significantly improves few-shot learning performance. We show that our proposed method S2M2 beats the current state-of-the-art accuracy on standard few-shot learning datasets like CIFAR-FS, CUB, mini-ImageNet and tiered-ImageNet by 3 − 8%. Through extensive experimentation, we show that the features learned using our approach generalize to complex few-shot evaluation tasks, cross-domain scenarios and are robust against slight changes to data distribution.
Taxable Stock Trading with Deep Reinforcement Learning

In this paper, we propose stock trading based on the average tax basis. Recall that when selling stocks, capital gain should be taxed while capital loss can earn certain tax rebate. We learn the optimal trading strategies with and without considering taxes by reinforcement learning. The result shows that tax ignorance could induce more than 62% loss on the average portfolio returns, implying that taxes should be embedded in the environment of continuous stock trading on AI platforms.
CAiRE: An Empathetic Neural Chatbot.

In this paper, we present an end-to-end empathetic conversation agent CAiRE. Our system adapts TransferTransfo (Wolf et al., 2019) learning approach that fine-tunes a large-scale pre-trained language model with multi-task objectives: response language modeling, response prediction and dialogue emotion detection. We evaluate our model on the recently proposed empathetic-dialogues dataset (Rashkin et al., 2019), the experiment results show that CAiRE achieves state-of-the-art performance on dialogue emotion detection and empathetic response generation.
Conflicting Disk Inclination Estimates for the Black Hole X-Ray Binary XTE J1550−564

The dynamical characteristics of XTE J1550−564, a black hole X-ray binary, are well established, and the broadband spectral evolution of the source has been well studied. Its orbital inclination is known to be high, at ∼75°, with the jet estimated to align well with the orbital axis. We explore simultaneous observations made with the Advanced Satellite for Cosmology and Astrophysics and Rossi X-ray Timing Explorer covering the 1–200 keV band during the early stages of the first outburst of XTE J1550−564 in its hard-intermediate state on 1998 September 23/24. We show that the most up-to-date reflection models applied to these data yield an inclination estimate much lower than that found in previous studies at ∼40°, grossly disagreeing with the dynamically estimated orbital inclination. We discuss the possible explanations for this disagreement and its implications for reflection models, including possible physical scenarios in which either the inner disk is misaligned with both the binary orbit and the outer jet or the inner accretion flow, corona, and/or jet have vertical structure that leads to lower inferred disk inclination through various physical means.
Towards Optimizing Reiter's HS-Tree for Sequential Diagnosis

Reiter's HS-Tree is one of the most popular diagnostic search algorithms due to its desirable properties and general applicability. In sequential diagnosis, where the addressed diagnosis problem is subject to successive change through the acquisition of additional knowledge about the diagnosed system, HS-Tree is used in a stateless fashion. That is, the existing search tree is discarded when new knowledge is obtained, albeit often large parts of the tree are still relevant and have to be rebuilt in the next iteration, involving redundant operations and costly reasoner calls. As a remedy to this, we propose DynamicHS, a variant of HS-Tree that avoids these redundancy issues by maintaining state throughout sequential diagnosis while preserving all desirable properties of HS-Tree. Preliminary results of ongoing evaluations in a problem domain where HS-Tree is the state-of-the-art diagnostic method suggest significant time savings achieved by DynamicHS by reducing expensive reasoner calls.
An Empirical Study on Leveraging Scene Graphs for Visual Question Answering

Visual question answering (Visual QA) has attracted significant attention these years. While a variety of algorithms have been proposed, most of them are built upon different combinations of image and language features as well as multi-modal attention and fusion. In this paper, we investigate an alternative approach inspired by conventional QA systems that operate on knowledge graphs. Specifically, we investigate the use of scene graphs derived from images for Visual QA: an image is abstractly represented by a graph with nodes corresponding to object entities and edges to object relationships. We adapt the recently proposed graph network (GN) to encode the scene graph and perform structured reasoning according to the input question. Our empirical studies demonstrate that scene graphs can already capture essential information of images and graph networks have the potential to outperform state-of-the-art Visual QA algorithms but with a much cleaner architecture. By analyzing the features generated by GNs we can further interpret the reasoning process, suggesting a promising direction towards explainable Visual QA.
Does the boson peak survive in an ultrathin oxide glass?

D. L. Cortie, ∗ M. J. Cyster, J. S. Smith, G. N. Iles, X. L. Wang, D. R. G. Mitchell, R. A. Mole, N. de Souza, D. Yu, and J. H. Cole † The Institute for Superconducting and Electronic Materials, University of Wollongong Chemical and Quantum Physics, School of Science, RMIT University, Melbourne, Victoria 3000, Australia Space Physics, School of Science, RMIT University, Melbourne, Victoria 3000, Australia Electron Microscopy Centre, University of Wollongong Australian Nuclear Science and Technology Organisation (Dated: 29 July, 2019)