Miracle-dz/UniFAR-FTUs huggingface dataset:
A Tool to Predict Coercivity in Magnetic Materials

Magnetic coercivity is often viewed to be lower in alloys with negligible (or zero) values of the anisotropy constant. However, this explains little about the dramatic drop in coercivity in FeNi alloys at a non-zero anisotropy value. Here, we develop a theoretical and computational tool to investigate the fundamental interplay between material constants that govern coercivity in bulk magnetic alloys. The two distinguishing features of our coercivity tool are that: (a) we introduce a large localized disturbance, such as a spike-like magnetic domain, that provides a nucleation barrier for magnetization reversal; and (b) we account for magneto-elastic energy -- however small -- in addition to the anisotropy and magnetostatic energy terms. We apply this coercivity tool to show that the interactions between local instabilities and material constants, such as anisotropy and magnetostriction constants, are key factors that govern magnetic coercivity in bulk alloys. Using our model, we show that coercivity is minimum at the permalloy composition (Fe-21.5Ni-78.5) at which the alloy's anisotropy constant is not zero. We systematically vary the values of the anisotropy and magnetostriction constants, around the permalloy composition, and identify new combinations of material constants at which coercivity is small. More broadly, our coercivity tool provides a theoretical framework to potentially discover novel magnetic materials with low coercivity.
Efficient Exploration for Model-based Reinforcement Learning with Continuous States and Actions

Balancing exploration and exploitation is crucial in reinforcement learning (RL). In this paper, we study the model-based posterior sampling algorithm in continuous state-action spaces theoretically and empirically. First, we improve the regret bound: with the assumption that reward and transition functions can be modeled as Gaussian Processes with linear kernels, we develop a Bayesian regret bound of $\tilde{O}(H^{3/2}d\sqrt{T})$, where $H$ is the episode length, $d$ is the dimension of the state-action space, and $T$ indicates the total time steps. Our bound can be extended to nonlinear cases as well: using linear kernels on the feature representation $\phi$, the Bayesian regret bound becomes $\tilde{O}(H^{3/2}d_{\phi}\sqrt{T})$, where $d_\phi$ is the dimension of the representation space. Moreover, we present MPC-PSRL, a model-based posterior sampling algorithm with model predictive control for action selection. To capture the uncertainty in models and realize posterior sampling, we use Bayesian linear regression on the penultimate layer (the feature representation layer $\phi$) of neural networks. Empirical results show that our algorithm achieves the best sample efficiency in benchmark control tasks compared to prior model-based algorithms, and matches the asymptotic performance of model-free algorithms.
Efficient CNN-LSTM based Image Captioning using Neural Network Compression

Modern Neural Networks are eminent in achieving state of the art performance on tasks under Computer Vision, Natural Language Processing and related verticals. However, they are notorious for their voracious memory and compute appetite which further obstructs their deployment on resource limited edge devices. In order to achieve edge deployment, researchers have developed pruning and quantization algorithms to compress such networks without compromising their efficacy. Such compression algorithms are broadly experimented on standalone CNN and RNN architectures while in this work, we present an unconventional end to end compression pipeline of a CNN-LSTM based Image Captioning model. The model is trained using VGG16 or ResNet50 as an encoder and an LSTM decoder on the flickr8k dataset. We then examine the effects of different compression architectures on the model and design a compression architecture that achieves a 73.1% reduction in model size, 71.3% reduction in inference time and a 7.7% increase in BLEU score as compared to its uncompressed counterpart.
Understanding the Impacts of Stellar Companions on Planet Formation and Evolution: A Survey of Stellar and Planetary Companions within 25 pc

We explore the impact of outer stellar companions on the occurrence rate of giant planets detected with radial velocities. We searched for stellar and planetary companions to a volume-limited sample of solar-type stars within 25 pc. Using adaptive optics imaging observations from the Lick 3 m and Palomar 200″ Telescopes, we characterized the multiplicity of our sample stars, down to the bottom of the main sequence. With these data, we confirm field star multiplicity statistics from previous surveys. We additionally combined three decades of radial velocity (RV) data from the California Planet Search with newly collected RV data from Keck/HIRES and the Automated Planet Finder/Levy Spectrometer to search for planetary companions in these same systems. Using an updated catalog of both stellar and planetary companions, as well as detailed injection/recovery tests to determine our sensitivity and completeness, we measured the occurrence rate of planets among the single- and multiple-star systems. We found that planets with masses in the range of 0.1–10 M J and with semimajor axes of 0.1–10 au have an occurrence rate of planets per star when they orbit single stars and an occurrence rate of 0.12 ± 0.04 planets per star when they orbit a star in a binary system. Breaking the sample down by the binary separation, we found that only one planet-hosting binary system had a binary separation <100 au, and none had a separation <50 au. These numbers yielded planet occurrence rates of planets per star for binaries with separation a B > 100 au and planets per star for binaries with separation a B < 100 au. The similarity in the planet occurrence rate around single stars and wide primaries implies that wide binary systems should actually host more planets than single-star systems, since they have more potential host stars. We estimated a system-wide planet occurrence rate of 0.3 planets per wide binary system for binaries with separations a B > 100 au. Finally, we found evidence that giant planets in binary systems have a different semimajor-axis distribution than their counterparts in single-star systems. The planets in the single-star sample had a significantly higher occurrence rate outside of 1 au than inside 1 au by nearly 4σ, in line with expectations that giant planets are most common near the snow line. However, the planets in the wide binary systems did not follow this distribution, but rather had equivalent occurrence rates interior and exterior to 1 au. This may point to binary-mediated planet migration acting on our sample, even in binaries wider than 100 au.
Revisit 1D Total Variation restoration problem with new real-time algorithms for signal and hyper-parameter estimations.

