scientific article; zbMATH DE number 6860834

zbMath1442.62025arXiv1610.03577MaRDI QIDQ4637057

Jihun Hamm

Publication date: 17 April 2018

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

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

zbMATH Keywords

minimax optimizationdifferential privacy\(k\)-anonymityempirical risk minimizationinference attackspeech emotion classification

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Minimax procedures in statistical decision theory (62C20) Learning and adaptive systems in artificial intelligence (68T05) Applications of statistics to psychology (62P15) Statistical aspects of big data and data science (62R07)

Related Items (1)

Unnamed Item

Uses Software

• PrivateLR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A direct method of linearization for continuous minimax problems
• What Can We Learn Privately?
• The Algorithmic Foundations of Differential Privacy
• Linearization method for continuous min-max problem
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• Distributed Subgradient Methods for Multi-Agent Optimization
• Universally utility-maximizing privacy mechanisms
• Advances in Cryptology – CRYPTO 2004
• Privacy-preserving statistical estimation with optimal convergence rates
• Understanding Machine Learning
• Theory of Cryptography
• Differential Privacy

This page was built for publication: