Miracle-dz/UniFAR-FTUs huggingface dataset:
Zap Q-Learning With Nonlinear Function Approximation

The Zap stochastic approximation (SA) algorithm was introduced recently as a means to accelerate convergence in reinforcement learning algorithms. While numerical results were impressive, stability (in the sense of boundedness of parameter estimates) was established in only a few special cases. This class of algorithms is generalized in this paper, and stability is established under very general conditions. This general result can be applied to a wide range of algorithms found in reinforcement learning. Two classes are considered in this paper: (i)The natural generalization of Watkins' algorithm is not always stable in function approximation settings. Parameter estimates may diverge to infinity even in the \textit{linear} function approximation setting with a simple finite state-action MDP. Under mild conditions, the Zap SA algorithm provides a stable algorithm, even in the case of \textit{nonlinear} function approximation. (ii) The GQ algorithm of Maei et. ~al.~2010 is designed to address the stability challenge. Analysis is provided to explain why the algorithm may be very slow to converge in practice. The new Zap GQ algorithm is stable even for nonlinear function approximation.
Discovery of an edge-on galaxy with X-shaped bi-cone – SDSS J171359.00+333625.5

Using the integral field unit (IFU) data from Mapping Nearby Galaxies at Apache Point Observatory (MaNGA) survey, we study the kinematics of gas and stellar components in an edge-on Seyfert 2 galaxy, SDSS J171359.00+333625.5, with X-shaped bi-conical outflows. The gas and stars therein are found to be counter-rotating, indicating that the collision between the inner and external gas might be an effective way to dissipate the angular momentum, which leads to remarkable gas accretion into the galaxy centre. Large [O iii]λ5007 equivalent width and AGN-like line ratio in the large bi-conical region suggest that the gas is ionized by the central AGN. The gas velocity in the bi-cone region shows that ionized gas is receding relative to the galaxy centre, which could be the joint effect of inflows, outflows, and disc rotation. We are probably witnessing the case where a great amount of gas in the disc is being efficiently accreted into the central black hole, and the AGN-driven galactic winds are blown out along the bi-cone. The kinematics of oxygen, including rotation velocity and velocity dispersion, is different from other elements, like hydrogen, nitrogen, and sulphur. The rotation velocity estimated from oxygen is slower than from other elements. The velocity dispersion of other elements follows galactic gravitational potential, while the velocity dispersion of oxygen stays roughly constant along the galactic major-axis. The further advanced observations, e.g. of cold gas or with an IFU of higher spatial resolution, are required to better understand this object.
On the Convergence of Perturbed Distributed Asynchronous Stochastic Gradient Descent to Second Order Stationary Points in Non-convex Optimization

In this paper, the second order convergence of non-convex optimization in the asynchronous stochastic gradient descent (ASGD) algorithm is studied systematically. We investigate the behavior of ASGD near and away from saddle points. Different from the general stochastic gradient descent(SGD), we show that ASGD might return back even if it has escaped the saddle points, yet after staying near a strict saddle point for a long enough time ($O(T)$), ASGD will finally go away from strict saddle points. An inequality is given to describe the process of ASGD to escape saddle points. Using a novel Razumikhin-Lyapunov method, we show the exponential instability of the perturbed gradient dynamics near the strict saddle points and give a more detailed estimation about how the time delay parameter $T$ influences the speed to escape. In particular, we consider the optimization of smooth nonconvex functions, and propose a perturbed asynchronous stochastic gradient descent algorithm with guarantee of convergence to second order stationary points with high probability in $O(1/\epsilon^4)$ iterations. To the best of our knowledge, this is the first work on the second order convergence of asynchronous algorithm.
Manifold Embedded Knowledge Transfer for Brain-Computer Interfaces

Transfer learning makes use of data or knowledge in one problem to help solve a different, yet related, problem. It is particularly useful in brain-computer interfaces (BCIs), for coping with variations among different subjects and/or tasks. This paper considers offline unsupervised cross-subject electroencephalogram (EEG) classification, i.e., we have labeled EEG trials from one or more source subjects, but only unlabeled EEG trials from the target subject. We propose a novel manifold embedded knowledge transfer (MEKT) approach, which first aligns the covariance matrices of the EEG trials in the Riemannian manifold, extracts features in the tangent space, and then performs domain adaptation by minimizing the joint probability distribution shift between the source and the target domains, while preserving their geometric structures. MEKT can cope with one or multiple source domains, and can be computed efficiently. We also propose a domain transferability estimation (DTE) approach to identify the most beneficial source domains, in case there are a large number of source domains. Experiments on four EEG datasets from two different BCI paradigms demonstrated that MEKT outperformed several state-of-the-art transfer learning approaches, and DTE can reduce more than half of the computational cost when the number of source subjects is large, with little sacrifice of classification accuracy.
Analyzing User Activities Using Vector Space Model in Online Social Networks

