Miracle-dz/UniFAR-FTUs huggingface dataset:
Reducing runtime and error in VQE using deeper and noisier quantum circuits

The rapid development of noisy intermediate-scale quantum (NISQ) devices has raised the question of whether or not these devices will find commercial use. Unfortunately, a major shortcoming of many proposed NISQ-amenable algorithms, such as the variational quantum eigensolver (VQE), is coming into view: the algorithms require too many independent quantum measurements to solve practical problems in a reasonable amount of time. This motivates the central question of our work: how might we speed up such algorithms in spite of the impact of error on NISQ computations? We demonstrate on quantum hardware that the estimation of expectation values, a core subroutine of many quantum algorithms including VQE, can be improved in terms of precision and accuracy by using a technique we call Robust Amplitude Estimation. Consequently, this method reduces the runtime to achieve the same mean-squared error compared to the standard prepare-and-measure estimation method. The surprising result is that by using deeper, and therefore more error-prone, quantum circuits, we realize more accurate quantum computations in less time. As the quality of quantum devices improves, this method will provide a proportional reduction in estimation runtime. This technique may be used to speed up quantum computations into the regime of early fault-tolerant quantum computation and aid in the realization of quantum advantage.
MOS: A Low Latency and Lightweight Framework for Face Detection, Landmark Localization, and Head Pose Estimation

With the emergence of service robots and surveillance cameras, dynamic face recognition (DFR) in wild has received much attention in recent years. Face detection and head pose estimation are two important steps for DFR. Very often, the pose is estimated after the face detection. However, such sequential computations lead to higher latency. In this paper, we propose a low latency and lightweight network for simultaneous face detection, landmark localization and head pose estimation. Inspired by the observation that it is more challenging to locate the facial landmarks for faces with large angles, a pose loss is proposed to constrain the learning. Moreover, we also propose an uncertainty multi-task loss to learn the weights of individual tasks automatically. Another challenge is that robots often use low computational units like ARM based computing core and we often need to use lightweight networks instead of the heavy ones, which lead to performance drop especially for small and hard faces. In this paper, we propose online feedback sampling to augment the training samples across different scales, which increases the diversity of training data automatically. Through validation in commonly used WIDER FACE, AFLW and AFLW2000 datasets, the results show that the proposed method achieves the state-of-the-art performance in low computational resources. The code and data will be available at https://github.com/lyp-deeplearning/MOS-Multi-Task-Face-Detect.
WareVR: Virtual Reality Interface for Supervision of Autonomous Robotic System Aimed at Warehouse Stocktaking

WareVR is a novel human-robot interface based on a virtual reality (VR) application to interact with a heterogeneous robotic system for automated inventory management. We have created an interface to supervise an autonomous robot remotely from a secluded workstation in a warehouse that could benefit during the current pandemic COVID-19 since the stocktaking is a necessary and regular process in warehouses, which involves a group of people. The proposed interface allows regular warehouse workers without experience in robotics to control the heterogeneous robotic system consisting of an unmanned ground vehicle (UGV) and unmanned aerial vehicle (UAV). WareVR provides visualization of the robotic system in a digital twin of the warehouse, which is accompanied by a real-time video stream from the real environment through an onboard UAV camera. Using the WareVR interface, the operator can conduct different levels of stocktaking, monitor the inventory process remotely, and teleoperate the drone for a more detailed inspection. Besides, the developed interface includes remote control of the UAV for intuitive and straightforward human interaction with the autonomous robot for stocktaking. The effectiveness of the VR-based interface was evaluated through the user study in a “visual inspection” scenario.
A Geometry-Based Stochastic Model for Truck Communication Channels in Freeway Scenarios

Vehicle-to-vehicle (V2V) wireless communication systems are fundamental in many intelligent transportation applications, e.g., traffic load control, driverless vehicle, and collision avoidance. Hence, developing appropriate V2V communication systems and standardization require realistic V2V propagation channel models. However, most existing V2V channel modeling studies focus on car-to-car channels; only a few investigate truck-to-car (T2C) or truck-to-truck (T2T) channels. In this paper, a hybrid geometry-based stochastic model (GBSM) is proposed for T2X (T2C or T2T) channels in freeway environments. Next, we parameterize this GBSM from the extensive channel measurements. We extract the multipath components (MPCs) by using a joint maximum likelihood estimation (RiMAX) and then determine the cluster types based on their evolution patterns. We classify the determined clusters into line-of-sight, single-bounce reflections from static interaction objects (IOs), single-bounce reflections from mobile IOs, multiple-bounce reflections, and density multipath components (DMCs). Particularly, we model multiple-bounce reflections as double clusters following the COST 273/COST2100 method. This paper presents the complete parameterization of the channel model. We validate this model by comparing the delay spread and the angular spreads of arrival/departure obtained from the proposed model with the measurement data.
Interpreting Deep Learning Models in Natural Language Processing: A Review

