Idan Attias

According to our database1, Idan Attias authored at least 14 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Information Complexity of Stochastic Convex Optimization: Applications to Generalization and Memorization.
CoRR, 2024

2023
Optimal Learners for Realizable Regression: PAC Learning and Online Learning.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Adversarially Robust PAC Learnability of Real-Valued Functions.
Proceedings of the International Conference on Machine Learning, 2023

Online Learning and Solving Infinite Games with an ERM Oracle.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Learning Revenue Maximization Using Posted Prices for Stochastic Strategic Patient Buyers.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Domain Invariant Adversarial Learning.
Trans. Mach. Learn. Res., 2022

Improved Generalization Bounds for Adversarially Robust Learning.
J. Mach. Learn. Res., 2022

Adversarially Robust Learning of Real-Valued Functions.
CoRR, 2022

Stochastic Strategic Patient Buyers: Revenue maximization using posted prices.
CoRR, 2022

A Characterization of Semi-Supervised Adversarially Robust PAC Learnability.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Fat-shattering dimension of k-fold maxima.
CoRR, 2021

2020
Prediction with Corrupted Expert Advice.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Improved Generalization Bounds for Robust Learning.
Proceedings of the Algorithmic Learning Theory, 2019


  Loading...