Open Access. Powered by Scholars. Published by Universities.®
Artificial Intelligence and Robotics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Machine Learning (cs.LG) (9)
- Learning systems (8)
- Machine learning (6)
- Optimization (6)
- Reinforcement learning (6)
-
- Deep learning (5)
- Stochastic systems (5)
- Artificial Intelligence (cs.AI) (4)
- Computational linguistics (4)
- Simple++ (4)
- Antennas (3)
- Artificial intelligence (3)
- Condition (3)
- Internet of things (3)
- Learn+ (3)
- Optimization and Control (math.OC) (3)
- Wireless networks (3)
- Auto encoders (2)
- Benchmarking (2)
- Classification (of information) (2)
- Classification tasks (2)
- Computer vision (2)
- Constrained optimization (2)
- Design (2)
- Distributed optimization (2)
- Feature extraction (2)
- Feature selection (2)
- Federated learning (2)
- Forecasting (2)
- Geometry (2)
Articles 61 - 86 of 86
Full-Text Articles in Artificial Intelligence and Robotics
Learning To Generalize Dispatching Rules On The Job Shop Scheduling, Zangir Iklassov, Dmitrii Medvedev, Ruben Solozabal, Martin Takac
Learning To Generalize Dispatching Rules On The Job Shop Scheduling, Zangir Iklassov, Dmitrii Medvedev, Ruben Solozabal, Martin Takac
Machine Learning Faculty Publications
This paper introduces a Reinforcement Learning approach to better generalize heuristic dispatching rules on the Job-shop Scheduling Problem (JSP). Current models on the JSP do not focus on generalization, although, as we show in this work, this is key to learning better heuristics on the problem. A well-known technique to improve generalization is to learn on increasingly complex instances using Curriculum Learning (CL). However, as many works in the literature indicate, this technique might suffer from catastrophic forgetting when transferring the learned skills between different problem sizes. To address this issue, we introduce a novel Adversarial Curriculum Learning (ACL) strategy, …
What-Is And How-To For Fairness In Machine Learning: A Survey, Reflection, And Perspective, Zeyu Tang, Jiji Zhang, Kun Zhang
What-Is And How-To For Fairness In Machine Learning: A Survey, Reflection, And Perspective, Zeyu Tang, Jiji Zhang, Kun Zhang
Machine Learning Faculty Publications
Algorithmic fairness has attracted increasing attention in the machine learning community. Various definitions are proposed in the literature, but the differences and connections among them are not clearly addressed. In this paper, we review and reflect on various fairness notions previously proposed in machine learning literature, and make an attempt to draw connections to arguments in moral and political philosophy, especially theories of justice. We also consider fairness inquiries from a dynamic perspective, and further consider the long-term impact that is induced by current prediction and decision. In light of the differences in the characterized fairness, we present a flowchart …
Learning To Control Under Time-Varying Environment, Yuzhen Han, Ruben Solozabal, Jing Dong, Xingyu Zhou, Martin Takac, Bin Gu
Learning To Control Under Time-Varying Environment, Yuzhen Han, Ruben Solozabal, Jing Dong, Xingyu Zhou, Martin Takac, Bin Gu
Machine Learning Faculty Publications
This paper investigates the problem of regret minimization in linear time-varying (LTV) dynamical systems. Due to the simultaneous presence of uncertainty and non-stationarity, designing online control algorithms for unknown LTV systems remains a challenging task. At a cost of NP-hard offline planning, prior works have introduced online convex optimization algorithms, although they suffer from nonparametric rate of regret. In this paper, we propose the first computationally tractable online algorithm with regret guarantees that avoids offline planning over the state linear feedback policies. Our algorithm is based on the optimism in the face of uncertainty (OFU) principle in which we optimistically …
Flecs: A Federated Learning Second-Order Framework Via Compression And Sketching, Artem Agafonov, Dmitry Kamzolov, Rachael Tappenden, Alexander Gasnikov, Martin Takac
Flecs: A Federated Learning Second-Order Framework Via Compression And Sketching, Artem Agafonov, Dmitry Kamzolov, Rachael Tappenden, Alexander Gasnikov, Martin Takac
Machine Learning Faculty Publications
Inspired by the recent work FedNL (Safaryan et al, FedNL: Making Newton-Type Methods Applicable to Federated Learning), we propose a new communication efficient second-order framework for Federated learning, namely FLECS. The proposed method reduces the high-memory requirements of FedNL by the usage of an L-SR1 type update for the Hessian approximation which is stored on the central server. A low dimensional 'sketch' of the Hessian is all that is needed by each device to generate an update, so that memory costs as well as number of Hessian-vector products for the agent are low. Biased and unbiased compressions are utilized to …
Offline Reinforcement Learning With Causal Structured World Models, Zheng-Mao Zhu, Xiong-Hui Chen, Hong-Long Tian, Kun Zhang, Yang Yu
Offline Reinforcement Learning With Causal Structured World Models, Zheng-Mao Zhu, Xiong-Hui Chen, Hong-Long Tian, Kun Zhang, Yang Yu
Machine Learning Faculty Publications
Model-based methods have recently shown promising for offline reinforcement learning (RL), aiming to learn good policies from historical data without interacting with the environment. Previous model-based offline RL methods learn fully connected nets as world-models to map the states and actions to the next-step states. However, it is sensible that a world-model should adhere to the underlying causal effect such that it will support learning an effective policy generalizing well in unseen states. In this paper, We first provide theoretical results that causal world-models can outperform plain world-models for offline RL by incorporating the causal structure into the generalization error …
A Survey On Cache-Aided Noma For 6g Networks, Dipen Bepari, Soumen Mondal, Aniruddha Chandra, Rajeev Shukla, Yuanwei Liu, Mohsen Guizani, Arumugam Nallanathan
A Survey On Cache-Aided Noma For 6g Networks, Dipen Bepari, Soumen Mondal, Aniruddha Chandra, Rajeev Shukla, Yuanwei Liu, Mohsen Guizani, Arumugam Nallanathan
Machine Learning Faculty Publications
Contrary to orthogonal multiple-access (OMA), non-orthogonal multiple-access (NOMA) schemes can serve a pool of users without exploiting the scarce frequency or time domain resources. This is useful in meeting the sixth generation (6G) network requirements, such as, low latency, massive connectivity, users' fairness, and high spectral efficiency. On the other hand, content caching restricts duplicate data transmission by storing popular contents in advance at the network edge which reduces 6G data traffic. In this survey, we focus on cache-aided NOMA-based wireless networks which can reap the benefits of both cache and NOMA; switching to NOMA from OMA enables cache-aided networks …
Pervasive Machine Learning For Smart Radio Environments Enabled By Reconfigurable Intelligent Surfaces, George C. Alexandropoulos, Kyriakos Stylianopoulos, Chongwen Huang, Chau Yuen, Mehdi Bennis, Mérouane Debbah
Pervasive Machine Learning For Smart Radio Environments Enabled By Reconfigurable Intelligent Surfaces, George C. Alexandropoulos, Kyriakos Stylianopoulos, Chongwen Huang, Chau Yuen, Mehdi Bennis, Mérouane Debbah
Machine Learning Faculty Publications
The emerging technology of Reconfigurable Intelligent Surfaces (RISs) is provisioned as an enabler of smart wireless environments, offering a highly scalable, low-cost, hardware-efficient, and almost energy-neutral solution for dynamic control of the propagation of electromagnetic signals over the wireless medium, ultimately providing increased environmental intelligence for diverse operation objectives. One of the major challenges with the envisioned dense deployment of RISs in such reconfigurable radio environments is the efficient configuration of multiple metasurfaces with limited, or even the absence of, computing hardware. In this paper, we consider multi-user and multi-RIS-empowered wireless systems, and present a thorough survey of the online …
Cross-Temporal Snapshot Alignment For Dynamic Multi-Relational Networks, Lvjia Chen, Shangsong Liang
Cross-Temporal Snapshot Alignment For Dynamic Multi-Relational Networks, Lvjia Chen, Shangsong Liang
Machine Learning Faculty Publications
A dynamic network is often represented as a sequence of snapshots evolving over time. In certain real-world scenarios, the identities of nodes in snapshots of a dynamic network are unknown and need to be figured out. To deal with such a challenge, recently, the task of cross-temporal snapshot alignment for dynamic networks is proposed, which aims to match equivalent nodes across temporal snapshots of a dynamic network given a small set of identified nodes. However, in many dynamic multi-relational networks like temporal knowledge graphs, the relation type information of edges, which can be useful for the alignment task, is neglected …
Internet Of Things Device Capabilities, Architectures, Protocols, And Smart Applications In Healthcare Domain: A Review, Md. Milon Islam, Sheikh Noorduddin, Fakhreddine (Fakhri) Karray, Ghulam Muhammad
Internet Of Things Device Capabilities, Architectures, Protocols, And Smart Applications In Healthcare Domain: A Review, Md. Milon Islam, Sheikh Noorduddin, Fakhreddine (Fakhri) Karray, Ghulam Muhammad
Machine Learning Faculty Publications
Nowadays, the Internet has spread to practically every country around the world and is having unprecedented effects on people's lives. The Internet of Things (IoT) is getting more popular and has a high level of interest in both practitioners and academicians in the age of wireless communication due to its diverse applications. The IoT is a technology that enables everyday things to become savvier, everyday computation towards becoming intellectual, and everyday communication to become a little more insightful. In this paper, the most common and popular IoT device capabilities, architectures, and protocols are demonstrated in brief to provide a clear …
Wrapper And Hybrid Feature Selection Methods Using Metaheuristic Algorithms For English Text Classification: A Systematic Review, Osamah Mohammed Alyasiri, Yu N. Cheah, Ammar Kamal Abasi, Omar Mustafa Al-Janabi
Wrapper And Hybrid Feature Selection Methods Using Metaheuristic Algorithms For English Text Classification: A Systematic Review, Osamah Mohammed Alyasiri, Yu N. Cheah, Ammar Kamal Abasi, Omar Mustafa Al-Janabi
Machine Learning Faculty Publications
Feature selection (FS) constitutes a series of processes used to decide which relevant features/attributes to include and which irrelevant features to exclude for predictive modeling. It is a crucial task that aids machine learning classifiers in reducing error rates, computation time, overfitting, and improving classification accuracy. It has demonstrated its efficacy in myriads of domains, ranging from its use for text classification (TC), text mining, and image recognition. While there are many traditional FS methods, recent research efforts have been devoted to applying metaheuristic algorithms as FS techniques for the TC task. However, there are few literature reviews concerning TC. …
Testability Of Instrumental Variables In Linear Non-Gaussian Acyclic Causal Models, Feng Xie, Yangbo He, Zhi Geng, Zhengming Chen, Ru Hou, Kun Zhang
Testability Of Instrumental Variables In Linear Non-Gaussian Acyclic Causal Models, Feng Xie, Yangbo He, Zhi Geng, Zhengming Chen, Ru Hou, Kun Zhang
Machine Learning Faculty Publications
This paper investigates the problem of selecting instrumental variables relative to a target causal influence X → Y from observational data generated by linear non-Gaussian acyclic causal models in the presence of unmeasured confounders. We propose a necessary condition for detecting variables that cannot serve as instrumental variables. Unlike many existing conditions for continuous variables, i.e., that at least two or more valid instrumental variables are present in the system, our condition is designed with a single instrumental variable. We then characterize the graphical implications of our condition in linear non-Gaussian acyclic causal models. Given that the existing graphical criteria …
Industrial Digital Twins At The Nexus Of Nextg Wireless Networks And Computational Intelligence: A Survey, Shah Zeb, Aamir Mahmood, Syed Ali Hassan, Md. Jalil Piran, Mikael Gidlund, Mohsen Guizani
Industrial Digital Twins At The Nexus Of Nextg Wireless Networks And Computational Intelligence: A Survey, Shah Zeb, Aamir Mahmood, Syed Ali Hassan, Md. Jalil Piran, Mikael Gidlund, Mohsen Guizani
Machine Learning Faculty Publications
By amalgamating recent communication and control technologies, computing and data analytics techniques, and modular manufacturing, Industry 4.0 promotes integrating cyber–physical worlds through cyber–physical systems (CPS) and digital twin (DT) for monitoring, optimization, and prognostics of industrial processes. A DT enables interaction with the digital image of the industrial physical objects/processes to simulate, analyze, and control their real-time operation. DT is rapidly diffusing in numerous industries with the interdisciplinary advances in the industrial Internet of things (IIoT), edge and cloud computing, machine learning, artificial intelligence, and advanced data analytics. However, the existing literature lacks in identifying and discussing the role and …
Robustness Analysis Of Classification Using Recurrent Neural Networks With Perturbed Sequential Input, Guangyi Liu, Arash Amini, Martin Takac, Nader Motee
Robustness Analysis Of Classification Using Recurrent Neural Networks With Perturbed Sequential Input, Guangyi Liu, Arash Amini, Martin Takac, Nader Motee
Machine Learning Faculty Publications
For a given stable recurrent neural network (RNN) that is trained to perform a classification task using sequential inputs, we quantify explicit robustness bounds as a function of trainable weight matrices. The sequential inputs can be perturbed in various ways, e.g., streaming images can be deformed due to robot motion or imperfect camera lens. Using the notion of the Voronoi diagram and Lipschitz properties of stable RNNs, we provide a thorough analysis and characterize the maximum allowable perturbations while guaranteeing the full accuracy of the classification task. We illustrate and validate our theoretical results using a map dataset with clouds …
Design Demand Trend Acquisition Method Based On Short Text Mining Of User Comments In Shopping Websites, Zhiyong Xiong, Zhaoxiong Yan, Huanan Yao, Shangsong Liang
Design Demand Trend Acquisition Method Based On Short Text Mining Of User Comments In Shopping Websites, Zhiyong Xiong, Zhaoxiong Yan, Huanan Yao, Shangsong Liang
Machine Learning Faculty Publications
In order to facilitate designers to explore the market demand trend of laptops and to establish a better “network users-market feedback mechanism”, we propose a design and research method of a short text mining tool based on the K-means clustering algorithm and Kano mode. An improved short text clustering algorithm is used to extract the design elements of laptops. Based on the traditional questionnaire, we extract the user’s attention factors, score the emotional tendency, and analyze the user’s needs based on the Kano model. Then, we select 10 laptops, process them by the improved algorithm, cluster the evaluation words and …
Conditional Contrastive Learning With Kernel, Yao Hung Hubert Tsai, Tianqin Li, Martin Q. Ma, Han Zhao, Kun Zhang, Louis Philippe Morency, Ruslan Salakhutdinov
Conditional Contrastive Learning With Kernel, Yao Hung Hubert Tsai, Tianqin Li, Martin Q. Ma, Han Zhao, Kun Zhang, Louis Philippe Morency, Ruslan Salakhutdinov
Machine Learning Faculty Publications
Conditional contrastive learning frameworks consider the conditional sampling procedure that constructs positive or negative data pairs conditioned on specific variables. Fair contrastive learning constructs negative pairs, for example, from the same gender (conditioning on sensitive information), which in turn reduces undesirable information from the learned representations; weakly supervised contrastive learning constructs positive pairs with similar annotative attributes (conditioning on auxiliary information), which in turn are incorporated into the representations. Although conditional contrastive learning enables many applications, the conditional sampling procedure can be challenging if we cannot obtain sufficient data pairs for some values of the conditioning variable. This paper presents …
Adarl: What, Where, And How To Adapt In Transfer Reinforcement Learning, Biwei Huang, Fan Feng, Chaochao Lu, Sara Magliacane, Kun Zhang
Adarl: What, Where, And How To Adapt In Transfer Reinforcement Learning, Biwei Huang, Fan Feng, Chaochao Lu, Sara Magliacane, Kun Zhang
Machine Learning Faculty Publications
One practical challenge in reinforcement learning (RL) is how to make quick adaptations when faced with new environments. In this paper, we propose a principled framework for adaptive RL, called AdaRL, that adapts reliably and efficiently to changes across domains with a few samples from the target domain, even in partially observable environments. Specifically, we leverage a parsimonious graphical representation that characterizes structural relationships over variables in the RL system. Such graphical representations provide a compact way to encode what and where the changes across domains are, and furthermore inform us with a minimal set of changes that one has …
Learning Temporally Causal Latent Processes From General Temporal Data, Weiran Yao, Yuewen Sun, Alex Ho, Changyin Sun, Kun Zhang
Learning Temporally Causal Latent Processes From General Temporal Data, Weiran Yao, Yuewen Sun, Alex Ho, Changyin Sun, Kun Zhang
Machine Learning Faculty Publications
Our goal is to recover time-delayed latent causal variables and identify their relations from measured temporal data. Estimating causally-related latent variables from observations is particularly challenging as the latent variables are not uniquely recoverable in the most general case. In this work, we consider both a nonparametric, nonstationary setting and a parametric setting for the latent processes and propose two provable conditions under which temporally causal latent processes can be identified from their nonlinear mixtures. We propose LEAP, a theoretically-grounded framework that extends Variational AutoEncoders (VAEs) by enforcing our conditions through proper constraints in causal process prior. Experimental results on …
Optimal Transport For Causal Discovery, Ruibo Tu, Kun Zhang, Hedvig Kjellström, Cheng Zhang
Optimal Transport For Causal Discovery, Ruibo Tu, Kun Zhang, Hedvig Kjellström, Cheng Zhang
Machine Learning Faculty Publications
To determine causal relationships between two variables, approaches based on Functional Causal Models (FCMs) have been proposed by properly restricting model classes; however, the performance is sensitive to the model assumptions, which makes it difficult to use. In this paper, we provide a novel dynamical-system view of FCMs and propose a new framework for identifying causal direction in the bivariate case. We first show the connection between FCMs and optimal transport, and then study optimal transport under the constraints of FCMs. Furthermore, by exploiting the dynamical interpretation of optimal transport under the FCM constraints, we determine the corresponding underlying dynamical …
Hsva: Hierarchical Semantic-Visual Adaptation For Zero-Shot Learning, Shiming Chen, Guo Sen Xie, Yang Liu, Qinmu Peng, Baigui Sun, Hao Li, Xinge You, Ling Shao
Hsva: Hierarchical Semantic-Visual Adaptation For Zero-Shot Learning, Shiming Chen, Guo Sen Xie, Yang Liu, Qinmu Peng, Baigui Sun, Hao Li, Xinge You, Ling Shao
Machine Learning Faculty Publications
Zero-shot learning (ZSL) tackles the unseen class recognition problem, transferring semantic knowledge from seen classes to unseen ones. Typically, to guarantee desirable knowledge transfer, a common (latent) space is adopted for associating the visual and semantic domains in ZSL. However, existing common space learning methods align the semantic and visual domains by merely mitigating distribution disagreement through one-step adaptation. This strategy is usually ineffective due to the heterogeneous nature of the feature representations in the two domains, which intrinsically contain both distribution and structure variations. To address this and advance ZSL, we propose a novel hierarchical semantic-visual adaptation (HSVA) framework. …
Learning From Mistakes - A Framework For Neural Architecture Search, Bhanu Garg, Li Zhang, Pradyumna Sridhara, Ramtin Hosseini, Eric P. Xing, Pengtao Xie
Learning From Mistakes - A Framework For Neural Architecture Search, Bhanu Garg, Li Zhang, Pradyumna Sridhara, Ramtin Hosseini, Eric P. Xing, Pengtao Xie
Machine Learning Faculty Publications
Learning from one's mistakes is an effective human learning technique where the learners focus more on the topics where mistakes were made, so as to deepen their understanding. In this paper, we investigate if this human learning strategy can be applied in machine learning. We propose a novel machine learning method called Learning From Mistakes (LFM), wherein the learner improves its ability to learn by focusing more on the mistakes during revision. We formulate LFM as a three-stage optimization problem: 1) learner learns; 2) learner re-learns focusing on the mistakes, and; 3) learner validates its learning. We develop an efficient …
Notmad: Estimating Bayesian Networks With Sample-Specific Structures And Parameters, Benjamin Lengerich, Caleb Ellington, Bryon Aragam, Eric P. Xing, Manolis Kellis
Notmad: Estimating Bayesian Networks With Sample-Specific Structures And Parameters, Benjamin Lengerich, Caleb Ellington, Bryon Aragam, Eric P. Xing, Manolis Kellis
Machine Learning Faculty Publications
Context-specific Bayesian networks (i.e. directed acyclic graphs, DAGs) identify context-dependent relationships between variables, but the non-convexity induced by the acyclicity requirement makes it difficult to share information between context-specific estimators (e.g. with graph generator functions). For this reason, existing methods for inferring context-specific Bayesian networks have favored breaking datasets into subsamples, limiting statistical power and resolution, and preventing the use of multidimensional and latent contexts. To overcome this challenge, we propose NOTEARS-optimized Mixtures of Archetypal DAGs (NOTMAD). NOTMAD models context-specific Bayesian networks as the output of a function which learns to mix archetypal networks according to sample context. The archetypal …
Panoramic Learning With A Standardized Machine Learning Formalism, Zhiting Hu, Eric P. Xing
Panoramic Learning With A Standardized Machine Learning Formalism, Zhiting Hu, Eric P. Xing
Machine Learning Faculty Publications
Machine Learning (ML) is about computational methods that enable machines to learn concepts from experiences. In handling a wide variety of experiences ranging from data instances, knowledge, constraints, to rewards, adversaries, and lifelong interplay in an ever-growing spectrum of tasks, contemporary ML/AI research has resulted in a multitude of learning paradigms and methodologies. Despite the continual progresses on all different fronts, the disparate narrowly-focused methods also make standardized, composable, and reusable development of learning solutions difficult, and make it costly if possible to build AI agents that panoramically learn from all types of experiences. This paper presents a standardized ML …
Molecule Optimization By Explainable Evolution, Binghong Chen, Tianzhe Wang, Chengtao Li, Hanjun Dai, Le Song
Molecule Optimization By Explainable Evolution, Binghong Chen, Tianzhe Wang, Chengtao Li, Hanjun Dai, Le Song
Machine Learning Faculty Publications
Optimizing molecules for desired properties is a fundamental yet challenging task in chemistry, material science, and drug discovery. This paper develops a novel algorithm for optimizing molecular properties via an Expectation-Maximization (EM) like explainable evolutionary process. The algorithm is designed to mimic human experts in the process of searching for desirable molecules and alternate between two stages: the first stage on explainable local search which identifies rationales, i.e., critical subgraph patterns accounting for desired molecular properties, and the second stage on molecule completion which explores the larger space of molecules containing good rationales. We test our approach against various baselines …
Inexact Tensor Methods And Their Application To Stochastic Convex Optimization, Artem Agafonov, Dmitry Kamzolov, Pavel Dvurechensky, Alexander Gasnikov, Martin Takac
Inexact Tensor Methods And Their Application To Stochastic Convex Optimization, Artem Agafonov, Dmitry Kamzolov, Pavel Dvurechensky, Alexander Gasnikov, Martin Takac
Machine Learning Faculty Publications
We propose general non-accelerated and accelerated tensor methods under inexact information on the derivatives of the objective, analyze their convergence rate. Further, we provide conditions for the inexactness in each derivative that is sufficient for each algorithm to achieve a desired accuracy. As a corollary, we propose stochastic tensor methods for convex optimization and obtain sufficient mini-batch sizes for each derivative. © 2020, CC BY.
Human Parsing Based Texture Transfer From Single Image To 3d Human Via Cross-View Consistency, Fang Zhao, Shengcai Liao, Kaihao Zhang, Ling Shao
Human Parsing Based Texture Transfer From Single Image To 3d Human Via Cross-View Consistency, Fang Zhao, Shengcai Liao, Kaihao Zhang, Ling Shao
Machine Learning Faculty Publications
This paper proposes a human parsing based texture transfer model via cross-view consistency learning to generate the texture of 3D human body from a single image. We use the semantic parsing of human body as input for providing both the shape and pose information to reduce the appearance variation of human image and preserve the spatial distribution of semantic parts. Meanwhile, in order to improve the prediction for textures of invisible parts, we explicitly enforce the consistency across different views of the same subject by exchanging the textures predicted by two views to render images during training. The perceptual loss …
Learning To Learn Kernels With Variational Random Features, Xiantong Zhen, Haoliang Sun, Yingjun Du, Jun Xu, Yilong Yin, Ling Shao, Cees Snoek
Learning To Learn Kernels With Variational Random Features, Xiantong Zhen, Haoliang Sun, Yingjun Du, Jun Xu, Yilong Yin, Ling Shao, Cees Snoek
Machine Learning Faculty Publications
We introduce kernels with random Fourier features in the meta-learning framework for few-shot learning. We propose meta variational random features (MetaVRF) to learn adaptive kernels for the base-learner, which is developed in a latent variable model by treating the random feature basis as the latent variable. We formulate the optimization of MetaVRF as a variational inference problem by deriving an evidence lower bound under the meta-learning framework. To incorporate shared knowledge from related tasks, we propose a context inference of the posterior, which is established by an LSTM architecture. The LSTMbased inference network effectively integrates the context information of previous …