Neural network models have achieved state-of-the-art performances in a wide range of natural language processing (NLP) tasks. However, a long-standing criticism against neural network models is the lack of interpretability, which not only reduces the reliability of neural NLP systems but also limits the scope of their applications in areas where interpretability is essential (e.g., health care applications). In response, the increasing interest in interpreting neural NLP models has spurred a diverse array of interpretation methods over recent years. In this survey, we provide a comprehensive review of various interpretation methods for neural models in NLP. We first stretch out a high-level taxonomy for interpretation methods in NLP, i.e., training-based approaches, test-based approaches, and hybrid approaches. Next, we describe sub-categories in each category in detail, e.g., influence-function based methods, KNN-based methods, attention-based models, saliency-based methods, perturbation-based methods, etc. We point out deficiencies of current methods and suggest some avenues for future research.
Analogue gravitational field from nonlinear fluid dynamics

The dynamics of sound in a fluid is intrinsically nonlinear. We derive the consequences of this fact for the analogue gravitational field experienced by sound waves, by first describing generally how the nonlinearity of the equation for phase fluctuations back-reacts on the definition of the background providing the effective space-time metric. Subsequently, we use the analytical tool of Riemann invariants in one-dimensional motion to derive source terms of the effective gravitational field stemming from nonlinearity. Finally, we show that the consequences of nonlinearity we derive can be observed with Bose–Einstein condensates in the ultracold gas laboratory.
The popular assignment problem: when cardinality is more important than popularity

We consider a matching problem in a bipartite graph $G=(A\cup B,E)$ where nodes in $A$ are agents having preferences in partial order over their neighbors, while nodes in $B$ are objects without preferences. We propose a polynomial-time combinatorial algorithm based on LP duality that finds a maximum matching or assignment in $G$ that is popular among all maximum matchings, if there exists one. Our algorithm can also be used to achieve a trade-off between popularity and cardinality by imposing a penalty on unmatched nodes in $A$. We also provide an $O^*(|E|^k)$ algorithm that finds an assignment whose unpopularity margin is at most $k$; this algorithm is essentially optimal, since the problem is $\mathsf{NP}$-complete and $\mathsf{W}_l[1]$-hard with parameter $k$. We also prove that finding a popular assignment of minimum cost when each edge has an associated binary cost is $\mathsf{NP}$-hard, even if agents have strict preferences. By contrast, we propose a polynomial-time algorithm for the variant of the popular assignment problem with forced/forbidden edges. Finally, we present an application in the context of housing markets.
Self-Supervision and Spatial-Sequential Attention Based Loss for Multi-Person Pose Estimation

Bottom-up based multi-person pose estimation approaches use heatmaps with auxiliary predictions to estimate joint positions and belonging at one time. Recently, various combinations between auxiliary predictions and heatmaps have been proposed for higher performance, these predictions are supervised by the corresponding L2 loss function directly. However, the lack of more explicit supervision results in low features utilization and contradictions between predictions in one model. To solve these problems, this paper proposes (i) a new loss organization method which uses self-supervised heatmaps to reduce prediction contradictions and spatial-sequential attention to enhance networks' features extraction; (ii) a new combination of predictions composed by heatmaps, Part Affinity Fields (PAFs) and our block-inside offsets to fix pixel-level joints positions and further demonstrates the effectiveness of proposed loss function. Experiments are conducted on the MS COCO keypoint dataset and adopting OpenPose as the baseline model. Our method outperforms the baseline overall. On the COCO verification dataset, the mAP of OpenPose trained with our proposals outperforms the OpenPose baseline by over 5.5%.
Multifractality in Quasienergy Space of Coherent States as a Signature of Quantum Chaos

We present the multifractal analysis of coherent states in kicked top model by expanding them in the basis of Floquet operator eigenstates. We demonstrate the manifestation of phase space structures in the multifractal properties of coherent states. In the classical limit, the classical dynamical map can be constructed, allowing us to explore the corresponding phase space portraits and to calculate the Lyapunov exponent. By tuning the kicking strength, the system undergoes a transition from regularity to chaos. We show that the variation of multifractal dimensions of coherent states with kicking strength is able to capture the structural changes of the phase space. The onset of chaos is clearly identified by the phase-space-averaged multifractal dimensions, which are well described by random matrix theory in a strongly chaotic regime. We further investigate the probability distribution of expansion coefficients, and show that the deviation between the numerical results and the prediction of random matrix theory behaves as a reliable detector of quantum chaos.
Incremental causal effects: an introduction and review

