In this task, you are given the abstract of a research paper. Your task is to generate a summary of this abstract. Your summary should not be very short, but it's better if it's not more than 30 words.

Example Input: Stochastic gradient descent (SGD), which dates back to the 1950s, is one of the most popular and effective approaches for performing stochastic optimization. Research on SGD resurged recently in machine learning for optimizing convex loss functions and training nonconvex deep neural networks. The theory assumes that one can easily compute an unbiased gradient estimator, which is usually the case due to the sample average nature of empirical risk minimization. There exist, however, many scenarios (e.g., graphs) where an unbiased estimator may be as expensive to compute as the full gradient because training examples are interconnected. Recently, Chen et al. (2018) proposed using a consistent gradient estimator as an economic alternative. Encouraged by empirical success, we show, in a general setting, that consistent estimators result in the same convergence behavior as do unbiased ones. Our analysis covers strongly convex, convex, and nonconvex objectives. We verify the results with illustrative experiments on synthetic and real-world data. This work opens several new research directions, including the development of more efficient SGD updates with consistent estimators and the design of efficient training algorithms for large-scale graphs.

Example Output: Convergence theory for biased (but consistent) gradient estimators in stochastic optimization and application to graph convolutional networks

Example Input: Inspired by neurophysiological discoveries of navigation cells in the mammalian
 brain, we introduce the first deep neural network architecture for modeling Egocentric
 Spatial Memory (ESM). It learns to estimate the pose of the agent and
 progressively construct top-down 2D global maps from egocentric views in a spatially
 extended environment. During the exploration, our proposed ESM network
 model updates belief of the global map based on local observations using a recurrent
 neural network. It also augments the local mapping with a novel external
 memory to encode and store latent representations of the visited places based on
 their corresponding locations in the egocentric coordinate. This enables the agents
 to perform loop closure and mapping correction. This work contributes in the
 following aspects: first, our proposed ESM network provides an accurate mapping
 ability which is vitally important for embodied agents to navigate to goal locations.
 In the experiments, we demonstrate the functionalities of the ESM network in
 random walks in complicated 3D mazes by comparing with several competitive
 baselines and state-of-the-art Simultaneous Localization and Mapping (SLAM)
 algorithms. Secondly, we faithfully hypothesize the functionality and the working
 mechanism of navigation cells in the brain. Comprehensive analysis of our model
 suggests the essential role of individual modules in our proposed architecture and
 demonstrates efficiency of communications among these modules. We hope this
 work would advance research in the collaboration and communications over both
 fields of computer science and computational neuroscience.
Example Output: first deep neural network for modeling Egocentric Spatial Memory inspired by neurophysiological discoveries of navigation cells in mammalian brain

Example Input: Approaches to continual learning aim to successfully learn a set of related tasks that arrive in an online manner. Recently, several frameworks have been developed which enable deep learning to be deployed in this learning scenario. A key modelling decision is to what extent the architecture should be shared across tasks. On the one hand, separately modelling each task avoids catastrophic forgetting but it does not support transfer learning and leads to large models. On the other hand, rigidly specifying a shared component and a task-specific part enables task transfer and limits the model size, but it is vulnerable to catastrophic forgetting and restricts the form of task-transfer that can occur. Ideally, the network should adaptively identify which parts of the network to share in a data driven way. Here we introduce such an approach called Continual Learning with Adaptive Weights (CLAW), which is based on probabilistic modelling and variational inference. Experiments show that CLAW achieves state-of-the-art performance on six benchmarks in terms of overall continual learning performance, as measured by classification accuracy, and in terms of addressing catastrophic forgetting.
Example Output:
A continual learning framework which learns to automatically adapt its architecture based on a proposed variational inference algorithm.