AI News HubLIVE
Original source2 min read

Productionized Fairness Measurement Under Privacy Constraints

This paper presents Privacy-Preserving Probabilistic Race/Ethnicity Estimation (PPRE) to enable fairness measurements with respect to race/ethnicity for U.S. LinkedIn members while preserving privacy. It combines the Bayesian Improved Surname Geocoding estimator with a sparse golden survey set of self-reported demographics, and applies secure two-party computation, differential privacy, and additive homomorphic encryption.

SourcearXiv Machine LearningAuthor: Osonde A. Osoba, Yuzi He, Saikrishna Badrinarayanan, Varun Mithal, Sakshi Jain, Natesh S. Pillai

[2606.27558] Productionized Fairness Measurement Under Privacy Constraints

[Submitted on 25 Jun 2026]

Title:Productionized Fairness Measurement Under Privacy Constraints

View a PDF of the paper titled Productionized Fairness Measurement Under Privacy Constraints, by Osonde A. Osoba and 5 other authors

View PDF HTML (experimental)

Abstract:Fairness measurements in the form of disaggregated evaluations often rely on demographic signals that are legally constrained or culturally sensitive. Race and ethnicity signals are among the more difficult signals to curate and use for this task. This paper presents Privacy-Preserving Probabilistic Race/Ethnicity Estimation (PPRE) as a method for enabling fairness measurements with respect to race/ethnicity for U.S.\ LinkedIn members in a privacy-preserving manner. PPRE applies privacy technologies (specifically: secure two-party computation, differential privacy, and additive homomorphic encryption) on top of two race/ethnicity demographic signal sources (the Bayesian Improved Surname Geocoding estimator and a sparse golden survey set of self-reported demographics) to power a fairness measurement solution with respect to US-based race/ethnicity demographics. We detail its privacy guarantees and demonstrate its application on candidate- and viewer-side fairness measurements. We close with a transferable framework for institutions seeking to implement similar privacy-preserving measurement infrastructure.

Subjects:

Machine Learning (cs.LG); Cryptography and Security (cs.CR)

Cite as: arXiv:2606.27558 [cs.LG]

(or arXiv:2606.27558v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2606.27558

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Osonde Osoba Ph.D. [view email] [v1] Thu, 25 Jun 2026 21:20:03 UTC (353 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Productionized Fairness Measurement Under Privacy Constraints, by Osonde A. Osoba and 5 other authors

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.LG

new | recent | 2026-06

Change to browse by:

cs cs.CR

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

IArxiv recommender toggle

IArxiv Recommender (What is IArxiv?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)