Related papers: Influence and interaction indexes for pseudo-Boole…
A self-interacting dynamics that mimics the standard Consensus-Based Optimization (CBO) model is introduced. This single-particle dynamics is shown to converge to a unique invariant measure that approximates the global minimum of a given…
Sub-sampling is a common and often effective method to deal with the computational challenges of large datasets. However, for most statistical models, there is no well-motivated approach for drawing a non-uniform subsample. We show that the…
In this paper, we construct a type of interacting particle systems to approximate a class of stochastic different equations whose coefficients depend on the conditional probability distributions of the processes given partial observations.…
Due to the reduced probability of successful post-selection, the weak-value amplification seems to be unavailable for the parameter-estimation. Here, we show theoretically that, some effects due to the weak interactions present only in the…
We answer a question from A. V. Abanin and P. T. Tien about so-called almost subadditive weight functions in the sense of Braun-Meise-Taylor. Using recent knowledge of a growth index for functions, crucially appearing in the…
In this paper we obtain the average sensitivity of the laced Boolean functions. This confirms a conjecture of Shparlinski. We also compute the weights of the laced Boolean functions and show that they are almost balanced.
A committee's decisions on more than two alternatives much depend on the adopted voting method, and so does the distribution of power among the committee members. We investigate how different aggregation methods such as plurality runoff,…
We survey current term-wise techniques for quadratizing high-degree pseudo-Boolean functions and introduce a new one, which allows multiple splits of terms. We also introduce the first aggregative approach, which splits a collection of…
A common goal in observational research is to estimate marginal causal effects in the presence of confounding variables. One solution to this problem is to use the covariate distribution to weight the outcomes such that the data appear…
The influence of the $k$'th coordinate on a Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$ is the probability that flipping $x_k$ changes the value $f(x)$. The total influence $I(f)$ is the sum of influences of the coordinates. The…
We show that on every product probability space, Boolean functions with small total influences are essentially the ones that are almost measurable with respect to certain natural sub-sigma algebras. This theorem in particular describes the…
We investigate the manipulation of power indices in TU-cooperative games by stimulating (subject to a budget constraint) changes in the propensity of other players to participate to the game. We display several algorithms that show that the…
In this paper we consider the influences of variables on Boolean functions in general product spaces. Unlike the case of functions on the discrete cube where there is a clear definition of influence, in the general case at least three…
Influence diagnosis is important since presence of influential observations could lead to distorted analysis and misleading interpretations. For high-dimensional data, it is particularly so, as the increased dimensionality and complexity…
We compute the influence action for a system perturbatively coupled to a linear scalar field acting as the environment. Subtleties related to divergences that appear when summing over all the modes are made explicit and clarified. Being…
We study the Shapley value in weighted voting games. The Shapley value has been used as an index for measuring the power of individual agents in decision-making bodies and political organizations, where decisions are made by a majority vote…
We present a quantum algorithm for approximating the linear structures of a Boolean function $f$. Different from previous algorithms (such as Simon's and Shor's algorithms) which rely on restrictions on the Boolean function, our algorithm…
Model-based controllers learned from data have the biases and noise of their training trajectories, making it important to know which trajectories help or hurt closed-loop performance. Influence functions, widely used in machine learning…
In this paper, we present a dual representation of the influence functions, whose computational complexity scales with dataset size rather than model size. Both analytically and experimentally, we show that this representation can be an…
The paper studies semi-almost periodic holomorphic functions on a polydisk which have, in a sense, the weakest possible discontinuities on the boundary torus. The basic result used in the proofs is an extension of the classical Bohr…