In this task, you are given a part of an article. Your task is to generate headline (title) for this text. Preferred headlines are under fifteen words.

Protein subcellular localization prediction is an important and challenging problem. The traditional biology experiments are expensive and time-consuming, so more and more research interests tend to a series of machine learning approaches for predicting protein subcellular location. There are two main difficult problems among the existing state-of-the-art methods. First, most of the existing techniques are designed to deal with the multi-class but not the multi-label classification, which ignores the connection between the multiple labels. In reality, multiple location proteins implicate that there are vital and unique biological significances worthy of special focus, which cannot be ignored. Second, the techniques for handling imbalanced data in multi-label classification problem is significant but less. For solving the two issues, we have developed an ensemble multi-label classifier called HPSLPred which can be applied for the multi-label classification with imbalanced protein source. For the conveniences of users, a user-friendly webserver for HPSLPred was established at http://server.malab.cn/HPSLPred.
HPSLPred: An Ensemble Multi-label Classifier for Human Protein Subcellular Location Prediction with Imbalanced Source

The success of semi-supervised learning crucially relies on the scalability to a huge amount of unlabelled data that are needed to capture the underlying manifold structure for better classification. Since computing the pairwise similarity between the training data is prohibitively expensive in most kinds of input data, currently, there is no general readyto-use semi-supervised learning method/tool available for learning with tens of millions or more data points. In this paper, we adopted the idea of two low-rank label propagation algorithms, GLNP (Global Linear Neighborhood Propagation) and Kernel Nyström Approximation, and implemented the parallelized version of the two algorithms accelerated with Nesterov’s accelerated projected gradient descent for Big-data Label Propagation (BigLP). The parallel algorithms are tested on five real datasets ranging from 7000 to 10,000,000 in size and a simulation dataset of 100,000,000 samples. In the experiments, the implementation can scale up to datasets with 100,000,000 samples and hundreds of features and the algorithms also significantly improved the prediction accuracy when only a very small percentage of the data is labeled. The results demonstrate that the BigLP implementation is highly scalable to big data and effective in utilizing the unlabeled data for semi-supervised learning.
Low-rank Label Propagation for Semi-supervised Learning with 100 Millions Samples

We study optimization algorithms based on variance reduction for stochastic gradient descent (SGD). Remarkable recent progress has been made in this direction through development of algorithms like SAG, SVRG, SAGA. These algorithms have been shown to outperform SGD, both theoretically and empirically. However, asynchronous versions of these algorithms—a crucial requirement for modern large-scale applications—have not been studied. We bridge this gap by presenting a unifying framework for many variance reduction techniques. Subsequently, we propose an asynchronous algorithm grounded in our framework, and prove its fast convergence. An important consequence of our general approach is that it yields asynchronous versions of variance reduction algorithms such as SVRG and SAGA as a byproduct. Our method achieves near linear speedup in sparse settings common to machine learning. We demonstrate the empirical performance of our method through a concrete realization of asynchronous SVRG.

On Variance Reduction in Stochastic Gradient Descent and its Asynchronous Variants