nils-herrmann/clean_scirepeval huggingface dataset:
Switchable Organic Plasmonics with Conductive Polymer Nanoantennas

Metal nanostructures are key elements in nanooptics owing to their strong resonant interaction with light through local plasmonic charge oscillations. Their ability to shape light at the nanoscale have made them important across a multitude of areas, including biosensing, energy conversion and ultrathin flat metaoptics. Yet another dimension of avenues is foreseen for dynamic nanoantennas, ranging from tuneable metalenses for miniaturized medical devices to adaptable windows that control radiation flows in and out of buildings. However, enabling nano-optical antennas to be dynamically controllable remains highly challenging and particularly so for traditional metals with fixed permittivity. Here we present state-of-the-art conductive polymers as a new class of organic plasmonic materials for redox-tuneable nano-optics. Through experiments and simulations, we show that nanodisks of highly conductive polymers can provide clear optical extinction peaks via excitation of dipolar localised surface plasmon resonances. Resonance frequencies redshift with increasing nanodisk aspect ratio, in agreement with analytical calculations based on dipolar polarizability theory. We furthermore demonstrate complete switching of the optical response of the organic nanoantennas by chemical tuning of the polymer's redox state, which effectively modulates the material permittivity between plasmonic and non-plasmonic regimes. Our results thereby show that conductive polymer nanostructures can act as redox-tuneable plasmonic nanoantennas, based on bipolaronic charge carriers rather than electrons as in conventional metals. Future directions may investigate different polymers and geometries to further widen the plasmonic spectral range (here around 0.8 to 3.6 {\mu}m) as well as different ways of tuning.
Revisiting Explicit Negation in Answer Set Programming

A common feature in Answer Set Programming is the use of a second negation, stronger than default negation and sometimes called explicit, strong or classical negation. This explicit negation is normally used in front of atoms, rather than allowing its use as a regular operator. In this paper we consider the arbitrary combination of explicit negation with nested expressions, as those defined by Lifschitz, Tang and Turner. We extend the concept of reduct for this new syntax and then prove that it can be captured by an extension of Equilibrium Logic with this second negation. We study some properties of this variant and compare to the already known combination of Equilibrium Logic with Nelson’s strong negation.
Learning and T-Norms Theory

Deep learning has been shown to achieve impressive results in several domains like computer vision and natural language processing. Deep architectures are typically trained following a supervised scheme and, therefore, they rely on the availability of a large amount of labeled training data to effectively learn their parameters. Neuro-symbolic approaches have recently gained popularity to inject prior knowledge into a deep learner without requiring it to induce this knowledge from data. These approaches can potentially learn competitive solutions with a significant reduction of the amount of supervised data. A large class of neuro-symbolic approaches is based on First-Order Logic to represent prior knowledge, that is relaxed to a differentiable form using fuzzy logic. This paper shows that the loss function expressing these neuro-symbolic learning tasks can be unambiguously determined given the selection of a t-norm generator. When restricted to simple supervised learning, the presented theoretical apparatus provides a clean justification to the popular cross-entropy loss, that has been shown to provide faster convergence and to reduce the vanishing gradient problem in very deep structures. One advantage of the proposed learning formulation is that it can be extended to all the knowledge that can be represented by a neuro-symbolic method, and it allows the development of a novel class of loss functions, that the experimental results show to lead to faster convergence rates than other approaches previously proposed in the literature.
Light Dark Matter Search with Ionization Signals in XENON1T.

We report constraints on light dark matter (DM) models using ionization signals in the XENON1T experiment. We mitigate backgrounds with strong event selections, rather than requiring a scintillation signal, leaving an effective exposure of (22±3) tonne day. Above ∼0.4  keV_{ee}, we observe <1  event/(tonne day keV_{ee}), which is more than 1000 times lower than in similar searches with other detectors. Despite observing a higher rate at lower energies, no DM or CEvNS detection may be claimed because we cannot model all of our backgrounds. We thus exclude new regions in the parameter spaces for DM-nucleus scattering for DM masses m_{χ} within 3-6  GeV/c^{2}, DM-electron scattering for m_{χ}>30  MeV/c^{2}, and absorption of dark photons and axionlike particles for m_{χ} within 0.186-1  keV/c^{2}.
Outfit Compatibility Prediction and Diagnosis with Multi-Layered Comparison Network