In this chapter, we review the class of causal effects based on incremental propensity scores interventions proposed by Kennedy [2019]. The aim of incremental propensity score interventions is to estimate the effect of increasing or decreasing subjects' odds of receiving treatment; this differs from the average treatment effect, where the aim is to estimate the effect of everyone deterministically receiving versus not receiving treatment. We first present incremental causal effects for the case when there is a single binary treatment, such that it can be compared to average treatment effects and thus shed light on key concepts. In particular, a benefit of incremental effects is that positivity - a common assumption in causal inference - is not needed to identify causal effects. Then we discuss the more general case where treatment is measured at multiple time points, where positivity is more likely to be violated and thus incremental effects can be especially useful. Throughout, we motivate incremental effects with real-world applications, present nonparametric estimators for these effects, and discuss their efficiency properties, while also briefly reviewing the role of influence functions in functional estimation. Finally, we show how to interpret and analyze results using these estimators in practice, and discuss extensions and future directions.
Kilonova and Optical Afterglow from Binary Neutron Star Mergers. I. Luminosity Function and Color Evolution

In the first work of this series, we adopt a GW170817-like viewing-angle-dependent kilonova model and the standard afterglow model with a light-curve distribution based on the properties of cosmological short gamma-ray burst afterglows to simulate the luminosity functions and color evolution of both kilonovae and optical afterglow emissions from binary neutron star (BNS) mergers. We find that ∼10% of the nearly-on-axis afterglows are brighter than the associated kilonovae at the peak time. These kilonovae would be significantly polluted by the associated afterglow emission. Only at large viewing angles with sinθv≳0.20 , the electromagnetic signals of most BNS mergers would be kilonova-dominated and some off-axis afterglows may emerge at ∼5–10 days after the mergers. At a brightness dimmer than ∼23–24 mag, according to their luminosity functions, the number of afterglows is much larger than that of kilonovae. Because the search depth of the present survey projects is <22 mag, the number of afterglow events that are detected via serendipitous observations would be much higher than that of kilonova events, consistent with the current observations. For the foreseeable survey projects (e.g., Mephisto, WFST, and LSST), whose search depths can reach ≳23–24 mag, the detection rate of kilonovae could have the same order of magnitude as afterglows. We also find that it may be difficult to use the fading rate in a single band to directly identify kilonovae and afterglows among various fast-evolving transients by serendipitous surveys. However, the color evolution between the optical and infrared bands can identify them because the color evolution patterns of these phenomena are unique compared with those of other fast-evolving transients.
What can be learnt from UHECR anisotropies observations. I. Large-scale anisotropies and composition features

We investigate the implications of the current data regarding large scale anisotropies, and examine to what extent they can be used to constrain the origin of UHECRs and the astrophysical parameters of the source scenarios. We discuss the possibility of observing an associated anisotropy of the composition, the potential benefit of the separation of the different nuclear components and the interest of observing the UHECR sky with larger exposure future observatories. We simulate UHECR sky maps for various astrophysical scenarios satisfying the current observational constraints, taking into account the energy losses of the UHE protons and nuclei and their deflections by intervening magnetic fields. We investigate scenarios in which the UHECR source distribution follows that of the galaxies, varying the source composition and spectrum, the source density and the magnetic field models. We apply similar analyses as those used by the Auger collaboration. We find that: i) reproducing the observed dipole anisotropy and its energy evolution is relatively easy within our assumptions; ii) this agreement can be obtained with different sets of assumptions on the astrophysical parameters, and is thus not, at this stage, very constraining for UHECR source scenarios; iii) the actual reconstructed direction of the dipole appears non natural in essentially all scenarios investigated, and challenges their main assumptions on the source distribution or the assumed magnetic field configuration, especially in the Galaxy; iv) except for protons, the energy range in which the GZK horizon strongly reduces is a key target for anisotropy searches for each given nuclear species; v) The composition anisotropy naturally expected in our models is unlikely to account for that recently reported by Auger unless the observed amplitude is a strong positive statistical fluctuation of an intrinsically weaker signal.
2022 roadmap on neuromorphic computing and engineering

