Reviewerly/exHarmony huggingface dataset:
Dynamic Regulation of Level Set Parameters Using 3D Convolutional Neural Network for Liver Tumor Segmentation

Segmentation of liver tumors plays an important role in the choice of therapeutic strategies for liver disease and treatment monitoring. In this paper, we generalize the process of a level set with a novel algorithm of dynamic regulation to energy functional parameters. The presented method is fully automatic once the tumor has been detected. First, a 3D convolutional neural network with dense layers for classification is used to estimate current contour location relative to the tumor boundary. Second, the output 3D CNN probabilities can dynamically regulate parameters of the level set functional over the process of segmentation. Finally, for full automation, appropriate initializations and local window size are generated based on the current contour position probabilities. We demonstrate the proposed method on the dataset of MICCAI 2017 LiTS Challenge and 3DIRCADb that include low contrast and heterogeneous tumors as well as noisy images. To illustrate the strength of our method, we evaluated it against the state-of-the-art methods. Compared with the level set framework with fixed parameters, our method performed better significantly with an average DICE improvement of 0.15. We also analyzed a challenging dataset 3DIRCADb of tumors and obtained a competitive DICE of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1"><mml:mrow><mml:mn>0.85</mml:mn><mml:mo>±</mml:mo><mml:mn>0.06</mml:mn></mml:mrow></mml:math> with the proposed method.
Calibrated Model-Based Deep Reinforcement Learning

Estimates of predictive uncertainty are important for accurate model-based planning and reinforcement learning. However, predictive uncertainties---especially ones derived from modern deep learning systems---can be inaccurate and impose a bottleneck on performance. This paper explores which uncertainties are needed for model-based reinforcement learning and argues that good uncertainties must be calibrated, i.e. their probabilities should match empirical frequencies of predicted events. We describe a simple way to augment any model-based reinforcement learning agent with a calibrated model and show that doing so consistently improves planning, sample complexity, and exploration. On the \textsc{HalfCheetah} MuJoCo task, our system achieves state-of-the-art performance using 50\% fewer samples than the current leading approach. Our findings suggest that calibration can improve the performance of model-based reinforcement learning with minimal computational and implementation overhead.
Improving Neural Machine Translation with Neural Syntactic Distance

Chunpeng Ma, Akihiro Tamura, Masao Utiyama, Eiichiro Sumita, Tiejun Zhao. Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers). 2019.
A Hybrid QoS-QoE Estimation System for IPTV Service

The internet protocol television service (IPTV) has become a key product for internet service providers (ISP), offering several benefits to both ISP and end-users. Because packet networks based on internet protocol have not been prepared for time-sensitive services, such as voice or video, packet networks have had to adopt several mechanisms to secure minimal transmission standards in the form of data stream prioritization. There are two commonly used approaches for video quality assessment. The first approach needs an original source for comparison (full-reference objective metrics), and the second one requires observers for subjective evaluation of video quality. Both approaches are impractical in real-time transmission because it is difficult to transform an objective score into a subjective quality perception, and on the other hand, subjective tests are not able to be performed immediately. Since many countries worldwide put IPTV on the same level as other broadcasting systems (e.g., terrestrial, cable, or satellite), IPTV services are subject to regulation by the national regulation authority. This results in the need to prepare service qualitative criteria and monitoring tools capable of measuring end-user satisfaction levels. Our proposed model combines the principles of both assessment approaches, which results in an effective monitoring solution. Therefore, the main contribution of the created system is to offer a monitoring tool able to analyze the features extracted from the video sequence and transmission system and promptly translate their impact into a subjective point of view.
Collaborative Metric Learning with Memory Network for Multi-Relational Recommender Systems

The success of recommender systems in modern online platforms is inseparable from the accurate capture of users' personal tastes. In everyday life, large amounts of user feedback data are created along with user-item online interactions in a variety of ways, such as browsing, purchasing, and sharing. These multiple types of user feedback provide us with tremendous opportunities to detect individuals' fine-grained preferences. Different from most existing recommender systems that rely on a single type of feedback, we advocate incorporating multiple types of user-item interactions for better recommendations. Based on the observation that the underlying spectrum of user preferences is reflected in various types of interactions with items and can be uncovered by latent relational learning in metric space, we propose a unified neural learning framework, named Multi-Relational Memory Network (MRMN). It can not only model fine-grained user-item relations but also enable us to discriminate between feedback types in terms of the strength and diversity of user preferences. Extensive experiments show that the proposed MRMN model outperforms competitive state-of-the-art algorithms in a wide range of scenarios, including e-commerce, local services, and job recommendations.
Learning Two Layer Rectified Neural Networks in Polynomial Time.

