Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mingtian Peng

dblp:392/0151 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0003-8948-0759ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Graph learning · 44% Probabilistic and Bayesian machine learning · 44% Reinforcement learning · 13%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph neural network
1.012026
DynaFLUX: Implicit Dynamics-Preserving Reinforcement Learning for Topology-Free Influence Maximization · WWW 2026
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
latent dynamics learning
1.012026
DynaFLUX: Implicit Dynamics-Preserving Reinforcement Learning for Topology-Free Influence Maximization · WWW 2026
Algorithmic game theory and mechanism design
influence maximization
1.012026
DynaFLUX: Implicit Dynamics-Preserving Reinforcement Learning for Topology-Free Influence Maximization · WWW 2026
Machine learning › Reinforcement learning
policy optimization
0.312026
DynaFLUX: Implicit Dynamics-Preserving Reinforcement Learning for Topology-Free Influence Maximization · WWW 2026

Methods — techniques the papers use, named apart from their topics

self-attention pointer network · 2.0reinforcement learning · 2.0monte carlo diffusion · 2.0generative modeling · 2.0
YearPublicationVenuePosition
2026 DynaFLUX: Implicit Dynamics-Preserving Reinforcement Learning for Topology-Free Influence Maximization
abstract
Influence maximization (IM) aims to select a small set of seed nodes whose activation triggers a maximal cascade. Existing methods typically assume access to the network topology or a reliable surrogate, which is often unavailable in practice due to noisy, privacy-protected, or partially observed links. These settings pose two challenges: (1) the lack of explicit topology removes a key inductive constraint for diffusion modeling, undermining influence estimation, and (2) nonlinear, temporally dependent node interactions yield complex multivariate time series that hinder topology inference. We propose DynaFLUX, an end-to-end generative framework for IM under hidden topology. DynaFLUX learns a compact surrogate of latent dynamics directly from observed time series, and jointly optimizes a seed-selection policy via reinforcement learning. A self-attention pointer network captures long-range dependencies for seed generation, while an influence-prediction module infers a surrogate topology and uses Monte Carlo diffusion to provide policy-gradient rewards. Experiments show that DynaFLUX accurately identifies influential spreaders and consistently outperforms state-of-the-art baselines in unseen topology scenarios.
Daiyunke Zhang, Ting Deng, Tianchen Zhu, Shuai Ma 0001, Daqing Li, Mingtian Peng
WWW6
2026 Zero-shot reinforcement learning for multi-domain task-oriented dialogue policy
Richong Zhang, Xudong Liu 0001, Mingtian Peng
Frontiers Comput. Sci.5