SearcharxivSearch

arXiv subjects

Mingcan Wang

Publications and source records attributed to Mingcan Wang.

3 recordsLinked to original sources

Deep-Control BSDE: Layerwise Brownian-Weighted Regression for High-Dimensional Semilinear PDEs

High-dimensional semilinear parabolic partial differential equations arise in stochastic control, financial engineering, and uncertainty quantification, but classical spatial discretizations suffer from the curse of dimensionality. Motivated by Gaussian perturbation and conditional regression in denoising score matching, we propose Deep-Control BSDE (\DCBSDE{}), a layerwise control-regression method for Markovian backward stochastic differential equations. From an implicit Euler scheme, we identify the discrete ideal control $z_n^\pi=\mathcal M_nu_{n+1}^\pi$ as the conditional projection coefficient of the successor value response onto the one-step Brownian increment. At each time level, the method freezes the successor value function, approximates the resulting Brownian conditional-moment target using finitely many branches, regresses the control, and then fits the value through the implicit BSDE relation. A frozen linear-response baseline and antithetic pairing reduce finite-branch fluctuations while preserving the conditional target, and a within-layer correction coordinates the value and control approximations. We establish backward stability through a contraction property of the Brownian projection and derive conditional consistency when discretization, local learning, numerical, and finite-branch errors vanish jointly. Experiments across six benchmarks demonstrate that \DCBSDE{} achieves a favorable overall balance among value accuracy, control accuracy, and dynamic consistency while exhibiting generally stable performance across random seeds. These results support the use of \DCBSDE{} in applications requiring reliable joint approximation of the value and control processes.

stat.CO

GCN-MPPR: Enhancing the Propagation of Message Passing Neural Networks via Motif-Based Personalized PageRank

The algorithms based on message passing neural networks (MPNNs) on graphs have recently achieved great success for various graph applications. However, studies find that these methods always propagate the information to very limited neighborhoods with shallow depth, particularly due to over-smoothing. That means most of the existing MPNNs fail to be so `deep'. Although some previous work tended to handle this challenge via optimization- or structure-level remedies, the overall performance of GCNs still suffers from limited accuracy, poor stability, and unaffordable computational cost. Moreover, neglect of higher-order relationships during the propagation of MPNNs has further limited the performance of them. To overcome these challenges, a novel variant of PageRank named motif-based personalized PageRank (MPPR) is proposed to measure the influence of one node to another on the basis of considering higher-order motif relationships. Secondly, the MPPR is utilized to the message passing process of GCNs, thereby guiding the message passing process at a relatively `high' level. The experimental results show that the proposed method outperforms almost all of the baselines on accuracy, stability, and time consumption. Additionally, the proposed method can be considered as a component that can underpin almost all GCN tasks, with DGCRL being demonstrated in the experiment. The anonymous code repository is available at: https://anonymous.4open.science/r/GCN-MPPR-AFD6/.

cs.AI

RLBayes: a Bayesian Network Structure Learning Algorithm via Reinforcement Learning-Based Search Strategy

The score-based structure learning of Bayesian network (BN) is an effective way to learn BN models, which are regarded as some of the most compelling probabilistic graphical models in the field of representation and reasoning under uncertainty. However, the search space of structure learning grows super-exponentially as the number of variables increases, which makes BN structure learning an NP-hard problem, as well as a combination optimization problem (COP). Despite the successes of many heuristic methods on it, the results of the structure learning of BN are usually unsatisfactory. Inspired by Q-learning, in this paper, a Bayesian network structure learning algorithm via reinforcement learning-based (RL-based) search strategy is proposed, namely RLBayes. The method borrows the idea of RL and tends to record and guide the learning process by a dynamically maintained Q-table. By creating and maintaining the dynamic Q-table, RLBayes achieve storing the unlimited search space within limited space, thereby achieving the structure learning of BN via Q-learning. Not only is it theoretically proved that RLBayes can converge to the global optimal BN structure, but also it is experimentally proved that RLBayes has a better effect than almost all other heuristic search algorithms.

cs.LG