Modern computation based on von Neumann architecture is now a mature cutting-edge science. In the von Neumann architecture, processing and memory units are implemented as separate blocks interchanging data intensively and continuously. This data transfer is responsible for a large part of the power consumption. The next generation computer technology is expected to solve problems at the exascale with 1018 calculations each second. Even though these future computers will be incredibly powerful, if they are based on von Neumann type architectures, they will consume between 20 and 30 megawatts of power and will not have intrinsic physically built-in capabilities to learn or deal with complex data as our brain does. These needs can be addressed by neuromorphic computing systems which are inspired by the biological concepts of the human brain. This new generation of computers has the potential to be used for the storage and processing of large amounts of digital information with much lower power consumption than conventional processors. Among their potential future applications, an important niche is moving the control from data centers to edge devices. The aim of this roadmap is to present a snapshot of the present state of neuromorphic technology and provide an opinion on the challenges and opportunities that the future holds in the major areas of neuromorphic technology, namely materials, devices, neuromorphic circuits, neuromorphic algorithms, applications, and ethics. The roadmap is a collection of perspectives where leading researchers in the neuromorphic community provide their own view about the current state and the future challenges for each research area. We hope that this roadmap will be a useful resource by providing a concise yet comprehensive introduction to readers outside this field, for those who are just entering the field, as well as providing future perspectives for those who are well established in the neuromorphic computing community.
Retarded kernels for longitudinal survival analysis and dynamic prediction

Predicting patient survival probabilities based on observed covariates is an important assessment in clinical practice. These patient-specific covariates are often measured over multiple follow-up appointments. It is then of interest to predict survival based on the history of these longitudinal measurements, and to update predictions as more observations become available. The standard approaches to these socalled ‘dynamic prediction’ assessments are joint models and landmark analysis. Joint models involve high-dimensional parameterisations, and their computational complexity often prohibits including multiple longitudinal covariates. Landmark analysis is simpler, but discards a proportion of the available data at each ‘landmark time’. In this work we propose a ‘retarded kernel’ approach to dynamic prediction that sits somewhere in between the two standard methods in terms of complexity. By conditioning hazard rates directly on the covariate measurements over the observation time frame, we define a model that takes into account the full history of covariate measurements but is more practical and parsimonious than joint modelling. Timedependent association kernels describe the impact of covariate changes at earlier times on the patient’s hazard rate at later times. Under the constraints that our model (i) reduces to the standard Cox model for time-independent covariates, and (ii) contains the instantaneous Cox model as a special case, we derive two natural kernel parameterisations. Upon application to three clinical data sets, we find that the predictive accuracy of the retarded kernel approach is comparable to that of the two existing standard methods.
Convolutional neural networks for shower energy prediction in liquid argon time projection chambers

When electrons with energies of O(100) MeV pass through a liquid argon time projection chamber (LArTPC), they deposit energy in the form of electromagnetic showers. Methods to reconstruct the energy of these showers in LArTPCs often rely on the combination of a clustering algorithm and a linear calibration between the shower energy and charge contained in the cluster. This reconstruction process could be improved through the use of a convolutional neural network (CNN). Here we discuss the performance of various CNN-based models on simulated LArTPC images, and then compare the best performing models to a typical linear calibration algorithm. We show that the CNN method is able to address inefficiencies caused by unresponsive wires in LArTPCs and reconstruct a larger fraction of imperfect events to within 5 % accuracy compared with the linear algorithm.
Deep Image Matting with Flexible Guidance Input

Image matting is an important computer vision problem. Many existing matting methods require a hand-made trimap to provide auxiliary information, which is very expensive and limits the real world usage. Recently, some trimap-free methods have been proposed, which completely get rid of any user input. However, their performance lag far behind trimap-based methods due to the lack of guidance information. In this paper, we propose a matting method that use Flexible Guidance Input as user hint, which means our method can use trimap, scribblemap or clickmap as guidance information or even work without any guidance input. To achieve this, we propose Progressive Trimap Deformation(PTD) scheme that gradually shrink the area of the foreground and background of the trimap with the training step increases and finally become a scribblemap. To make our network robust to any user scribble and click, we randomly sample points on foreground and background and perform curve fitting. Moreover, we propose Semantic Fusion Module(SFM) which utilize the Feature Pyramid Enhancement Module(FPEM) and Joint Pyramid Upsampling(JPU) in matting task for the first time. The experiments show that our method can achieve state-of-the-art results comparing with existing trimap-based and trimap-free methods.
Pixel-Level Face Image Quality Assessment for Explainable Face Recognition

In this work, we introduce the concept of pixel-level gface image quality that determines the utility of single pixels in a face image for recognition. We propose a training-free approach to assess the pixel-level qualities of a face image given an arbitrary face recognition network. To achieve this, a model-specific quality value of the input image is estimated and used to build a sample-specific quality regression model. Based on this model, quality-based gradients are back-propagated and converted into pixel-level quality estimates. In the experiments, we qualitatively and quantitatively investigated the meaningfulness of our proposed pixel-level qualities based on real and artificial disturbances and by comparing the explanation maps on faces incompliant with the ICAO standards. In all scenarios, the results demonstrate that the proposed solution produces meaningful pixel-level qualities enhancing the interpretability of the face image and its quality. The code is publicly available.