Miracle-dz/UniFAR-FTUs huggingface dataset:
Evidence that 1.6-year solar quasi-biennial oscillations are synchronous with maximum Sun-planet alignments

Solar quasi-biennial oscillations, (QBOs), with period range 0.6 – 4 years, are prominent in records of solar activity. Here we show that the 1.6 year QBO in solar activity has the exceptional feature of phase inversion between each solar cycle in the sequence of four solar cycles, 20 to 23. The hypothesis advanced is that this feature is due to synchronicity between solar activity and planetary alignment. An index of alignment between Earth and Mercury, Venus, Jupiter and Saturn is shown to have dominant peaks of alignment separated by 1.6 years in each solar cycle with, however, peak alignments shifting by half a period, 0.8 years, between alternate solar cycles. Accepting that solar activity increases when planets align would explain the phase inversion in alternate solar cycles observed in the 1.6 year QBO. Two new methods were developed to test this hypothesis: (a) Narrow band filtering of solar activity with the pass band based on the frequency content of the planetary alignment index. (b) Superposing intervals of raw solar activity data centred on times of maximum planet alignment. Both methods provided strong support for the hypothesis. Planetary alignment is complex but predictable enabling the forecasting of solar QBO intermittency and future QBO spectral content.
AugMax: Adversarial Composition of Random Augmentations for Robust Training

Data augmentation is a simple yet effective way to improve the robustness of deep neural networks (DNNs). Diversity and hardness are two complementary dimensions of data augmentation to achieve robustness. For example, AugMix explores random compositions of a diverse set of augmentations to enhance broader coverage, while adversarial training generates adversarially hard samples to spot the weakness. Motivated by this, we propose a data augmentation framework, termed AugMax, to unify the two aspects of diversity and hardness. AugMax first randomly samples multiple augmentation operators and then learns an adversarial mixture of the selected operators. Being a stronger form of data augmentation, AugMax leads to a significantly augmented input distribution which makes model training more challenging. To solve this problem, we further design a disentangled normalization module, termed DuBIN (Dual-Batch-and-Instance Normalization), that disentangles the instance-wise feature heterogeneity arising from AugMax. Experiments show that AugMax-DuBIN leads to significantly improved out-of-distribution robustness, outperforming prior arts by 3.03%, 3.49%, 1.82% and 0.71% on CIFAR10-C, CIFAR100-C, Tiny ImageNet-C and ImageNet-C. Codes and pretrained models are available: https://github.com/VITA-Group/AugMax.
Visual Selective Attention System to Intervene User Attention in Sharing COVID-19 Misinformation

Information sharing on social media must be accompanied by attentive behavior so that in a distorted digital environment, users are not rushed and distracted in deciding to share information. The spread of misinformation, especially those related to the COVID-19, can divide and create negative effects of falsehood in society. Individuals can also cause feelings of fear, health anxiety, and confusion in the treatment COVID-19. Although much research has focused on understanding human judgment from a psychological underline, few have addressed the essential issue in the screening phase of what technology can interfere amidst users' attention in sharing information. This research aims to intervene in the user's attention with a visual selective attention approach. This study uses a quantitative method through studies 1 and 2 with pre-and post-intervention experiments. In study 1, we intervened in user decisions and attention by stimulating ten information and misinformation using the Visual Selective Attention System (VSAS) tool. In Study 2, we identified associations of user tendencies in evaluating information using the Implicit Association Test (IAT). The significant results showed that the user's attention and decision behavior improved after using the VSAS. The IAT results show a change in the association of user exposure, where after the intervention using VSAS, users tend not to share misinformation about COVID-19. The results are expected to be the basis for developing social media applications to combat the negative impact of the infodemic COVID-19 misinformation.
Scalable Bayesian divergence time estimation with ratio transformations.

