scientific article; zbMATH DE number 7307479

MaRDI QIDQ5149241

No author found.

Publication date: 8 February 2021

Full work available at URL: https://arxiv.org/abs/2011.05934

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

differential privacyempirical risk minimizationround complexitylocal differential privacyconvex learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

PAC learning halfspaces in non-interactive local differential privacy model with public unlabeled data

Uses Software

• RAPPOR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
• On parallel complexity of nonsmooth convex optimization
• A class of smoothing functions for nonlinear and mixed complementarity problems
• The saturation class and iterates of the Bernstein polynomials
• Distributed Private Heavy Hitters
• Faster Algorithms for Privately Releasing Marginals
• Privately Releasing Conjunctions and the Statistical Query Barrier
• Local, Private, Efficient Protocols for Succinct Histograms
• What Can We Learn Privately?
• The Algorithmic Foundations of Differential Privacy
• Distributed Private Data Analysis: Simultaneously Solving How and What
• Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy
• Heavy Hitters and the Structure of Local Privacy
• Theory of Cryptography

This page was built for publication: