Sketching in Adversarial Environments

DOI10.1137/080733772MaRDI QIDQ3225174zbMATH OpenOpenAlexFDO

Authors Ilya Mironov, Moni Naor, Gil Segev

Publication date 15 March 2012

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/080733772

zbMATH Keywords

communication complexitydata stream modelsketch model

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Sketched learning for image denoising
• An experimental comparison of machine learning for adaptive sketch recognition
• Research of generating sketching style from original image

Cited in

(9)

• Separating adaptive streaming from oblivious streaming using the bounded storage model
• A Framework for Adversarially Robust Streaming Algorithms
• How robust are linear sketches to adaptive inputs?
• Cuckoo hashing in cryptography: optimal parameters, robustness and applications
• Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
• Arithmetic sketching
• Adversarially robust streaming algorithms via differential privacy
• A framework for adversarial streaming via differential privacy and difference estimators
• Adversarial laws of large numbers and optimal regret in online classification

This page was built for publication: Sketching in Adversarial Environments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225174)