Miracle-dz/UniFAR-FTUs huggingface dataset:
Plant 'n' Seek: Can You Find the Winning Ticket?

The lottery ticket hypothesis has sparked the rapid development of pruning algorithms that aim to reduce the computational costs associated with deep learning during training and model deployment. Currently, such algorithms are primarily evaluated on imaging data, for which we lack ground truth information and thus the understanding of how sparse lottery tickets could be. To fill this gap, we develop a framework that allows us to plant and hide winning tickets with desirable properties in randomly initialized neural networks. To analyze the ability of state-of-the-art pruning to identify tickets of extreme sparsity, we design and hide such tickets solving four challenging tasks. In extensive experiments, we observe similar trends as in imaging studies, indicating that our framework can provide transferable insights into realistic problems. Additionally, we can now see beyond such relative trends and highlight limitations of current pruning methods. Based on our results, we conclude that the current limitations in ticket sparsity are likely of algorithmic rather than fundamental nature. We anticipate that comparisons to planted tickets will facilitate future developments of efficient pruning algorithms.
Namesakes: Ambiguously Named Entities from Wikipedia and News

We present Namesakes, a dataset of ambiguously named entities obtained from English-language Wikipedia and news articles. It consists of 58862 mentions of 4148 unique entities and their namesakes: 1000 mentions from news, 28843 from Wikipedia articles about the entity, and 29019 Wikipedia backlink mentions. Namesakes should be helpful in establishing challenging benchmarks for the task of named entity linking (NEL).
Model-Based Single Image Deep Dehazing

Model-based single image dehazing algorithms restore images with sharp edges and rich details at the expense of low PSNR values. Data-driven ones restore images with high PSNR values but with low contrast, and even some remaining haze. In this paper, a novel single image de-hazing algorithm is introduced by fusing model-based and data-driven approaches. Both transmission map and atmospheric light are initialized by the model-based methods, and reﬁned by deep learning approaches which form a neural augmentation. Haze-free images are restored by using the transmission map and atmospheric light. Experimental results indicate that the proposed algorithm can remove haze well from real-world and synthetic hazy images.
Theoretically and Practically Efficient Parallel Nucleus Decomposition

This paper studies the nucleus decomposition problem, which has been shown to be useful in finding dense substructures in graphs. We present a novel parallel algorithm that is efficient both in theory and in practice. Our algorithm achieves a work complexity matching the best sequential algorithm while also having low depth (parallel running time), which significantly improves upon the only existing parallel nucleus decomposition algorithm (Sariyüce et al. , PVLDB 2018). The key to the theoretical efficiency of our algorithm is a new lemma that bounds the amount of work done when peeling cliques from the graph, combined with the use of a theoretically-efficient parallel algorithms for clique listing and bucketing. We introduce several new practical optimizations, including a new multi-level hash table structure to store information on cliques space-efficiently and a technique for traversing this structure cache-efficiently. On a 30-core machine with two-way hyper-threading on real-world graphs, we achieve up to a 55x speedup over the state-of-the-art parallel nucleus decomposition algorithm by Sariyüce et al. , and up to a 40x self-relative parallel speedup. We are able to efficiently compute larger nucleus decompositions than prior work on several million-scale graphs for the first time.
RDF-to-Text Generation with Reinforcement Learning Based Graph-augmented Structural Neural Encoders

Considering a collection of RDF triples, the RDF-to-text generation task aims to generate a text description. Most previous methods solve this task using a sequence-to-sequence model or using a graph-based model to encode RDF triples and to generate a text sequence. Nevertheless, these approaches fail to clearly model the local and global structural information between and within RDF triples. Moreover, the previous methods also face the non-negligible problem of low faithfulness of the generated text, which seriously affects the overall performance of these models. To solve these problems, we propose a model combining two new graph-augmented structural neural encoders to jointly learn both local and global structural information in the input RDF triples. To further improve text faithfulness, we innovatively introduce a reinforcement learning (RL) reward based on information extraction (IE). We first extract triples from the generated text using a pretrained IE model and regard the correct number of the extracted triples as the additional RL reward. Experimental results on two benchmark datasets demonstrate that our proposed model outperforms the state-of-the-art baselines, and the additional reinforcement learning reward does help to improve the faithfulness of the generated text.
Molecular dynamics analysis of biomolecular systems including nucleic acids