Existing works about fashion outfit compatibility focus on predicting the overall compatibility of a set of fashion items with their information from different modalities. However, there are few works explore how to explain the prediction, which limits the persuasiveness and effectiveness of the model. In this work, we propose an approach to not only predict but also diagnose the outfit compatibility. We introduce an end-to-end framework for this goal, which features for: (1) The overall compatibility is learned from all type-specified pairwise similarities between items, and the backpropagation gradients are used to diagnose the incompatible factors. (2) We leverage the hierarchy of CNN and compare the features at different layers to take into account the compatibilities of different aspects from the low level (such as color, texture) to the high level (such as style). To support the proposed method, we build a new type-specified outfit dataset named Polyvore-T based on Polyvore dataset. We compare our method with the prior state-of-the-art in two tasks: outfit compatibility prediction and fill-in-the-blank. Experiments show that our approach has advantages in both prediction performance and diagnosis ability.
AVEC 2019 Workshop and Challenge: State-of-Mind, Detecting Depression with AI, and Cross-Cultural Affect Recognition

The Audio/Visual Emotion Challenge and Workshop (AVEC 2019) 'State-of-Mind, Detecting Depression with AI, and Cross-cultural Affect Recognition' is the ninth competition event aimed at the comparison of multimedia processing and machine learning methods for automatic audiovisual health and emotion analysis, with all participants competing strictly under the same conditions. The goal of the Challenge is to provide a common benchmark test set for multimodal information processing and to bring together the health and emotion recognition communities, as well as the audiovisual processing communities, to compare the relative merits of various approaches to health and emotion recognition from real-life data. This paper presents the major novelties introduced this year, the challenge guidelines, the data used, and the performance of the baseline systems on the three proposed tasks: state-of-mind recognition, depression assessment with AI, and cross-cultural affect sensing, respectively.
Context-Aware Multipath Networks

Making a single network effectively address diverse contexts---learning the variations within a dataset or multiple datasets---is an intriguing step towards achieving generalized intelligence. Existing approaches of deepening, widening, and assembling networks are not cost effective in general. In view of this, networks which can allocate resources according to the context of the input and regulate flow of information across the network are effective. In this paper, we present Context-Aware Multipath Network (CAMNet), a multi-path neural network with data-dependant routing between parallel tensors. We show that our model performs as a generalized model capturing variations in individual datasets and multiple different datasets, both simultaneously and sequentially. CAMNet surpasses the performance of classification and pixel-labeling tasks in comparison with the equivalent single-path, multi-path, and deeper single-path networks, considering datasets individually, sequentially, and in combination. The data-dependent routing between tensors in CAMNet enables the model to control the flow of information end-to-end, deciding which resources to be common or domain-specific.
Compressing deep quaternion neural networks with targeted regularization

In recent years, hyper-complex deep networks (such as complex-valued and quaternion-valued neural networks) have received a renewed interest in the literature. They find applications in multiple fields, ranging from image reconstruction to 3D audio processing. Similar to their real-valued counterparts, quaternion neural networks (QVNNs) require custom regularization strategies to avoid overfitting. In addition, for many real-world applications and embedded implementations, there is the need of designing sufficiently compact networks, with few weights and neurons. However, the problem of regularizing and/or sparsifying QVNNs has not been properly addressed in the literature as of now. In this paper, we show how to address both problems by designing targeted regularization strategies, which are able to minimize the number of connections and neurons of the network during training. To this end, we investigate two extensions of l1 and structured regularization to the quaternion domain. In our experimental evaluation, we show that these tailored strategies significantly outperform classical (real-valued) regularization approaches, resulting in small networks especially suitable for low-power and real-time applications.
Sequential Learning of Active Subspaces

In recent years, active subspace methods (ASMs) have become a popular means of performing subspace sensitivity analysis on black-box functions. Naively applied, however, ASMs require gradient evaluations of the target function. In the event of noisy, expensive, or stochastic simulators, evaluating gradients via finite differencing may be infeasible. In such cases, often a surrogate model is employed, on which finite differencing is performed. When the surrogate model is a Gaussian process (GP), we show that the ASM estimator is available in closed form, rendering the finite-difference approximation unnecessary. We use our closed-form solution to develop acquisition functions focused on sequential learning tailored to sensitivity analysis on top of ASMs. We also show that the traditional ASM estimator may be viewed as a method of moments estimator for a certain class of GPs. We demonstrate how uncertainty on GP hyperparameters may be propagated to uncertainty on the sensitivity analysis, allowing model-based confidence intervals on the active subspace. Our methodological developments are illustrated on several examples.
Lexicographic Multiarmed Bandit