The increasing popularity of internet, wireless technologies and mobile devices has led to the birth of mass connectivity and online interaction through Online Social Networks (OSNs) and similar environments. OSN reflects a social structure consist of a set of individuals and different types of ties like connections, relationships, interactions etc among them and helps its users to connect with their friends and common interest groups, share views and to pass information. Now days the users choose OSN sites as a most preferred place for sharing their updates, different views, posting photographs and would like to make it available for others for viewing, rating and making comments. The current paper aims to explore and analyze the association between the objects (like photographs, posts etc) and its viewers (friends, acquaintances etc) for a given user and to find activity relationship among them by using the TF-IDF scheme of Vector Space Model. After vectorization the vector data has been presented through a weighted graph with various properties.
An Efficient Modal-based Approach Towards Guzheng Sound Synthesis

Encouraged by recent interest in traditional Chinese instruments this work proposes a computational sound synthesis model for a traditional Chinese instrument, the guzheng. Digital waveguide model and modal synthesis are the most popular physical modelling methods. However, the excitation signal is usually over-simplified and the design of some digital filters is inadequate for real-time synthesis. We propose an accurate and efficient approach to synthesise the string signal of the guzheng. Our proposed model enables accurate parametric control of the pluck because the parameters are based on physical model of the instrument. The sound of the guzheng is then computed as the convolution of the synthesised string signal and the impulse response of the resonant body. As proof of concept, the 21st string of the guzheng is synthesised using the proposed model. The sound computed using our model shows improved accuracy with an acceptable computational complexity.
SiPPing Neural Networks: Sensitivity-informed Provable Pruning of Neural Networks

We introduce a pruning algorithm that provably sparsifies the parameters of a trained model in a way that approximately preserves the model's predictive accuracy. Our algorithm uses a small batch of input points to construct a data-informed importance sampling distribution over the network's parameters, and adaptively mixes a sampling-based and deterministic pruning procedure to discard redundant weights. Our pruning method is simultaneously computationally efficient, provably accurate, and broadly applicable to various network architectures and data distributions. Our empirical comparisons show that our algorithm reliably generates highly compressed networks that incur minimal loss in performance relative to that of the original network. We present experimental results that demonstrate our algorithm's potential to unearth essential network connections that can be trained successfully in isolation, which may be of independent interest.
Mixed Levy Subordinated Market Model and Implied Probability Weighting Function

It is essential to incorporate the impact of investor behavior when modeling the dynamics of asset returns. In this paper, we reconcile behavioral finance and rational finance by incorporating investor behavior within the framework of dynamic asset pricing theory. To include the views of investors, we employ the method of subordination which has been proposed in the literature by including business (intrinsic, market) time. We define a mixed Levy subordinated model by adding a single subordinated Levy process to the well-known log-normal model, resulting in a new log-price process. We apply the proposed models to study the behavioral finance notion of "greed and fear" disposition from the perspective of rational dynamic asset pricing theory. The greedy or fearful disposition of option traders is studied using the shape of the probability weighting function. We then derive the implied probability weighting function for the fear and greed deposition of option traders in comparison to spot traders. Our result shows the diminishing sensitivity of option traders. Diminishing sensitivity results in option traders overweighting the probability of big losses in comparison to spot traders.
Loss Landscape Sightseeing with Multi-Point Optimization

We present multi-point optimization: an optimization technique that allows to train several models simultaneously without the need to keep the parameters of each one individually. The proposed method is used for a thorough empirical analysis of the loss landscape of neural networks. By extensive experiments on FashionMNIST and CIFAR10 datasets we demonstrate two things: 1) loss surface is surprisingly diverse and intricate in terms of landscape patterns it contains, and 2) adding batch normalization makes it more smooth. Source code to reproduce all the reported results is available on GitHub: https://github.com/universome/loss-patterns.
Longitudinal Motion Planning for Autonomous Vehicles and Its Impact on Congestion: A Survey

This paper reviews machine learning methods for the motion planning of autonomous vehicles (AVs), with exclusive focus on the longitudinal behaviors and their impact on traffic congestion. An extensive survey of training data, model input/output, and learning methods for machine learning longitudinal motion planning (mMP) is first presented. Each of those major components is discussed and evaluated from the perspective of congestion impact. The emerging technologies adopted by leading AV giants like Waymo and Tesla are highlighted in our review. We find that: i) the AV industry has been focusing on the long tail problem caused by "corner errors" threatening driving safety, ii) none of the existing public datasets provides sufficient data under congestion scenarios, and iii) although alternative and more advanced learning methods are available in literature, the major mMP method adopted by industry is still behavior cloning (BC). The study also surveys the connections between mMP and traditional car-following (CF) models, and it reveals that: i) the model equivalence only exists in simple settings, ii) studies have shown mMP can significantly outperform CF models in long-term speed prediction, and iii) mMP's string stability remains intractable yet, which can only be analyzed by model approximation followed with numerical simulations. Future research needs are also identified in the end.
On the reliability of computational chaos-based cryptography for information exchange