1D Total Variation (TV) denoising, considering the data fidelity and the Total Variation (TV) regularization, proposes a good restored signal preserving shape edges. The main issue is how to choose the weight $\lambda$ balancing those two terms. In practice, this parameter is selected by assessing a list of candidates (e.g. cross validation), which is inappropriate for the real time application. In this work, we revisit 1D Total Variation restoration algorithm proposed by Tibshirani and Taylor. A heuristic method is integrated for estimating a good choice of $\lambda$ based on the extremums number of restored signal. We propose an offline version of restoration algorithm in O(n log n) as well as its online implementation in O(n). Combining the rapid algorithm and the automatic choice of $\lambda$, we propose a real-time automatic denoising algorithm, providing a large application fields. The simulations show that our proposition of $\lambda$ has a similar performance as the states of the art.
Alignment of helical nanofilaments on the surfaces of various self-assembled monolayers

We successfully prepared controlled layers of NOBOW molecules on a variety of self-assembled monolayers (SAMs) such that the layers formed oriented domain structures in which the complex chiral/polar crystalline helical nanofilaments (HNFs) were arranged to form a B4 bent-core liquid crystal (LC) phase. The alignment of the B2 phase, which formed at a higher temperature than the B4 phase, affected the direction of the HNFs. The HNFs formed on the B2 smectic layers and were aligned parallel or perpendicular, respectively, to the substrates with high or low surface energies (molecule-philic or -phobic SAM-treated substrates). The HNFs confined within rectangular microchannels modified by the SAMs were directly visualized by electron microscopy and X-ray diffraction studies. The orientations of the HNFs were found to be governed by the B2 smectic layer morphology.
Image-Based Jet Analysis

Image-based jet analysis is built upon the jet image representation of jets that enables a direct connection between high energy physics and the fields of computer vision and deep learning. Through this connection, a wide array of new jet analysis techniques have emerged. In this text, we survey jet image based classification models, built primarily on the use of convolutional neural networks, examine the methods to understand what these models have learned and what is their sensitivity to uncertainties, and review the recent successes in moving these models from phenomenological studies to real world application on experiments at the LHC. Beyond jet classification, several other applications of jet image based techniques, including energy estimation, pileup noise reduction, data generation, and anomaly detection, are discussed.
Investigating surface stress: Surface loss in ultrathin single-crystal silicon cantilevers

We investigated the effect of surface treatment in an ultrahigh-vacuum chamber on the Q factor of ultrathin single-crystal silicon cantilevers with different thicknesses (60, 170, and 500 nm) and different surface orientations. When the length is L>30 μm, the Q factor is proportional to the thickness and surface loss dominates, whereas when L<30 μm, support loss surpasses the surface loss. Heating can remove the SiO2 layer and absorbates and results in an increase of the Q factor. Hydrogen termination leads to a larger relative increase of the Q factor in thinner structures than in thicker ones. Heating and H exposure improve the Q values of Si(100)-oriented cantilevers more than Si(110)-oriented ones, and they result in the opposing resonance frequency response for these two surfaces.
Transfer Learning Through Weighted Loss Function and Group Normalization for Vessel Segmentation from Retinal Images

The vascular structure of blood vessels is important in diagnosing retinal conditions such as glaucoma and diabetic retinopathy. Accurate segmentation of these vessels can help in detecting retinal objects such as the optic disc and optic cup and hence determine if there are damages to these areas. Moreover, the structure of the vessels can help in diagnosing glaucoma. The rapid development of digital imaging and computer-vision techniques has increased the potential for developing approaches for segmenting retinal vessels. In this paper, we propose an approach for segmenting retinal vessels that uses deep learning along with transfer learning. We adapted the U-Net structure to use a customized Inception V3 as the encoder and used multiple skip connections to form the decoder. Moreover, we used a weighted loss function to handle the issue of class imbalance in retinal images. Furthermore, we contributed a new dataset to this field. We tested our approach on six publicly available datasets and a newly created dataset. We achieved an average accuracy of 95.60 % and a Dice coefficient of 80.98 %. The results obtained from comprehensive experiments demonstrate the robustness of our approach to the segmentation of blood vessels in retinal images obtained from different sources. Our approach results in greater segmentation accuracy than other approaches.
FG-Net: Fast Large-Scale LiDAR Point CloudsUnderstanding Network Leveraging CorrelatedFeature Mining and Geometric-Aware Modelling