Consider the following fundamental learning problem: given input examples $x \in \mathbb{R}^d$ and their vector-valued labels, as defined by an underlying generative neural network, recover the weight matrices of this network. We consider two-layer networks, mapping $\mathbb{R}^d$ to $\mathbb{R}^m$, with $k$ non-linear activation units $f(\cdot)$, where $f(x) = \max \{x , 0\}$ is the ReLU. Such a network is specified by two weight matrices, $\mathbf{U}^* \in \mathbb{R}^{m \times k}, \mathbf{V}^* \in \mathbb{R}^{k \times d}$, such that the label of an example $x \in \mathbb{R}^{d}$ is given by $\mathbf{U}^* f(\mathbf{V}^* x)$, where $f(\cdot)$ is applied coordinate-wise. Given $n$ samples as a matrix $\mathbf{X} \in \mathbb{R}^{d \times n}$ and the (possibly noisy) labels $\mathbf{U}^* f(\mathbf{V}^* \mathbf{X}) + \mathbf{E}$ of the network on these samples, where $\mathbf{E}$ is a noise matrix, our goal is to recover the weight matrices $\mathbf{U}^*$ and $\mathbf{V}^*$. In this work, we develop algorithms and hardness results under varying assumptions on the input and noise. Although the problem is NP-hard even for $k=2$, by assuming Gaussian marginals over the input $\mathbf{X}$ we are able to develop polynomial time algorithms for the approximate recovery of $\mathbf{U}^*$ and $\mathbf{V}^*$. Perhaps surprisingly, in the noiseless case our algorithms recover $\mathbf{U}^*,\mathbf{V}^*$ exactly, i.e., with no error. To the best of the our knowledge, this is the first algorithm to accomplish exact recovery. For the noisy case, we give the first polynomial time algorithm that approximately recovers the weights in the presence of mean-zero noise $\mathbf{E}$. Our algorithms generalize to a larger class of rectified activation functions, $f(x) = 0$ when $x\leq 0$, and $f(x) > 0$ otherwise.
Proposed Taxonomy for Gender Bias in Text; A Filtering Methodology for the Gender Generalization Subtype

The purpose of this paper is to present an empirical study on gender bias in text. Current research in this field is focused on detecting and correcting for gender bias in existing machine learning models rather than approaching the issue at the dataset level. The underlying motivation is to create a dataset which could enable machines to learn to differentiate bias writing from non-bias writing. A taxonomy is proposed for structural and contextual gender biases which can manifest themselves in text. A methodology is proposed to fetch one type of structural gender bias, Gender Generalization. We explore the IMDB movie review dataset and 9 different corpora from Project Gutenberg. By filtering out irrelevant sentences, the remaining pool of candidate sentences are sent for human validation. A total of 6123 judgments are made on 1627 sentences and after a quality check on randomly selected sentences we obtain an accuracy of 75%. Out of the 1627 sentences, 808 sentence were labeled as Gender Generalizations. The inter-rater reliability amongst labelers was of 61.14%.
A new algorithm for the colored image encryption via the modified Chua’s circuit

A genuine encryption/decryption algorithm has been developed by using a new chaotic circuit, namely modified Chua’s circuit (MCC). The importance of MCC is that it exhibits hyper-chaotic behaviour for a large parameter regime due to the double frequency dependent nature. The numbers extracted from the solutions of the MCC are transmitted to the newly developed algorithm for the encryption and the decryption aims. The scrambling feature, which is implemented at the bit level using the MCC has been applied in the algorithm. Following the encryption procedure, the encrypted colored image has been tested by a variety of tests including the secret key size, secret key sensitivity analysis, histogram analysis, correlation analysis, differential analysis, information entropy analysis, noise attack analysis and occlusion analysis. The results are good and provide an efficient technique for the color image encryption and decryption in the theme of secure communication. Besides, it is not time consuming.
Task Identification System for Elderly Paralyzed Patients Using Electrooculography and Neural Networks

Earlier day’s people with disability face lot of difficulty in communication due to neuromuscular attack. They are unable to share ideas and thoughts with others, so they need some assist to overcome this condition. To overcome the condition in this paper we discussed the capabilities of designing electrooculogram (EOG)-based human computer interface (HCI) by ten subjects using power spectral density techniques and Neural Network. In this study we compare the right-hander performance with left-hander performance. Outcomes of the study concluded that left-hander performance was marginally appreciated compared to right-hander performance in terms of classification accuracy with an average accuracy of 93.38% for all left-hander subjects and 91.38% for all the right subjects using probabilistic neural network (PNN) and also we analyzed that during the training left-handers were interestingly participated and also they can able to perform the following 11 tasks easily compared with right-handers. From this study we concluded that potentiality of creating HCI was possible by means of left-handers and also study proves that right-hander need some more training to achieve this. Finally the experiment outperforms our previous study in terms of performance by changing the subjects from right-hander to left-handers.
Overview of the 6th Workshop on Asian Translation

