Miracle-dz/UniFAR-FTUs huggingface dataset:
A Network Embedding Based Method for Cascade Prediction on Social Networks

—The prediction for information diffusion on social networks has great practical signiﬁcance in marketing and public opinion control. It aims to predict the individuals who will potentially repost the message on the social network. One type of method is based on demographics, complex networks and other prior knowledge to establish an interpretable model to simulate and predict the propagation process, while the other type of method is completely data-driven and maps the nodes to a latent space for propagation prediction. Existing latent space design and embedding methods lack consideration for the intervene among users. In this paper, we propose an independent asymmetric embedding method to embed each individual into one latent inﬂuence space and multiple latent susceptibility spaces. Based on the similarity between information diffusion and heat diffusion phenomenon, the heat diffusion kernel is exploited in our model and establishes the embedding rules. Furthermore, our method captures the co-occurrence regulation of user combinations in cascades to improve the calculating effectiveness. The results of extensive experiments conducted on real-world datasets verify both the predictive accuracy and cost-effectiveness of our approach.
Efficient Policy Space Response Oracles

Policy Space Response Oracle methods (PSRO) provide a general solution to learn Nash equilibrium in two-player zero-sum games but suffer from two drawbacks: (1) the computation inefficiency due to the need for consistent meta-game evaluation via simulations, and (2) the exploration inefficiency due to finding the best response against a fixed meta-strategy at every epoch. In this work, we propose Efficient PSRO (EPSRO) that largely improves the efficiency of the above two steps. Central to our development is the newly-introduced subroutine of no-regret optimization on the unrestricted-restricted (URR) game. By solving URR at each epoch, one can evaluate the current game and compute the best response in one forward pass without the need for meta-game simulations. Theoretically, we prove that the solution procedures of EPSRO offer a monotonic improvement on the exploitability, which none of existing PSRO methods possess. Furthermore, we prove that the no-regret optimization has a regret bound of $\mathcal{O}(\sqrt{T\log{[(k^2+k)/2]}})$, where $k$ is the size of restricted policy set. Most importantly, a desirable property of EPSRO is that it is parallelizable, this allows for highly efficient exploration in the policy space that induces behavioral diversity. We test EPSRO on three classes of games, and report a 50x speedup in wall-time and 10x data efficiency while maintaining similar exploitability as existing PSRO methods on Kuhn and Leduc Poker games.
Causal effect of racial bias in data and machine learning algorithms on user persuasiveness & discriminatory decision making: An Empirical Study

Language data and models demonstrate various types of bias, be it ethnic, religious, gender, or socioeconomic. AI/NLP models, when trained on the racially biased dataset, AI/NLP models instigate poor model explainability, influence user experience during decision making and thus further magnifies societal biases, raising profound ethical implications for society. The motivation of the study is to investigate how AI systems imbibe bias from data and produce unexplainable discriminatory outcomes and influence an individual's articulateness of system outcome due to the presence of racial bias features in datasets. The design of the experiment involves studying the counterfactual impact of racial bias features present in language datasets and its associated effect on the model outcome. A mixed research methodology is adopted to investigate the cross implication of biased model outcome on user experience, effect on decision-making through controlled lab experimentation. The findings provide foundation support for correlating the implication of carry-over an artificial intelligence model solving NLP task due to biased concept presented in the dataset. Further, the research outcomes justify the negative influence on users' persuasiveness that leads to alter the decision-making quotient of an individual when trying to rely on the model outcome to act. The paper bridges the gap across the harm caused in establishing poor customer trustworthiness due to an inequitable system design and provides strong support for researchers, policymakers, and data scientists to build responsible AI frameworks within organizations.
MetaStan: An R package for Bayesian (model-based) meta-analysis using Stan

Meta-analysis methods are used to combine evidence from multiple studies. Meta-regression as well as model-based meta-analysis are extensions of standard pairwise meta-analysis in which information about study-level covariates and (arm-level) dosing amount or exposure may be taken into account. A Bayesian approach to inference is very attractive in this context, especially when a meta-analysis is based on few studies only or rare events. In this article, we present the R package MetaStan which implements a wide range of pairwise and model-based meta-analysis models. A generalised linear mixed model (GLMM) framework is used to describe the pairwise meta-analysis, meta-regression and model-based meta-analysis models. Within the GLMM framework, the likelihood and link functions are adapted to reﬂect the nature of the data. For example, a binomial likelihood with a logit link is used to perform a meta-analysis based on datasets with dichotomous endpoints. Bayesian computations are conducted using Stan via the rstan interface. Stan uses a Hamiltonian Monte Carlo sampler which belongs to the family of Markov chain Monte Carlo methods. Stan imple-mentations are done by using suitable parametrizations to ease computations. The user-friendly R package MetaStan , available on CRAN, supports a wide range of pairwise and model-based meta-analysis models. MetaStan provides ﬁtting functions for pairwise meta-analysis with the option of including covariates and model-based meta-analysis. The supported outcome types are continuous, binary, and count. Forest plots for the pairwise meta-analysis and dose-response plots for the model-based meta-analysis can be obtained from the package. The use of MetaStan is demonstrated through clinical examples.
Data-driven emergence of convolutional structure in neural networks