We consider a multiobjective multiarmed bandit problem with lexicographically ordered objectives. In this problem, the goal of the learner is to select arms that are lexicographic optimal as much as possible without knowing the arm reward distributions beforehand. We capture this goal by defining a multidimensional form of regret that measures the loss of the learner due to not selecting lexicographic optimal arms, and then, consider two settings where the learner has prior information on the expected arm rewards. In the first setting, the learner only knows for each objective the lexicographic optimal expected reward. In the second setting, it only knows for each objective near-lexicographic optimal expected rewards. For both settings we prove that the learner achieves expected regret uniformly bounded in time. The algorithm we propose for the second setting also attains bounded regret for the multiarmed bandit with satisficing objectives. In addition, we also consider the harder prior-free case, and show that the learner can still achieve sublinear in time gap-free regret. Finally, we experimentally evaluate performance of the proposed algorithms in a variety of multiobjective learning problems.
Fitting In and Breaking Up: A Nonlinear Version of Coevolving Voter Models

We investigate a nonlinear version of coevolving voter models, in which node states and network structure update as a coupled stochastic process. Most prior work on coevolving voter models has focused on linear update rules with fixed and homogeneous rewiring and adopting probabilities. By contrast, in our nonlinear version, the probability that a node rewires or adopts is a function of how well it "fits in" with the nodes in its neighborhood. To explore this idea, we incorporate a local-survey parameter σ_{i} that encodes the fraction of neighbors of an updating node i that share its opinion state. In an update, with probability σ_{i}^{q} (for some nonlinearity parameter q), the updating node rewires; with complementary probability 1-σ_{i}^{q}, the updating node adopts a new opinion state. We study this mechanism using three rewiring schemes: after an updating node deletes one of its discordant edges, it then either (1) "rewires-to-random" by choosing a new neighbor in a random process; (2) "rewires-to-same" by choosing a new neighbor in a random process from nodes that share its state; or (3) "rewires-to-none" by not rewiring at all (akin to "unfriending" on social media). We compare our nonlinear coevolving voter model to several existing linear coevolving voter models on various network architectures. Relative to those models, we find in our model that initial network topology plays a larger role in the dynamics and that the choice of rewiring mechanism plays a smaller role. A particularly interesting feature of our model is that, under certain conditions, the opinion state that is held initially by a minority of the nodes can effectively spread to almost every node in a network if the minority nodes view themselves as the majority. In light of this observation, we relate our results to recent work on the majority illusion in social networks.
Correlation Transfer by Layer 5 Cortical Neurons Under Recreated Synaptic Inputs In Vitro

Correlated electrical activity in neurons is a prominent characteristic of cortical microcircuits. Despite a growing amount of evidence concerning both spike-count and subthreshold membrane potential pairwise correlations, little is known about how different types of cortical neurons convert correlated inputs into correlated outputs. We studied pyramidal neurons and two classes of GABAergic interneurons of layer 5 in neocortical brain slices obtained from rats of both sexes, and we stimulated them with biophysically realistic correlated inputs, generated using dynamic clamp. We found that the physiological differences between cell types manifested unique features in their capacity to transfer correlated inputs. We used linear response theory and computational modeling to gain clear insights into how cellular properties determine both the gain and timescale of correlation transfer, thus tying single-cell features with network interactions. Our results provide further ground for the functionally distinct roles played by various types of neuronal cells in the cortical microcircuit.  No matter how we probe the brain, we find correlated neuronal activity over a variety of spatial and temporal scales. For the cerebral cortex, significant evidence has accumulated on trial-to-trial covariability in synaptic inputs activation, subthreshold membrane potential fluctuations, and output spike trains. Although we do not yet fully understand their origin and whether they are detrimental or beneficial for information processing, we believe that clarifying how correlations emerge is pivotal for understanding large-scale neuronal network dynamics and computation. Here, we report quantitative differences between excitatory and inhibitory cells, as they relay input correlations into output correlations. We explain this heterogeneity by simple biophysical models and provide the most experimentally validated test of a theory for the emergence of correlations.
Taming Momentum in a Distributed Asynchronous Environment

Although distributed computing can significantly reduce the training time of deep neural networks, scaling the training process while maintaining high efficiency and final accuracy is challenging. Distributed asynchronous training enjoys near-linear speedup, but asynchrony causes gradient staleness, the main difficulty in scaling stochastic gradient descent to large clusters. Momentum, which is often used to accelerate convergence and escape local minima, exacerbates the gradient staleness, thereby hindering convergence. We propose DANA: a novel asynchronous distributed technique which is based on a new gradient staleness measure that we call the gap. By minimizing the gap, DANA mitigates the gradient staleness, despite using momentum, and therefore scales to large clusters while maintaining high final accuracy and fast convergence. DANA adapts Nesterov's Accelerated Gradient to a distributed setting, computing the gradient on an estimated future position of the model's parameters. In turn, we show that DANA's estimation of the future position amplifies the use of a Taylor expansion, which relies on a fast Hessian approximation, making it much more effective and accurate. Our evaluation on the CIFAR and ImageNet datasets shows that DANA outperforms existing methods, in both final accuracy and convergence speed.
Mathematical analysis and simulation study of a phase-field model of prostate cancer growth with chemotherapy and antiangiogenic therapy effects

