Xin Lyu

Affiliations:
  • Tsinghua University, Institute for Interdisciplinary Information Sciences, Beijing, China


According to our database1, Xin Lyu authored at least 17 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries.
IACR Cryptol. ePrint Arch., 2024

The Cost of Parallelizing Boosting.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting.
Electron. Colloquium Comput. Complex., 2023

Hot PATE: Private Aggregation of Distributions for Diverse Task.
CoRR, 2023

The Target-Charging Technique for Privacy Accounting across Interactive Computations.
CoRR, 2023

Optimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

The Target-Charging Technique for Privacy Analysis across Interactive Computations.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Generalized Private Selection and Testing with High Confidence.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Tight Time-Space Lower Bounds for Constant-Pass Learning.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Improved Pseudorandom Generators for AC<sup>0</sup> Circuits.
Electron. Colloquium Comput. Complex., 2022

On the Robustness of CountSketch to Adaptive Inputs.
Proceedings of the International Conference on Machine Learning, 2022

Improved Pseudorandom Generators for AC⁰ Circuits.
Proceedings of the 37th Computational Complexity Conference, 2022

2021
Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC1.
Electron. Colloquium Comput. Complex., 2021

Inverse-Exponential Correlation Bounds and Extremely Rigid Matrices from a New Derandomized XOR Lemma.
Electron. Colloquium Comput. Complex., 2021

Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC¹.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization.
Electron. Colloquium Comput. Complex., 2020


  Loading...