Miracle-dz/UniFAR-FTUs huggingface dataset:
Proper Time and Mass of the Universe

A modification of the homogeneous isotropic model of the Friedman universe with a scalar field is proposed, in which the proper time of the universe is added to the dynamic variables under the additional condition of its classical dynamics. Along with proper time, an additional parameter is included in the modified theory, which is an analog of the rest mass of a relativistic particle. Assuming the dependence of the gravitational constant on proper time, we obtain the rest mass as an additional dynamic variable.
Few-Shot Object Detection on Remote Sensing Images

In this article, we deal with the problem of object detection on remote sensing images. Previous researchers have developed numerous deep convolutional neural network (CNN)-based methods for object detection on remote sensing images, and they have reported remarkable achievements in detection performance and efficiency. However, current CNN-based methods often require a large number of annotated samples to train deep neural networks and tend to have limited generalization abilities for unseen object categories. In this article, we introduce a metalearning-based method for few-shot object detection on remote sensing images where only a few annotated samples are needed for the unseen object categories. More specifically, our model contains three main components: a metafeature extractor that learns to extract metafeature maps from input images, a feature reweighting module that learns class-specific reweighting vectors from the support images and use them to recalibrate the metafeature maps, and a bounding box prediction module that carries out object detection on the reweighted feature maps. We build our few-shot object detection model upon the YOLOv3 architecture and develop a multiscale object detection framework. Experiments on two benchmark data sets demonstrate that with only a few annotated samples, our model can still achieve a satisfying detection performance on remote sensing images, and the performance of our model is significantly better than the well-established baseline models.
Restoring the continuum limit in the time-dependent numerical renormalization group approach

The continuous coupling function in quantum impurity problems is exactly partitioned into a part represented by a finite size Wilson chain and a part represented by a set of additional reservoirs, each coupled to one Wilson chain site. These additional reservoirs represent high-energy modes of the environment neglected by the numerical renormalization group and are required to restore the continuum limit of the original problem. We present a hybrid time-dependent numerical renormalization group approach which combines an accurate numerical renormalization group treatment of the non-equilibrium dynamics on the finite size Wilson chain with a Bloch-Redfield formalism to include the effect of these additional reservoirs. Our approach overcomes the intrinsic shortcoming of the time-dependent numerical renormalization group approach induced by the bath discretization with a Wilson parameter $\Lambda > 1$. We analytically prove that for a system with a single chemical potential, the thermal equilibrium reduced density operator is the steady-state solution of the Bloch-Redfield master equation. For the numerical solution of this master equation a Lanczos method is employed which couples all energy shells of the numerical renormalization group. The presented hybrid approach is applied to the real-time dynamics in correlated fermionic quantum-impurity systems. An analytical solution of the resonant-level model serves as a benchmark for the accuracy of the method which is then applied to non-trivial models, such as the interacting resonant-level model and the single impurity Anderson model.
Dermatologist vs Neural Network

Cancer, in general, is very deadly. Timely treatment of any cancer is the key to saving a life. Skin cancer is no exception. There have been thousands of Skin Cancer cases registered per year all over the world. There have been 123,000 deadly melanoma cases detected in a single year. This huge number is proven to be a cause of a high amount of UV rays present in the sunlight due to the degradation of the Ozone layer. If not detected at an early stage, skin cancer can lead to the death of the patient. Unavailability of proper resources such as expert dermatologists, state of the art testing facilities, and quick biopsy results have led researchers to develop a technology that can solve the above problem. Deep Learning is one such method that has offered extraordinary results. The Convolutional Neural Network proposed in this study out performs every pretrained models. We trained our model on the HAM10000 dataset which offers 10015 images belonging to 7 classes of skin disease. The model we proposed gave an accuracy of 89%. This model can predict deadly melanoma skin cancer with a great accuracy. Hopefully, this study can help save people's life where there is the unavailability of proper dermatological resources by bridging the gap using our proposed study.
Catplayinginthesnow: Impact of Prior Segmentation on a Model of Visually Grounded Speech

The language acquisition literature shows that children do not build their lexicon by segmenting the spoken input into phonemes and then building up words from them, but rather adopt a top-down approach and start by segmenting word-like units and then break them down into smaller units. This suggests that the ideal way of learning a language is by starting from full semantic units. In this paper, we investigate if this is also the case for a neural model of Visually Grounded Speech trained on a speech-image retrieval task. We evaluated how well such a network is able to learn a reliable speech-to-image mapping when provided with phone, syllable, or word boundary information. We present a simple way to introduce such information into an RNN-based model and investigate which type of boundary is the most efficient. We also explore at which level of the network’s architecture such information should be introduced so as to maximise its performances. Finally, we show that using multiple boundary types at once in a hierarchical structure, by which low-level segments are used to recompose high-level segments, is beneficial and yields better results than using low-level or high-level segments in isolation.
Online Hyper-parameter Tuning in Off-policy Learning via Evolutionary Strategies

