Draft:Aleksandra Korolova
| Submission declined on 28 February 2024 by Ldm1954 (talk). This draft's references do not show that the subject qualifies for a Wikipedia article. In summary, the draft needs to
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
|  |
Comment: Too soon. Neither the NSF, Sloan or Bronze medals qualify as major awards, and she does not yet have a strong enough publication record. She has made a good start, but it will be done years before she qualifies. Ldm1954 (talk) 06:18, 28 February 2024 (UTC)
Aleksandra Korolova | |
|---|---|
| Alma mater | Stanford University (PhD) |
| Awards | |
| Scientific career | |
| Fields | |
| Institutions | Princeton University |
| Thesis | Protecting Privacy When Mining and Sharing User Data (2012) |
| Doctoral advisor | Ashish Goel.[1] |
| Website | www |
Aleksandra Korolova is a Latvian[2] - American Computer Scientist. She is an Assistant Professor of Computer Science[3] and Public Affairs[4] at Princeton University and Associated Faculty[5] at Princeton's Center for Information Technology Policy. Her research develops privacy-preserving and fair algorithms, studies individual and societal impacts of machine learning and AI, and performs AI audits for algorithmic bias.
Research and career[edit]
Privacy[edit]
Korolova's research has been one of the first to identify privacy vulnerabilities in targeted advertising systems[6][7].
Korolova's work led to the first industry deployment of differential privacy, Google's RAPPOR[8][9], demonstrating its feasibility in the local model.
Algorithmic Fairness[edit]
Korolova developed new black-box audit methodologies for isolating the role of ad delivery algorithms from other confounding factors. Her application of these methodologies demonstrated that Facebook's ad delivery algorithms lead to discriminatory outcomes in housing and employment advertising[10][11] and to a filter bubble in political ad delivery[12].
Recognition[edit]
Korolova's Ph.D. thesis titled "Protecting Privacy when Mining and Sharing User Data" won the Arthur Samuel Award for outstanding Computer Science Ph.D. thesis at Stanford University[13].
Korolova's work on demonstrating privacy vulnerabilities due to microtargeted advertising was recognized by the 2011 PET Award for Outstanding Research in Privacy Enhancing Technologies[14].
Korolova's work on discrimination through ad delivery received an Honorable Mention at the CSCW conference in 2019[15].
She is the recipient of the 2020 National Science Foundation CAREER Award[16].
Korolova was awarded the 2024 Sloan Research Fellowship in Computer Science[17]
She won bronze medals at the 1998 and 2000 International Mathematics Olympiad.[18]
References[edit]
- ^ Aleksandra Korolova at the Mathematics Genealogy Project
- ^ "Latvian Computer Scientists".
- ^ "Faculty Directory". Princeton Department of Computer Science.
- ^ "Aleksandra Korolova". Princeton School of Public and International Affairs Faculty Directory.
- ^ "Associated Faculty". Center for Information Technology Policy.
- ^ Korolova, Aleksandra (2011). "Privacy Violations Using Microtargeted Ads: A Case Study". Journal of Privacy and Confidentiality. 3. doi:10.29012/jpc.v3i1.594.
- ^ Heft, Miguel (Oct 22, 2010). "Marketers Can Glean Private Data on Facebook". New York Times.
- ^ Úlfar Erlingsson, Vasyl Pihur, and Aleksandra Korolova (2014). "RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Response". Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security. pp. 1054–1067. doi:10.1145/2660267.2660348. ISBN 978-1-4503-2957-6.
{{cite book}}: CS1 maint: multiple names: authors list (link) - ^ Erlingsson, Úlfar. "Learning statistics with privacy, aided by the flip of a coin". Google Security Blog.
- ^ Muhammad Ali, Piotr Sapiezynski, Miranda Bogen, Aleksandra Korolova, Alan Mislove, and Aaron Rieke. (7 November 2019). "Discrimination through Optimization: How Facebook's Ad Delivery Can Lead to Biased Outcomes". Proceedings of the ACM on Human-Computer Interaction. 3 (CSCW): 199:1–199:30. doi:10.1145/3359301.
{{cite journal}}: CS1 maint: multiple names: authors list (link) - ^ Basileal Imana, Aleksandra Korolova, and John Heidemann (2021). "Auditing for Discrimination in Algorithms Delivering Job Ads". Proceedings of the Web Conference 2021. pp. 3767–3778. doi:10.1145/3442381.3450077. ISBN 978-1-4503-8312-7.
{{cite book}}: CS1 maint: multiple names: authors list (link) - ^ Muhammad Ali, Piotr Sapiezynski, Aleksandra Korolova, Alan Mislove, and Aaron Rieke (2021). "Ad Delivery Algorithms: The Hidden Arbiters of Political Messaging". Proceedings of the 14th ACM International Conference on Web Search and Data Mining. pp. 13–21. doi:10.1145/3437963.3441801. ISBN 978-1-4503-8297-7.
{{cite book}}: CS1 maint: multiple names: authors list (link) - ^ Widom, Jennifer. "Stanford Computer Science 2013 Newsletter".
- ^ "PET Award for Outstanding Research in Privacy Enhancing Technologies".
- ^ "Conference Programs".
- ^ "NSF Award Search: Award # 1943584 - CAREER: Towards Privacy and Fairness in Multi-Sided Platforms".
- ^ "2024 Sloan Research Fellowships". Alfred P. Sloan Foundation.
- ^ "International Mathematical Olympiad".