Significance The interplay between data symmetries and network architecture is key for efficient learning in neural networks. Convolutional neural networks perform well in image recognition by exploiting the translation invariance of images. However, learning convolutional structure directly from data has proven elusive. Here we show how a neural network trained on translation-invariant data can autonomously develop a convolutional structure. Our work thus shows that neural networks can learn representations that exploit the data symmetries autonomously, by exploiting higher-order data statistics. We finally identify the maximization of non-Gaussianity as a guiding principle for representation learning in our model, linking discriminative vision tasks and unsupervised feature extraction.
Learning to Speak on Behalf of a Group: Medium Access Control for Sending a Shared Message

The rapid development of Internet of Things (IoT) technologies has not only enabled new applications, but also presented new challenges for reliable communication with limited resources. In this work, we define a novel problem that can arise in these scenarios, in which a set of sensors need to communicate a joint observation. This observation is shared by a random subset of the nodes, which need to propagate it to the rest of the network, but coordination is complex: as signaling constraints require the use of random access schemes over shared channels, sensors need to implicitly coordinate, so that at least one transmission gets through without collisions. Unlike the majority of existing medium access schemes, the goal is to make sure that the shared message gets through, regardless of the sender. We analyze this coordination problem theoretically and provide low-complexity solutions. While a clustering-based approach is near-optimal if the sensors have prior knowledge, we provide a distributed multi-armed bandit (MAB) solution for the more general case and validate it by simulation.
Learning Fair Representations via Rate-Distortion Maximization

Abstract Text representations learned by machine learning models often encode undesirable demographic information of the user. Predictive models based on these representations can rely on such information, resulting in biased decisions. We present a novel debiasing technique, Fairness-aware Rate Maximization (FaRM), that removes protected information by making representations of instances belonging to the same protected attribute class uncorrelated, using the rate-distortion function. FaRM is able to debias representations with or without a target task at hand. FaRM can also be adapted to remove information about multiple protected attributes simultaneously. Empirical evaluations show that FaRM achieves state-of-the-art performance on several datasets, and learned representations leak significantly less protected attribute information against an attack by a non-linear probing network.
Views, variety and celestial spheres

This paper describes a continuation of the program of causal views, in which the world consists of nothing but a vast number of partial views of its past. Each view is associated to an event, and is a representation of the immediate causal past of that event. These consists mainly of processes that transfer energy, momentum and other charges to it from its past events. There is fundamentally no space or spacetime, just a large number of events, which are the causes of events to come. This is a development of energetic causal set theories, developed with Marina Cortes. Momentum and energy are fundamental, and are conserved under their transformation from present events to future events. As a result Minkowski spacetime emerges, in a way that preserves causal relations. The locality of events as constructed in the emergent spacetime is a consequence of the conservation of energy-momentum fundamentally. In this paper I propose that the views of events can be represented in terms of degrees of freedom on punctured two surfaces-each puncture corresponding to an immediate past event. This makes possible versions of the theory that are relativistically invariant. 1 ar X iv :2 20 2. 00 59 4v 1 [ gr -q c] 1 F eb 2 02 2
Wearable antenna with tripolarisation diversity for WBAN communications

A wearable antenna with tripolarisation diversity is designed for wireless body area networks (WBANs). The antenna is fabricated with flexible materials. Three polarisations are realised by combining an inductive loaded circular monopolar patch antenna with a microstrip annular ring antenna. Simulated and measured results show that the antenna has sufficient bandwidth for a WBAN. The port isolation reaches 13.5 dB, and the correlation coefficients show a good diversity performance.
Blockchain in the Quantum World

Blockchain is one of the most discussed and highly accepted technologies, primarily due to its application in almost every field where third parties are needed for trust. Blockchain technology relies on distributed consensus for trust, which is accomplished using hash functions and public-key cryptography. Most of the cryptographic algorithms in use today are vulnerable to quantum attacks. In this work, a systematic literature review is done so that it can be repeated, starting with identifying the research questions. Focusing on these research questions, literature is analysed to find the answers to these questions. The survey is completed by answering the research questions and identification of the research gaps. It is found in the literature that 30% of the research solutions are applicable for the data layer, 24% for the application and presentation layer, 23% for the network layer, 16% for the consensus layer and only 1% for hardware and infrastructure layer. We also found that 6% of the solutions are not blockchain-based but present different distributed ledger technology.
Differentially Private Community Detection for Stochastic Block Models

