On Collaboration in Distributed Parameter Estimation with Resource
Constraints
- URL: http://arxiv.org/abs/2307.06442v1
- Date: Wed, 12 Jul 2023 20:11:50 GMT
- Title: On Collaboration in Distributed Parameter Estimation with Resource
Constraints
- Authors: Yu-Zhen Janice Chen, Daniel S. Menasch\'e, and Don Towsley
- Abstract summary: We study sensor/agent data collection and collaboration policies for parameter estimation.
We propose novel ways to apply multi-armed bandit algorithms to learn the optimal data collection and collaboration policy.
- Score: 13.014069919671623
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: We study sensor/agent data collection and collaboration policies for
parameter estimation, accounting for resource constraints and correlation
between observations collected by distinct sensors/agents. Specifically, we
consider a group of sensors/agents each samples from different variables of a
multivariate Gaussian distribution and has different estimation objectives, and
we formulate a sensor/agent's data collection and collaboration policy design
problem as a Fisher information maximization (or Cramer-Rao bound minimization)
problem. When the knowledge of correlation between variables is available, we
analytically identify two particular scenarios: (1) where the knowledge of the
correlation between samples cannot be leveraged for collaborative estimation
purposes and (2) where the optimal data collection policy involves investing
scarce resources to collaboratively sample and transfer information that is not
of immediate interest and whose statistics are already known, with the sole
goal of increasing the confidence on the estimate of the parameter of interest.
When the knowledge of certain correlation is unavailable but collaboration may
still be worthwhile, we propose novel ways to apply multi-armed bandit
algorithms to learn the optimal data collection and collaboration policy in our
distributed parameter estimation problem and demonstrate that the proposed
algorithms, DOUBLE-F, DOUBLE-Z, UCB-F, UCB-Z, are effective through
simulations.
Related papers
- Stratified Prediction-Powered Inference for Hybrid Language Model Evaluation [62.2436697657307]
Prediction-powered inference (PPI) is a method that improves statistical estimates based on limited human-labeled data.
We propose a method called Stratified Prediction-Powered Inference (StratPPI)
We show that the basic PPI estimates can be considerably improved by employing simple data stratification strategies.
arXiv Detail & Related papers (2024-06-06T17:37:39Z) - Multi-Source Conformal Inference Under Distribution Shift [41.701790856201036]
We consider the problem of obtaining distribution-free prediction intervals for a target population, leveraging multiple potentially biased data sources.
We derive the efficient influence functions for the quantiles of unobserved outcomes in the target and source populations.
We propose a data-adaptive strategy to upweight informative data sources for efficiency gain and downweight non-informative data sources for bias reduction.
arXiv Detail & Related papers (2024-05-15T13:33:09Z) - Collaborative Heterogeneous Causal Inference Beyond Meta-analysis [68.4474531911361]
We propose a collaborative inverse propensity score estimator for causal inference with heterogeneous data.
Our method shows significant improvements over the methods based on meta-analysis when heterogeneity increases.
arXiv Detail & Related papers (2024-04-24T09:04:36Z) - Differentially Private Linear Regression with Linked Data [3.9325957466009203]
Differential privacy, a mathematical notion from computer science, is a rising tool offering robust privacy guarantees.
Recent work focuses on developing differentially private versions of individual statistical and machine learning tasks.
We present two differentially private algorithms for linear regression with linked data.
arXiv Detail & Related papers (2023-08-01T21:00:19Z) - CEDAR: Communication Efficient Distributed Analysis for Regressions [9.50726756006467]
There are growing interests about distributed learning over multiple EHRs databases without sharing patient-level data.
We propose a novel communication efficient method that aggregates the local optimal estimates, by turning the problem into a missing data problem.
We provide theoretical investigation for the properties of the proposed method for statistical inference as well as differential privacy, and evaluate its performance in simulations and real data analyses.
arXiv Detail & Related papers (2022-07-01T09:53:44Z) - To Collaborate or Not in Distributed Statistical Estimation with
Resource Constraints? [14.626510386380474]
We study how the amount of correlation between observations collected by distinct sensors/learners affects data collection and collaboration strategies.
We discuss two applications, IoT DDoS attack detection and distributed estimation in wireless sensor networks, that may benefit from our results.
arXiv Detail & Related papers (2022-05-31T20:47:09Z) - DRFLM: Distributionally Robust Federated Learning with Inter-client
Noise via Local Mixup [58.894901088797376]
federated learning has emerged as a promising approach for training a global model using data from multiple organizations without leaking their raw data.
We propose a general framework to solve the above two challenges simultaneously.
We provide comprehensive theoretical analysis including robustness analysis, convergence analysis, and generalization ability.
arXiv Detail & Related papers (2022-04-16T08:08:29Z) - Reinforcement Learning with Heterogeneous Data: Estimation and Inference [84.72174994749305]
We introduce the K-Heterogeneous Markov Decision Process (K-Hetero MDP) to address sequential decision problems with population heterogeneity.
We propose the Auto-Clustered Policy Evaluation (ACPE) for estimating the value of a given policy, and the Auto-Clustered Policy Iteration (ACPI) for estimating the optimal policy in a given policy class.
We present simulations to support our theoretical findings, and we conduct an empirical study on the standard MIMIC-III dataset.
arXiv Detail & Related papers (2022-01-31T20:58:47Z) - Sparse Feature Selection Makes Batch Reinforcement Learning More Sample
Efficient [62.24615324523435]
This paper provides a statistical analysis of high-dimensional batch Reinforcement Learning (RL) using sparse linear function approximation.
When there is a large number of candidate features, our result sheds light on the fact that sparsity-aware methods can make batch RL more sample efficient.
arXiv Detail & Related papers (2020-11-08T16:48:02Z) - Optimal Off-Policy Evaluation from Multiple Logging Policies [77.62012545592233]
We study off-policy evaluation from multiple logging policies, each generating a dataset of fixed size, i.e., stratified sampling.
We find the OPE estimator for multiple loggers with minimum variance for any instance, i.e., the efficient one.
arXiv Detail & Related papers (2020-10-21T13:43:48Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.