Off-policy learning algorithms have been known to be sensitive to the choice of hyper-parameters. However, unlike near on-policy algorithms for which hyper-parameters could be optimized via e.g. meta-gradients, similar techniques could not be straightforwardly applied to off-policy learning. In this work, we propose a framework which entails the application of Evolutionary Strategies to online hyper-parameter tuning in off-policy learning. Our formulation draws close connections to meta-gradients and leverages the strengths of black-box optimization with relatively low-dimensional search spaces. We show that our method outperforms state-of-the-art off-policy learning baselines with static hyper-parameters and recent prior work over a wide range of continuous control benchmarks.
A Dataset and Benchmarks for Multimedia Social Analysis

We present a new publicly available dataset with the goal of advancing multi-modality learning by offering vision and language data within the same context. This is achieved by obtaining data from a social media website with posts containing multiple paired images/videos and text, along with comment trees containing images/videos and/or text. With a total of 677k posts, 2.9 million post images, 488k post videos, 1.4 million comment images, 4.6 million comment videos, and 96.9 million comments, data from different modalities can be jointly used to improve performances for a variety of tasks such as image captioning, image classification, next frame prediction, sentiment analysis, and language modeling. We present a wide range of statistics for our dataset. Finally, we provide baseline performance analysis for one of the regression tasks using pre-trained models and several fully connected networks.
Transferring Monolingual Model to Low-Resource Language: The Case of Tigrinya

In recent years, transformer models have achieved great success in natural language processing (NLP) tasks. Most of the current state-of-the-art NLP results are achieved by using monolingual transformer models, where the model is pre-trained using a single language unlabelled text corpus. Then, the model is fine-tuned to the specific downstream task. However, the cost of pre-training a new transformer model is high for most languages. In this work, we propose a cost-effective transfer learning method to adopt a strong source language model, trained from a large monolingual corpus to a low-resource language. Thus, using XLNet language model, we demonstrate competitive performance with mBERT and a pre-trained target language model on the cross-lingual sentiment (CLS) dataset and on a new sentiment analysis dataset for low-resourced language Tigrinya. With only 10k examples of the given Tigrinya sentiment analysis dataset, English XLNet has achieved 78.88% F1-Score outperforming BERT and mBERT by 10% and 7%, respectively. More interestingly, fine-tuning (English) XLNet model on the CLS dataset has promising results compared to mBERT and even outperformed mBERT for one dataset of the Japanese language.
GLUECons: A Generic Benchmark for Learning Under Constraints

Recent research has shown that integrating domain knowledge into deep learning architectures is effective; It helps reduce the amount of required data, improves the accuracy of the models' decisions, and improves the interpretability of models. However, the research community lacks a convened benchmark for systematically evaluating knowledge integration methods. In this work, we create a benchmark that is a collection of nine tasks in the domains of natural language processing and computer vision. In all cases, we model external knowledge as constraints, specify the sources of the constraints for each task, and implement various models that use these constraints. We report the results of these models using a new set of extended evaluation criteria in addition to the task performances for a more in-depth analysis. This effort provides a framework for a more comprehensive and systematic comparison of constraint integration techniques and for identifying related research challenges. It will facilitate further research for alleviating some problems of state-of-the-art neural models.
Road Mapping in Low Data Environments with OpenStreetMap

Roads are among the most essential components of any country's infrastructure. By facilitating the movement and exchange of people, ideas, and goods, they support economic and cultural activity both within and across local and international borders. A comprehensive, up-to-date mapping of the geographical distribution of roads and their quality thus has the potential to act as an indicator for broader economic development. Such an indicator has a variety of high-impact applications, particularly in the planning of rural development projects where up-to-date infrastructure information is not available. This work investigates the viability of high resolution satellite imagery and crowd-sourced resources like OpenStreetMap in the construction of such a mapping. We experiment with state-of-the-art deep learning methods to explore the utility of OpenStreetMap data in road classification and segmentation tasks. We also compare the performance of models in different mask occlusion scenarios as well as out-of-country domains. Our comparison raises important pitfalls to consider in image-based infrastructure classification tasks, and shows the need for local training data specific to regions of interest for reliable performance.
Minimax Dynamics of Optimally Balanced Spiking Networks of Excitatory and Inhibitory Neurons

