Miracle-dz/UniFAR-FTUs huggingface dataset:
Economic Policy Uncertainty: A Review on Applications and Measurement Methods with Focus on Text Mining Methods

Economic Policy Uncertainty (EPU) represents the uncertainty realized by the investors during economic policy alterations. EPU is a critical indicator in economic studies to predict future investments, the unemployment rate, and recessions. EPU values can be estimated based on financial parameters directly or implied uncertainty indirectly using the text mining methods. Although EPU is a well-studied topic within the economy, the methods utilized to measure it are understudied. In this article, we define the EPU briefly and review the methods used to measure the EPU, and survey the areas influenced by the changes in EPU level. We divide the EPU measurement methods into three major groups with respect to their input data. Examples of each group of methods are enlisted, and the pros and cons of the groups are discussed. Among the EPU measures, text mining-based ones are dominantly studied. These methods measure the realized uncertainty by taking into account the uncertainty represented in the news and publicly available sources of financial information. Finally, we survey the research areas that rely on measuring the EPU index with the hope that studying the impacts of uncertainty would attract further attention of researchers from various research fields. In addition, we propose a list of future research approaches focusing on measuring EPU using textual material.
Recap: Detecting Deepfake Video with Unpredictable Tampered Traces via Recovering Faces and Mapping Recovered Faces

The exploitation of Deepfake techniques for malicious intentions has driven significant research interest in Deepfake detection. Deepfake manipulations frequently introduce random tampered traces, leading to unpredictable outcomes in different facial regions. However, existing detection methods heavily rely on specific forgery indicators, and as the forgery mode improves, these traces become increasingly randomized, resulting in a decline in the detection performance of methods reliant on specific forgery traces. To address the limitation, we propose Recap, a novel Deepfake detection model that exposes unspecific facial part inconsistencies by recovering faces and enlarges the differences between real and fake by mapping recovered faces. In the recovering stage, the model focuses on randomly masking regions of interest (ROIs) and reconstructing real faces without unpredictable tampered traces, resulting in a relatively good recovery effect for real faces while a poor recovery effect for fake faces. In the mapping stage, the output of the recovery phase serves as supervision to guide the facial mapping process. This mapping process strategically emphasizes the mapping of fake faces with poor recovery, leading to a further deterioration in their representation, while enhancing and refining the mapping of real faces with good representation. As a result, this approach significantly amplifies the discrepancies between real and fake videos. Our extensive experiments on standard benchmarks demonstrate that Recap is effective in multiple scenarios.
Proximity-induced sequence of field transitions in Kitaev candidate BaCo$_2$(AsO$_4$)$_2$

We study field-induced phase transitions of the minimal exchange model proposed earlier for BaCo$_2$(AsO$_4$)$_2$, a candidate for Kitaev honeycomb model, using numerical minimization of classical spin clusters. We show that experimentally observed sequence of step-like transitions in magnetic field is realized in the phase diagram of the minimal model. Surprisingly, intermediate up-up-down plateau phase is stabilized only in the proximity of a double-zigzag$-$zigzag phase boundary. We systematically map out the region of stability of experimentally observed cascade of transitions and argue that BaCo$_2$(AsO$_4$)$_2$ exchange parameters are close to a region of strong phase competition, which can explain suppressed saturation field.
Learning Soft Robot Dynamics Using Differentiable Kalman Filters and Spatio-Temporal Embeddings

This paper introduces a novel approach for modeling the dynamics of soft robots, utilizing a differentiable filter architecture. The proposed approach enables end-to-end training to learn system dynamics, noise characteristics, and temporal behavior of the robot. A novel spatio-temporal embedding process is discussed to handle observations with varying sensor placements and sampling frequencies. The efficacy of this approach is demonstrated on a tensegrity robot arm by learning end-effector dynamics from demonstrations with complex bending motions. The model is proven to be robust against missing modalities, diverse sensor placement, and varying sampling rates. Additionally, the proposed framework is shown to identify physical interactions with humans during motion. The utilization of a differentiable filter presents a novel solution to the difficulties of modeling soft robot dynamics. Our approach shows substantial improvement in accuracy compared to state-of-the-art filtering methods, with at least a 24% reduction in mean absolute error (MAE) observed. Furthermore, the predicted end-effector positions show an average MAE of 25.77mm from the ground truth, highlighting the advantage of our approach. The code is available at https://github.com/ir-lab/soft_robot_DEnKF.
Cosmology from weak lensing peaks and minima with Subaru Hyper Suprime-Cam survey first-year data

