Imagen de Portada

Differentially Private Learning of Exponential Distributions: Simple Algorithms and Tight Bounds

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Mahpud, Bar, Sheffet, Or
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

A Private Approximation of the 2nd-Moment Matrix of Any Subsamplable Input
por: Mahpud, Bar, et al.
Publicado: (2025)

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

Private Approximations of a Convex Hull in Low Dimensions
por: Gao, Yue, et al.
Publicado: (2020)

A Simple, Nearly-Optimal Algorithm for Differentially Private All-Pairs Shortest Distances
por: Campbell, Jesse, et al.
Publicado: (2024)

Almost Tight Error Bounds on Differentially Private Continual Counting
por: Henzinger, Monika, et al.
Publicado: (2022)

Tight Bounds for Gaussian Mean Estimation under Personalized Differential Privacy
por: Dong, Wei, et al.
Publicado: (2026)

Online Flow Time Minimization: Tight Bounds for Non-Preemptive Algorithms
por: Geng, Yutong, et al.
Publicado: (2025)

Tight Differentially Private PCA via Matrix Coherence
por: d'Orsi, Tommaso, et al.
Publicado: (2025)

Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut
por: Cheng, Yu, et al.
Publicado: (2024)

Convex Optimization with Local Label Differential Privacy: Tight Bounds in All Privacy Regimes
por: Chua, Lynn, et al.
Publicado: (2026)

Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees
por: Høgemo, Svein
Publicado: (2024)

A Tight Double-Exponentially Lower Bound for High-Multiplicity Bin Packing
por: Jansen, Klaus, et al.
Publicado: (2025)

Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model
por: Räcke, Harald, et al.
Publicado: (2024)

Tight Sampling Bounds for Eigenvalue Approximation
por: Swartworth, William, et al.
Publicado: (2024)

Tight Bounds for Classical Open Addressing
por: Bender, Michael A., et al.
Publicado: (2024)

A Simple Algorithm for Clustering Discrete Distributions
por: Mitra, Pradipta
Publicado: (2026)

Tight (S)ETH-based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-Machine Scheduling
por: Bringmann, Karl, et al.
Publicado: (2026)

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

Nearly Tight Bounds for the Online Sorting Problem
por: Azar, Yossi, et al.
Publicado: (2025)

Almost Tight Bounds for Online Hypergraph Matching
por: Tröbst, Thorben, et al.
Publicado: (2024)

Tight Bounds for Sorting Under Partial Information
por: van der Hoog, Ivor, et al.
Publicado: (2024)

Improved Bounds with a Simple Algorithm for Edge Estimation for Graphs of Unknown Size
por: Chanda, Debarshi
Publicado: (2025)

Simplified Tight Bounds for Monotone Minimal Perfect Hashing
por: Kosolobov, Dmitry
Publicado: (2024)

Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval
por: Kuszmaul, William, et al.
Publicado: (2024)

Double Exponential Lower Bound for Telephone Broadcast
por: Tale, Prafullkumar
Publicado: (2024)

Tight Lower Bounds for Central String Queries in Compressed Space
por: Kempa, Dominik, et al.
Publicado: (2025)

A Tight Lower Bound for Cycle Detection in Grid Graphs
por: Au, Andrew
Publicado: (2026)

Tight Static Lower Bounds for Non-Adaptive Data Structures
por: Persiano, Giuseppe, et al.
Publicado: (2020)

Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs
por: Khanna, Sanjeev, et al.
Publicado: (2024)

Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth
por: Wlodarczyk, Michal
Publicado: (2023)

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
por: Bentert, Matthias, et al.
Publicado: (2024)

Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs
por: Das, Syamantak, et al.
Publicado: (2024)

Simple and Optimal Algorithms for Heavy Hitters and Frequency Moments in Distributed Models
por: Huang, Zengfeng, et al.
Publicado: (2025)

Tight Bounds for Learning Polyhedra with a Margin
por: Patel, Shyamal, et al.
Publicado: (2026)

Improved Lower Bound for Differentially Private Facility Location
por: Manurangsi, Pasin
Publicado: (2024)

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

Tight Bounds for Sampling q-Colorings via Coupling from the Past
por: Ding, Tianxing, et al.
Publicado: (2025)

Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance
por: Azarmehr, Amir, et al.
Publicado: (2025)

Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model
por: Feng, Shiyuan, et al.
Publicado: (2025)

Improved Differentially Private Algorithms for Rank Aggregation
por: Hillebrand, Quentin, et al.
Publicado: (2025)