This paper investigates the use of dynamical chaotic systems to encrypt and exchange images between different devices. Two devices were used to simulate the Cubic Map, having the same set of initial conditions, to generate an encryption key. Although both devices are floating-point compliant, the simulations, and consequently the encryption key, turned out to differ from one another. This indicates that many existing chaos-based encryption schemes are just special cases of computational arithmetic properties, in which some characteristics in the construction of the devices coincided. A method to mitigate such flaw was also presented.
Encoder-Decoder based CNN and Fully Connected CRFs for Remote Sensed Image Segmentation

With the advancement of remote-sensed imaging large volumes of very high resolution land cover images can now be obtained. Automation of object recognition in these 2D images, however, is still a key issue. High intra-class variance and low inter-class variance in Very High Resolution (VHR) images hamper the accuracy of prediction in object recognition tasks. Most successful techniques in various computer vision tasks recently are based on deep supervised learning. In this work, a deep Convolutional Neural Network (CNN) based on symmetric encoder-decoder architecture with skip connections is employed for the 2D semantic segmentation of most common land cover object classes - impervious surface, buildings, low vegetation, trees and cars. Atrous convolutions are employed to have large receptive field in the proposed CNN model. Further, the CNN outputs are post-processed using Fully Connected Conditional Random Field (FCRF) model to refine the CNN pixel label predictions. The proposed CNN-FCRF model achieves an overall accuracy of 90.5% on the ISPRS Vaihingen Dataset.
SmokEng: Towards Fine-grained Classification of Tobacco-related Social Media Text

Contemporary datasets on tobacco consumption focus on one of two topics, either public health mentions and disease surveillance, or sentiment analysis on topical tobacco products and services. However, two primary considerations are not accounted for, the language of the demographic affected and a combination of the topics mentioned above in a fine-grained classification mechanism. In this paper, we create a dataset of 3144 tweets, which are selected based on the presence of colloquial slang related to smoking and analyze it based on the semantics of the tweet. Each class is created and annotated based on the content of the tweets such that further hierarchical methods can be easily applied. Further, we prove the efficacy of standard text classification methods on this dataset, by designing experiments which do both binary as well as multi-class classification. Our experiments tackle the identification of either a specific topic (such as tobacco product promotion), a general mention (cigarettes and related products) or a more fine-grained classification. This methodology paves the way for further analysis, such as understanding sentiment or style, which makes this dataset a vital contribution to both disease surveillance and tobacco use research.
Deep Crowd-Flow Prediction in Built Environments

Predicting the behavior of crowds in complex environments is a key requirement in a multitude of application areas, including crowd and disaster management, architectural design, and urban planning. Given a crowd's immediate state, current approaches simulate crowd movement to arrive at a future state. However, most applications require the ability to predict hundreds of possible simulation outcomes (e.g., under different environment and crowd situations) at real-time rates, for which these approaches are prohibitively expensive. In this paper, we propose an approach to instantly predict the long-term flow of crowds in arbitrarily large, realistic environments. Central to our approach is a novel CAGE representation consisting of Capacity, Agent, Goal, and Environment-oriented information, which efficiently encodes and decodes crowd scenarios into compact, fixed-size representations that are environmentally lossless. We present a framework to facilitate the accurate and efficient prediction of crowd flow in never-before-seen crowd scenarios. We conduct a series of experiments to evaluate the efficacy of our approach and showcase positive results.
KonIQ-10k: An Ecologically Valid Database for Deep Learning of Blind Image Quality Assessment

Deep learning methods for image quality assessment (IQA) are limited due to the small size of existing datasets. Extensive datasets require substantial resources both for generating publishable content and annotating it accurately. We present a systematic and scalable approach to creating KonIQ-10k, the largest IQA dataset to date, consisting of 10,073 quality scored images. It is the first in-the-wild database aiming for ecological validity, concerning the authenticity of distortions, the diversity of content, and quality-related indicators. Through the use of crowdsourcing, we obtained 1.2 million reliable quality ratings from 1,459 crowd workers, paving the way for more general IQA models. We propose a novel, deep learning model (KonCept512), to show an excellent generalization beyond the test set (0.921 SROCC), to the current state-of-the-art database LIVE-in-the-Wild (0.825 SROCC). The model derives its core performance from the InceptionResNet architecture, being trained at a higher resolution than previous models ( $512\times 384$ ). Correlation analysis shows that KonCept512 performs similar to having 9 subjective scores for each test image.
Channel Estimation for Extremely Large-Scale Massive MIMO Systems

