Prioritizing municipal lead mitigation projects as a relaxed knapsack optimization: a method and case study

• URL: http://arxiv.org/abs/2201.09372v3
• Date: Sat, 11 Jun 2022 12:42:56 GMT
• Title: Prioritizing municipal lead mitigation projects as a relaxed knapsack optimization: a method and case study
• Authors: Isaac Slavitt
• Abstract summary: This paper describes a simple process for estimating child health impact at a parcel level by cleaning and synthesizing municipal datasets. Using geocoding as the core record linkage mechanism, parcel-level toxicity data can be combined with school enrollment records. A harm metric of estimated exposure-years is described at the parcel level, which can then be aggregated to the project level and minimized globally.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Lead pipe remediation budgets are limited and ought to maximize public health impact. This goal implies a non-trivial optimization problem; lead service lines connect water mains to individual houses, but any realistic replacement strategy must batch replacements at a larger scale. Additionally, planners typically lack a principled method for comparing the relative public health value of potential interventions and often plan projects based on non-health factors. This paper describes a simple process for estimating child health impact at a parcel level by cleaning and synthesizing municipal datasets that are commonly available but seldom joined due to data quality issues. Using geocoding as the core record linkage mechanism, parcel-level toxicity data can be combined with school enrollment records to indicate where young children and lead lines coexist. A harm metric of estimated exposure-years is described at the parcel level, which can then be aggregated to the project level and minimized globally by posing project selection as a 0/1 knapsack problem. Simplifying further for use by non-experts, the implied linear programming relaxation is solved intuitively with the greedy algorithm; ordering projects by benefit cost ratio produces a priority list which planners can then consider holistically alongside harder to quantify factors. A case study demonstrates the successful application of this framework to a small U.S. city's existing data to prioritize federal infrastructure funding. While this paper focuses on lead in drinking water, the approach readily generalizes to other sources of residential toxicity with disproportionate impact on children.

Related papers

• Bayesian Collaborative Bandits with Thompson Sampling for Improved Outreach in Maternal Health Program [36.10003434625494]
  Mobile health (mHealth) programs face a critical challenge in optimizing the timing of automated health information calls to beneficiaries. We propose a principled approach using Thompson Sampling for this collaborative bandit problem. We demonstrate significant improvements over state-of-the-art baselines on a real-world dataset from the world's largest maternal mHealth program.
  arXiv  Detail & Related papers  (2024-10-28T18:08:18Z)
• SpatialRank: Urban Event Ranking with NDCG Optimization on Spatiotemporal Data [55.609946936979036]
  We propose a novel spatial event ranking approach named SpatialRank. We show that SpatialRank can effectively identify the top riskiest locations of crimes and traffic accidents.
  arXiv  Detail & Related papers  (2023-09-30T06:20:21Z)
• Rebalancing Social Feed to Minimize Polarization and Disagreement [24.939887831898453]
  We propose a novel problem formulation aimed at slightly nudging users' social feeds in order to strike a balance between relevance and diversity. Our approach is based on re-weighting the relative importance of the accounts that a user follows, so as to calibrate the frequency with which the content produced by various accounts is shown to the user.
  arXiv  Detail & Related papers  (2023-08-28T10:59:05Z)
• Flashpoints Signal Hidden Inherent Instabilities in Land-Use Planning [0.0]
  We show that optimization-based planning approaches with generic planning criteria generate a series of unstable "flashpoints" We show that instabilities lead to regions of ambiguity in land-use type that we term "gray areas"
  arXiv  Detail & Related papers  (2023-08-15T11:47:16Z)
• Equity Promotion in Public Transportation [18.057286025603055]
  We propose an optimization model to study how to integrate the two approaches together for equity-promotion purposes. We have designed a linear-programming (LP) based rounding algorithm, which proves to achieve an optimal approximation ratio of 1-1/e. Experimental results confirm our theoretical predictions and demonstrate the effectiveness of our LP-based strategy in promoting social equity.
  arXiv  Detail & Related papers  (2022-11-26T10:06:00Z)
• Quantization for decentralized learning under subspace constraints [61.59416703323886]
  We consider decentralized optimization problems where agents have individual cost functions to minimize subject to subspace constraints. We propose and study an adaptive decentralized strategy where the agents employ differential randomized quantizers to compress their estimates. The analysis shows that, under some general conditions on the quantization noise, the strategy is stable both in terms of mean-square error and average bit rate.
  arXiv  Detail & Related papers  (2022-09-16T09:38:38Z)
• Is Vertical Logistic Regression Privacy-Preserving? A Comprehensive Privacy Analysis and Beyond [57.10914865054868]
  We consider vertical logistic regression (VLR) trained with mini-batch descent gradient. We provide a comprehensive and rigorous privacy analysis of VLR in a class of open-source Federated Learning frameworks.
  arXiv  Detail & Related papers  (2022-07-19T05:47:30Z)
• Measurement-based Admission Control in Sliced Networks: A Best Arm Identification Approach [68.8204255655161]
  In sliced networks, the shared tenancy of slices requires adaptive admission control of data flows. We devise a joint measurement and decision strategy that returns a correct decision with a certain level of confidence.
  arXiv  Detail & Related papers  (2022-04-14T12:12:34Z)
• Is Pessimism Provably Efficient for Offline RL? [104.00628430454479]
  We study offline reinforcement learning (RL), which aims to learn an optimal policy based on a dataset collected a priori. We propose a pessimistic variant of the value iteration algorithm (PEVI), which incorporates an uncertainty quantifier as the penalty function.
  arXiv  Detail & Related papers  (2020-12-30T09:06:57Z)
• Hierarchical Planning for Resource Allocation in Emergency Response Systems [0.8602553195689513]
  A classical problem in city-scale cyber-physical systems is resource allocation under uncertainty. Online, offline, and decentralized approaches have been applied to such problems, but they have difficulty scaling to large decision problems. We present a general approach to hierarchical planning that leverages structure in city-level CPS problems for resource allocation under uncertainty.
  arXiv  Detail & Related papers  (2020-12-24T15:55:23Z)
• Hierarchical Adaptive Contextual Bandits for Resource Constraint based Recommendation [49.69139684065241]
  Contextual multi-armed bandit (MAB) achieves cutting-edge performance on a variety of problems. In this paper, we propose a hierarchical adaptive contextual bandit method (HATCH) to conduct the policy learning of contextual bandits with a budget constraint.
  arXiv  Detail & Related papers  (2020-04-02T17:04:52Z)

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.