Redistricting from the Bottom Up: Sampling Communities of Interest with Differential Privacy
- URL: http://arxiv.org/abs/2606.14453v1
- Date: Fri, 12 Jun 2026 13:39:57 GMT
- Title: Redistricting from the Bottom Up: Sampling Communities of Interest with Differential Privacy
- Abstract summary: We propose using differential privacy to draw redistricting plans that incorporate community of interest testimonies.<n>We show that COI-informed sampling outperforms an uninformed baseline and the enacted plan.<n>We also find that stronger COI preservation tends to spread minority and Democratic representation more evenly across districts.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Independent Redistricting Commissions (IRCs) are a promising tool for bottom-up redistricting, but their public testimony processes are vulnerable to adversarial manipulation. We propose using differential privacy to draw redistricting plans that incorporate community of interest (COI) testimonies while remaining robust to adversarial input. Treating individual testimonies as data points, we use the marked edge walk to sample from differentially private distributions of redistricting plans via the exponential mechanism. We introduce two score functions and demonstrate that both can be targeted by MEW across a range of privacy budgets. Applying this method to Missouri's mid-cycle redistricting using 808 COI testimonies, we show that COI-informed sampling outperforms an uninformed baseline and the enacted plan. An adversarial experiment demonstrates that the method can be robust to attacks under certain privacy budgets and may perform better in practice than formal group privacy guarantees imply. We also find that stronger COI preservation tends to spread minority and Democratic representation more evenly across districts.
Related papers
- Urania: Differentially Private Insights into AI Use [102.27238986985698]
$Urania$ provides end-to-end privacy protection by leveraging DP tools such as clustering, partition selection, and histogram-based summarization.<n>Results show the framework's ability to extract meaningful conversational insights while maintaining stringent user privacy.
arXiv Detail & Related papers (2025-06-05T07:00:31Z) - Understanding and Mitigating the Impacts of Differentially Private Census Data on State Level Redistricting [4.589972411795548]
Data users were shaken by the adoption of differential privacy in the 2020 DAS.
We consider two redistricting settings in which a data user might be concerned about the impacts of privacy preserving noise.
We observe that an analyst may come to incorrect conclusions if they do not account for noise.
arXiv Detail & Related papers (2024-09-10T18:11:54Z) - Differentially Private Online Community Detection for Censored Block Models: Algorithms and Fundamental Limits [55.162623894523826]
We study the private online change detection problem for dynamic communities, using a censored block model (CBM)<n>We consider edge differential privacy (DP) in both local and central settings, and propose joint change detection and community estimation procedures for both scenarios.
arXiv Detail & Related papers (2024-05-09T12:35:57Z) - TernaryVote: Differentially Private, Communication Efficient, and
Byzantine Resilient Distributed Optimization on Heterogeneous Data [50.797729676285876]
We propose TernaryVote, which combines a ternary compressor and the majority vote mechanism to realize differential privacy, gradient compression, and Byzantine resilience simultaneously.
We theoretically quantify the privacy guarantee through the lens of the emerging f-differential privacy (DP) and the Byzantine resilience of the proposed algorithm.
arXiv Detail & Related papers (2024-02-16T16:41:14Z) - Multiscale Parallel Tempering for Fast Sampling on Redistricting Plans [1.1233768932957773]
A persuasive method is to compare the plan with an ensemble of neutrally drawn redistricting plans.
To audit the partisan difference between the ensemble and a given plan, one must ensure that the non-partisan criteria are matched.
In this work, we generate a multiscale parallel tempering approach that makes local moves at each scale.
arXiv Detail & Related papers (2024-01-30T21:33:05Z) - LoLep: Single-View View Synthesis with Locally-Learned Planes and
Self-Attention Occlusion Inference [66.45326873274908]
We propose a novel method, LoLep, which regresses Locally-Learned planes from a single RGB image to represent scenes accurately.
Compared to MINE, our approach has an LPIPS reduction of 4.8%-9.0% and an RV reduction of 73.9%-83.5%.
arXiv Detail & Related papers (2023-07-23T03:38:55Z) - Auditing Fairness by Betting [43.515287900510934]
We provide practical, efficient, and nonparametric methods for auditing the fairness of deployed classification and regression models.<n>Our methods are sequential and allow for the continuous monitoring of incoming data.<n>We demonstrate the efficacy of our approach on three benchmark fairness datasets.
arXiv Detail & Related papers (2023-05-27T20:14:11Z) - FedLAP-DP: Federated Learning by Sharing Differentially Private Loss Approximations [53.268801169075836]
We propose FedLAP-DP, a novel privacy-preserving approach for federated learning.
A formal privacy analysis demonstrates that FedLAP-DP incurs the same privacy costs as typical gradient-sharing schemes.
Our approach presents a faster convergence speed compared to typical gradient-sharing methods.
arXiv Detail & Related papers (2023-02-02T12:56:46Z) - Untangling the Dueling Expert Witnesses: Comparing Ensemble Methods in
Pennsylvania's Redistricting Plans [0.0]
Ensembles of random legislative districts are a valuable tool for assessing whether a proposed district plan is an outlier or gerrymander.
Recent open source methods now permit independent validation of expert witness testimony.
We compare ensembles for the Pennsylvania House and Congressional districts calculated using "Redist" and "Gerrychain"
arXiv Detail & Related papers (2022-08-18T00:03:40Z) - Mathematically Quantifying Non-responsiveness of the 2021 Georgia
Congressional Districting Plan [3.097163558730473]
We use a Metropolized-sampling technique through a parallel tempering method combined with ReCom.
We develop these improvements through the first case study of district plans in Georgia.
Our analysis projects that any election in Georgia will reliably elect 9 Republicans and 5 Democrats under the enacted plan.
arXiv Detail & Related papers (2022-03-13T02:58:32Z) - Implications of Distance over Redistricting Maps: Central and Outlier Maps [10.318010762465939]
In representative democracy, a redistricting map is chosen to partition an electorate into districts which each elects a representative.<n>A valid redistricting map must satisfy a collection of constraints such as being compact, contiguous, and of almost-equal population.<n>This enables a partisan legislature to gerrymander by choosing a map which unfairly favors it.
arXiv Detail & Related papers (2022-03-02T04:59:30Z) - Local Relation Learning for Face Forgery Detection [73.73130683091154]
We propose a novel perspective of face forgery detection via local relation learning.
Specifically, we propose a Multi-scale Patch Similarity Module (MPSM), which measures the similarity between features of local regions.
We also propose an RGB-Frequency Attention Module (RFAM) to fuse information in both RGB and frequency domains for more comprehensive local feature representation.
arXiv Detail & Related papers (2021-05-06T10:44:32Z) - The Essential Role of Empirical Validation in Legislative Redistricting
Simulation [0.0]
We apply a recently developed computational method that can efficiently enumerate all possible redistricting plans.
We show that this algorithm scales to a state with a couple of hundred geographical units.
arXiv Detail & Related papers (2020-06-17T20:51:43Z)
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.