With the recent progress in structural biology and genome biology, structural dynamics of molecular systems that include nucleic acids has attracted attention in the context of gene regulation. The structure–function relationship is an important topic that highlights the importance of the physicochemical properties of nucleotides, as well as that of amino acids in proteins. Simulations are a useful tool for the detailed analysis of molecular dynamics that complement experiments in molecular biology; however, molecular simulation of nucleic acids is less well developed than that of proteins partly due to the physical nature of nucleic acids. In this review, we briefly describe the current status and future directions of the field as a guide to promote collaboration between experimentalists and computational biologists.
Joint Alignment and Reconstruction of Multislice Dynamic MRI Using Variational Manifold Learning

Free-breathing cardiac MRI schemes are emerging as competitive alternatives to breath-held cine MRI protocols, enabling applicability to pediatric and other population groups that cannot hold their breath. Because the data from the slices are acquired sequentially, the cardiac/respiratory motion patterns may be different for each slice; current free-breathing approaches perform independent recovery of each slice. In addition to not being able to exploit the inter-slice redundancies, manual intervention or sophisticated post-processing methods are needed to align the images post-recovery for quantification. To overcome these challenges, we propose an unsupervised variational deep manifold learning scheme for the joint alignment and reconstruction of multislice dynamic MRI. The proposed scheme jointly learns the parameters of the deep network as well as the latent vectors for each slice, which capture the motion-induced dynamic variations, from the k-t space data of the specific subject. The variational framework minimizes the non-uniqueness in the representation, thus offering improved alignment and reconstructions.
MidNet: An Anchor-and-Angle-Free Detector for Oriented Ship Detection in Aerial Images

Ship detection in aerial images remains an active yet challenging task due to its arbitrary object orientation and various aspect ratios from the bird’s-eye perspective. Most existing oriented objection detection methods rely on angular prediction or predefined anchor boxes, making these methods highly sensitive to unstable angular regression and excessive hyperparameter setting. To address these issues, we replace the angular-based object encoding with an anchor-and-angle-free paradigm and propose a novel detector deploying a center and four midpoints for encoding each oriented object, namely, MidNet. Moreover, MidNet designs a novel symmetrical deformable convolution for enhancing the features of midpoints; then, the center and midpoints for an identical ship are adaptively matched by predicting corresponding centripetal shift and matching radius. Finally, a concise analytical geometry algorithm is proposed to calculate the ship orientation and refine the keypoints stepwisely for building precise oriented bounding boxes. On two public ship detection datasets, HRSC2016 and FGSD2021, MidNet outperforms the state-of-the-art detectors by achieving APs of 90.52% and 86.50%.
Multi-modal Transformers Excel at Class-agnostic Object Detection

pairs. Our extensive experiments across various domains and novel objects show the state-of-the-art performance of MViTs to localize generic objects in images. Based on these ﬁndings, we develop an efﬁcient and ﬂexible MViT architecture using multi-scale feature processing and deformable self-attention that can adaptively generate proposals given a speciﬁc language query. We show the signiﬁcance of MViT proposals in a diverse range of applications including open-world object detection, salient and camouﬂage object detection, supervised and self-supervised detection tasks. Further, MViTs offer enhanced interactability with intelligible text queries. Code: https://git.io/J1HPY .
Explainable Software Defect Prediction: Are We There Yet?

Explaining the prediction results of software defect prediction models is a challenging while practical task, which can provide useful information for developers to understand and fix the predicted bugs. To address this issue, recently, Jiarpakdee et al. proposed to use {two state-of-the-art} model-agnostic techniques (i.e., LIME and BreakDown) to explain the prediction results of bug prediction models. Their experiments show these tools can generate promising results and the generated explanations can assist developers understand the prediction results. However, the fact that LIME and BreakDown were only examined on a single software defect prediction model setting calls into question about their consistency and reliability across software defect prediction models with various settings. In this paper, we set out to investigate the consistency and reliability of model-agnostic technique based explanation generation approaches (i.e., LIME and BreakDown) on software defect prediction models with different settings , e.g., different data sampling techniques, different machine learning classifiers, and different prediction scenarios. Specifically, we use both LIME and BreakDown to generate explanations for the same instance under software defect prediction models with different settings and then check the consistency of the generated explanations for the instance. We reused the same defect data from Jiarpakdee et al. in our experiments. The results show that both LIME and BreakDown generate inconsistent explanations under different software defect prediction settings for the same test instances, which makes them unreliable for explanation generation. Overall, with this study, we call for more research in explainable software defect prediction towards achieving consistent and reliable explanation generation.
A User Centric Blockage Model for Wireless Networks