We present cosmological constraints derived from peak counts, minimum counts, and the angular power spectrum of the Subaru Hyper Suprime-Cam first-year (HSC Y1) weak lensing shear catalog. Weak lensing peak and minimum counts contain non-Gaussian information and hence are complementary to the conventional two-point statistics in constraining cosmology. In this work, we forward-model the three summary statistics and their dependence on cosmology, using a suite of $N$-body simulations tailored to the HSC Y1 data. We investigate systematic and astrophysical effects including intrinsic alignments, baryon feedback, multiplicative bias, and photometric redshift uncertainties. We mitigate the impact of these systematics by applying cuts on angular scales, smoothing scales, statistic bins, and tomographic redshift bins. By combining peaks, minima, and the power spectrum, assuming a flat-$\Lambda$CDM model, we obtain $S_{8} \equiv \sigma_8\sqrt{\Omega_m/0.3}= 0.810^{+0.022}_{-0.026}$, a 35\% tighter constraint than that obtained from the angular power spectrum alone. Our results are in agreement with other studies using HSC weak lensing shear data, as well as with Planck 2018 cosmology and recent CMB lensing constraints from the Atacama Cosmology Telescope and the South Pole Telescope.
RT-MonoDepth: Real-time Monocular Depth Estimation on Embedded Systems

Depth sensing is a crucial function of unmanned aerial vehicles and autonomous vehicles. Due to the small size and simple structure of monocular cameras, there has been a growing interest in depth estimation from a single RGB image. However, state-of-the-art monocular CNN-based depth estimation methods using fairly complex deep neural networks are too slow for real-time inference on embedded platforms. This paper addresses the problem of real-time depth estimation on embedded systems. We propose two efficient and lightweight encoder-decoder network architectures, RT-MonoDepth and RT-MonoDepth-S, to reduce computational complexity and latency. Our methodologies demonstrate that it is possible to achieve similar accuracy as prior state-of-the-art works on depth estimation at a faster inference speed. Our proposed networks, RT-MonoDepth and RT-MonoDepth-S, runs at 18.4\&30.5 FPS on NVIDIA Jetson Nano and 253.0\&364.1 FPS on NVIDIA Jetson AGX Orin on a single RGB image of resolution 640$\times$192, and achieve relative state-of-the-art accuracy on the KITTI dataset. To the best of the authors' knowledge, this paper achieves the best accuracy and fastest inference speed compared with existing fast monocular depth estimation methods.
Cotinine concentrations in maternal serum and amniotic fluid during pregnancy and risk of testicular germ cell cancer in the offspring: A prospective nested case‐control study

Maternal smoking in pregnancy may increase the risk of testicular germ cell cancer (TGCC) in offspring, but current evidence remains inconclusive. We performed a nested case‐control study using cotinine measurements in maternal serum and amniotic fluid as a biomarker for tobacco exposure during pregnancy. A total of 654 males with maternal serum (n = 359, ncases/controls = 71/288) and/or amniotic fluid (n = 295, ncases/controls = 66/229) samples were included. Data on TGCC diagnoses and relevant covariates were derived from nationwide Danish health registries. Cotinine was quantified by liquid chromatography tandem mass spectrometry. An adapted cox regression model estimated the risk of TGCC considering active and inactive tobacco use defined according to cotinine concentrations of <, ≥15 ng/ml. Overall, the concentrations of cotinine were comparable in maternal serum and amniotic fluid (medianserum/amniotic fluid: 2.1/2.6 ng/ml). A strong statistically significant correlation was detected in 14 paired samples (Spearman rho: 0.85). Based on maternal serum cotinine concentrations, exposure to active tobacco use was not associated with risk of TGCC in offspring (HR 0.88, 95% CI 0.51; 1.52). Similarly, based on amniotic fluid cotinine concentrations, exposure to active tobacco use was not associated with risk of TGCC (HR 1.11, 95% CI 0.64; 1.95). However, different risks were observed for seminomas and nonseminomas in both matrices, but none were statistically significant. Our findings did not provide convincing evidence supporting that exposure to tobacco during pregnancy is associated with TGCC.
BAN-PL: a Novel Polish Dataset of Banned Harmful and Offensive Content from Wykop.pl web service