This paper presents the results of the shared tasks from the 6th workshop on Asian translation (WAT2019) including Ja↔En, Ja↔Zh scientific paper translation subtasks, Ja↔En, Ja↔Ko, Ja↔En patent translation subtasks, Hi↔En, My↔En, Km↔En, Ta↔En mixed domain subtasks, Ru↔Ja news commentary translation task, and En→Hi multi-modal translation task.For the WAT2019, 25 teams participated in the shared tasks.We also received 10 research paper submissions out of which 7 1 were accepted.About 400 translation results were submitted to the automatic evaluation server, and selected submissions were manually evaluated.
The Need of Industry to Go FAIR

The industry sector is a very large producer and consumer of data, and many companies traditionally focused on production or manufacturing are now relying on the analysis of large amounts of data to develop new products and services. As many of the data sources needed are distributed and outside the company, FAIR data will have a major impact, both by reducing the existing internal data silos and by enabling the efficient integration with external (public and commercial) data. Many companies are still in the early phases of internal data “FAIRification”, providing opportunities for SMEs and academics to apply and develop their expertise on FAIR data in collaborations and public-private partnerships. For a global Internet of FAIR Data &amp; Services to thrive, also involving industry, professional tools and services are essential. FAIR metrics and certifications on individuals, data, organizations, and software, must ensure that data producers and consumers have independent quality metrics on their data. In this opinion article we reflect on some industry specific challenges of FAIR implementation to be dealt with when choices are made regarding “Industry GOing FAIR”.
Trace types and denotational semantics for sound programmable inference in probabilistic languages

Modern probabilistic programming languages aim to formalize and automate key aspects of probabilistic modeling and inference. Many languages provide constructs for programmable inference that enable developers to improve inference speed and accuracy by tailoring an algorithm for use with a particular model or dataset. Unfortunately, it is easy to use these constructs to write unsound programs that appear to run correctly but produce incorrect results. To address this problem, we present a denotational semantics for programmable inference in higher-order probabilistic programming languages, along with a type system that ensures that well-typed inference programs are sound by construction. A central insight is that the type of a probabilistic expression can track the space of its possible execution traces, not just the type of value that it returns, as these traces are often the objects that inference algorithms manipulate. We use our semantics and type system to establish soundness properties of custom inference programs that use constructs for variational, sequential Monte Carlo, importance sampling, and Markov chain Monte Carlo inference.
Liquidate your assets: reasoning about resource usage in liquid Haskell

Liquid Haskell is an extension to the type system of Haskell that supports formal reasoning about program correctness by encoding logical properties as refinement types. In this article, we show how Liquid Haskell can also be used to reason about program efficiency in the same setting. We use the system's existing verification machinery to ensure that the results of our cost analysis are valid, together with custom invariants for particular program contexts to ensure that the results of our analysis are precise. To illustrate our approach, we analyse the efficiency of a wide range of popular data structures and algorithms, and in doing so, explore various notions of resource usage. Our experience is that reasoning about efficiency in Liquid Haskell is often just as simple as reasoning about correctness, and that the two can naturally be combined.
Continual Learning with Bayesian Neural Networks for Non-Stationary Data

This work addresses continual learning for non-stationary data, using Bayesian neural networks and memory-based online variational Bayes. We represent the posterior approximation of the network weights by a diagonal Gaussian distribution and a complementary memory of raw data. This raw data corresponds to likelihood terms that cannot be well approximated by the Gaussian. We introduce a novel method for sequentially updating both components of the posterior approximation. Furthermore, we propose Bayesian forgetting and a Gaussian diffusion process for adapting to non-stationary data. The experimental results show that our update method improves on existing approaches for streaming data. Additionally, the adaptation methods lead to better predictive performance for non-stationary data.
Unsupervised Factory Activity Recognition with Wearable Sensors Using Process Instruction Information