The goal of community detection over graphs is to recover underlying labels/attributes of users (e.g., political affiliation) given the connectivity between users (represented by adjacency matrix of a graph). There has been significant recent progress on understanding the fundamental limits of community detection when the graph is generated from a stochastic block model (SBM). Specifically, sharp information theoretic limits and efficient algorithms have been obtained for SBMs as a function of $p$ and $q$, which represent the intra-community and inter-community connection probabilities. In this paper, we study the community detection problem while preserving the privacy of the individual connections (edges) between the vertices. Focusing on the notion of $(\epsilon, \delta)$-edge differential privacy (DP), we seek to understand the fundamental tradeoffs between $(p, q)$, DP budget $(\epsilon, \delta)$, and computational efficiency for exact recovery of the community labels. To this end, we present and analyze the associated information-theoretic tradeoffs for three broad classes of differentially private community recovery mechanisms: a) stability based mechanism; b) sampling based mechanisms; and c) graph perturbation mechanisms. Our main findings are that stability and sampling based mechanisms lead to a superior tradeoff between $(p,q)$ and the privacy budget $(\epsilon, \delta)$; however this comes at the expense of higher computational complexity. On the other hand, albeit low complexity, graph perturbation mechanisms require the privacy budget $\epsilon$ to scale as $\Omega(\log(n))$ for exact recovery. To the best of our knowledge, this is the first work to study the impact of privacy constraints on the fundamental limits for community detection.
Deconfounded Representation Similarity for Comparison of Neural Networks

Similarity metrics such as representational similarity analysis (RSA) and centered kernel alignment (CKA) have been used to compare layer-wise representations between neural networks. However, these metrics are confounded by the population structure of data items in the input space, leading to spuriously high similarity for even completely random neural networks and inconsistent domain relations in transfer learning. We introduce a simple and generally applicable fix to adjust for the confounder with covariate adjustment regression, which retains the intuitive invariance properties of the original similarity measures. We show that deconfounding the similarity metrics increases the resolution of detecting semantically similar neural networks. Moreover, in real-world applications, deconfounding improves the consistency of representation similarities with domain similarities in transfer learning, and increases correlation with out-of-distribution accuracy.
Are low-frequency quasi-periodic oscillations in accretion flows the disk response to jet instability?

Low-frequency quasi-periodic oscillations, or LFQPOs, are ubiquitous in black hole X-ray binaries and provide strong constraints on the accretion-ejection processes. Although several models have been proposed, none has been proven to reproduce all observational constraints, and no consensus has emerged so far. We make the conjecture that disks in binaries are threaded by a large-scale vertical magnetic ﬁeld that splits it into two radial zones. In the inner jet-emitting disk (JED), a near equipartition ﬁeld allows driving powerful self-collimated jets, while beyond a transition radius, the disk magnetization is too low and a standard accretion disk (SAD) is settled. In a series of papers, this hybrid JED-SAD disk conﬁguration has been shown to successfully reproduce most multiwavelength (radio and X-rays) observations, as well as the concurrence with the LFQPOs for the archetypal source GX 339-4. We ﬁrst analyze the main QPO scenarios provided in the literature: (1) a speciﬁc process occurring at the transition radius, (2) the accretion-ejection instability, and (3) the solid-body Lense-Thirring disk precession. We recall their main assumptions and shed light on some severe theoretical issues that question the capability of reproducing LFQPOs. We then argue that none of these models can be operating under JED-SAD physical conditions. We ﬁnally propose an alternative scenario according to which LFQPOs are the disk response to an instability triggered in the jets near a magnetic recollimation zone. This situation can account for most of the type C QPO phenomenology and is consistent with the global behavior of black hole binaries. This nondestructive jet instability remains to be calculated, however. If this instability is numerically conﬁrmed, then it might also naturally account for the jet wobbling phenomenology seen in various accreting sources such as compact objets and young forming stars.
MoCap-less Quantitative Evaluation of Ego-Pose Estimation Without Ground Truth Measurements