Divergence time estimation is crucial to provide temporal signals for dating biologically important events, from species divergence to viral transmissions in space and time. With the advent of high-throughput sequencing, recent Bayesian phylogenetic studies have analyzed hundreds to thousands of sequences. Such large-scale analyses challenge divergence time reconstruction by requiring inference on highly-correlated internal node heights that often become computationally infeasible. To overcome this limitation, we explore a ratio transformation that maps the original N-1 internal node heights into a space of one height parameter and N-2 ratio parameters. To make the analyses scalable, we develop a collection of linear-time algorithms to compute the gradient and Jacobian-associated terms of the log-likelihood with respect to these ratios. We then apply Hamiltonian Monte Carlo sampling with the ratio transform in a Bayesian framework to learn the divergence times in four pathogenic viruses (West Nile virus, rabies virus, Lassa virus and Ebola virus) and the coralline red algae. Our method both resolves a mixing issue in the West Nile virus example and improves inference efficiency by at least 5-fold for the Lassa and rabies virus examples as well as for the algae example. Our method now also makes it computationally feasible to incorporate mixed-effects molecular clock models for the Ebola virus example, confirms the findings from the original study and reveals clearer multimodal distributions of the divergence times of some clades of interest. [Divergence time estimation, Bayesian inference, Hamiltonian Monte Carlo, ratio transformation, effective sample size, phylogenetics, pathogens.
Optimal Inverse Design Based on Memetic Algorithms—Part II: Examples and Properties

Optimal inverse design, including topology optimization and evaluation of fundamental bounds on performance, which was introduced in Part 1, is applied to various antenna design problems. A memetic scheme for topology optimization combines local and global techniques to accelerate convergence and maintain robustness. Method-of-moments (MoMs) matrices are used to evaluate objective functions and allow determination of fundamental bounds on performance. By applying the Shermann–Morrison–Woodbury identity, the repetitively performed structural update is inversion-free yet full-wave. The technique can easily be combined with additional features often required in practice, e.g., only a part of the structure is controllable, or evaluation of an objective function is required in a subdomain only. The memetic framework supports multifrequency and multiport optimization and offers many other advantages, such as an actual shape being known at every moment of the optimization. The performance of the method is assessed, including its convergence and computational cost.
Notes from the bulk: Metric dependence of the edge states of Chern-Simons theory

The abelian Chern-Simons theory is considered on a cylindrical spacetime R×D, in a not necessarily flat Lorentzian background. As in the flat bulk case with planar boundary, we find that also on the radial boundary of a curved background a Kaç-Moody algebra exists, with the same central charge as in the flat case, which henceforth depends neither on the bulk metric nor on the geometry of the boundary. The holographically induced theory on the 2D boundary is topologically protected, in the sense that it describes a Luttinger liquid, no matter which the bulk metric is. The main result of this paper is that a remnant of the 3D bulk theory resides in the chiral velocity of the edge modes, which is not a constant like in the flat bulk case, but it is local, depending on the determinant of the induced metric on the boundary. This result may provide a theoretical framework for the recently observed accelerated chiral bosons on the edge of some Hall systems.
Computationally efficient zero-noise extrapolation for quantum-gate-error mitigation

Zero noise extrapolation (ZNE) is a widely used technique for gate error mitigation on near term quantum computers because it can be implemented in software and does not require knowledge of the quantum computer noise parameters. Traditional ZNE requires a significant resource overhead in terms of quantum operations. A recent proposal using a targeted (or random) instead of fixed identity insertion method (riim versus fiim) requires significantly fewer quantum gates for the same formal precision. We start by showing that riim can allow for ZNE to be deployed on deeper circuits than fiim, but requires many more measurements to achieve the same level of statistical uncertainty. We develop two extensions to fiim and riim. The List Identity Insertion Method (liim) allows to mitigate the error from certain cnot gates, typically those with the largest error. Set Identity Insertion Method (siim) naturally interpolates between the measurement-efficient fiim and the gate-efficient riim, allowing to trade off fewer cnot gates for more measurements. Finally, we investigate a way to boost the number of measurements, namely to run ZNE in parallel, utilizing as many quantum devices as are available. We explore the performance of riim in a parallel setting where there is a non-trivial spread in noise across sets of qubits within or across quantum computers.
Learning Optimal Decision Trees Using MaxSAT

We present a Combinatorial Optimization approach based on Maximum Satisﬁability technology to compute Minimum Pure Decision Trees (MPDTs) for the sake of interpretability. We show that our approach outperforms clearly in terms of runtime previous approaches to compute MPDTs. We additionally show that these MPDTs can outperform on average the DT classiﬁers generated with sklearn in terms of accuracy. Therefore, our approach tackles favourably the challenge of balancing interpretability and accuracy.
Decomposed Inductive Procedure Learning

Recent advances in machine learning have made it possible to train artificially intelligent agents that perform with super-human accuracy on a great diversity of complex tasks. However, the process of training these capabilities often necessitates millions of annotated examples -- far more than humans typically need in order to achieve a passing level of mastery on similar tasks. Thus, while contemporary methods in machine learning can produce agents that exhibit super-human performance, their rate of learning per opportunity in many domains is decidedly lower than human-learning. In this work we formalize a theory of Decomposed Inductive Procedure Learning (DIPL) that outlines how different forms of inductive symbolic learning can be used in combination to build agents that learn educationally relevant tasks such as mathematical, and scientific procedures, at a rate similar to human learners. We motivate the construction of this theory along Marr's concepts of the computational, algorithmic, and implementation levels of cognitive modeling, and outline at the computational-level six learning capacities that must be achieved to accurately model human learning. We demonstrate that agents built along the DIPL theory are amenable to satisfying these capacities, and demonstrate, both empirically and theoretically, that DIPL enables the creation of agents that exhibit human-like learning performance.
Disrupting Deep Uncertainty Estimation Without Harming Accuracy

Deep neural networks (DNNs) have proven to be powerful predictors and are widely used for various tasks. Credible uncertainty estimation of their predictions, however, is crucial for their deployment in many risk-sensitive applications. In this paper we present a novel and simple attack, which unlike adversarial attacks, does not cause incorrect predictions but instead cripples the network's capacity for uncertainty estimation. The result is that after the attack, the DNN is more confident of its incorrect predictions than about its correct ones without having its accuracy reduced. We present two versions of the attack. The first scenario focuses on a black-box regime (where the attacker has no knowledge of the target network) and the second scenario attacks a white-box setting. The proposed attack is only required to be of minuscule magnitude for its perturbations to cause severe uncertainty estimation damage, with larger magnitudes resulting in completely unusable uncertainty estimations. We demonstrate successful attacks on three of the most popular uncertainty estimation methods: the vanilla softmax score, Deep Ensembles and MC-Dropout. Additionally, we show an attack on SelectiveNet, the selective classification architecture. We test the proposed attack on several contemporary architectures such as MobileNetV2 and EfficientNetB0, all trained to classify ImageNet.
Gas sensing technologies -- status, trends, perspectives and novel applications

The strong, continuous progresses in gas sensors and electronic noses resulted in improved performance and enabled an increasing range of applications with large impact on modern societies, such as environmental monitoring, food quality control and diagnostics by breath analysis. Here we review this field with special attention to established and emerging approaches as well as the most recent breakthroughs, challenges and perspectives. In particular, we focus on (1) the transduction principles employed in different architectures of gas sensors, analysing their advantages and limitations; (2) the sensing layers including recent trends toward nanostructured, low-dimensional and composite materials; (3) advances in signal processing methodologies, including the recent advent of artificial neural networks. Finally, we conclude with a summary on the latest achievements and trends in terms of applications.
Physics-Informed Neural Networks (PINNs) for Parameterized PDEs: A Metalearning Approach

Physics-informed neural networks (PINNs) as a means of discretizing partial differential equations (PDEs) are garnering much attention in the Computational Science and Engineering (CS&E) world. At least two challenges exist for PINNs at present: an understanding of accuracy and convergence characteristics with respect to tunable parameters and identiﬁcation of optimization strategies that make PINNs as efﬁcient as other computational science tools. The cost of PINNs training remains a major challenge of Physics-informed Machine Learning (PiML) – and, in fact, machine learning (ML) in general. This paper is meant to move towards addressing the latter through the study of PINNs for parameterized PDEs. Following the ML world, we introduce metalearning of PINNs for parameterized PDEs. By introducing metalearning and transfer learning concepts, we can greatly accelerate the PINNs optimization process. We present a survey of model-agnostic metalearning, and then discuss our model-aware metalearning applied to PINNs. We provide theoretically motivated and empirically backed assumptions that make our metalearning approach possible. We then test our approach on various canonical forward parameterized PDEs that have been presented in the emerging PINNs literature.
Distributional Reinforcement Learning for Multi-Dimensional Reward Functions

A growing trend for value-based reinforcement learning (RL) algorithms is to capture more information than scalar value functions in the value network. One of the most well-known methods in this branch is distributional RL, which models return distribution instead of scalar value. In another line of work, hybrid reward architectures (HRA) in RL have studied to model source-specific value functions for each source of reward, which is also shown to be beneficial in performance. To fully inherit the benefits of distributional RL and hybrid reward architectures, we introduce Multi-Dimensional Distributional DQN (MD3QN), which extends distributional RL to model the joint return distribution from multiple reward sources. As a by-product of joint distribution modeling, MD3QN can capture not only the randomness in returns for each source of reward, but also the rich reward correlation between the randomness of different sources. We prove the convergence for the joint distributional Bellman operator and build our empirical algorithm by minimizing the Maximum Mean Discrepancy between joint return distribution and its Bellman target. In experiments, our method accurately models the joint return distribution in environments with richly correlated reward functions, and outperforms previous RL methods utilizing multi-dimensional reward functions in the control setting.
Cosmography with standard sirens from the Einstein Telescope

We discuss the power of third-generation gravitational wave detectors to constrain cosmographic parameters in the case of electromagnetically bright standard sirens focusing on the specific case of the Einstein Telescope. We analyze the impact that the redshift source distribution, the number of detections and the observational error in the luminosity distance have on the inference of the first cosmographic parameters, and show that with a few hundreds detections the Hubble constant can be recovered at sub-percent level whereas the deceleration parameter at a few percent level, both with negligible bias.
Modeling of Frequency Security Constraints and Quantification of Frequency Control Reserve Requirements for Unit Commitment

The high penetration of converter-based renewable energy sources has brought challenges to the power system frequency control. It is essential to consider the frequency security constraints and frequency control reserve requirements in unit commitment (UC). Considering that the risk of frequency insecurity varies under the changeable operational condition, we propose to optimize the PFC droop gains and reserve capacities in the UC model to provide diverse control efforts in different risk levels adaptively. Copula theory is used to establish the joint distribution model among frequency control performance, secondary frequency control (SFC) reserve capacities, and power fluctuations. Then the distributionally robust optimization technique is utilized in the SFC reserve requirement determination to handle the possible error in the probability model. The UC simulation is conducted on IEEE 118-bus system to test the proposed optimal PFC droop gain strategy and SFC reserve requirement quantification method. Simulation results show that the proposed optimal PFC droop gain strategy is better than the traditional fixed PFC droop gain setting on economic efficiency and operational flexibility. Besides, the SFC reserve requirement calculated by the proposed method is more appropriate than the actual SFC reserve capacity in the historical operation.
DP-SSL: Towards Robust Semi-supervised Learning with A Few Labeled Samples

The scarcity of labeled data is a critical obstacle to deep learning. Semi-supervised learning (SSL) provides a promising way to leverage unlabeled data by pseudo labels. However, when the size of labeled data is very small (say a few labeled samples per class), SSL performs poorly and unstably, possibly due to the low quality of learned pseudo labels. In this paper, we propose a new SSL method called DP-SSL that adopts an innovative data programming (DP) scheme to generate probabilistic labels for unlabeled data. Different from existing DP methods that rely on human experts to provide initial labeling functions (LFs), we develop a multiple-choice learning~(MCL) based approach to automatically generate LFs from scratch in SSL style. With the noisy labels produced by the LFs, we design a label model to resolve the conflict and overlap among the noisy labels, and finally infer probabilistic labels for unlabeled samples. Extensive experiments on four standard SSL benchmarks show that DP-SSL can provide reliable labels for unlabeled data and achieve better classification performance on test sets than existing SSL methods, especially when only a small number of labeled samples are available. Concretely, for CIFAR-10 with only 40 labeled samples, DP-SSL achieves 93.82% annotation accuracy on unlabeled data and 93.46% classification accuracy on test data, which are higher than the SOTA results.
Identifying and Benchmarking Natural Out-of-Context Prediction Problems

Deep learning systems frequently fail at out-of-context (OOC) prediction, the problem of making reliable predictions on uncommon or unusual inputs or subgroups of the training distribution. To this end, a number of benchmarks for measuring OOC performance have recently been introduced. In this work, we introduce a framework unifying the literature on OOC performance measurement, and demonstrate how rich auxiliary information can be leveraged to identify candidate sets of OOC examples in existing datasets. We present NOOCh: a suite of naturally-occurring"challenge sets", and show how varying notions of context can be used to probe specific OOC failure modes. Experimentally, we explore the tradeoffs between various learning approaches on these challenge sets and demonstrate how the choices made in designing OOC benchmarks can yield varying conclusions.
Distributed Transmit Beamforming: Design and Demonstration From the Lab to UAVs

Cooperating radios can extend their communication range by adjusting their signals to ensure coherent combining at a destination radio. This technique is called distributed transmit beamforming. Beamforming (BF) relies on the BF radios having frequency synchronized carriers and phases adjusted for coherent combining. Both requirements are typically met by exchanging preambles with the destination. However, since BF aims to increase the received power, the individually transmitted preambles are typically at low SNR and their lengths are constrained by the channel coherence time. These noisy preambles lead to errors in frequency and phase estimation, which result in randomly changing BF gains. To build reliable distributed BF systems, the impact of estimation errors on the BF gains need to be considered in the design. In this work, assuming a destination-led BF protocol and Kalman filter for frequency tracking, we optimize the number of BF radios and the preamble lengths to achieve reliable BF gain. To do that, we characterize the relations between the BF gains distribution, the channel coherence time, and design parameters like the SNR, preamble lengths, and the number of radios. The proposed relations are verified using simulations and via experiments using software-defined radios in a lab and on UAVs.