Searcharxiv⌕ Search

arXiv subjects

Chi Zhao

Publications and source records attributed to Chi Zhao.

8 recordsLinked to original sources

Leverage-Enhanced Sampling Owen Method for Explainable Artificial Intelligence

Recently, the Shapley value has been widely applied in machine learning for feature importance analysis and model explainability. The multilinear extension of games proposed by Owen (1972) expresses the Shapley value as the integral of partial derivatives along the main diagonal of the cube. Direct evaluation of this integral requires exponential-time computation of the partial derivatives. To improve computational efficiency, we propose a sampling-based estimation strategy within Owen's multilinear extension framework, combining stratified sampling with coalition leverage scores. Experimental results demonstrate that the proposed method significantly reduces computational costs while maintaining explanation accuracy.

cs.GT↗

Min-Marginal Power Indices for Multi-Objective Feature Selection

Game-theoretic feature selection scores each feature by its average marginal contribution across coalitions. An average shows whether a feature helps overall, but not whether, in some coalition, adding it turns an acceptable model into an unacceptable one. Building on minimum marginal aggregation, we define the Min-Marginal Power Index (MinPI) on a binary utility-threshold game. For a fixed quota, MinPI takes the value -1, 0, or +1 and labels each feature harmful, neutral, or decisive. A harmful label carries its own evidence, an evaluated coalition in which adding the feature drops utility below the quota, so no score cutoff is needed; finite-budget estimators keep this property but may miss harmful features. We use MinPI to propose feature removals, which are accepted only if they pass a validation gate, and to prefilter multi-objective search. On six benchmark datasets over five seeds, MinPI removed 12.5% of analyzed features with almost no loss of held-out utility. On Madelon and Abalone, where it removed the most, its removals cost far less held-out utility than random removals of the same size. Prefiltering increased the dataset-averaged hypervolume of multi-objective search in all five seeds. MinPI is therefore a conservative feature-deletion step whose gains are largest where the data contain many removable features.

cs.LG↗

TempShap: When and How Much a Feature Matters in Time-Series Forecasting

Attribution for a time-series forecaster should answer two questions that a feature-level scalar cannot: when in the input window a feature acts, and how much its influence changes across the forecast horizon. Most existing Shapley explainers treat each feature as one player and therefore collapse both axes. We propose TempShap, a retrospective, loss-based Shapley framework whose players are the individual input cells $(t,i)$. Its attribution tensor yields temporal-localization and horizon-impact profiles. We validate these against planted temporal structures, a tractable exact cell game, and a closed-form attribution oracle for a real linear forecaster. Permutation sharing estimates the cell-level game at localized perturbation cost. Under redundant inputs, one-at-a-time scores under-credit substitutable information, whereas the signed Shapley decomposition preserves total value and yields more reliable held-out deletion rankings under mean masking. A planted counterexample isolates the redundancy mechanism. Experiments show a deletion-ranking advantage across Shapley estimators, forecasting benchmarks, and model families. TempShap therefore makes fine-grained Shapley attribution both practical and operationally useful.

cs.AI↗

Strategic inputs: feature selection from game-theoretic perspective

The exponential growth of data volumes has led to escalating computational costs in machine learning model training. However, many features fail to contribute positively to model performance while consuming substantial computational resources. This paper presents an end-to-end feature selection framework for tabular data based on game theory. We formulate feature selection procedure based on a cooperative game where features are modeled as players, and their importance is determined through the evaluation of synergistic interactions and marginal contributions. The proposed framework comprises four core components: sample selection, game-theoretic feature importance evaluation, redundant feature elimination, and optimized model training. Experimental results demonstrate that the proposed method achieves substantial computation reduction while preserving predictive performance, thereby offering an efficient solution of the computational challenges of large-scale machine learning. The source code is available at https://github.com/vectorsss/strategy_inputs.

cs.LG↗

ShapG: new feature importance method based on the Shapley value

With wide application of Artificial Intelligence (AI), it has become particularly important to make decisions of AI systems explainable and transparent. In this paper, we proposed a new Explainable Artificial Intelligence (XAI) method called ShapG (Explanations based on Shapley value for Graphs) for measuring feature importance. ShapG is a model-agnostic global explanation method. At the first stage, it defines an undirected graph based on the dataset, where nodes represent features and edges are added based on calculation of correlation coefficients between features. At the second stage, it calculates an approximated Shapley value by sampling the data taking into account this graph structure. The sampling approach of ShapG allows to calculate the importance of features efficiently, i.e. to reduce computational complexity. Comparison of ShapG with other existing XAI methods shows that it provides more accurate explanations for two examined datasets. We also compared other XAI methods developed based on cooperative game theory with ShapG in running time, and the results show that ShapG exhibits obvious advantages in its running time, which further proves efficiency of ShapG. In addition, extensive experiments demonstrate a wide range of applicability of the ShapG method for explaining complex models. We find ShapG an important tool in improving explainability and transparency of AI systems and believe it can be widely used in various fields.

cs.AI↗

Ray-Tracing Channel Modeling for LEO Satellite-to-Ground Communication Systems

Based on the vision of global coverage for sixth-generation (6G) wireless communication systems, the low earth orbit (LEO) satellite-to-ground channel model for urban scenarios has emerged as highly important for the system design. In this paper, we propose an LEO satellite-to-ground channel model through shooting and bouncing rays (SBR) algorithm to analyze the channel characteristics. The orbit of LEO is modeled by the simplified general perturbations 4 (SGP4), and an accurate celestial model is applied to calculate the Doppler shift of multipath in a transmission time window of LEO satellite-to-ground communications. Channel characteristics of LEO satellite-to-ground communications such as the root-mean-square (RMS) delay spread, the Doppler shift, and the received power at different times are obtained. The simulation results show that the received power is only significantly noticeable in the transmission time window when the satellite is close to the receiver. Proposed model validates the effectiveness of ray-tracing in actual LEO satellite-to-ground communication scenarios and extends the calculation of the Doppler shift.

eess.SY↗

Centrality measures and opinion dynamics in two-layer networks with replica nodes

We examine two-layer networks and centrality measures defined on them. We propose two fast and accurate algorithms to approximate the game-theoretic centrality measures and examine connection between centrality measures and characteristics of opinion dynamic processes on such networks. As an example, we consider a Zachary's karate club social network and extend it by adding the second (internal) layer of communication. Internal layer represents the idea that individuals can share their real opinions with their close friends. The structures of the external and internal layers may be different. As characteristics of opinion dynamic processes we mean consensus time and winning rate of a particular opinion. We find significantly strong positive correlation between internal graph density and consensus time, and significantly strong negative correlation between centrality of authoritative nodes and consensus time.

physics.soc-ph↗

Opinion Dynamics in Two-Layer Networks with Hypocrisy

We propose a general concealed voter model (GCVM), in which individuals interact in two layers and can exchange their opinions in the internal layer. This interaction is not allowed in a concealed voter model (CVM). By exchanging opinions in the internal layer we mean that individuals share their real or internal opinions with their close friends. The process of opinion formation in GCVM is presented in the paper. We make the series of numerical simulations of GCVM with different network structures (both external and internal) and get some counterintuitive conclusions. For instance, we find out that sometimes with a relatively simple network structure of an external layer the consensus within the individuals' opinions cannot be reached, and if individuals in the network are not good at expressing their opinions publicly (in an external layer), exchanging opinions with their close friends (in an internal layer) is almost useless.

physics.soc-ph↗