Cytotoxic chemotherapy is a common treatment for advanced prostate cancer. These tumors are also known to rely on angiogenesis, i.e., the growth of local microvasculature via chemical signaling produced by the tumor. Thus, several clinical studies have been investigating antiangiogenic therapy for advanced prostate cancer, either as monotherapy or combined with standard cytotoxic protocols. However, the complex genetic alterations promoting prostate cancer growth complicate the selection of the best chemotherapeutic approach for each patient's tumor. Here, we present a mathematical model of prostate cancer growth and chemotherapy that may enable physicians to test and design personalized chemotherapeutic protocols in silico. We use the phase-field method to describe tumor growth, which we assume to be driven by a generic nutrient following reaction-diffusion dynamics. Tumor proliferation and apoptosis (i.e., programmed cell death) can be parameterized with experimentally-determined values. Cytotoxic chemotherapy is included as a term downregulating tumor net proliferation, while antiangiogenic therapy is modeled as a reduction in intratumoral nutrient supply. Another equation couples the tumor phase field with the production of prostate-specific antigen, which is an extensively used prostate cancer biomarker. We prove the well-posedness of our model and we run a series of representative simulations using an isogeometric method to explore untreated tumor growth as well as the effects of cytotoxic chemotherapy and antiangiogenic therapy, both alone and combined. Our simulations show that our model captures the growth morphologies of prostate cancer as well as common outcomes of cytotoxic and antiangiogenic mono and combined therapy. Our model also reproduces the usual temporal trends in tumor volume and prostate-specific antigen evolution observed in previous studies.
Network and Agent Dynamics with Evolving Protection against Systemic Risk

The dynamics of protection processes has been a fundamental challenge in systemic risk analysis. The conceptual principle and methodological techniques behind the mechanisms involved [in such dynamics] have been harder to grasp than researchers understood them to be. In this paper, we show how to construct a large variety of behaviors by applying a simple algorithm to networked agents, which could, conceivably, offer a straightforward way out of the complexity. The model starts with the probability that systemic risk spreads. Even in a very random social structure, the propagation of risk is guaranteed by an arbitrary network property of a set of elements. Despite intensive systemic risk, the potential of the absence of failure could also be driven when there has been a strong investment in protection through a heuristically evolved protection level. It is very interesting to discover that many applications are still seeking the mechanisms through which networked individuals build many of these protection process or mechanisms based on fitness due to evolutionary drift. Our implementation still needs to be polished against what happens in the real world, but in general, the approach could be useful for researchers and those who need to use protection dynamics to guard against systemic risk under intrinsic randomness in artificial circumstances.
Influence Maximization in Unknown Social Networks: Learning Policies for Effective Graph Sampling

A serious challenge when finding influential actors in real-world social networks is the lack of knowledge about the structure of the underlying network. Current state-of-the-art methods rely on hand-crafted sampling algorithms; these methods sample nodes and their neighbours in a carefully constructed order and choose opinion leaders from this discovered network to maximize influence spread in the (unknown) complete network. In this work, we propose a reinforcement learning framework for network discovery that automatically learns useful node and graph representations that encode important structural properties of the network. At training time, the method identifies portions of the network such that the nodes selected from this sampled subgraph can effectively influence nodes in the complete network. The realization of such transferable network structure based adaptable policies is attributed to the meticulous design of the framework that encodes relevant node and graph signatures driven by an appropriate reward scheme. We experiment with real-world social networks from four different domains and show that the policies learned by our RL agent provide a 10-36% improvement over the current state-of-the-art method.
On Indecomposable Non-Simple $\mathbb{N}$-graded Vertex Algebras

In this paper, we study an impact of Leibniz algebras on the algebraic structure of $\mathbb{N}$-graded vertex algebras. We provide easy ways to characterize indecomposable non-simple $\mathbb{N}$-graded vertex algebras $\oplus_{n=0}^{\infty}V_{(n)}$ such that $\dim V_{(0)}\geq 2$. Also, we examine the algebraic structure of $\mathbb{N}$-graded vertex algebras $V=\oplus_{n=0}^{\infty}V_{(n)}$ such that $\dim~V_{(0)}\geq 2$ and $V_{(1)}$ is a (semi)simple Leibniz algebra that has $sl_2$ as its Levi factor. We show that under suitable conditions this type of vertex algebra is indecomposable but not simple. Along the way we classify vertex algebroids associated with (semi)simple Leibniz algebras that have $sl_2$ as their Levi factor.