Excitation-inhibition (E-I) balance is ubiquitously observed in the cortex. Recent studies suggest an intriguing link between balance on fast timescales, tight balance, and efficient information coding with spikes. We further this connection by taking a principled approach to optimal balanced networks of excitatory (E) and inhibitory (I) neurons. By deriving E-I spiking neural networks from greedy spike-based optimizations of constrained minimax objectives, we show that tight balance arises from correcting for deviations from the minimax optimum. We predict specific neuron firing rates in the network by solving the minimax problem, going beyond statistical theories of balanced networks. Finally, we design minimax objectives for reconstruction of an input signal, associative memory, and storage of manifold attractors, and derive from them E-I networks that perform the computation. Overall, we present a novel normative modeling approach for spiking E-I networks, going beyond the widely-used energy minimizing networks that violate Dale's law. Our networks can be used to model cortical circuits and computations.
Optimistic Distributionally Robust Policy Optimization

Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), as the widely employed policy based reinforcement learning (RL) methods, are prone to converge to a sub-optimal solution as they limit the policy representation to a particular parametric distribution class. To address this issue, we develop an innovative Optimistic Distributionally Robust Policy Optimization (ODRPO) algorithm, which effectively utilizes Optimistic Distributionally Robust Optimization (DRO) approach to solve the trust region constrained optimization problem without parameterizing the policies. Our algorithm improves TRPO and PPO with a higher sample efficiency and a better performance of the final policy while attaining the learning stability. Moreover, it achieves a globally optimal policy update that is not promised in the prevailing policy based RL algorithms. Experiments across tabular domains and robotic locomotion tasks demonstrate the effectiveness of our approach.
Frequency-domain optical coherence tomography with undetected mid-infrared photons

Mid-infrared light scatters much less than shorter wavelengths, allowing greatly enhanced penetration depths for optical imaging techniques such as optical coherence tomography (OCT). However, both detection and broadband sources in the mid-IR are technologically challenging. Interfering entangled photons in a nonlinear interferometer enables sensing with undetected photons making mid-IR sources and detectors obsolete. Here we implement mid-infrared frequency-domain OCT based on ultra-broadband entangled photon pairs. We demonstrate 10 ${\mu}$m axial and 20 ${\mu}$m lateral resolution 2D and 3D imaging of strongly scattering ceramic and paint samples. Together with $10^6$ times less noise scaled for the same amount of probe light and also vastly reduced footprint and technical complexity this technique can outperform conventional approaches with classical mid-IR light.
Accretion-to-jet energy conversion efficiency in GW170817

Gamma-ray bursts (GRBs) are thought to be produced by short-lived, supercritical accretion onto a newborn compact object. Some process is believed to tap energy from the compact object, or the accretion disc, powering the launch of a relativistic jet. For the first time, we can construct independent estimates of the GRB jet energy and of the mass in the accretion disc in its central engine; this is thanks to gravitational wave observations of the GW170817 binary neutron star merger by the Laser Interferometer Gravitational wave Observatory (LIGO) and Virgo interferometers, as well as a global effort to monitor the afterglow of the associated short gamma-ray burst GRB 170817A on a long-term, high-cadence, multi-wavelength basis. In this work, we estimate the accretion-to-jet energy conversion efficiency in GW170817, that is, the ratio of the jet total energy to the accretion disc rest mass energy, and we compare this quantity with theoretical expectations from the Blandford-Znajek and neutrino-antineutrino annihilation (νν̄) jet-launching mechanisms in binary neutron star mergers. Based on previously published multi-wavelength modelling of the GRB 170817A jet afterglow, we construct the posterior probability density distribution of the total energy in the bipolar jets launched by the GW170817 merger remnant. By applying a new numerical-relativity-informed fitting formula for the accretion disc mass, we construct the posterior probability density distribution of the GW170817 remnant disc mass. Combining the two, we estimate the accretion-to-jet energy conversion efficiency in this system, carefully accounting for uncertainties. The accretion-to-jet energy conversion efficiency in GW170817 isη ∼ 10−3, with an uncertainty of slightly less than two orders of magnitude. This low efficiency is in agreement with expectations from the $ \nu\bar\nu $ mechanism, which therefore cannot be excluded by this measurement alone. The low efficiency also agrees with that anticipated for the Blandford-Znajek mechanism, provided that the magnetic field in the disc right after the merger is predominantly toroidal (which is expected as a result of the merger dynamics). This is the first estimate of the accretion-to-jet energy conversion efficiency in a GRB that combines independent estimates of the jet energy and accretion disc mass. Future applications of this method to a larger number of systems will reduce the uncertainties in the efficiency and reveal whether or not it is universal. This, in turn, will provide new insights into the jet-launching conditions in neutron star mergers.
Manifold GPLVMs for discovering non-Euclidean latent structure in neural data