This paper presents an unsupervised method for recognizing assembly work done by factory workers by using wearable sensor data. Such assembly work is a common part of line production systems and typically involves the factory workers performing a repetitive work process made up of a sequence of manual operations, such as setting a board on a workbench and screwing parts onto the board. This study aims to recognize the starting and ending times for individual operations in such work processes through analysis of sensor data collected from the workers along with analysis of the process instructions that detail and describe the flow of operations for each work process. We propose a particle-filter-based factory activity recognition method that leverages (i) trend changes in the sensor data detected by a nonparametric Bayesian hidden Markov model, (ii) semantic similarities between operations discovered in the process instructions, (iii) sensor-data similarities between consecutive repetitions of individual operations, and (iv) frequent sensor-data patterns (motifs) discovered in the overall assembly work processes. We evaluated the proposed method using sensor data from six workers collected in actual factories, achieving a recognition accuracy of 80% (macro-averaged F-measure).
A Novel Cooperative Path Planning for Multirobot Persistent Coverage in Complex Environments

In this paper, a new path planning algorithm is developed to address the problem of persistent and cooperative coverage using a group of robots in a complex environment. Previous works have mainly used geometric division to achieve collaborative coverage search, but ignored the environmental complexity and the path length difference of each robot. In contrast, this paper presents a novel strategy for multi-robot persistent coverage, which aims to obtain more equal coverage route for each robot while guaranteeing both the obstacle avoidance and the minimization of the coverage period. The strategy first deploys the sensors in the target region to satisfy coverage requirements. Then it classifies the sensor points by improved k-means clustering which introducing the feedback mechanism to balance the length of each route. Finally, the approach solves the travelling salesman problem to obtain the closed route for each robot. The numerical simulations show that the proposed approach is feasible to implement the cooperative and persistent coverage in consideration of complicated obstacles, equilibrium of the path length, and the minimization of total cost.
Linear embedding by joint Robust Discriminant Analysis and Inter-class Sparsity

Linear Discriminant Analysis (LDA) and its variants are widely used as feature extraction methods. They have been used for different classification tasks. However, these methods have some limitations that need to be overcome. The main limitation is that the projection obtained by LDA does not provide a good interpretability for the features. In this paper, we propose a novel supervised method used for multi-class classification that simultaneously performs feature selection and extraction. The targeted projection transformation focuses on the most discriminant original features, and at the same time, makes sure that the transformed features (extracted features) belonging to each class have common sparsity. Our proposed method is called Robust Discriminant Analysis with Feature Selection and Inter-class Sparsity (RDA_FSIS). The corresponding model integrates two types of sparsity. The first type is obtained by imposing the ℓ2,1 constraint on the projection matrix in order to perform feature selection. The second type of sparsity is obtained by imposing the inter-class sparsity constraint used for ensuring a common sparsity structure in each class. An orthogonal matrix is also introduced in our model in order to guarantee that the extracted features can retain the main variance of the original data and thus improve the robustness to noise. The proposed method retrieves the LDA transformation by taking into account the two types of sparsity. Various experiments are conducted on several image datasets including faces, objects and digits. The projected features are used for multi-class classification. Obtained results show that the proposed method outperforms other competing methods by learning a more compact and discriminative transformation.
Hessian based analysis of SGD for Deep Nets: Dynamics and Generalization

While stochastic gradient descent (SGD) and variants have been surprisingly successful for training deep nets, several aspects of the optimization dynamics and generalization are still not well understood. In this paper, we present new empirical observations and theoretical results on both the optimization dynamics and generalization behavior of SGD for deep nets based on the Hessian of the training loss and associated quantities. We consider three specific research questions: (1) what is the relationship between the Hessian of the loss and the second moment of stochastic gradients (SGs)? (2) how can we characterize the stochastic optimization dynamics of SGD with fixed step sizes based on the first and second moments of SGs? and (3) how can we characterize a scale-invariant generalization bound of deep nets based on the Hessian of the loss? Throughout the paper, we support theoretical results with empirical observations, with experiments on synthetic data, MNIST, and CIFAR-10, with different batch sizes, and with different difficulty levels by synthetically adding random labels.
NGBoost: Natural Gradient Boosting for Probabilistic Prediction

We present Natural Gradient Boosting (NGBoost), an algorithm for generic probabilistic prediction via gradient boosting. Typical regression models return a point estimate, conditional on covariates, but probabilistic regression models output a full probability distribution over the outcome space, conditional on the covariates. This allows for predictive uncertainty estimation — crucial in applications like healthcare and weather forecasting. NGBoost generalizes gradient boosting to probabilistic regression by treating the parameters of the conditional distribution as targets for a multiparameter boosting algorithm. Furthermore, we show how the Natural Gradient is required to correct the training dynamics of our multiparameter boosting approach. NGBoost can be used with any base learner, any family of distributions with continuous parameters, and any scoring rule. NGBoost matches or exceeds the performance of existing methods for probabilistic prediction while offering additional benefits in flexibility, scalability, and usability. An open-source implementation is available on GitHub.