—The emergence of data-driven approaches for con- trol and planning in robotics have highlighted the need for developing experimental robotic platforms for data collection. However, their implementation is often complex and expensive, in particular for ﬂying and terrestrial robots where the pre- cise estimation of the position requires motion capture devices (MoCap) or Lidar. In order to simplify the use of a robotic platform dedicated to research on a wide range of indoor and outdoor environments, we present a data validation tool for ego-pose estimation that does not require any equipment other than the on-board camera. The method and tool allow a rapid, visual and quantitative evaluation of the quality of ego-pose sensors and are sensitive to different sources of ﬂaws in the acquisition chain, ranging from desynchronization of the sensor ﬂows to misevaluation of the geometric parameters of the robotic platform. Using computer vision, the information from the sensors is used to calculate the motion of a semantic scene point through its projection to the 2D image space of the on-board camera. The deviations of these keypoints from references created with a semi-automatic tool allow rapid and simple quality assessment of the data collected on the platform. To demonstrate the performance of our method, we evaluate it on two challenging standard UAV datasets as well as one dataset taken from a terrestrial robot.
Specific interactions of peripheral membrane proteins with lipids: what can molecular simulations show us?

Abstract Peripheral membrane proteins (PMPs) can reversibly and specifically bind to biological membranes to carry out functions such as cell signalling, enzymatic activity, or membrane remodelling. Structures of these proteins and of their lipid-binding domains are typically solved in a soluble form, sometimes with a lipid or lipid headgroup at the binding site. To provide a detailed molecular view of PMP interactions with the membrane, computational methods such as molecular dynamics (MD) simulations can be applied. Here, we outline recent attempts to characterise these binding interactions, focusing on both intracellular proteins, such as phosphatidylinositol phosphate (PIP)-binding domains, and extracellular proteins such as glycolipid-binding bacterial exotoxins. We compare methods used to identify and analyse lipid-binding sites from simulation data and highlight recent work characterising the energetics of these interactions using free energy calculations. We describe how improvements in methodologies and computing power will help MD simulations to continue to contribute to this field in the future.
Submodularity In Machine Learning and Artificial Intelligence

In this manuscript, we offer a gentle review of submodularity and supermodularity and their properties. We offer a plethora of submodular definitions; a full description of a number of example submodular functions and their generalizations; example discrete constraints; a discussion of basic algorithms for maximization, minimization, and other operations; a brief overview of continuous submodular extensions; and some historical applications. We then turn to how submodularity is useful in machine learning and artificial intelligence. This includes summarization, and we offer a complete account of the differences between and commonalities amongst sketching, coresets, extractive and abstractive summarization in NLP, data distillation and condensation, and data subset selection and feature selection. We discuss a variety of ways to produce a submodular function useful for machine learning, including heuristic hand-crafting, learning or approximately learning a submodular function or aspects thereof, and some advantages of the use of a submodular function as a coreset producer. We discuss submodular combinatorial information functions, and how submodularity is useful for clustering, data partitioning, parallel machine learning, active and semi-supervised learning, probabilistic modeling, and structured norms and loss functions.1
SUGAR: Efficient Subgraph-Level Training via Resource-Aware Graph Partitioning

Graph Neural Networks (GNNs) have demonstrated a great potential in a variety of graph-based applications, such as recommender systems, drug discovery, and object recognition. Nevertheless, resource-efficient GNN learning is a rarely explored topic despite its many benefits for edge computing and Internet of Things (IoT) applications. To improve this state of affairs, this work proposes efficient subgraph-level training via resource-aware graph partitioning (SUGAR). SUGAR first partitions the initial graph into a set of disjoint subgraphs and then performs local training at the subgraph-level We provide a theoretical analysis and conduct extensive experiments on five graph benchmarks to verify its efficacy in practice. Our results across five different hardware platforms demonstrate great runtime speedup and memory reduction of SUGAR on large-scale graphs. We believe SUGAR opens a new research direction towards developing GNN methods that are resource-efficient, hence suitable for IoT deployment.
Generalization in Cooperative Multi-Agent Systems

Collective intelligence is a fundamental trait shared by several species of living organisms. It has allowed them to thrive in the diverse environmental conditions that exist on our planet. From simple organisations in an ant colony to complex systems in human groups, collective intelligence is vital for solving complex survival tasks. As is commonly observed, such natural systems are flexible to changes in their structure. Specifically, they exhibit a high degree of generalization when the abilities or the total number of agents changes within a system. We term this phenomenon as Combinatorial Generalization (CG). CG is a highly desirable trait for autonomous systems as it can increase their utility and deployability across a wide range of applications. While recent works addressing specific aspects of CG have shown impressive results on complex domains, they provide no performance guarantees when generalizing towards novel situations. In this work, we shed light on the theoretical underpinnings of CG for cooperative multi-agent systems (MAS). Specifically, we study generalization bounds under a linear dependence of the underlying dynamics on the agent capabilities, which can be seen as a generalization of Successor Features to MAS. We then extend the results first for Lipschitz and then arbitrary dependence of rewards on team capabilities. Finally, empirical analysis on various domains using the framework of multi-agent reinforcement learning highlights important desiderata for multi-agent algorithms towards ensuring CG.