Skip to content

Author

Purnamrita Sarkar

We have 6 of 89 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

One-Shot Private Confidence Regions via Resampling

A simple framework for constructing differentially private confidence regions by adding noise only to the final resampling quantile instead of privatizing the estimator computed on each resample, avoiding the computational and privacy costs of privatizing many intermediate resample statistics.

Shourya Pandey, Purnamrita Sarkar, Po-Ling Loh et al. · 0 citations
Preprint Sep 2026

Streaming PCA: averaging from a geometric perspective

The main goal is to develop a procedure based on Oja's algorithm that is optimal without prior knowledge of the eigengap, which is otherwise needed to tune the learning rates effectively.

Tuan Pham, A. Rinaldo, Purnamrita Sarkar · 0 citations
Preprint Oct 2026

One-Shot Private Confidence Regions via Resampling

We propose a simple framework for constructing differentially private confidence regions \textit{in one shot}, i.e., by adding noise only to the final resampling quantile instead of privatizing the estimator computed on each resample. The cost of privacy of our procedure is only logarithmic in the number of resamples $...

Shourya Pandey, Purnamrita Sarkar, Po-Ling Loh et al. · 0 citations
#machine learning Preprint Oct 2026

Conditional Flow Matching for Transport Between Markov Processes

A flow matching based algorithm is formulated which learns a transport map from the source to target trajectory distribution, while preserving the Markov structure, which is consistent in the population limit and derive finite-sample error bounds under mixing time assumptions.

Syamantak Kumar, D. Nagaraj, Saptarshi Roy et al. · 0 citations
Preprint Sep 2026

Streaming PCA: averaging from a geometric perspective

We study principal component analysis (PCA) under memory constraints, a setting that is increasingly important in large-scale data analysis. Our focus is on Oja's algorithm, which is a one-pass, memory-efficient algorithm requiring only $O(p)$ storage in the rank-one case and $O(pk)$ storage for $k$- PCA. The main goal...

Tuan Pham, A. Rinaldo, Purnamrita Sarkar · 0 citations
#machine learning Preprint Sep 2026

High-Magnetization Sampling at Low Temperatures: Ising Models and Bayesian Sparse Linear Regression

Sparsity is a powerful structural resource in optimization and statistics. We develop frameworks for leveraging sparsity in sampling problems over the Hamming slice $\mathcal{X}_k^d:=\{\mathbf{x}\in\{\pm 1\}^d:|\{i:\mathbf{x}_i=1\}|=k\}$, in high-dimensional regimes where $k\ll d$ (i.e., where $\mathcal{X}_k^d$ is \emp...

Syamantak Kumar, Purnamrita Sarkar, Kevin Tian et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.