Demo Data from EDBT 2026 / reviewers in the wild / expert
Jinwon Sohn
dblp:346/4957
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021
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 |
Computational geometry · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection
differential privacy |
0.8 | 1 | 2024 | Differentially Private Topological Data Analysis · J. Mach. Learn. Res. 2024 |
Privacy and data protection › differential privacy › differentially private query answering
private data analysis |
0.8 | 1 | 2024 | Differentially Private Topological Data Analysis · J. Mach. Learn. Res. 2024 |
Computational geometry › topological data analysis › persistent homology
persistence diagram |
0.8 | 1 | 2024 | Differentially Private Topological Data Analysis · J. Mach. Learn. Res. 2024 |
Computational geometry
topological data analysis |
0.8 | 1 | 2024 | Differentially Private Topological Data Analysis · J. Mach. Learn. Res. 2024 |
Methods — techniques the papers use, named apart from their topics
sensitivity analysis · 1.5exponential mechanism · 1.5distance to measure · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Fair Supervised Learning with A Simple Random Sampler of Sensitive AttributesabstractAs the data-driven decision process becomes dominating for industrial applications, fairness-aware machine learning arouses great attention in various areas. This work proposes fairness penalties learned by neural networks with a simple random sampler of sensitive attributes for non-discriminatory supervised learning. In contrast to many existing works that critically rely on the discreteness of sensitive attributes and response variables, the proposed penalty is able to handle versatile formats of the sensitive attributes, so it is more extensively applicable in practice than many existing algorithms. This penalty enables us to build a computationally efficient group-level in-processing fairness-aware training framework. Empirical evidence shows that our framework enjoys better utility and fairness measures on popular benchmark data sets than competing methods. We also theoretically characterize estimation errors and loss of utility of the proposed neural-penalized risk minimization problem. Jinwon Sohn, Qifan Song |
AISTATS | 1 |
| 2024 | Differentially Private Topological Data AnalysisabstractThis paper is the first to attempt differentially private (DP) topological data analysis (TDA), producing near-optimal private persistence diagrams. We analyze the sensitivity of persistence diagrams in terms of the bottleneck distance, and we show that the commonly used Cech complex has sensitivity that does not decrease as the sample size $n$ increases. This makes it challenging for the persistence diagrams of Cech complexes to be privatized. As an alternative, we show that the persistence diagram obtained by the $L^1$-distance to measure (DTM) has sensitivity $O(1/n)$. Based on the sensitivity analysis, we propose using the exponential mechanism whose utility function is defined in terms of the bottleneck distance of the $L^1$-DTM persistence diagrams. We also derive upper and lower bounds of the accuracy of our privacy mechanism; the obtained bounds indicate that the privacy error of our mechanism is near-optimal. We demonstrate the performance of our privatized persistence diagrams through simulations as well as on a real data set tracking human movement. Taegyu Kang, Sehwan Kim, Jinwon Sohn, Jordan Awan |
J. Mach. Learn. Res. | 3 |