417,125 research outputs found
Information Cascades on Arbitrary Topologies
In this paper, we study information cascades on graphs. In this setting, each
node in the graph represents a person. One after another, each person has to
take a decision based on a private signal as well as the decisions made by
earlier neighboring nodes. Such information cascades commonly occur in practice
and have been studied in complete graphs where everyone can overhear the
decisions of every other player. It is known that information cascades can be
fragile and based on very little information, and that they have a high
likelihood of being wrong.
Generalizing the problem to arbitrary graphs reveals interesting insights. In
particular, we show that in a random graph , for the right value of
, the number of nodes making a wrong decision is logarithmic in . That
is, in the limit for large , the fraction of players that make a wrong
decision tends to zero. This is intriguing because it contrasts to the two
natural corner cases: empty graph (everyone decides independently based on his
private signal) and complete graph (all decisions are heard by all nodes). In
both of these cases a constant fraction of nodes make a wrong decision in
expectation. Thus, our result shows that while both too little and too much
information sharing causes nodes to take wrong decisions, for exactly the right
amount of information sharing, asymptotically everyone can be right. We further
show that this result in random graphs is asymptotically optimal for any
topology, even if nodes follow a globally optimal algorithmic strategy. Based
on the analysis of random graphs, we explore how topology impacts global
performance and construct an optimal deterministic topology among layer graphs
On the Minimum Degree up to Local Complementation: Bounds and Complexity
The local minimum degree of a graph is the minimum degree reached by means of
a series of local complementations. In this paper, we investigate on this
quantity which plays an important role in quantum computation and quantum error
correcting codes. First, we show that the local minimum degree of the Paley
graph of order p is greater than sqrt{p} - 3/2, which is, up to our knowledge,
the highest known bound on an explicit family of graphs. Probabilistic methods
allows us to derive the existence of an infinite number of graphs whose local
minimum degree is linear in their order with constant 0.189 for graphs in
general and 0.110 for bipartite graphs. As regards the computational complexity
of the decision problem associated with the local minimum degree, we show that
it is NP-complete and that there exists no k-approximation algorithm for this
problem for any constant k unless P = NP.Comment: 11 page
Geometric Crossing-Minimization - A Scalable Randomized Approach
We consider the minimization of edge-crossings in geometric drawings of graphs G=(V, E), i.e., in drawings where each edge is depicted as a line segment. The respective decision problem is NP-hard [Daniel Bienstock, 1991]. Crossing-minimization, in general, is a popular theoretical research topic; see Vrt\u27o [Imrich Vrt\u27o, 2014]. In contrast to theory and the topological setting, the geometric setting did not receive a lot of attention in practice. Prior work [Marcel Radermacher et al., 2018] is limited to the crossing-minimization in geometric graphs with less than 200 edges. The described heuristics base on the primitive operation of moving a single vertex v to its crossing-minimal position, i.e., the position in R^2 that minimizes the number of crossings on edges incident to v.
In this paper, we introduce a technique to speed-up the computation by a factor of 20. This is necessary but not sufficient to cope with graphs with a few thousand edges. In order to handle larger graphs, we drop the condition that each vertex v has to be moved to its crossing-minimal position and compute a position that is only optimal with respect to a small random subset of the edges. In our theoretical contribution, we consider drawings that contain for each edge uv in E and each position p in R^2 for v o(|E|) crossings. In this case, we prove that with a random subset of the edges of size Theta(k log k) the co-crossing number of a degree-k vertex v, i.e., the number of edge pairs uv in E, e in E that do not cross, can be approximated by an arbitrary but fixed factor delta with high probability. In our experimental evaluation, we show that the randomized approach reduces the number of crossings in graphs with up to 13 000 edges considerably. The evaluation suggests that depending on the degree-distribution different strategies result in the fewest number of crossings
Generation of Policy-Level Explanations for Reinforcement Learning
Though reinforcement learning has greatly benefited from the incorporation of
neural networks, the inability to verify the correctness of such systems limits
their use. Current work in explainable deep learning focuses on explaining only
a single decision in terms of input features, making it unsuitable for
explaining a sequence of decisions. To address this need, we introduce
Abstracted Policy Graphs, which are Markov chains of abstract states. This
representation concisely summarizes a policy so that individual decisions can
be explained in the context of expected future transitions. Additionally, we
propose a method to generate these Abstracted Policy Graphs for deterministic
policies given a learned value function and a set of observed transitions,
potentially off-policy transitions used during training. Since no restrictions
are placed on how the value function is generated, our method is compatible
with many existing reinforcement learning methods. We prove that the worst-case
time complexity of our method is quadratic in the number of features and linear
in the number of provided transitions, . By applying
our method to a family of domains, we show that our method scales well in
practice and produces Abstracted Policy Graphs which reliably capture
relationships within these domains.Comment: Accepted to Proceedings of the Thirty-Third AAAI Conference on
Artificial Intelligence (2019
- …