This paper proposes a cascade blockage model for analyzing the vision that a user has of a wireless network. This model, inspired by the classical multiplicative cascade models, has a radial structure meant to analyze blockages seen by the receiver at the origin in different angular sectors. The main novelty is that it is based on the geometry of obstacles and takes the joint blockage phenomenon into account. We show on a couple of simple instances that the Laplace transforms of total interference satisfies a functional equation that can be solved efficiently by an iterative scheme. This is used to analyze the coverage probability of the receiver and the effect of blockage correlation and penetration loss in both dense and sparse blockage environments. Furthermore, this model is used to investigate the effect of blockage correlation on user beamforming techniques. Another functional equation and its associated iterative algorithm are proposed to derive the coverage performance of the best beam selection in this context. In addition, the conditional coverage probability is also derived to evaluate the effect of beam switching. The results not only show that beam selection is quite efficient for multi-beam terminals, but also show how the correlation brought by blockages can be leveraged to accelerate beam sweeping and pairing.
Longitudinally Asymmetric Stratospheric Oscillation on a Tidally Locked Exoplanet

Using a three-dimensional general circulation model, we show that the atmospheric dynamics on a tidally locked Earth-like exoplanet, simulated with the planetary and orbital parameters of Proxima Centauri b, support a longitudinally asymmetric stratospheric wind oscillation (LASO), analogous to Earth’s quasi-biennial oscillation (QBO). In our simulations, the LASO has a vertical extent of 35–55 km, a period of 5–6.5 months, and a peak-to-peak wind speed amplitude of −70 to +130 m s−1 with a maximum at an altitude of 41 km. Unlike the QBO, the LASO displays longitudinal asymmetries related to the asymmetric thermal forcing of the planet and to interactions with the resulting stationary Rossby waves. The equatorial gravity wave sources driving the LASO are localized in the deep convection region at the substellar point and in a jet exit region near the western terminator, unlike the QBO, for which these sources are distributed uniformly around the planet. Longitudinally, the western terminator experiences the highest wind speeds and undergoes reversals earlier than other longitudes. The antistellar point only experiences a weak oscillation with a very brief, low-speed westward phase. The QBO on Earth is associated with fluctuations in the abundances of water vapor and trace gases such as ozone, which are also likely to occur on exoplanets if these gases are present. Strong fluctuations in temperature and the abundances of atmospheric species at the terminators will need to be considered when interpreting atmospheric observations of tidally locked exoplanets.
Feature extraction of machine learning and phase transition point of Ising model

We study the features extracted by the Restricted Boltzmann Machine (RBM) when it is trained with spin configurations of Ising model at various temperatures. Using the trained RBM, we obtain the flow of iterative reconstructions (RBM flow) of the spin configurations and find that in some cases the flow approaches the phase transition point $T=T_c$ in Ising model. Since the extracted features are emphasized in the reconstructed configurations, the configurations at such a fixed point should describe nothing but the extracted features. Then we investigate the dependence of the fixed point on various parameters and conjecture the condition where the fixed point of the RBM flow is at the phase transition point. We also provide supporting evidence for the conjecture by analyzing the weight matrix of the trained RBM.
Data Excellence for AI: Why Should You Care

The efficacy of machine learning (ML) models depends on both algorithms and data. Training data defines what we want our models to learn, and testing data provides the means by which their empirical progress is measured. Benchmark datasets define the entire world within which models exist and operate, yet research continues to focus on critiquing and improving the algorithmic aspect of the models rather than critiquing and improving the data with which our models operate. If"data is the new oil,"we are still missing work on the refineries by which the data itself could be optimized for more effective use.
Community-Detection via Hashtag-Graphs for Semi-Supervised NMF Topic Models

Extracting topics from large collections of unstructured text-documents has become a central task in current NLP applications and algorithms like NMF, LDA as well as their generalizations are the well-established current state of the art. However, especially when it comes to short text documents like Tweets, these approaches often lead to unsatisfying results due to the sparsity of the document-feature matrices. Even though, several approaches have been proposed to overcome this sparsity by taking additional information into account, these are merely focused on the aggregation of similar documents and the estimation of word-co-occurrences. This ultimately completely neglects the fact that a lot of topical-information can be actually retrieved from so-called hashtag-graphs by applying common community detection algorithms. Therefore, this paper outlines a novel approach on how to integrate topic structures of hashtag graphs into the estimation of topic models by connecting graph-based community detection and semi-supervised NMF. By applying this approach on recently streamed Twitter data it will be seen that this procedure actually leads to more intuitive and humanly interpretable topics.
VideoPose: Estimating 6D object pose from videos

We introduce a simple yet effective algorithm that uses convolutional neural networks to directly estimate object poses from videos. Our approach leverages the temporal information from a video sequence, and is computationally efficient and robust to support robotic and AR domains. Our proposed network takes a pre-trained 2D object detector as input, and aggregates visual features through a recurrent neural network to make predictions at each frame. Experimental evaluation on the YCB-Video dataset show that our approach is on par with the state-of-the-art algorithms. Further, with a speed of 30 fps, it is also more efficient than the state-of-the-art, and therefore applicable to a variety of applications that require real-time object pose estimation.
Closures for multicomponent reacting flows based on dispersion analysis

