scientific article; zbMATH DE number 7053378
From MaRDI portal
Publication:5743502
zbMath1421.68146MaRDI QIDQ5743502
Pravesh K. Kothari, Adam R. Klivans, Mahdi Cheraghchi, Homin K. Lee
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095242
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Submodular Functions: Learnability, Structure, and Optimization, Is submodularity testable?, Differential Privacy on Finite Computers, Approximating the Noise Sensitivity of a Monotone Boolean Function, Approximate F_2-Sketching of Valuation Functions, Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions, Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas, Efficient algorithms for privately releasing marginals via convex relaxations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning intersections and thresholds of halfspaces
- Toward efficient agnostic learning
- Privately Releasing Conjunctions and the Statistical Query Barrier
- What Can We Learn Privately?
- Maximizing Non-monotone Submodular Functions
- Efficient noise-tolerant learning from statistical queries
- Agnostically Learning Halfspaces
- An analysis of approximations for maximizing submodular set functions—I
- Symmetry and Approximability of Submodular Maximization Problems
- Information Inequalities for Joint Distributions, With Interpretations and Applications
- Learning submodular functions
- Some optimal inapproximability results
- Matroids and the greedy algorithm
- Truthful randomized mechanisms for combinatorial auctions
- Theory of Cryptography
- Hardness amplification within NP
- Noise sensitivity of Boolean functions and applications to percolation
