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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Abhinav Chakraborty 0002

dblp:257/1462-2 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 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
Information theory · 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.912025
When Data Can't Meet: Estimating Correlation Across Privacy Barriers · NeurIPS 2025
Privacy and data protection › differential privacy
distributed differential privacy
0.912025
When Data Can't Meet: Estimating Correlation Across Privacy Barriers · NeurIPS 2025
Information theory › estimation theory
correlation estimation
0.912025
When Data Can't Meet: Estimating Correlation Across Privacy Barriers · NeurIPS 2025
Privacy and data protection
privacy-preserving data analysis
0.312025
When Data Can't Meet: Estimating Correlation Across Privacy Barriers · NeurIPS 2025

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

minimax estimation · 1.7confidence intervals · 0.9confidence interval · 0.9
YearPublicationVenuePosition
2025 When Data Can't Meet: Estimating Correlation Across Privacy Barriers
abstract
We consider the problem of estimating the correlation of two random variables $X$ and $Y$, where the pairs $(X,Y)$ are not observed together, but are instead separated co-ordinate-wise at two servers: server 1 contains all the $X$ observations, and server 2 contains the corresponding $Y$ observations. In this vertically distributed setting, we assume that each server has its own privacy constraints, owing to which they can only share suitably privatized statistics of their own component observations. We consider differing privacy budgets $(\varepsilon_1,\delta_1)$ and $(\varepsilon_2,\delta_2)$ for the two servers and determine the minimax optimal rates for correlation estimation allowing for both non-interactive and interactive mechanisms. We also provide correlation estimators that achieve these rates and further develop inference procedures, namely, confidence intervals, for the estimated correlations. Our results are characterized by an interesting rate in terms of the sample size $n$, $\varepsilon_1$, $\varepsilon_2$, which is strictly slower than the usual central privacy estimation rates. More interestingly, we find that the interactive mechanism is always better than its non-interactive counterpart whenever the two privacy budgets are different. Results from extensive numerical experiments support our theoretical findings.
Abhinav Chakraborty 0002, Arnab Auddy, T. Tony Cai
NeurIPS1
2024 PrIsing: Privacy-Preserving Peer Effect Estimation via Ising Model
abstract
The Ising model, originally developed as a spin-glass model for ferromagnetic elements, has gained popularity as a network-based model for capturing dependencies in agents’ outputs. Its increasing adoption in healthcare and the social sciences has raised privacy concerns regarding the confidentiality of agents’ responses. In this paper, we present a novel $(\varepsilon,\delta)$-differentially private algorithm specifically designed to protect the privacy of individual agents’ outcomes. Our algorithm allows for precise estimation of the natural parameter using a single network through an objective perturbation technique. Furthermore, we establish regret bounds for this algorithm and assess its performance on synthetic datasets and two real-world networks: one involving HIV status in a social network and the other concerning the political leaning of online blogs.
Abhinav Chakraborty 0002, Anirban Chatterjee, Abhinandan Dalal
AISTATS1