This work presents algebraic closure models associated with advective transport and nonlinear reactions in a Reynolds-averaged Navier-Stokes context for a system of species subject to binary reactions and transport by advection and diffusion. Expanding upon analysis originally developed for non-reactive transport in the context of Taylor dispersion of scalars, this work extends the modified gradient diffusion model explicated by Peters (Turbulent Combustion, 2000) and based on work by Corrsin (JFM, vol. 11, p.407-416) beyond single-component transport phenomena and involving nonlinear reactions. The presented model forms, from this weakly-nonlinear extension of the original dispersion theory, lead to an analytic expression for the eddy diffusivity matrix that explicitly captures the influence of the reaction kinetics on the closure operators. Furthermore, we demonstrate that the derived model form directly translates between flow topologies through a priori and a posteriori testing of a binary species system subject to homogeneous isotropic turbulence. Using twoand three-dimensional direct numerical simulations involving laminar and turbulent flows, it is shown that this framework improves prediction of mean quantities compared to previous results. Lastly, the presented model form, collapses to the earlier gradient diffusion and its modified version derived by Corrsin in the limits of non-reactive species and linear reactions, respectively.
Plan Better Amid Conservatism: Offline Multi-Agent Reinforcement Learning with Actor Rectification

Conservatism has led to significant progress in offline reinforcement learning (RL) where an agent learns from pre-collected datasets. However, as many real-world scenarios involve interaction among multiple agents, it is important to resolve offline RL in the multi-agent setting. Given the recent success of transferring online RL algorithms to the multi-agent setting, one may expect that offline RL algorithms will also transfer to multi-agent settings directly. Surprisingly, we empirically observe that conservative offline RL algorithms do not work well in the multi-agent setting -- the performance degrades significantly with an increasing number of agents. Towards mitigating the degradation, we identify a key issue that non-concavity of the value function makes the policy gradient improvements prone to local optima. Multiple agents exacerbate the problem severely, since the suboptimal policy by any agent can lead to uncoordinated global failure. Following this intuition, we propose a simple yet effective method, Offline Multi-Agent RL with Actor Rectification (OMAR), which combines the first-order policy gradients and zeroth-order optimization methods to better optimize the conservative value functions over the actor parameters. Despite the simplicity, OMAR achieves state-of-the-art results in a variety of multi-agent control tasks.
Flow sensing and energy harvesting characteristics of a wind-driven piezoelectric Pb(Zr0.52, Ti0.48)O 3 microcantilever

Wind flow regarded as a renewable energy source is present everywhere in indoor or open environments. A self-sustained flow-sensing microsystem is especially desirable in future applications of smart home, remote sensing and environmental monitoring. Piezoelectric thin films are commonly adopted in microenergy harvesters for converting the mechanical strain into an electrical charge based on the piezoelectric effect. It is also a promising candidate for flow sensors because of its passive nature, that is, the detectable output charge is a function of flow rate. The aim of this reported work has been to investigate the flow sensing and energy harvesting capabilities of a flexible piezoelectric Pb(Zr0.52, Ti0.48)O3 (PZT) microcantilever under wind flow. A self-sustained flow-sensing microsystem is possible by integrating the arrays of PZT microcantilevers, which measure the flow rate of ambient wind by one microcantilever and scavenge wind-flow energy as a power source by the rest.
Domain Page-Table Isolation

Modern applications often consist of different security domains that require isolation from each other. While several solutions exist, most of them rely on specialized hardware, hardware extensions, or require less-efficient software instrumentation of the application. In this paper, we propose Domain Page-Table Isolation (DPTI), a novel mechanism for hardware-enforced security domains that can be readily used on commodity off-the-shelf CPUs. DPTI uses two novel techniques for dynamic, time-limited changes to the memory isolation at security-critical points, called memory freezing and stashing. We demonstrate the versatility and efficacy of DPTI in two scenarios: First, DPTI freezes or stashes memory to support faster and more fine-grained syscall filtering than state-of-the-art seccomp-bpf. With the provided memory safety guarantees, DPTI can even securely support deep argument filtering, such as string comparisons. Second, DPTI freezes or stashes memory to efficiently confine potentially untrusted SGX enclaves, outperforming existing solutions by 14.6%-22% while providing the same security guarantees. Our results show that DPTI is a viable mechanism to isolate domains within applications using only existing mechanisms available on modern CPUs, without relying on special hardware instructions or extensions