On harmonic analysis of causal operators

We follow the group representation theory approach to define causal operators on Banach modules and present some of their spectral properties.     

Invariant smoothness measures for surfaces

Two novel smoothness measures for surfaces are presented in this paper. The second and third order smoothness are defined as the squared normal curvature and the squared variation in normal curvature integrated over all directions in the tangent plane. Both quantities are truly geometric in the sense that they are invariant with respect to the actual parametrization of the surface. All the same, all formulae are derived in terms of an arbitrary parametrization. In addition to providing a basis for variational surface construction, the second and third order smoothness can also be used for evaluation and assessment of the quality of an existing surface. This revised version was published online in August 2006 with corrections to the Cover Date.     

Algorithms for fair k-clustering with multiple protected attributes

We study fair center based clustering problems. In an influential paper, Chierichetti, Kumar, Lattanzi and Vassilvitskii (NIPS 2017) consider the problem of finding a good clustering, say of women and men, such that every cluster contains an equal number of women and men. They were able to obtain a constant factor approximation for this problem for most center based k-clustering objectives such as k-median, k-means, and k-center. Despite considerable interest in extending this problem for multiple protected attributes (e.g. women and men, with or without citizenship), so far constant factor approximations for these problems have remained elusive except in special cases. We settle this question in the affirmative by giving the first constant factor approximation for a wide range of center based k-clustering objectives.     

Bayesian Network Structure Learning Method Based on Causal Direction Graph for Protein Signaling Networks

Constructing the structure of protein signaling networks by Bayesian network technology is a key issue in the field of bioinformatics. The primitive structure learning algorithms of the Bayesian network take no account of the causal relationships between variables, which is unfortunately important in the application of protein signaling networks. In addition, as a combinatorial optimization problem with a large searching space, the computational complexities of the structure learning algorithms are unsurprisingly high. Therefore, in this paper, the causal directions between any two variables are calculated first and stored in a graph matrix as one of the constraints of structure learning. A continuous optimization problem is constructed next by using the fitting losses of the corresponding structure equations as the target, and the directed acyclic prior is used as another constraint at the same time. Finally, a pruning procedure is developed to keep the result of the continuous optimization problem sparse. Experiments show that the proposed method improves the structure of the Bayesian network compared with the existing methods on both the artificial data and the real data, meanwhile, the computational burdens are also reduced significantly.     

An Improved Temporal Fusion Transformers Model for Predicting Supply Air Temperature in High-Speed Railway Carriages

A key element for reducing energy consumption and improving thermal comfort on high-speed rail is controlling air-conditioning temperature. Accurate prediction of air supply temperature is aimed at improving control effects. Existing studies of supply air temperature prediction models are interdisciplinary, involving heat transfer science and computer science, where the problem is defined as time-series prediction. However, the model is widely accepted as a complex model that is nonlinear and dynamic. That makes it difficult for existing statistical and deep learning methods, e.g., autoregressive integrated moving average model (ARIMA), convolutional neural network (CNN), and long short-term memory network (LSTM), to fully capture the interaction between these variables and provide accurate prediction results. Recent studies have shown the potential of the Transformer to increase the prediction capacity. This paper offers an improved temporal fusion transformers (TFT) prediction model for supply air temperature in high-speed train carriages to tackle these challenges, with two improvements: (i) Double-convolutional residual encoder structure based on dilated causal convolution; (ii) Spatio-temporal double-gated structure based on Gated Linear Units. Moreover, this study designs a loss function suitable for general long sequence time-series forecast tasks for temperature forecasting. Empirical simulations using a high-speed rail air-conditioning operation dataset at a specific location in China show that the temperature prediction of the two units using the improved TFT model improves the MAPE by 21.70% and 11.73%, respectively the original model. Furthermore, experiments demonstrate that the model effectively outperforms seven popular methods on time series computing tasks, and the attention of the prediction problem in the time dimension is analyzed.     

The Evolution of Fairness in the Ultimatum Game

The article presents a model on the evolution of strategies in the Ultimatum game. In particular, the model considers the effect of role turnover and interaction structure. Past experimental studies showed that subjects behave more fairly than would be predicted by classical game theory. The goal of this model is to illuminate how fairness emerges in evolution when role turnover and preferential association are in effect. Simulation shows that evolution towards strategies of fairness is plausible. Some empirical implications are also discussed.     

Causal Discovery in High-Dimensional Point Process Networks with Hidden Nodes

Thanks to technological advances leading to near-continuous time observations, emerging multivariate point process data offer new opportunities for causal discovery. However, a key obstacle in achieving this goal is that many relevant processes may not be observed in practice. Naïve estimation approaches that ignore these hidden variables can generate misleading results because of the unadjusted confounding. To plug this gap, we propose a deconfounding procedure to estimate high-dimensional point process networks with only a subset of the nodes being observed. Our method allows flexible connections between the observed and unobserved processes. It also allows the number of unobserved processes to be unknown and potentially larger than the number of observed nodes. Theoretical analyses and numerical studies highlight the advantages of the proposed method in identifying causal interactions among the observed processes.     

Interventional Fairness with Indirect Knowledge of Unobserved Protected Attributes

The deployment of machine learning (ML) systems in applications with societal impact has motivated the study of fairness for marginalized groups. Often, the protected attribute is absent from the training dataset for legal reasons. However, datasets still contain proxy attributes that capture protected information and can inject unfairness in the ML model. Some deployed systems allow auditors, decision makers, or affected users to report issues or seek recourse by flagging individual samples. In this work, we examine such systems and consider a feedback-based framework where the protected attribute is unavailable and the flagged samples are indirect knowledge. The reported samples are used as guidance to identify the proxy attributes that are causally dependent on the (unknown) protected attribute. We work under the causal interventional fairness paradigm. Without requiring the underlying structural causal model a priori, we propose an approach that performs conditional independence tests on observed data to identify such proxy attributes. We theoretically prove the optimality of our algorithm, bound its complexity, and complement it with an empirical evaluation demonstrating its efficacy on various real-world and synthetic datasets.     

When Can Statistical Theories Be Causally Closed?

The notion of common cause closedness of a classical, Kolmogorovian probability space with respect to a causal independence relation between the random events is defined, and propositions are presented that characterize common cause closedness for specific probability spaces. It is proved in particular that no probability space with a finite number of random events can contain common causes of all the correlations it predicts; however, it is demonstrated that probability spaces even with a finite number of random events can be common cause closed with respect to a causal independence relation that is stronger than logical independence. Furthermore it is shown that infinite, atomless probability spaces are always common cause closed in the strongest possible sense. Open problems concerning common cause closedness are formulated and the results are interpreted from the perspective of Reichenbach's Common Cause Principle (RCCP).     

Non-standard aspects of Minkowski causal logic

The Minkowski causal logic, which is already known to be a complete orthomodular lattice, is found to be also an atomistic and irreducible logic, but to have no other essential properties to be represented in terms of all the subspace of some Hilbert space. Alternative representation of the logic in terms of subspaces of a real vector space or of the states in terms of probability measures are suggested.