Imagen de Portada

Differentially Private Quantiles with Smaller Error

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Imola, Jacob, Boninsegna, Fabrizio, Keller, Hannah, Aamand, Anders, Chowdhury, Amrita Roy, Pagh, Rasmus
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

InfTDA: A Simple TopDown Mechanism for Hierarchical Differentially Private Counting Queries
por: Boninsegna, Fabrizio
Publicado: (2025)

Piquant$\varepsilon$: Private Quantile Estimation in the Two-Server Model
por: Keller, Hannah, et al.
Publicado: (2025)

Lightweight Protocols for Distributed Private Quantile Estimation
por: Aamand, Anders, et al.
Publicado: (2025)

Differentially Private Release of Hierarchical Origin/Destination Data with a TopDown Approach
por: Boninsegna, Fabrizio, et al.
Publicado: (2024)

Differentially Private High-Dimensional Approximate Range Counting, Revisited
por: Aumüller, Martin, et al.
Publicado: (2024)

Profile Reconstruction from Private Sketches
por: Wu, Hao, et al.
Publicado: (2024)

Skirting Additive Error Barriers for Private Turnstile Streams
por: Aamand, Anders, et al.
Publicado: (2026)

Faster Private Minimum Spanning Trees
por: Pagh, Rasmus, et al.
Publicado: (2024)

Breaking the $n^{1.5}$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition
por: Aamand, Anders, et al.
Publicado: (2025)

Streaming Private Continual Counting via Binning
por: Andersson, Joel Daniel, et al.
Publicado: (2024)

A Smooth Binary Mechanism for Efficient Private Continual Observation
por: Andersson, Joel Daniel, et al.
Publicado: (2023)

Private Lossless Multiple Release
por: Andersson, Joel Daniel, et al.
Publicado: (2025)

Differentially Private Gomory-Hu Trees
por: Aamand, Anders, et al.
Publicado: (2024)

Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation
por: Pham, Ninh, et al.
Publicado: (2025)

Near-Optimal Trace Reconstruction for Mildly Separated Strings
por: Aamand, Anders, et al.
Publicado: (2024)

Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation
por: Pagh, Rasmus, et al.
Publicado: (2024)

Aleph Filter: To Infinity in Constant Time
por: Dayan, Niv, et al.
Publicado: (2024)

PLAN: Variance-Aware Private Mean Estimation
por: Aumüller, Martin, et al.
Publicado: (2023)

Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming
por: Kacham, Praneeth, et al.
Publicado: (2023)

Optimal Non-Adaptive Cell Probe Dictionaries and Hashing
por: Larsen, Kasper Green, et al.
Publicado: (2023)

Online Sorting and Translational Packing of Convex Polygons
por: Aamand, Anders, et al.
Publicado: (2021)

Hashing for Sampling-Based Estimation
por: Aamand, Anders, et al.
Publicado: (2024)

How fast can you find a good hypothesis?
por: Aamand, Anders, et al.
Publicado: (2025)

Count on Your Elders: Laplace vs Gaussian Noise
por: Andersson, Joel Daniel, et al.
Publicado: (2024)

Modern Minimal Perfect Hashing: A Survey
por: Lehmann, Hans-Peter, et al.
Publicado: (2025)

Daisy Bloom Filters
por: Bercea, Ioana O., et al.
Publicado: (2022)

Space-Efficient Private Estimation of Quantiles
por: Cafaro, Massimo, et al.
Publicado: (2025)

Relative Error Streaming Quantiles with Seamless Mergeability via Adaptive Compactors
por: Domes, Tomáš, et al.
Publicado: (2025)

Continual Counting with Gradual Privacy Expiration
por: Andersson, Joel Daniel, et al.
Publicado: (2024)

On the Structure of Replicable Hypothesis Testers
por: Aamand, Anders, et al.
Publicado: (2025)

Improved Approximations for Hard Graph Problems using Predictions
por: Aamand, Anders, et al.
Publicado: (2025)

Learning-Augmented Frequent Directions
por: Aamand, Anders, et al.
Publicado: (2025)

On Differentially Private Linear Algebra
por: Kaplan, Haim, et al.
Publicado: (2024)

Differentially Private Substring and Document Counting with Near-Optimal Error
por: Bernardini, Giulia, et al.
Publicado: (2024)

The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2
por: Byrka, Jarosław, et al.
Publicado: (2024)

Concurrent Composition for Differentially Private Continual Mechanisms
por: Henzinger, Monika, et al.
Publicado: (2024)

Differentially Private Selection using Smooth Sensitivity
por: Yamamoto, Akito, et al.
Publicado: (2024)

Almost Tight Bounds for Differentially Private Densest Subgraph
por: Dinitz, Michael, et al.
Publicado: (2023)

SplineSketch: Even More Accurate Quantiles with Error Guarantees
por: Łukasiewicz, Aleksander, et al.
Publicado: (2025)

Improved Differentially Private Continual Observation Using Group Algebra
por: Henzinger, Monika, et al.
Publicado: (2024)