Since the Internet is flooded with hate, it is one of the main tasks for NLP experts to master automated online content moderation. However, advancements in this field require improved access to publicly available accurate and non-synthetic datasets of social media content. For the Polish language, such resources are very limited. In this paper, we address this gap by presenting a new open dataset of offensive social media content for the Polish language. The dataset comprises content from Wykop.pl, a popular online service often referred to as the"Polish Reddit", reported by users and banned in the internal moderation process. It contains a total of 691,662 posts and comments, evenly divided into two categories:"harmful"and"neutral"("non-harmful"). The anonymized subset of the BAN-PL dataset consisting on 24,000 pieces (12,000 for each class), along with preprocessing scripts have been made publicly available. Furthermore the paper offers valuable insights into real-life content moderation processes and delves into an analysis of linguistic features and content characteristics of the dataset. Moreover, a comprehensive anonymization procedure has been meticulously described and applied. The prevalent biases encountered in similar datasets, including post-moderation and pre-selection biases, are also discussed.
Monotone Symplectic Six-Manifolds that admit a Hamiltonian GKM Action are diffeomorphic to Smooth Fano Threefolds

Let $(M,\omega)$ be a compact symplectic manifold with a Hamiltonian GKM action of a compact torus. We formulate a positive condition on the space; this condition is satisfied if the underlying symplectic manifold is monotone. The main result of this article is that the underlying manifold of a positive Hamiltonian GKM space of dimension six is diffeomorphic to a smooth Fano threefold. We prove the main result in two steps. In the first step, we deduce from results of Goertsches, Konstantis, and Zoller that if the complexity of the action is zero or one then the equivariant and the ordinary cohomology with integer coefficients are determined by the GKM graph. This result, in combination with a classification result by Jupp, Wall and Zubr for certain six-manifolds, implies that the diffeomorphism type of a compact symplectic six-manifold with a Hamiltonian GKM action is determined by the associated GKM graph. In the second step, based on results by Godinho and Sabatini, we compute the complete list of the GKM graphs of positive Hamiltonian GKM spaces of dimension six. We deduce that any such GKM graph is isomorphic to a GKM graph of a smooth Fano threefold.
Inverse theorems for discretized sums and $L^q$ norms of convolutions in $\mathbb{R}^d$

We prove inverse theorems for the size of sumsets and the $L^q$ norms of convolutions in the discretized setting, extending to arbitrary dimension an earlier result of the author in the line. These results have applications to the dimensions of dynamical self-similar sets and measures, and to the higher dimensional fractal uncertainty principle. The proofs are based on a structure theorem for the entropy of convolution powers due to M. ~Hochman.
Can Large Language Models Find And Fix Vulnerable Software?

In this study, we evaluated the capability of Large Language Models (LLMs), particularly OpenAI's GPT-4, in detecting software vulnerabilities, comparing their performance against traditional static code analyzers like Snyk and Fortify. Our analysis covered numerous repositories, including those from NASA and the Department of Defense. GPT-4 identified approximately four times the vulnerabilities than its counterparts. Furthermore, it provided viable fixes for each vulnerability, demonstrating a low rate of false positives. Our tests encompassed 129 code samples across eight programming languages, revealing the highest vulnerabilities in PHP and JavaScript. GPT-4's code corrections led to a 90% reduction in vulnerabilities, requiring only an 11% increase in code lines. A critical insight was LLMs' ability to self-audit, suggesting fixes for their identified vulnerabilities and underscoring their precision. Future research should explore system-level vulnerabilities and integrate multiple static code analyzers for a holistic perspective on LLMs' potential.
Rethinking Client Drift in Federated Learning: A Logit Perspective

