Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Ana Kenney

dblp:234/8926 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Privacy and data protection · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection
differential privacy
0.412019
Benefits and Pitfalls of the Exponential Mechanism with Applications to Hilbert Spaces and Functional PCA · ICML 2019
Privacy and data protection › differential privacy › privacy mechanism design
exponential mechanism
0.412019
Benefits and Pitfalls of the Exponential Mechanism with Applications to Hilbert Spaces and Functional PCA · ICML 2019
Mathematical optimization
functional data analysis
0.412019
Benefits and Pitfalls of the Exponential Mechanism with Applications to Hilbert Spaces and Functional PCA · ICML 2019
Privacy and data protection
privacy-preserving data analysis
0.112019
Benefits and Pitfalls of the Exponential Mechanism with Applications to Hilbert Spaces and Functional PCA · ICML 2019

Methods — techniques the papers use, named apart from their topics

gaussian process · 0.8exponential mechanism · 0.8central limit theorem · 0.8
YearPublicationVenuePosition
2019 Benefits and Pitfalls of the Exponential Mechanism with Applications to Hilbert Spaces and Functional PCA
abstract
The exponential mechanism is a fundamental tool of Differential Privacy (DP) due to its strong privacy guarantees and flexibility. We study its extension to settings with summaries based on infinite dimensional outputs such as with functional data analysis, shape analysis, and nonparametric statistics. We show that the mechanism must be designed with respect to a specific base measure over the output space, such as a Gaussian process. We provide a positive result that establishes a Central Limit Theorem for the exponential mechanism quite broadly. We also provide a negative result, showing that the magnitude of noise introduced for privacy is asymptotically non-negligible relative to the statistical estimation error. We develop an $\ep$-DP mechanism for functional principal component analysis, applicable in separable Hilbert spaces, and demonstrate its performance via simulations and applications to two datasets.
Jordan Awan, Ana Kenney, Matthew Reimherr, Aleksandra B. Slavkovic
ICML2