This work presents FG-Net, a general deep learning framework for large-scale point clouds understanding without voxelizations, which achieves accurate and real-time performance with a single NVIDIA GTX 1080 GPU. First, a novel noise and outlier filtering method is designed to facilitate subsequent high-level tasks. For effective understanding purpose, we propose a deep convolutional neural network leveraging correlated feature mining and deformable convolution based geometric-aware modelling, in which the local feature relationships and geometric patterns can be fully exploited. For the efficiency issue, we put forward an inverse density sampling operation and a feature pyramid based residual learning strategy to save the computational cost and memory consumption respectively. Extensive experiments on real-world challenging datasets demonstrated that our approaches outperform state-of-the-art approaches in terms of accuracy and efficiency. Moreover, weakly supervised transfer learning is also conducted to demonstrate the generalization capacity of our method.
The Mind Is a Powerful Place: How Showing Code Comprehensibility Metrics Influences Code Understanding

Static code analysis tools and integrated development environments present developers with quality-related software metrics, some of which describe the understandability of source code. Software metrics influence overarching strategic decisions that impact the future of companies and the prioritization of everyday software development tasks. Several software metrics, however, lack in validation: we just choose to trust that they reflect what they are supposed to measure. Some of them were even shown to not measure the quality aspects they intend to measure. Yet, they influence us through biases in our cognitive-driven actions. In particular, they might anchor us in our decisions. Whether the anchoring effect exists with software metrics has not been studied yet. We conducted a randomized and double-blind experiment to investigate the extent to which a displayed metric value for source code comprehensibility anchors developers in their subjective rating of source code comprehensibility, whether performance is affected by the anchoring effect when working on comprehension tasks, and which individual characteristics might play a role in the anchoring effect. We found that the displayed value of a comprehensibility metric has a significant and large anchoring effect on a developer's code comprehensibility rating. The effect does not seem to affect the time or correctness when working on comprehension questions related to the code snippets under study. Since the anchoring effect is one of the most robust cognitive biases, and we have limited understanding of the consequences of the demonstrated manipulation of developers by non-validated metrics, we call for an increased awareness of the responsibility in code quality reporting and for corresponding tools to be based on scientific evidence.
uBAM: Unsupervised Behavior Analysis and Magnification using Deep Learning

Motor behavior analysis is essential to biomedical research and clinical diagnostics as it provides a non-invasive strategy for identifying motor impairment and its change caused by interventions. State-of-the-art instrumented movement analysis is time- and cost-intensive, since it requires placing physical or virtual markers. Besides the effort required for marking keypoints or annotations necessary for training or finetuning a detector, users need to know the interesting behavior beforehand to provide meaningful keypoints. We introduce uBAM, a novel, automatic deep learning algorithm for behavior analysis by discovering and magnifying deviations. We propose an unsupervised learning of posture and behavior representations that enable an objective behavior comparison across subjects. A generative model with novel disentanglement of appearance and behavior magnifies subtle behavior differences across subjects directly in a video without requiring a detour via keypoints or annotations. Evaluations on rodents and human patients with neurological diseases demonstrate the wide applicability of our approach.
A Note on Optimization Formulations of Markov Decision Processes

This note summarizes the optimization formulations used in the study of Markov decision processes. We consider both the discounted and undiscounted processes under the standard and the entropy-regularized settings. For each setting, we first summarize the primal, dual, and primal-dual problems of the linear programming formulation. We then detail the connections between these problems and other formulations for Markov decision processes such as the Bellman equation and the policy gradient method.
Worldsheet: Wrapping the World in a 3D Sheet for View Synthesis from a Single Image

We present Worldsheet, a method for novel view synthesis using just a single RGB image as input. The main insight is that simply shrink-wrapping a planar mesh sheet onto the input image, consistent with the learned intermediate depth, captures underlying geometry sufficient to generate photorealistic unseen views with large viewpoint changes. To operationalize this, we propose a novel differentiable texture sampler that allows our wrapped mesh sheet to be textured and rendered differentiably into an image from a target viewpoint. Our approach is category-agnostic, end-to-end trainable without using any 3D supervision, and requires a single image at test time. We also explore a simple extension by stacking multiple layers of Worldsheets to better handle occlusions. Worldsheet consistently outperforms prior state-of-the-art methods on single-image view synthesis across several datasets. Furthermore, this simple idea captures novel views surprisingly well on a wide range of high-resolution in-the-wild images, converting them into navigable 3D pop-ups. Video results and code are available at https://worldsheet.github. io.
Learning to Recognize Patch-Wise Consistency for Deepfake Detection