Extremely large-scale massive multiple-input multiple-output has shown considerable potential in future mobile communications. However, the use of extremely large aperture arrays will lead to near-field and spatial non-stationary channel conditions, which result in changes in transceiver design and channel state information acquisition. This letter focuses on the channel estimation problem and describes the non-stationary channel through a mapping between subarrays and scatterers. We propose subarray-wise and scatterer-wise channel estimation methods to estimate the near-field non-stationary channel from the views of the subarray and the scatterer, respectively. Numerical results demonstrate that the subarray-wise method can derive accurate channel estimation results with low complexity, whereas the scatterer-wise method can accurately position the scatterers and identify almost all the mappings between subarrays and scatterers.
Quantitative stability of optimal transport maps and linearization of the 2-Wasserstein space

This work studies an explicit embedding of the set of probability measures into a Hilbert space, defined using optimal transport maps from a reference probability density. This embedding linearizes to some extent the 2-Wasserstein space, and enables the direct use of generic supervised and unsupervised learning algorithms on measure data. Our main result is that the embedding is (bi-)Holder continuous, when the reference density is uniform over a convex set, and can be equivalently phrased as a dimension-independent Holder-stability results for optimal transport maps.
The evolution of carbon-polluted white dwarfs at low effective temperatures

Taking advantage of the Gaia Data Release 2, recent studies have revisited the evolution of carbon-polluted white dwarfs (DQs) across a large range of effective temperatures. These analyses have clearly confirmed the existence of two distinct DQ evolutionary sequences: one with normal-mass white dwarfs and one with heavily polluted and generally more massive objects. The first sequence is thought to result from the dredge-up of carbon from the core, while the second could at least partially be made of descendants of hot DQs. However, the evolution of carbon-polluted white dwarfs below 6500 K remains unexplored, mainly due to the theoretical difficulties associated with modelling their dense atmospheres. In this work, we present a detailed star-by-star analysis of cool carbon-polluted white dwarfs. Our recently improved atmosphere models allow us to obtain good fits to most objects, including very cool DQpec white dwarfs with strongly shifted C2 molecular bands. We show that cool carbon-polluted white dwarfs keep following the two distinct evolutionary tracks previously identified at higher temperatures. We also find that most DQ white dwarfs transform into DQpec when their photospheric densities exceed ${\approx}0.15\, {\textrm{g\,cm}}^{-3}$. However, we identify stars for which the DQ→DQpec transition occurs at lower photospheric densities, possibly due to the presence of a strong magnetic field.
Model-based Interactive Semantic Parsing: A Unified Framework and A Text-to-SQL Case Study

As a promising paradigm, interactive semantic parsing has shown to improve both semantic parsing accuracy and user confidence in the results. In this paper, we propose a new, unified formulation of the interactive semantic parsing problem, where the goal is to design a model-based intelligent agent. The agent maintains its own state as the current predicted semantic parse, decides whether and where human intervention is needed, and generates a clarification question in natural language. A key part of the agent is a world model: it takes a percept (either an initial question or subsequent feedback from the user) and transitions to a new state. We then propose a simple yet remarkably effective instantiation of our framework, demonstrated on two text-to-SQL datasets (WikiSQL and Spider) with different state-of-the-art base semantic parsers. Compared to an existing interactive semantic parsing approach that treats the base parser as a black box, our approach solicits less user feedback but yields higher run-time accuracy.
Cross-Domain Image Classification through Neural-Style Transfer Data Augmentation

In particular, the lack of sufficient amounts of domain-specific data can reduce the accuracy of a classifier. In this paper, we explore the effects of style transfer-based data transformation on the accuracy of a convolutional neural network classifiers in the context of automobile detection under adverse winter weather conditions. The detection of automobiles under highly adverse weather conditions is a difficult task as such conditions present large amounts of noise in each image. The InceptionV2 architecture is trained on a composite dataset, consisting of either normal car image dataset , a mixture of normal and style transferred car images, or a mixture of normal car images and those taken at blizzard conditions, at a ratio of 80:20. All three classifiers are then tested on a dataset of car images taken at blizzard conditions and on vehicle-free snow landscape images. We evaluate and contrast the effectiveness of each classifier upon each dataset, and discuss the strengths and weaknesses of style-transfer based approaches to data augmentation.