Federated Learning (FL) enables multiple clients to collaboratively learn in a distributed way, allowing for privacy protection. However, the real-world non-IID data will lead to client drift which degrades the performance of FL. Interestingly, we find that the difference in logits between the local and global models increases as the model is continuously updated, thus seriously deteriorating FL performance. This is mainly due to catastrophic forgetting caused by data heterogeneity between clients. To alleviate this problem, we propose a new algorithm, named FedCSD, a Class prototype Similarity Distillation in a federated framework to align the local and global models. FedCSD does not simply transfer global knowledge to local clients, as an undertrained global model cannot provide reliable knowledge, i.e., class similarity information, and its wrong soft labels will mislead the optimization of local models. Concretely, FedCSD introduces a class prototype similarity distillation to align the local logits with the refined global logits that are weighted by the similarity between local logits and the global prototype. To enhance the quality of global logits, FedCSD adopts an adaptive mask to filter out the terrible soft labels of the global models, thereby preventing them to mislead local optimization. Extensive experiments demonstrate the superiority of our method over the state-of-the-art federated learning approaches in various heterogeneous settings. The source code will be released.
Software Entity Recognition with Noise-Robust Learning

Recognizing software entities such as library names from free-form text is essential to enable many software engineering (SE) technologies, such as traceability link recovery, automated documentation, and API recommendation. While many approaches have been proposed to address this problem, they suffer from small entity vocabularies or noisy training data, hindering their ability to recognize software entities mentioned in sophisticated narratives. To address this challenge, we leverage the Wikipedia taxonomy to develop a comprehensive entity lexicon with 79K unique software entities in 12 fine-grained types, as well as a large labeled dataset of over 1.7M sentences. Then, we propose self-regularization, a noise-robust learning approach, to the training of our software entity recognition (SER) model by accounting for many dropouts. Results show that models trained with self-regularization outperform both their vanilla counterparts and state-of-the-art approaches on our Wikipedia benchmark and two Stack Overflow benchmarks. We release our models11https://huggingface.co/taidng/wikiser-bert-base; https. //huggingface.co/taidng/wikiser-bert-large. , data, and code for future research.22https://github.com/taidnguyen/software_entity_recognition
Proper Minor-Closed Classes of Graphs have Assouad-Nagata Dimension 2

Asymptotic dimension and Assouad-Nagata dimension are measures of the large-scale shape of a class of graphs. Bonamy et al. [J. Eur. Math. Society] showed that any proper minor-closed class has asymptotic dimension 2, dropping to 1 only if the treewidth is bounded. We improve this result by showing it also holds for the stricter Assouad-Nagata dimension. We also characterise when subdivision-closed classes of graphs have bounded Assouad-Nagata dimension.
SpikingBERT: Distilling BERT to Train Spiking Language Models Using Implicit Differentiation

Large language Models (LLMs), though growing exceedingly powerful, comprises of orders of magnitude less neurons and synapses than the human brain. However, it requires significantly more power/energy to operate. In this work, we propose a novel bio-inspired spiking language model (LM) which aims to reduce the computational cost of conventional LMs by drawing motivation from the synaptic information flow in the brain. In this paper, we demonstrate a framework that leverages the average spiking rate of neurons at equilibrium to train a neuromorphic spiking LM using implicit differentiation technique, thereby overcoming the non-differentiability problem of spiking neural network (SNN) based algorithms without using any type of surrogate gradient. The steady-state convergence of the spiking neurons also allows us to design a spiking attention mechanism, which is critical in developing a scalable spiking LM. Moreover, the convergence of average spiking rate of neurons at equilibrium is utilized to develop a novel ANN-SNN knowledge distillation based technique wherein we use a pre-trained BERT model as “teacher” to train our “student” spiking architecture. While the primary architecture proposed in this paper is motivated by BERT, the technique can be potentially extended to different kinds of LLMs. Our work is the first one to demonstrate the performance of an operational spiking LM architecture on multiple different tasks in the GLUE benchmark. Our implementation source code is available at https://github.com/NeuroCompLab-psu/SpikingBERT.
Efficient Real-time Path Planning with Self-evolving Particle Swarm Optimization in Dynamic Scenarios

