Cover Image

Private Evolution Converges

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	González, Tomás, Fanti, Giulia, Ramdas, Aaditya
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Cryptography and Security Data Structures and Algorithms Probability Statistics Theory 68P27 (Primary) 68Q32, 68Q87, 60B10 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved Computational Lower Bound of Estimation for Multi-Frequency Group Synchronization
by: Li, Zhangsong
Published: (2026)

A computational transition for detecting correlated stochastic block models by low-degree polynomials
by: Chen, Guanyi, et al.
Published: (2024)

Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity
by: Li, Zhangsong
Published: (2025)

Analysis of multivariate symbol statistics in primitive rational models
by: Goldwurm, Massimiliano, et al.
Published: (2026)

Optimal Hardness of Online Algorithms for Large Independent Sets
by: Gamarnik, David, et al.
Published: (2025)

Algorithmic Contiguity from Low-Degree Heuristic II: Predicting Detection-Recovery Gaps
by: Li, Zhangsong
Published: (2026)

Approximation and generalization properties of the random projection classification method
by: Boutin, Mireille, et al.
Published: (2021)

The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime
by: Gong, Shuyang, et al.
Published: (2024)

Composition in Differential Privacy for General Granularity Notions (Long Version)
by: Guerra-Balboa, Patricia, et al.
Published: (2023)

Low-Degree Hardness of Detection for Correlated Erdős-Rényi Graphs
by: Ding, Jian, et al.
Published: (2023)

Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares
by: Göbel, Andreas, et al.
Published: (2025)

Potential Hessian Ascent III: Sampling the Sherrington--Kirkpatrick Model at Beta < 1/2
by: Davies, Ewan, et al.
Published: (2026)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
by: Bergougnoux, Benjamin, et al.
Published: (2025)

Algorithmic Universality, Low-Degree Polynomials, and Max-Cut in Sparse Random Graphs
by: Cheairi, Houssam El, et al.
Published: (2024)

Computing the probability of intersection
by: Barvinok, Alexander
Published: (2025)

The Algorithmic Phase Transition in Correlated Spiked Models
by: Li, Zhangsong
Published: (2025)

Large Spikes in Stochastic Gradient Descent: A Large-Deviations View
by: Gess, Benjamin, et al.
Published: (2026)

VulRG: Multi-Level Explainable Vulnerability Patch Ranking for Complex Systems Using Graphs
by: Jiang, Yuning, et al.
Published: (2025)

A Proof of The Changepoint Detection Threshold Conjecture in Preferential Attachment Models
by: Du, Hang, et al.
Published: (2025)

Residual-Entropy Accounting for Routed Atom-Budgeted Learned Indexes
by: Alpay, Faruk, et al.
Published: (2026)

Formal Foundations for Controlled Stochastic Activity Networks
by: Movaghar, Ali
Published: (2025)

A packing lemma for VCN${}_k$-dimension and learning high-dimensional data
by: Coregliano, Leonardo N., et al.
Published: (2025)

On Approximating the Potts Model with Contracting Glauber Dynamics
by: He, Roxanne, et al.
Published: (2024)

Sample completion, structured correlation, and Netflix problems
by: Coregliano, Leonardo N., et al.
Published: (2025)

Conformal e-testing
by: Vovk, Vladimir, et al.
Published: (2020)

An Algorithm to Recover Shredded Random Matrices
by: Atamanchuk, Caelan, et al.
Published: (2023)

Discrete Diffusion Models for Language Generation
by: Weligalle, Ashen
Published: (2025)

Planting and MCMC Sampling from the Potts model
by: Galanis, Andreas, et al.
Published: (2024)

Low-temperature Sampling on Sparse Random Graphs
by: Galanis, Andreas, et al.
Published: (2025)

Quantum Search without Global Diffusion
by: Burke, John, et al.
Published: (2026)

On weighted graph separation problems and flow-augmentation
by: Kim, Eun Jung, et al.
Published: (2022)

Critical probabilities for positively associated, finite-range dependent percolation models
by: Köhler-Schindler, Laurin, et al.
Published: (2024)

Parameterized Complexity of Directed Traveling Salesman Problem
by: Blažej, Václav, et al.
Published: (2025)

Sharp threshold for network recovery from voter model dynamics
by: Du, Hang, et al.
Published: (2025)

A Smooth Computational Transition in Tensor PCA
by: Li, Zhangsong
Published: (2025)

A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation
by: Ding, Jian, et al.
Published: (2023)

Robust random graph matching in Gaussian models via vector approximate message passing
by: Li, Zhangsong
Published: (2024)

Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases
by: Meusel, Julia, et al.
Published: (2025)

Optimizing Noise for $f$-Differential Privacy via Anti-Concentration and Stochastic Dominance
by: Awan, Jordan, et al.
Published: (2023)

Leakage-Resilient Hardness Equivalence to Logspace Derandomization
by: Shalunov, Yakov
Published: (2023)