Search

Advanced flexible electronics and soft robotics require the development and implementation of flexible functional materials. Magnetoelectric (ME) oxide materials can convert magnetic input into electric output and vice versa, making them excellent candidates for advanced sensing, actuating, data storage, and communication. However, their application has been limited to rigid devices due to their brittle nature. Here, we report flexible ME oxide composite (BaTiO3/CoFe2O4) thin film nanostructures that can be transferred onto a stretchable substrate such as polydimethylsiloxane (PDMS). In contrast to rigid bulk counterparts, these ceramic nanostructures display a flexible behavior and exhibit reversibly tunable ME coupling via mechanical stretching. We believe our study can open up new avenues for integrating ceramic ME composites into flexible electronics and soft robotic devices., arXiv more...

Today's systems have diverse needs that are difficult to address using one-size-fits-all commodity DRAM. Unfortunately, although system designers can theoretically adapt commodity DRAM chips to meet their particular design goals (e.g., by reducing access timings to improve performance, implementing system-level RowHammer mitigations), we observe that designers today lack sufficient insight into commodity DRAM chips' reliability characteristics to implement these techniques in practice. In this work, we make a case for DRAM manufacturers to provide increased transparency into key aspects of DRAM reliability (e.g., basic chip design properties, testing strategies). Doing so enables system designers to make informed decisions to better adapt commodity DRAM to meet modern systems' needs while preserving its cost advantages. To support our argument, we study four ways that system designers can adapt commodity DRAM chips to system-specific design goals: (1) improving DRAM reliability; (2) reducing DRAM refresh overheads; (3) reducing DRAM access latency; and (4) mitigating RowHammer attacks. We observe that adopting solutions for any of the four goals requires system designers to make assumptions about a DRAM chip's reliability characteristics. These assumptions discourage system designers from using such solutions in practice due to the difficulty of both making and relying upon the assumption. We identify DRAM standards as the root of the problem: current standards rigidly enforce a fixed operating point with no specifications for how a system designer might explore alternative operating points. To overcome this problem, we introduce a two-step approach that reevaluates DRAM standards with a focus on transparency of DRAM reliability so that system designers are encouraged to make the most of commodity DRAM technology for both current and future DRAM chips., arXiv more...

The quantum ground state of a massive mechanical system is a steppingstone for investigating macroscopic quantum states and building high fidelity sensors. With the recent achievement of ground-state cooling of a single motional mode, levitated nanoparticles have entered the quantum domain. To overcome detrimental cross-coupling and decoherence effects, quantum control needs to be expanded to more system dimensions, but the effect of a decoupled dark mode has thus far hindered cavity-based ground state cooling of multiple mechanical modes. Here, we demonstrate two-dimensional (2D) ground-state cooling of an optically levitated nanoparticle. Utilising coherent scattering into an optical cavity mode, we reduce the occupation numbers of two separate centre-of-mass modes to 0.83 and 0.81, respectively. By controlling the frequency separation and the cavity coupling strengths of the nanoparticle's mechanical modes, we show the transition from 1D to 2D ground-state cooling while avoiding the effect of dark modes. Our results lay the foundations for generating quantum-limited high orbital angular momentum states with applications in rotation sensing. The demonstrated 2D control, combined with already shown capabilities of ground-state cooling along the third motional axis, opens the door for full 3D ground-state cooling of a massive object., arXiv more...

In this paper, we seek to measure how much information a component in a neural network could extract from the representations fed into it. Our work stands in contrast to prior probing work, most of which investigates how much information a model's representations contain. This shift in perspective leads us to propose a new principle for probing, the architectural bottleneck principle: In order to estimate how much information a given component could extract, a probe should look exactly like the component. Relying on this principle, we estimate how much syntactic information is available to transformers through our attentional probe, a probe that exactly resembles a transformer's self-attention head. Experimentally, we find that, in three models (BERT, ALBERT, and RoBERTa), a sentence's syntax tree is mostly extractable by our probe, suggesting these models have access to syntactic information while composing their contextual representations. Whether this information is actually used by these models, however, remains an open question., Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing more...

