Optimal Distributed Decision Fusion

The problem of decision fusion in distributed sensor system is considered. Distributed sensors pass their decisions about the same hypotheses to a fusion center that combines them into a final decision. Assuming that the semor decisions are independent from each other conditioned on each hypothesis, we provide a general proof that the optimal decision scheme that maximizes the probability of detection at the fusion for fixed false alarm probability comists of a Neyman-Pearson test (or a randomized N-P test) at the fusion and likelihood-ratio tests at the sensors

A randomized primal distributed algorithm for partitioned and big-data non-convex optimization

In this paper we consider a distributed optimization scenario in which the aggregate objective function to minimize is partitioned, big-data and possibly non-convex. Specifically, we focus on a set-up in which the dimension of the decision variable depends on the network size as well as the number of local functions, but each local function handled by a node depends only on a (small) portion of the entire optimization variable. This problem set-up has been shown to appear in many interesting network application scenarios. As main paper contribution, we develop a simple, primal distributed algorithm to solve the optimization problem, based on a randomized descent approach, which works under asynchronous gossip communication. We prove that the proposed asynchronous algorithm is a proper, ad-hoc version of a coordinate descent method and thus converges to a stationary point. To show the effectiveness of the proposed algorithm, we also present numerical simulations on a non-convex quadratic program, which confirm the theoretical results

Distributed Hypothesis Testing with Privacy Constraints

We revisit the distributed hypothesis testing (or hypothesis testing with communication constraints) problem from the viewpoint of privacy. Instead of observing the raw data directly, the transmitter observes a sanitized or randomized version of it. We impose an upper bound on the mutual information between the raw and randomized data. Under this scenario, the receiver, which is also provided with side information, is required to make a decision on whether the null or alternative hypothesis is in effect. We first provide a general lower bound on the type-II exponent for an arbitrary pair of hypotheses. Next, we show that if the distribution under the alternative hypothesis is the product of the marginals of the distribution under the null (i.e., testing against independence), then the exponent is known exactly. Moreover, we show that the strong converse property holds. Using ideas from Euclidean information theory, we also provide an approximate expression for the exponent when the communication rate is low and the privacy level is high. Finally, we illustrate our results with a binary and a Gaussian example

Distributed Cognition in Cancer Treatment Decision Making: An Application of the DECIDE Decision-Making Styles Typology

Distributed cognition occurs when cognitive and affective schemas are shared between two or more people during interpersonal discussion. Although extant research focuses on distributed cognition in decision making between health care providers and patients, studies show that caregivers are also highly influential in the treatment decisions of patients. However, there are little empirical data describing how and when families exert influence. The current article addresses this gap by examining decisional support in the context of cancer randomized clinical trial (RCT) decision making. Data are drawn from in-depth interviews with rural, Appalachian cancer patients (N = 46). Analysis of transcript data yielded empirical support for four distinct models of health decision making. The implications of these findings for developing interventions to improve the quality of treatment decision making and overall well-being are discussed

Distributed Cognition in Cancer Treatment Decision Making: An Application of the DECIDE Decision-Making Styles Typology

Distributed cognition occurs when cognitive and affective schemas are shared between two or more people during interpersonal discussion. Although extant research focuses on distributed cognition in decision making between health care providers and patients, studies show that caregivers are also highly influential in the treatment decisions of patients. However, there are little empirical data describing how and when families exert influence. The current article addresses this gap by examining decisional support in the context of cancer randomized clinical trial (RCT) decision making. Data are drawn from in-depth interviews with rural, Appalachian cancer patients (N = 46). Analysis of transcript data yielded empirical support for four distinct models of health decision making. The implications of these findings for developing interventions to improve the quality of treatment decision making and overall well-being are discussed

Exponentially Fast Parameter Estimation in Networks Using Distributed Dual Averaging

In this paper we present an optimization-based view of distributed parameter estimation and observational social learning in networks. Agents receive a sequence of random, independent and identically distributed (i.i.d.) signals, each of which individually may not be informative about the underlying true state, but the signals together are globally informative enough to make the true state identifiable. Using an optimization-based characterization of Bayesian learning as proximal stochastic gradient descent (with Kullback-Leibler divergence from a prior as a proximal function), we show how to efficiently use a distributed, online variant of Nesterov's dual averaging method to solve the estimation with purely local information. When the true state is globally identifiable, and the network is connected, we prove that agents eventually learn the true parameter using a randomized gossip scheme. We demonstrate that with high probability the convergence is exponentially fast with a rate dependent on the KL divergence of observations under the true state from observations under the second likeliest state. Furthermore, our work also highlights the possibility of learning under continuous adaptation of network which is a consequence of employing constant, unit stepsize for the algorithm.Comment: 6 pages, To appear in Conference on Decision and Control 201

Reduced Complexity Optimal Hard Decision Fusion under Neyman-Pearson Criterion

Distributed detection is an important part of many of the applications like wireless sensor networks, cooperative spectrum sensing in the cognitive radio network. Traditionally optimal non-randomized hard decision fusion rule under Neyman Pearson(NP) criterion is exponential in complexity. But recently [4] this was solved using dynamic programming. As mentioned in [4] that decision fusion problem exhibits semi-monotonic property in a special case. We use this property in our simulations and eventually apply dynamic programming to solve the problem with further reduced complexity. Further, we study the e�ect of using multiple antennas at FC with reduced complexity rule