Samson Zhou

Orcid: 0000-0001-8288-5698

According to our database1, Samson Zhou authored at least 73 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Bandwidth-Hard Functions: Reductions and Lower Bounds.
J. Cryptol., June, 2024

Learning-Augmented Skip Lists.
CoRR, 2024

2023
On Differential Privacy and Adaptive Data Analysis with Bounded Space.
IACR Cryptol. ePrint Arch., 2023

Provable Data Subset Selection For Efficient Neural Network Training.
CoRR, 2023

Streaming Algorithms for Learning with Experts: Deterministic Versus Robust.
CoRR, 2023

Differentially Private L<sub>2</sub>-Heavy Hitters in the Sliding Window Model.
CoRR, 2023

Near-Linear Sample Complexity for <i>L<sub>p</sub></i> Polynomial Regression.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

On Robust Streaming for Learning with Experts: Algorithms and Lower Bounds.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Near-Optimal k-Clustering in the Sliding Window Model.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Selective experience replay compression using coresets for lifelong deep reinforcement learning in medical imaging.
Proceedings of the Medical Imaging with Deep Learning, 2023

Fast (1+ε)-Approximation Algorithms for Binary Matrix Factorization.
Proceedings of the International Conference on Machine Learning, 2023

Provable Data Subset Selection For Efficient Neural Networks Training.
Proceedings of the International Conference on Machine Learning, 2023

Robust Algorithms on Adaptive Inputs from Bounded Adversaries.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Differentially Private $L_2$-Heavy Hitters in the Sliding Window Model.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Subquadratic Algorithms for Kernel Matrices via Kernel Density Estimation.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Streaming Euclidean k-median and k-means with o(log n) Space.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Differentially Private Aggregation via Imperfect Shuffling.
Proceedings of the 4th Conference on Information-Theoretic Cryptography, 2023

Private Data Stream Analysis for Universal Symmetric Norm Estimation.
Proceedings of the Approximation, 2023

How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity.
Proceedings of the Approximation, 2023

2022
Data-Independent Structured Pruning of Neural Networks via Coresets.
IEEE Trans. Neural Networks Learn. Syst., 2022

Sub-quadratic Algorithms for Kernel Matrices via Kernel Density Estimation.
CoRR, 2022

Near-Linear Sample Complexity for L<sub>p</sub> Polynomial Regression.
CoRR, 2022

Memory bounds for the experts problem.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

A Fast, Provably Accurate Approximation Algorithm for Sparse Principal Component Analysis Reveals Human Genetic Variation Across the World.
Proceedings of the Research in Computational Molecular Biology, 2022

Truly Perfect Samplers for Data Streams and Sliding Windows.
Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

The White-Box Adversarial Data Stream Model.
Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Learning-Augmented Algorithms for Online Linear and Semidefinite Programming.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Noisy Boolean Hidden Matching with Applications.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Hardness and Algorithms for Robust and Sparse Optimization.
Proceedings of the International Conference on Machine Learning, 2022

Fast Regression for Structured Inputs.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Learning-Augmented $k$-means Clustering.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Adaptive Sketches for Robust Regression with Importance Sampling.
Proceedings of the Approximation, 2022

New Coresets for Projective Clustering and Applications.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Relaxed Locally Correctable Codes in Computationally Bounded Channels.
IEEE Trans. Inf. Theory, 2021

Dimensionality Reduction for Wasserstein Barycenter.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Adversarial Robustness of Streaming Algorithms through Importance Sampling.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Sensitivity Analysis of the Maximum Matching Problem.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Learning a Latent Simplex in Input Sparsity Time.
Proceedings of the 9th International Conference on Learning Representations, 2021

Separations for Estimating Large Frequency Moments on Data Streams.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Symmetric Norm Estimation and Regression on Sliding Windows.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

On the Security of Proofs of Sequential Work in a Post-Quantum World.
Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

Efficient Coreset Constructions via Sensitivity Sampling.
Proceedings of the Asian Conference on Machine Learning, 2021

2020
Periodicity in Data Streams with Wildcards.
Theory Comput. Syst., 2020

Approximation Algorithms for Sparse Principal Component Analysis.
CoRR, 2020

Non-adaptive adaptive sampling on turnstile streams.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Fast Fourier Sparsity Testing.
Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

Approximating Cumulative Pebbling Cost Is Unique Games Hard.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Computationally Data-Independent Memory Hard Functions.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Data-Independent Neural Pruning via Coresets.
Proceedings of the 8th International Conference on Learning Representations, 2020

On Locally Decodable Codes in Resource Bounded Channels.
Proceedings of the 1st Conference on Information-Theoretic Cryptography, 2020

Near Optimal Linear Algebra in the Online and Sliding Window Models.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Memory-Efficient Performance Monitoring on Programmable Switches with Lean Algorithms.
Proceedings of the 1st Symposium on Algorithmic Principles of Computer Systems, 2020

"Bring Your Own Greedy"+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Nearly Optimal Sparse Group Testing.
IEEE Trans. Inf. Theory, 2019

On Activation Function Coresets for Network Pruning.
CoRR, 2019

Structural Results on Matching Estimation with Applications to Streaming.
Algorithmica, 2019

Adversarially Robust Submodular Maximization under Knapsack Constraints.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Approximate F<sub>2</sub>-Sketching of Valuation Functions.
Proceedings of the Approximation, 2019

Improved Algorithms for Time Decay Streams.
Proceedings of the Approximation, 2019

2018
Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions.
IACR Cryptol. ePrint Arch., 2018

Bandwidth-Hard Functions: Reductions and Lower Bounds.
IACR Cryptol. ePrint Arch., 2018

On the Economics of Offline Password Cracking.
Proceedings of the 2018 IEEE Symposium on Security and Privacy, 2018

Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling.
Proceedings of the Financial Cryptography and Data Security, 2018

Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows.
Proceedings of the Approximation, 2018

2017
On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i.
IACR Cryptol. ePrint Arch., 2017

Optimal Parametric Search for Path and Tree Partitioning.
CoRR, 2017

Streaming for Aibohphobes: Longest Palindrome with Mismatches.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

Streaming Periodicity with Mismatches.
Proceedings of the Approximation, 2017

Longest alignment with edits in data streams.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
Estimating Weighted Matchings in o(n) Space.
CoRR, 2016


  Loading...