Skip to content

Author

Shaoting Tang

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Apr 2026

Reinforcement learning with reputation-based adaptive exploration promotes cooperation.

Reinforcement learning provides a framework for studying how individuals adjust their behavior through repeated interaction and feedback in social dilemmas. In Q-learning, exploration controls how often agents choose actions other than those favored by their current learned Q-values. Yet, the existing models usually treat the exploration rate as a constant parameter. In systems with social evaluation, however, trial-and-error behavior carries different costs and opportunities for agents with different reputations, making exploration dependent on social standing rather than uniform across agents. Herein, we develop a spatial prisoner's dilemma model in which Q-learning agents adapt their exploration rates according to local reputation differences, while reputation is updated through an asymmetric, state-dependent rule. The results show that adaptive exploration and asymmetric reputation updating each promote cooperation, but their combination produces a stronger reinforcing effect than either mechanism alone. Low-reputation agents explore more and can recover reputation through cooperation, while high-reputation agents explore less and avoid reputation losses caused by defection. This mechanism also reorganizes cooperation in space, producing a stable checkerboard-like coexistence at intermediate reputation concern. In addition, cooperation is most vulnerable at intermediate baseline exploration rates, whereas stronger asymmetric reputation updating mitigates this exploration-induced disruption. These results suggest that reputation can act not only as a record of past behavior but also as a dynamic signal that regulates exploratory behavior during learning and thereby stabilizes cooperation.

Ang Li, Wenqiang Zhu, Chao-Qian Wang et al. · 0 citations
Open access Aug 2026

Reliable Rule-Guided Augmentation for Knowledge Graph Completion

Knowledge graph completion (KGC) commonly relies on embedding models trained with observed triples. Multi-hop paths provide additional evidence, but rule-derived triples differ in reliability and should not receive equal training weight. We study how to select reliable candidates using only the training graph and how to control their influence across different scoring functions. Our method induces Horn rules from target-relation-guided random walks and assigns each candidate a reliability score. The score combines smoothed rule confidence, normalized support, path consistency, type validity, and redundancy. Selected candidates enter the embedding objective as weighted positive samples, while the embedding model remains the final link predictor. Across five scoring functions, the method increases MRR by 0.001–0.012 on WN18RR and 0.001–0.005 on FB15k-237 in matched Base/Aug comparisons. The sensitivity and ablation results show that unfiltered multi-hop triples can impair performance and candidate control is necessary in the evaluated setting.

Qingsong Li, You Lv, Xiangnan Feng et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.