4 papers · 1 filter
Private Online Release of Adaptive Linear Queries
Aleksandar Nikolov, Haohua Tang
In this paper we study answering counting and other linear queries online under differential privacy constraints. Recent work by Nikolov, Tang, and Ullman [STOC 2026] gave the firs…
Stronger Memory-Query Tradeoffs for Convex Optimization: The Limitations of Subquadratic Memory
Michael Menart, Aleksandar Nikolov, Ohad Shamir
We prove two lower bounds for the first order oracle complexity of minimizing a -dimensional -Lipschitz convex function over the unit ball with bits of memory. We first s…
Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization
Aleksandar Nikolov, Haohua Tang, Jonathan Ullman
In this paper we consider several related online computation problems. First, we study answering sequences of statistical queries arriving online, and being answered immediately wh…
Weighted Fourier Factorizations: Optimal Gaussian Noise for Differentially Private Marginal and Product Queries
Christian Janos Lebeda, Aleksandar Nikolov, Haohua Tang
We revisit the task of releasing marginal queries under differential privacy with additive (correlated) Gaussian noise. We first give a construction for answering arbitrary workloa…