A common problem in neuroscience is to elucidate the collective neural representations of behaviorally important variables such as head direction, spatial location, upcoming movements, or mental spatial transformations. Often, these latent variables are internal constructs not directly accessible to the experimenter. Here, we propose a new probabilistic latent variable model to simultaneously identify the latent state and the way each neuron contributes to its representation in an unsupervised way. In contrast to previous models which assume Euclidean latent spaces, we embrace the fact that latent states often belong to symmetric manifolds such as spheres, tori, or rotation groups of various dimensions. We therefore propose the manifold Gaussian process latent variable model (mGPLVM), where neural responses arise from (i) a shared latent variable living on a specific manifold, and (ii) a set of non-parametric tuning curves determining how each neuron contributes to the representation. Cross-validated comparisons of models with different topologies can be used to distinguish between candidate manifolds, and variational inference enables quantification of uncertainty. We demonstrate the validity of the approach on several synthetic datasets and on calcium recordings from the ellipsoid body of Drosophila melanogaster. This circuit is known to encode head direction, and mGPLVM correctly recovers the ring topology expected from a neural population representing a single angular variable.
Learning scale-variant features for robust iris authentication with deep learning based ensemble framework.

In recent years, mobile Internet has accelerated the proliferation of smart mobile development. The mobile payment, mobile security and privacy protection have become the focus of widespread attention. Iris recognition becomes a high-security authentication technology in these fields, it is widely used in distinct science fields in biometric authentication fields. The Convolutional Neural Network (CNN) is one of the mainstream deep learning approaches for image recognition, whereas its anti-noise ability is weak and needs a certain amount of memory to train in image classification tasks. Under these conditions we put forward a fine-tuning neural network model based on the Mask R-CNN and Inception V4 neural network model, which integrates every component in an overall system that combines the iris detection, extraction, and recognition function as an iris recognition system. The proposed framework has the characteristics of scalability and high availability; it not only can learn part-whole relationships of the iris image but also enhancing the robustness of the whole framework. Importantly, the proposed model can be trained using the different spectrum of samples, such as Visible Wavelength (VW) and Near Infrared (NIR) iris biometric databases. The recognition average accuracy of 99.10% is achieved while executing in the mobile edge calculation device of the Jetson Nano.
Large deviation principles for stochastic dynamical systems with a fractional Brownian noise

We study small noise large deviation asymptotics for stochastic differential equations with a multiplicative noise given as a fractional Brownian motion $B^H$ with Hurst parameter $H>\frac12$. The solutions of the stochastic differential equations are defined pathwise under appropriate conditions on the coefficients. The ingredients in the proof of the large deviation principle, which include a variational representation for nonnegative functionals of fractional Brownian motions and a general sufficient condition for a LDP for a collection of functionals of a fractional Brownian motions, have a broader applicability than the model considered here.
Automated Diagram Generation to Build Understanding and Usability

Causal loop and stock and flow diagrams are broadly used in System Dynamics because they help organize relationships and convey meaning. Using the analytical work of Schoenberg (2019) to select what to include in a compressed model, this paper demonstrates how that information can be clearly presented in an automatically generated causal loop diagram. The diagrams are generated using tools developed by people working in graph theory and the generated diagrams are clear and aesthetically pleasing. This approach can also be built upon to generate stock and flow diagrams. Automated stock and flow diagram generation opens the door to representing models developed using only equations, regardless or origin, in a clear and easy to understand way. Because models can be large, the application of grouping techniques, again developed for graph theory, can help structure the resulting diagrams in the most usable form. This paper describes the algorithms developed for automated diagram generation and shows a number of examples of their uses in large models. The application of these techniques to existing, but inaccessible, equation-based models can help broaden the knowledge base for System Dynamics modeling. The techniques can also be used to improve layout in all, or part, of existing models with diagrammatic informtion.
Estimation of dense stochastic block models visited by random walks

We are interested in recovering information on a stochastic block model from the subgraph discovered by an exploring random walk. Stochastic block models correspond to populations structured into a finite number of types, where two individuals are connected by an edge independently from the other pairs and with a probability depending on their types. We consider here the dense case where the random network can be approximated by a graphon. This problem is motivated from the study of chain-referral surveys where each interviewee provides information on her/his contacts in the social network. First, we write the likelihood of the subgraph discovered by the random walk: biases are appearing since hubs and majority types are more likely to be sampled. Even for the case where the types are observed, the maximum likelihood estimator is not explicit any more. When the types of the vertices is unobserved, we use an SAEM algorithm to maximize the likelihood. Second, we propose a different estimation strategy using new results by Athreya and Roellin. It consists in de-biasing the maximum likelihood estimator proposed in Daudin et al. and that ignores the biases.