Dual NUP Representations and Min-Maximization in Factor Graphs
Normals with unknown parameters (NUP) can be used to convert nontrivial model-based estimation problems into iterations of linear least-squares or Gaussian estimation problems. In this paper, we extend this approach by augmenting factor graphs with convex-dual variables and pertinent NUP representations. In particular, in a state space setting, we propose a new iterative forward-backward algorithm that is dual to a recently proposed backward-forward algorithm.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
GL-Disen: Global-Local disentanglement for unsupervised learning of graph-level representations
Graph-level representation learning plays a crucial role in a variety of tasks such as molecular property prediction and community analysis. Currently, several models based on mutual information maximization have shown s…
DisentanglementGraph Representation LearningMolecular Property PredictionProperty Prediction+1SP-GCRL: Influence Maximization on Incomplete Social Graphs
Influence maximization (IM) in real platforms is challenged by incomplete, noisy social graphs and non-stationary diffusion dynamics. We propose SP-GCRL, a social-propagation-aware graph contrastive reinforcement learnin…
Reinforcement LearningContrastive LearningDeep Graph-Level Clustering Using Pseudo-Label-Guided Mutual Information Maximization Network
In this work, we study the problem of partitioning a set of graphs into different groups such that the graphs in the same group are similar while the graphs in different groups are dissimilar. This problem was rarely stu…
ClusteringGraph ClassificationNode ClusteringPseudo Label+1Learning Disentangled Representations for Time Series
Time-series representation learning is a fundamental task for time-series analysis. While significant progress has been made to achieve accurate representations for downstream applications, the learned representations of…
DisentanglementRepresentation LearningTime SeriesTime Series AnalysisLearning Disentangled Representations in Signed Directed Graphs without Social Assumptions
Signed graphs are complex systems that represent trust relationships or preferences in various domains. Learning node representations in such graphs is crucial for many mining tasks. Although real-world signed relationsh…
DecoderDisentanglement