Particle Swarm Optimization (PSO) has demonstrated efficacy in addressing static path planning problems. Nevertheless, such application on dynamic scenarios has been severely precluded by PSO's low computational efficiency and premature convergence downsides. To address these limitations, we proposed a Tensor Operation Form (TOF) that converts particle-wise manipulations to tensor operations, thereby enhancing computational efficiency. Harnessing the computational advantage of TOF, a variant of PSO, designated as Self-Evolving Particle Swarm Optimization (SEPSO) was developed. The SEPSO is underpinned by a novel Hierarchical Self-Evolving Framework (HSEF) that enables autonomous optimization of its own hyper-parameters to evade premature convergence. Additionally, a Priori Initialization (PI) mechanism and an Auto Truncation (AT) mechanism that substantially elevates the real-time performance of SEPSO on dynamic path planning problems were introduced. Comprehensive experiments on four widely used benchmark optimization functions have been initially conducted to corroborate the validity of SEPSO. Following this, a dynamic simulation environment that encompasses moving start/target points and dynamic/static obstacles was employed to assess the effectiveness of SEPSO on the dynamic path planning problem. Simulation results exhibit that the proposed SEPSO is capable of generating superior paths with considerably better real-time performance (67 path planning computations per second in a regular desktop computer) in contrast to alternative methods. The code and video of this paper can be accessed here.
AutoReP: Automatic ReLU Replacement for Fast Private Network Inference

The growth of the Machine-Learning-As-A-Service (MLaaS) market has highlighted clients’ data privacy and security issues. Private inference (PI) techniques using cryptographic primitives offer a solution but often have high computation and communication costs, particularly with non-linear operators like ReLU. Many attempts to reduce ReLU operations exist, but they may need heuristic threshold selection or cause substantial accuracy loss. This work introduces AutoReP, a gradient-based approach to lessen non-linear operators and alleviate these issues. It automates the selection of ReLU and polynomial functions to speed up PI applications and introduces distribution-aware polynomial approximation (DaPa) to maintain model expressivity while accurately approximating ReLUs. Our experimental results demonstrate significant accuracy improvements of 6.12% (94.31%, 12.9K ReLU budget, CIFAR-10), 8.39% (74.92%, 12.9K ReLU budget, CIFAR-100), and 9.45% (63.69%, 55K ReLU budget, Tiny-ImageNet) over current state-of-the-art methods, e.g., SNL. Morever, AutoReP is applied to EfficientNet-B2 on ImageNet dataset, and achieved 75.55% accuracy with 176.1 × ReLU budget reduction. The codes are shared on Github1.
Hand Dominance and Congruence for Wrist-Worn Haptics Using Custom Voice-Coil Actuation

During virtual interactions, rendering haptic feedback on a remote location (like the wrist) instead of the fingertips frees users' hands from mechanical devices. This allows for real interactions while still providing information about the mechanical properties of virtual objects. In this letter, we investigate the impact of using the dominant or non-dominant hand for virtual interactions and the best mapping between the active hand and the wrist receiving the haptic feedback, which can be defined as hand-wrist congruence through a user experiment based on a stiffness discrimination task. To render force feedback, we present CoWrHap – a novel wrist-worn haptic device with custom-made voice coil actuation. Our results show that participants performed the tasks (i) better with non-congruent mapping but reported better experiences with congruent mapping, and (ii) with no statistical difference in terms of hand dominance but with better user experience (enjoyment, pleasantness, etc.) using their dominant hands.