Grzegorz Gluch

Orcid: 0009-0004-8313-1408

According to our database1, Grzegorz Gluch authored at least 19 papers between 2018 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Private Proofs of When and Where.
IACR Cryptol. ePrint Arch., 2026

2025
On the Impossibility of Separating Intelligence from Judgment: The Computational Intractability of Filtering for AI Alignment.
CoRR, July, 2025

A Cryptographic Perspective on Mitigation vs. Detection in Machine Learning.
CoRR, April, 2025

4/3 rectangle tiling lower bound.
Inf. Process. Lett., 2025

The Good, the Bad and the Ugly: Meta-Analysis of Watermarks, Transferable Attacks and Adversarial Defenses.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

2024
Quantum Protocols for ML, Physics, and Finance.
PhD thesis, 2024

The Good, the Bad and the Ugly: Watermarks, Transferable Attacks and Adversarial Defenses.
CoRR, 2024

Nonlocality under Computational Assumptions.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
Bayes Complexity of Learners vs Overfitting.
CoRR, 2023

Breaking a Classical Barrier for Classifying Arbitrary Test Examples in the Quantum Model.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2021
Provable Adversarial Robustness in the Quantum Model.
CoRR, 2021

Noether: The More Things Change, the More Stay the Same.
CoRR, 2021

Adversarial Robustness: What fools you makes you stronger.
CoRR, 2021

Spectral Clustering Oracles in Sublinear Time.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Exponential Separation between Two Learning Models and Adversarial Robustness.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Query Complexity of Adversarial Attacks.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Constructing a provably adversarially-robust classifier from a high accuracy one.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
The First Order Truth Behind Undecidability of Regular Path Queries Determinacy.
Proceedings of the 22nd International Conference on Database Theory, 2019

2018
Can One Escape Red Chains?: Regular Path Queries Determinacy is Undecidable.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018


  Loading...