SearcharxivSearch

arXiv subjects

Shudong Yang

Publications and source records attributed to Shudong Yang.

6 recordsLinked to original sources

When AI Deceives: A Natural Experiment on the Causal Effects of Perceived Deception on Player Ratings in RPGs

AI-driven deception mechanisms are increasingly prevalent in digital games, yet the direction and magnitude of their effects on player experience remain contested. Existing research has not sufficiently disentangled designer-intended deception intensity from players' actual perception of deception, and most prior work relies on low-ecological-validity experiments or cross-sectional surveys. The present study aims to independently examine the causal effects of design deception intensity (DDI) and player deception awareness (PDA) on player ratings within a naturalistic gaming environment, and to investigate the moderating role of player experience. Leveraging the 54 version updates of Baldur's Gate 3 between 2019 and 2025 as a quasi-natural experiment, it collected all English-language Steam reviews posted within 1 to 28 days following each update, and constructed a player-version two-way fixed effects panel dataset. DDI was coded by human annotators based on patch notes; PDA was extracted and aggregated from review texts using a fine-tuned BERT classifier. The model incorporated both player and version fixed effects, complemented by five robustness checks including subsample partitioning, lagged variables, and placebo tests. PDA exerts a monotonic negative effect on positive review rates: within the observed PDA range, the net loss in review valence is approximately 0.4 percentage points, with a negative quadratic term that falsifies the inverted-U hypothesis of moderate perception optimality. DDI exhibits a U-shaped effect with an inflection point at a relatively low intensity, although the upward trend on the right branch is primarily driven by contemporaneous new content bundled with high-intensity updates. Any degree of deception awareness undermines player evaluations, while the positive manifestation of design intensity depends on content-confounding effects.

cs.CY

HERMES: KV Cache as Hierarchical Memory for Efficient Streaming Video Understanding

Recent advancements in Multimodal Large Language Models (MLLMs) have demonstrated significant improvement in offline video understanding. However, extending these capabilities to streaming video inputs, remains challenging, as existing models struggle to simultaneously maintain stable understanding performance, real-time responses, and low GPU memory overhead. To address this challenge, we propose HERMES, a novel training-free architecture for real-time and accurate understanding of video streams. Based on a mechanistic attention investigation, we conceptualize KV cache as a hierarchical memory framework that encapsulates video information across multiple granularities. During inference, HERMES reuses a compact KV cache, enabling efficient streaming understanding under resource constraints. Notably, HERMES requires no auxiliary computations upon the arrival of user queries, thereby guaranteeing real-time responses for continuous video stream interactions, which achieves 10$\times$ faster TTFT compared to prior SOTA. Even when reducing video tokens by up to 68% compared with uniform sampling, HERMES achieves superior or comparable accuracy across all benchmarks, with up to 11.4% gains on streaming datasets.

cs.CV

Discipline Reputation Evaluation Based on PhD Exchange Network

When reputation evaluation indicators become targets, existing indicators will lose the role of indicating the true quality; At present, the evaluation of discipline reputation mostly focuses on subjective evaluation based on objective data, and there is a dispute about reliability and validity; Due to different indicators and weight settings, it is difficult to make horizontal comparison among disciplines; The evaluation also has a certain time lag. In order to solve the above four problems, this study explores a new method of discipline reputation evaluation. Taking the business administration discipline as an example, it collects data of 5848 doctoral graduates who first entered teaching posts, establishes a directed adjacency matrix from the employment unit to the doctoral degree awarding unit, and uses the theory and method of social network analysis to conduct quantitative analysis on the doctoral mutual employment network. The results show that: (1) PhD exchange network can explain discipline reputation and is a new indicator to measure discipline reputation; (2) From the perspective of employment behavior among colleges and universities, there is horizontal flow and downward flow between the head colleges and universities, and downward flow is mainly among the middle and lower colleges. There is a time lag between college talent recruitment and academic achievement output. Therefore, the mining of the structural characteristics and network evolution trend of the PhD exchange network based on the "foot voting" of doctoral graduates is faster than the discipline ranking based on the follow-up achievement indicators to reflect the changes in the discipline quality, which can be used to warn the changes in the discipline quality.

cs.SI

Who will dropout from university? Academic risk prediction based on interpretable machine learning

In the institutional research mode, in order to explore which characteristics are the best indicators for predicting academic risk from the student behavior data sets that have high-dimensional, unbalanced classified small sample, it transforms the academic risk prediction of college students into a binary classification task. It predicts academic risk based on the LightGBM model and the interpretable machine learning method of Shapley value. The simulation results show that from the global perspective of the prediction model, characteristics such as the quality of academic partners, the seating position in classroom, the dormitory study atmosphere, the English scores of the college entrance examination, the quantity of academic partners, the addiction level of video games, the mobility of academic partners, and the degree of truancy are the best 8 predictors for academic risk. It is contrary to intuition that characteristics such as living in campus or not, work-study, lipstick addiction, student leader or not, lover amount, and smoking have little correlation with university academic risk in this experiment. From the local perspective of the sample, the factors affecting academic risk vary from person to person. It can perform personalized interpretable analysis through Shapley values, which cannot be done by traditional mathematical statistical prediction models. The academic contributions of this research are mainly in two aspects: First, the learning interaction networks is proposed for the first time, so that social behavior can be used to compensate for the one-sided individual behavior and improve the performance of academic risk prediction. Second, the introduction of Shapley value calculation makes machine learning that lacks a clear reasoning process visualized, and provides intuitive decision support for education managers.

cs.LG

Academic Lobification: Low-performance Control Strategy for Long-planed Academic Purpose

Academic lobification refers to a collection of academic performance control strategies, methods, and means that a student deliberately hides academic behaviors, or deliberately lowers academic performance, or deliberately delays academic returns for a certain long-term purpose, but does not produce academic risks. Understanding academic lobification is essential to our ability to compensate for inherent deviations in the evaluation of students' academic performance, discover gifted student, reap benefits and minimize harms. It outlines a set of questions that are fundamental to this emerging interdisciplinary research field, including research object, research question, research scope, research method, and explores the technical, legal and other constraints on the study of academic lobification.

cs.CY

Mining Meta-indicators of University Ranking: A Machine Learning Approach Based on SHAP

University evaluation and ranking is an extremely complex activity. Major universities are struggling because of increasingly complex indicator systems of world university rankings. So can we find the meta-indicators of the index system by simplifying the complexity? This research discovered three meta-indicators based on interpretable machine learning. The first one is time, to be friends with time, and believe in the power of time, and accumulate historical deposits; the second one is space, to be friends with city, and grow together by co-develop; the third one is relationships, to be friends with alumni, and strive for more alumni donations without ceiling.

stat.AP