2021
DOI: 10.1109/tpwrs.2020.3031314
|View full text |Cite
|
Sign up to set email alerts
|

Differentially Private Optimal Power Flow for Distribution Grids

Abstract: While power systems research relies on the availability of real-world network datasets, data owners (e.g., system operators) are hesitant to share data due to security and privacy risks. To control these risks, we develop privacy-preserving algorithms for the synthetic generation of optimization and machine learning datasets. Taking a real-world dataset as input, the algorithms output its noisy, synthetic version, which preserves the accuracy of the real data on a specific downstream model or even a large popu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
15
0

Year Published

2021
2021
2025
2025

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 36 publications
(15 citation statements)
references
References 31 publications
0
15
0
Order By: Relevance
“…Cloud-based energy management [17], [18], [21], [88]; 4. Privacy-preserving optimal decision making models [17], [18], [87], [89]- [92].…”
Section: Optimal Operation Of Cppsmentioning
confidence: 99%
“…Cloud-based energy management [17], [18], [21], [88]; 4. Privacy-preserving optimal decision making models [17], [18], [87], [89]- [92].…”
Section: Optimal Operation Of Cppsmentioning
confidence: 99%
“…A balanced nonconvex AC OPF problem is adapted to restore feasibility when the obfuscation is problematic, and is solved with Ipopt. Dvorkin et al (2020) set up a DP problem in a distribution network context where the customer load values are considered sensitive. In this case, the balanced linearized DistFlow formulation (Baran & Wu, 1989) is used to build a chance-constrained optimization model where some of the decision variables are affine functions of the noise of added in the DP mechanism.…”
Section: Phase Identificationmentioning
confidence: 99%
“…The nonconvex constraint (2d) can be relaxed into multiple linear inequalities by first approximating v i,t ≈ 1 (which is a good approximation as long as v and v in (3) are close to 1 p.u. ), and then using a convex polygon inner approximation [20] to replace the quadratic terms as…”
Section: A Convex Relaxations Of Non-convex Constraints Convex Relaxa...mentioning
confidence: 99%