Basecalling is an essential step in nanopore sequencing analysis where the raw signals of nanopore sequencers are converted into nucleotide sequences, i.e., reads. State-of-the-art basecallers employ complex deep learning models to achieve high basecalling accuracy. This makes basecalling computationally-inefficient and memory-hungry; bottlenecking the entire genome analysis pipeline. However, for many applications, the majority of reads do no match the reference genome of interest (i.e., target reference) and thus are discarded in later steps in the genomics pipeline, wasting the basecalling computation. To overcome this issue, we propose TargetCall, the first fast and widely-applicable pre-basecalling filter to eliminate the wasted computation in basecalling. TargetCall's key idea is to discard reads that will not match the target reference (i.e., off-target reads) prior to basecalling. TargetCall consists of two main components: (1) LightCall, a lightweight neural network basecaller that produces noisy reads; and (2) Similarity Check, which labels each of these noisy reads as on-target or off-target by matching them to the target reference. TargetCall filters out all off-target reads before basecalling; and the highly-accurate but slow basecalling is performed only on the raw signals whose noisy reads are labeled as on-target. Our thorough experimental evaluations using both real and simulated data show that TargetCall 1) improves the end-to-end basecalling performance of the state-of-the-art basecaller by 3.31x while maintaining high (98.88%) sensitivity in keeping on-target reads, 2) maintains high accuracy in downstream analysis, 3) precisely filters out up to 94.71% of off-target reads, and 4) achieves better performance, sensitivity, and generality compared to prior works. We freely open-source TargetCall at https://github.com/CMU-SAFARI/TargetCall., arXiv more...

Dilated and transposed convolutions are widely used in modern convolutional neural networks (CNNs). These kernels are used extensively during CNN training and inference of applications such as image segmentation and high-resolution image generation. Although these kernels have grown in popularity, they stress current compute systems due to their high memory intensity, exascale compute demands, and large energy consumption. We find that commonly-used low-power CNN inference accelerators based on spatial architectures are not optimized for both of these convolutional kernels. Dilated and transposed convolutions introduce significant zero padding when mapped to the underlying spatial architecture, significantly degrading performance and energy efficiency. Existing approaches that address this issue require significant design changes to the otherwise simple, efficient, and well-adopted architectures used to compute direct convolutions. To address this challenge, we propose EcoFlow, a new set of dataflows and mapping algorithms for dilated and transposed convolutions. These algorithms are tailored to execute efficiently on existing low-cost, small-scale spatial architectures and requires minimal changes to the network-on-chip of existing accelerators. EcoFlow eliminates zero padding through careful dataflow orchestration and data mapping tailored to the spatial architecture. EcoFlow enables flexible and high-performance transpose and dilated convolutions on architectures that are otherwise optimized for CNN inference. We evaluate the efficiency of EcoFlow on CNN training workloads and Generative Adversarial Network (GAN) training workloads. Experiments in our new cycle-accurate simulator show that EcoFlow 1) reduces end-to-end CNN training time between 7-85%, and 2) improves end-to-end GAN training performance between 29-42%, compared to state-of-the-art CNN inference accelerators., arXiv more...

Generalized noncontextuality is a well-studied notion of classicality that is applicable to a single system, as opposed to Bell locality. It relies on representing operationally indistinguishable procedures identically in an ontological model. However, operational indistinguishability depends on the set of operations that one may use to distinguish two procedures: we refer to this set as the reference of indistinguishability. Thus, whether or not a given experiment is noncontextual depends on the choice of reference. The choices of references appearing in the literature are seldom discussed, but typically relate to a notion of system underlying the experiment. This shift in perspective then begs the question: how should one define the extent of the system underlying an experiment? Our paper primarily aims at exposing this question rather than providing a definitive answer to it. We start by formulating a notion of relative noncontextuality for prepare-and-measure scenarios, which is simply noncontextuality with respect to an explicit reference of indistinguishability. We investigate how verdicts of relative noncontextuality depend on this choice of reference, and in the process introduce the concept of the noncontextuality graph of a prepare-and-measure scenario. We then discuss several proposals that one may appeal to in order to fix the reference to a specific choice, and relate these proposals to different conceptions of what a system really is. With this discussion, we advocate that whether or not an experiment is noncontextual is not as absolute as often perceived., arXiv more...