We propose to detect Deepfake generated by face manipulation based on one of their fundamental features: images are blended by patches from multiple sources, carrying distinct and persistent source features. In particular, we propose a novel representation learning approach for this task, called patch-wise consistency learning (PCL). It learns by measuring the consistency of image source features, resulting to representation with good interpretability and robustness to multiple forgery methods. We develop an inconsistency image generator (I2G) to generate training data for PCL and boost its robustness. We evaluate our approach on seven popular Deepfake detection datasets. Our model achieves superior detection accuracy and generalizes well to unseen generation methods. On average, our model outperforms the state-of-the-art in terms of AUC by 2% and 8% in the in- and cross-dataset evaluation, respectively.
The birth of intermediate-mass black holes in primordial galaxies

The discovery of quasars at $z \gtrsim$ 7 poses serious challenges because it is not known how 10$^9$ \Ms\ black holes formed by this epoch. The leading candidates for the seeds of these quasars are 10$^5$ \Ms\ direct-collapse black holes forming in atomically cooled haloes at $z \sim$ 15 - 20. However, the Lyman-Werner (LW) UV backgrounds required to form such objects are extreme, $\gtrsim$ 10$^4$ $\rm J_{21}$, and may have been rare in the early universe. Here, we model the formation of Population III stars in moderate LW backgrounds of 100 and 500 $\rm J_{21}$ that were much more common at early times. We find that these backgrounds allow haloes to grow to a few 10$^6$ - 10$^7$ \Ms\ and virial temperatures of nearly 10$^4$ K before collapsing but do not completely sterilize them of H$_2$. At the onset of collapse, Ly$\alpha$ cooling dominates in the outer regions of the halo but H$_2$ cooling regulates the collapse of the core, at rates that are 10 - 50 times those in minihaloes because of higher virial temperatures. Supercharged H$_2$ cooling leads to the formation of 1800 - 2800 \Ms\ primordial stars, with radiative feedback from the star halting accretion and setting its upper limit in mass. Such stars may lead to a population of less-massive, lower luminosity quasars that could be discovered by the {\em James Webb Space Telescope}, {\em Euclid} and the {\em Roman Space Telescope} in the coming decade.
Learning to Share: A Multitasking Genetic Programming Approach to Image Feature Learning

Evolutionary multitasking is a promising approach to simultaneously solving multiple tasks with knowledge sharing. Image feature learning can be solved as a multitasking problem because different tasks may have a similar feature space. Genetic programming (GP) has been successfully applied to image feature learning for classification. However, most of the existing GP methods solve one task, independently, using sufficient training data. No multitasking GP method has been developed for image feature learning. Therefore, this paper develops a multitasking GP approach to image feature learning for classification with limited training data. Owing to the flexible representation of GP, a new knowledge sharing mechanism based on a new individual representation is developed to allow GP to automatically learn what to share across two tasks. The shared knowledge is encoded as a common tree, which can represent the common/general features of two tasks. With the new individual representation, each task is solved using the features extracted from a common tree and a task-specific tree representing task-specific features. To learn the best common and task-specific trees, a new evolutionary process and new fitness functions are developed. The performance of the proposed approach is examined on six multitasking problems of 12 image classification datasets with limited training data and compared with three GP and 14 non-GP-based competitive methods. Experimental results show that the new approach outperforms these compared methods in almost all the comparisons. Further analysis reveals that the new approach learns simple yet effective common trees with high effectiveness and transferability.
Learning Fair Policies in Decentralized Cooperative Multi-Agent Reinforcement Learning

We consider the problem of learning fair policies in (deep) cooperative multi-agent reinforcement learning (MARL). We formalize it in a principled way as the problem of optimizing a welfare function that explicitly encodes two important aspects of fairness: efficiency and equity. As a solution method, we propose a novel neural network architecture, which is composed of two sub-networks specifically designed for taking into account the two aspects of fairness. In experiments, we demonstrate the importance of the two sub-networks for fair optimization. Our overall approach is general as it can accommodate any (sub)differentiable welfare function. Therefore, it is compatible with various notions of fairness that have been proposed in the literature (e.g., lexicographic maximin, generalized Gini social welfare function, proportional fairness). Our solution method is generic and can be implemented in various MARL settings: centralized training and decentralized execution, or fully decentralized. Finally, we experimentally validate our approach in various domains and show that it can perform much better than previous methods.