Joel Daniel Andersson
Scholar

Joel Daniel Andersson

Google Scholar ID: YIN6oFUAAAAJ
IST Austria
algorithmsdifferential privacy
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
120
 
H-index
4
 
i10-index
3
 
Publications
10
 
Co-authors
0
 
Contact
CVOpen ↗GitHubOpen ↗
Publications
7 items
Edit-Neighboring Data Streams and Privacy under Continual Observation
2026
Cited
0
Beyond Square Roots: Explicit Memory-Efficient Factorization for Multi-Epoch Private Learning
2026
Cited
0
Improved Accuracy for Private Continual Cardinality Estimation in Fully Dynamic Streams via Matrix Factorization
arXiv.org · 2026
Cited
1
Learning Rate Scheduling with Matrix Factorization for Private Training
2025
Cited
0
Private Lossless Multiple Release
2025
Cited
0
On the Space Complexity of Online Convolution
2025
Cited
0
Streaming Private Continual Counting via Binning
arXiv.org · 2024
Cited
0
Resume
Academic Achievements
  • Published 'A Smooth Binary Mechanism for Efficient Private Continual Observation' at NeurIPS 2023
  • Published 'Continual Counting with Gradual Privacy Expiration' at NeurIPS 2024
  • Published 'Private Lossless Multiple Release' at ICML 2025
  • Published 'Count on Your Elders: Laplace vs Gaussian Noise' at FORC 2025
  • Published 'Streaming Private Continual Counting via Binning' at SaTML 2025
  • Completed master’s thesis 'A Linear Framework for Orbit Correction in the High-Luminosity Large Hadron Collider' in 2020
  • Co-authored CERN technical report 'Orbit Correction Studies on the HL-LHC Layout and Optics V1.5' in 2020