We exhibit examples of high-dimensional unimodal posterior distributions arising in non-linear regression models with Gaussian process priors for which worst-case (`cold start') initialised MCMC methods typically take an exponential run-time to enter the regions where the bulk of the posterior measure concentrates. The counter-examples hold for general MCMC schemes based on gradient or random walk steps, and the theory is illustrated for Metropolis-Hastings adjusted methods such as pCN and MALA., arXiv more...

We introduce a software package that allows users to design and run simulations of thought experiments in quantum theory. In particular, it covers cases where several reasoning agents are modelled as quantum systems, such as Wigner's friend experiment. Users can customize the protocol of the experiment, the inner workings of agents (including a quantum circuit that models their reasoning process), the abstract logical system used (which may or not allow agents to combine premises and make inferences about each other's reasoning), and the interpretation of quantum theory used by different agents. Our open-source software is written in a quantum programming language, ProjectQ, and runs on classical or quantum hardware. As an example, we model the Frauchiger-Renner extended Wigner's friend thought experiment, where agents are allowed to measure each other's physical memories, and make inferences about each other's reasoning., arXiv more...

RowHammer is a DRAM vulnerability that can cause bit errors in a victim DRAM row by just accessing its neighboring DRAM rows at a high-enough rate. Recent studies demonstrate that new DRAM devices are becoming increasingly more vulnerable to RowHammer, and many works demonstrate system-level attacks for privilege escalation or information leakage. In this work, we leverage two key observations about RowHammer characteristics to spy on DRAM temperature: 1) RowHammer-induced bit error rate consistently increases (or decreases) as the temperature increases, and 2) some DRAM cells that are vulnerable to RowHammer cause bit errors only at a particular temperature. Based on these observations, we propose a new RowHammer attack, called SpyHammer, that spies on the temperature of critical systems such as industrial production lines, vehicles, and medical systems. SpyHammer is the first practical attack that can spy on DRAM temperature. SpyHammer can spy on absolute temperature with an error of less than 2.5 °C at the 90th percentile of tested temperature points, for 12 real DRAM modules from 4 main manufacturers., arXiv more...

Causality can be defined in terms of a space-time structure or based on information-theoretic structures, which correspond to very different notions of causation. When analysing physical experiments, these notions must be put together in a compatible manner. The process matrix framework describes quantum indefinite causal structures in the information-theoretic sense, but the physicality of such processes remains an open question. At the same time, there are several experiments in Minkowski spacetime (which implies a definite spacetime notion of causality) that claim to have implemented indefinite information-theoretic causal structures, suggesting an apparent tension between these notions. To address this, we develop a general framework that disentangles these two notions and characterises their compatibility in scenarios where quantum systems may be delocalised over a spacetime. The framework first describes a composition of quantum maps through feedback loops, and then the embedding of the resulting (possibly cyclic) signalling structure in an acyclic spacetime. Relativistic causality then corresponds to the compatibility of the two notions of causation. We reformulate the process matrix framework here and derive a number of no-go results for physical implementations of process matrices in a spacetime. These reveal that it is impossible to physically implement indefinite causal order processes with spacetime localised systems, and also characterise the degree to which they must be delocalised. Further, we show that any physical implementation of an indefinite order process can ultimately be fine-grained to one that admits a fixed acyclic information-theoretic causal order that is compatible with the spacetime causal order, thus resolving the apparent paradox. Our work sheds light on the operational meaning of indefinite causal structures which we discuss in detail., arXiv more...

Time Series Analysis (TSA) is a critical workload for consumer-facing devices. Accelerating TSA is vital for many domains as it enables the extraction of valuable information and predict future events. The state-of-the-art algorithm in TSA is the subsequence Dynamic Time Warping (sDTW) algorithm. However, sDTW's computation complexity increases quadratically with the time series' length, resulting in two performance implications. First, the amount of data parallelism available is significantly higher than the small number of processing units enabled by commodity systems (e.g., CPUs). Second, sDTW is bottlenecked by memory because it 1) has low arithmetic intensity and 2) incurs a large memory footprint. To tackle these two challenges, we leverage Processing-using-Memory (PuM) by performing in-situ computation where data resides, using the memory cells. PuM provides a promising solution to alleviate data movement bottlenecks and exposes immense parallelism. In this work, we present MATSA, the first MRAM-based Accelerator for Time Series Analysis. The key idea is to exploit magneto-resistive memory crossbars to enable energy-efficient and fast time series computation in memory. MATSA provides the following key benefits: 1) it leverages high levels of parallelism in the memory substrate by exploiting column-wise arithmetic operations, and 2) it significantly reduces the data movement costs performing computation using the memory cells. We evaluate three versions of MATSA to match the requirements of different environments (e.g., embedded, desktop, or HPC computing) based on MRAM technology trends. We perform a design space exploration and demonstrate that our HPC version of MATSA can improve performance by 7.35x/6.15x/6.31x and energy efficiency by 11.29x/4.21x/2.65x over server CPU, GPU and PNM architectures, respectively., arXiv more...

Discrete stochastic processes are widespread in natural systems with many applications across physics, biochemistry, epidemiology, sociology, and finance. While analytic solutions often cannot be derived, existing simulation frameworks can generate stochastic trajectories compatible with the dynamical laws underlying the random phenomena. However, most simulation algorithms assume the system dynamics are memoryless (Markovian assumption), under which assumption, future occurrences only depend on the present state of the system. Mathematically, the Markovian assumption models inter-event times as exponentially distributed variables, which enables the exact simulation of stochastic trajectories using the seminal Gillespie algorithm. Unfortunately, the majority of stochastic systems exhibit properties of memory, an inherently non-Markovian attribute. Non-Markovian systems are notoriously difficult to investigate analytically, and existing numerical methods are computationally costly or only applicable under strong simplifying assumptions, often not compatible with empirical observations. To address these challenges, we have developed the Rejection-based Gillespie algorithm for non-Markovian Reactions (REGIR), a general and scalable framework to simulate non-Markovian stochastic systems with arbitrary inter-event time distributions. REGIR can achieve arbitrary user-defined accuracy while maintaining the same asymptotic computational complexity as the Gillespie algorithm. We illustrate REGIR's modeling capabilities in three important biochemical systems, namely microbial growth dynamics, stem cell differentiation, and RNA transcription. In all three cases, REGIR efficiently models the underlying stochastic processes and demonstrates its utility to accurately investigate complex non-Markovian systems. The algorithm is implemented as a python library REGIR., arXiv more...

Due to the scarcity of dense pixel-level semantic annotations for images recorded in adverse visual conditions, there has been a keen interest in unsupervised domain adaptation (UDA) for the semantic segmentation of such images. UDA adapts models trained on normal conditions to the target adverse-condition domains. Meanwhile, multiple datasets with driving scenes provide corresponding images of the same scenes across multiple conditions, which can serve as a form of weak supervision for domain adaptation. We propose Refign, a generic extension to self-training-based UDA methods which leverages these cross-domain correspondences. Refign consists of two steps: (1) aligning the normal-condition image to the corresponding adverse-condition image using an uncertainty-aware dense matching network, and (2) refining the adverse prediction with the normal prediction using an adaptive label correction mechanism. We design custom modules to streamline both steps and set the new state of the art for domain-adaptive semantic segmentation on several adverse-condition benchmarks, including ACDC and Dark Zurich. The approach introduces no extra training parameters, minimal computational overhead -- during training only -- and can be used as a drop-in extension to improve any given self-training-based UDA method. Code is available at https://github.com/brdav/refign., Comment: IEEE/CVF Winter Conference on Applications of Computer Vision (WACV) 2023 more...

We present a novel data-driven distributionally robust Model Predictive Control formulation for unknown discrete-time linear time-invariant systems affected by unknown and possibly unbounded additive uncertainties. We use off-line collected data and an approximate model of the dynamics to formulate a finite-horizon optimization problem. To account for both the uncertainty related to the dynamics and the disturbance acting on the system, we resort to a distributionally robust formulation that optimizes the cost expectation while satisfying Conditional Value-at-Risk constraints with respect to the worst-case probability distributions of the uncertainties within an ambiguity set defined using the Wasserstein metric. Using results from the distributionally robust optimization literature we derive a tractable finite-dimensional convex optimization problem with finite-sample guarantees for the class of convex piecewise affine cost and constraint functions. The performance of the proposed algorithm is demonstrated in closed-loop simulation on a simple numerical example., 2022 IEEE 61st Conference on Decision and Control (CDC), ISBN:978-1-6654-6761-2, ISBN:978-1-6654-6760-5, ISBN:978-1-6654-6762-9 more...

Sequence alignment is a fundamentally memory bound computation whose performance in modern systems is limited by the memory bandwidth bottleneck. Processing-in-memory architectures alleviate this bottleneck by providing the memory with computing competencies. We propose Alignment-in-Memory (AIM), a framework for high-throughput sequence alignment using processing-in-memory, and evaluate it on UPMEM, the first publicly-available general-purpose programmable processing-in-memory system. Our evaluation shows that a real processing-in-memory system can substantially outperform server-grade multi-threaded CPU systems running at full-scale when performing sequence alignment for a wide variety of algorithms, read lengths, and edit distance thresholds. We hope that our findings inspire more work on creating and accelerating bioinformatics algorithms for such real processing-in-memory systems., arXiv more...

In multi-agent coverage control problems, agents navigate their environment to reach locations that maximize the coverage of some density. In practice, the density is rarely known $\textit{a priori}$, further complicating the original NP-hard problem. Moreover, in many applications, agents cannot visit arbitrary locations due to $\textit{a priori}$ unknown safety constraints. In this paper, we aim to efficiently learn the density to approximately solve the coverage problem while preserving the agents' safety. We first propose a conditionally linear submodular coverage function that facilitates theoretical analysis. Utilizing this structure, we develop MacOpt, a novel algorithm that efficiently trades off the exploration-exploitation dilemma due to partial observability, and show that it achieves sublinear regret. Next, we extend results on single-agent safe exploration to our multi-agent setting and propose SafeMac for safe coverage and exploration. We analyze SafeMac and give first of its kind results: near optimal coverage in finite time while provably guaranteeing safety. We extensively evaluate our algorithms on synthetic and real problems, including a bio-diversity monitoring task under safety constraints, where SafeMac outperforms competing methods., Comment: Accepted at NeurIPS 2022 more...

We give a free probabilistic proposal to compute the fine-grained radiation entropy for an arbitrary bulk radiation state, in the context of the Penington-Shenker-Stanford-Yang (PSSY) model where the gravitational path integral can be implemented with full control. We observe that the replica trick gravitational path integral is combinatorially matching the free multiplicative convolution between the spectra of the gravitational sector and the matter sector respectively. The convolution formula computes the radiation entropy accurately even in cases when the island formula fails to apply. It also helps to justify this gravitational replica trick as a soluble Hausdorff moment problem. We then work out how the free convolution formula can be evaluated using free harmonic analysis, which also gives a new free probabilistic treatment of resolving the separable sample covariance matrix spectrum. The free convolution formula suggests that the quantum information encoded in competing quantum extremal surfaces can be modelled as free random variables in a finite von Neumann algebra. Using the close tie between free probability and random matrix theory, we show that the PSSY model can be described as a random matrix model that is essentially a generalization of Page's model. It is then manifest that the island formula is only applicable when the convolution factorizes in regimes characterized by the one-shot entropies. We further show that the convolution formula can be reorganized to a generalized entropy formula in terms of the relative entropy., arXiv more...

The success of deep learning ignited interest in whether the brain learns hierarchical representations using gradient-based learning. However, current biologically plausible methods for gradient-based credit assignment in deep neural networks need infinitesimally small feedback signals, which is problematic in biologically realistic noisy environments and at odds with experimental evidence in neuroscience showing that top-down feedback can significantly influence neural activity. Building upon deep feedback control (DFC), a recently proposed credit assignment method, we combine strong feedback influences on neural activity with gradient-based learning and show that this naturally leads to a novel view on neural network optimization. Instead of gradually changing the network weights towards configurations with low output loss, weight updates gradually minimize the amount of feedback required from a controller that drives the network to the supervised output label. Moreover, we show that the use of strong feedback in DFC allows learning forward and feedback connections simultaneously, using learning rules fully local in space and time. We complement our theoretical results with experiments on standard computer-vision benchmarks, showing competitive performance to backpropagation as well as robustness to noise. Overall, our work presents a fundamentally novel view of learning as control minimization, while sidestepping biologically unrealistic assumptions., 26 pages, 4 figures more...

This report is a methodological reflection on Z-Inspection. Z-Inspection is a holistic process used to evaluate the trustworthiness of AI-based technologies at different stages of the AI lifecycle. It focuses, in particular, on the identification and discussion of ethical issues and tensions through the elaboration of socio-technical scenarios. It uses the general European Union's High-Level Expert Group's (EU HLEG) guidelines for trustworthy AI. This report illustrates for both AI researchers and AI practitioners how the EU HLEG guidelines for trustworthy AI can be applied in practice. We share the lessons learned from conducting a series of independent assessments to evaluate the trustworthiness of AI systems in healthcare. We also share key recommendations and practical suggestions on how to ensure a rigorous trustworthy AI assessment throughout the life-cycle of an AI system., arXiv more...

The electric power system is currently experiencing radical changes stemming from the increasing share of renewable energy resources and the consequent decommissioning of conventional power plants based on synchronous generators. Since the principal providers of ancillary services are being phased out, new flexibility and reserve providers are needed. The proliferation of Distributed Energy Resources (DERs) in modern distribution networks has opened new possibilities for distribution system operators, enabling them to fill the market gap by harnessing the DER flexibility. This paper introduces a novel centralized MPC-based controller that enables the concurrent provision of voltage support, primary and secondary frequency control by adjusting the setpoints of a heterogeneous group of DERs in active distribution grids. The input-multirate control framework is used to accommodate the distinct timescales and provision requirements of each ancillary service and to ensure that the available resources are properly allocated. Furthermore, an efficient way for incorporating network constraints in the formulation is proposed, where network decomposition is applied to a linear power flow formulation together with network reduction. In addition, different timescale dynamics of the employed DERs and their capability curves are included. The performance of the proposed controller is evaluated on several case studies via dynamic simulations of the IEEE 33-bus system., arXiv more...

State-of-the-art meta-learning techniques do not optimize for zero-shot adaptation to unseen tasks, a setting in which humans excel. On the contrary, meta-learning algorithms learn hyperparameters and weight initializations that explicitly optimize for few-shot learning performance. In this work, we take inspiration from recent advances in generative modeling and language-conditioned image synthesis to propose meta-learning techniques that use natural language guidance to achieve higher zero-shot performance compared to the state-of-the-art. We do so by recasting the meta-learning problem as a multi-modal generative modeling problem: given a task, we consider its adapted neural network weights and its natural language description as equivalent multi-modal task representations. We first train an unconditional generative hypernetwork model to produce neural network weights; then we train a second "guidance" model that, given a natural language task description, traverses the hypernetwork latent space to find high-performance task-adapted weights in a zero-shot manner. We explore two alternative approaches for latent space guidance: "HyperCLIP"-based classifier guidance and a conditional Hypernetwork Latent Diffusion Model ("HyperLDM"), which we show to benefit from the classifier-free guidance technique common in image generation. Finally, we demonstrate that our approaches outperform existing meta-learning methods with zero-shot learning experiments on our Meta-VQA dataset, which we specifically constructed to reflect the multi-modal meta-learning setting. more...

The ability to generalize compositionally is key to understanding the potentially infinite number of sentences that can be constructed in a human language from only a finite number of words. Investigating whether NLP models possess this ability has been a topic of interest: SCAN (Lake and Baroni, 2018) is one task specifically proposed to test for this property. Previous work has achieved impressive empirical results using a group-equivariant neural network that naturally encodes a useful inductive bias for SCAN (Gordon et al., 2020). Inspired by this, we introduce a novel group-equivariant architecture that incorporates a group-invariant hard alignment mechanism. We find that our network's structure allows it to develop stronger equivariance properties than existing group-equivariant approaches. We additionally find that it outperforms previous group-equivariant networks empirically on the SCAN task. Our results suggest that integrating group-equivariance into a variety of neural architectures is a potentially fruitful avenue of research, and demonstrate the value of careful analysis of the theoretical properties of such architectures., Comment: Accepted at COLING 2022 more...

We explore the light induced dynamics in superfluid helium nanodroplets with wide-angle scattering in a pump–probe measurement scheme. The droplets are doped with xenon atoms to facilitate the ignition of a nanoplasma through irradiation with near-infrared laser pulses. After a variable time delay of up to 800 ps, we image the subsequent dynamics using intense extreme ultraviolet pulses from the FERMI free-electron laser. The recorded scattering images exhibit complex intensity fluctuations that are categorized based on their characteristic features. Systematic simulations of wide-angle diffraction patterns are performed, which can qualitatively explain the observed features by employing model shapes with both randomly distributed as well as structured, symmetric distortions. This points to a connection between the dynamics and the positions of the dopants in the droplets. In particular, the structured fluctuations might be governed by an underlying array of quantized vortices in the superfluid droplet as has been observed in previous small-angle diffraction experiments. Our results provide a basis for further investigations of dopant–droplet interactions and associated heating mechanisms., New Journal of Physics, 24 (11), ISSN:1367-2630 more...

The R package BiDAG implements Markov chain Monte Carlo (MCMC) methods for structure learning and sampling of Bayesian networks. The package includes tools to search for a maximum a posteriori (MAP) graph and to sample graphs from the posterior distribution given the data. A new hybrid approach to structure learning enables inference in large graphs. In the first step, we define a reduced search space by means of the PC algorithm or based on prior knowledge. In the second step, an iterative order MCMC scheme proceeds to optimize within the restricted search space and estimate the MAP graph. Sampling from the posterior distribution is implemented using either order or partition MCMC. The models and algorithms can handle both discrete and continuous data. The BiDAG package also provides an implementation of MCMC schemes for structure learning and sampling of dynamic Bayesian networks., arXiv more...

In this paper, we present an approach to improve the robustness of BERT language models against word substitution-based adversarial attacks by leveraging adversarial perturbations for self-supervised contrastive learning. We create a word-level adversarial attack generating hard positives on-the-fly as adversarial examples during contrastive learning. In contrast to previous works, our method improves model robustness without using any labeled data. Experimental results show that our method improves robustness of BERT against four different word substitution-based adversarial attacks, and combining our method with adversarial training gives higher robustness than adversarial training alone. As our method improves the robustness of BERT purely with unlabeled data, it opens up the possibility of using large text datasets to train robust language models against word substitution-based adversarial attacks., Findings of the Association for Computational Linguistics: NAACL 2022, ISBN:978-1-955917-76-6 more...

We investigate two-dimensional, periodic ornaments of the Late Hellenistic (some centuries before the Common Era, the Classical Period) and Early Roman (Common Era) classical periods found at different locations in Asia Minor in Turkey and classify them into mathematical wallpaper groups based on their symmetry properties. The source material comes from Terrace Houses in Ephesus, Izmir, from Zeugma, now in the Zeugma Museum, Gaziantep, and from the recently released bathing pool in Antiochia ad Cragum near Gazipaşa, Antalya. Using the artifacts we first determine the occurrence of each symmetry group. Then we compare this distribution with those of the medieval cultures of the Middle East, namely the Armenian, Byzantine, Arab and Seljuk Turks, calculating in pairs the Euclidean distances of the wallpaper distributions. The subsequent multi-dimensional scaling and hierarchical cluster analysis of the results confirm that the Armenian and Byzantine artworks are strongly inspired by the classical masterpieces, as is the Seljuk creation by the Arabs., arXiv more...