Ido Nachum

According to our database, Ido Nachum authored at least 15 papers between 2017 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Minimax Limits of k-Fold Cross-Validation via Majority.

Ido Nachum, Rüdiger L. Urbanke, Thomas Weinberger

CoRR, May, 2026

2025

The Structure of Cross-Validation Error: Stability, Covariance, and Minimax Limits.

Ido Nachum, Rüdiger L. Urbanke, Thomas Weinberger

CoRR, November, 2025

2024

Batch Normalization Decomposed.

Ido Nachum, Marco Bondaschi, Michael Gastpar, Anatoly Khina

CoRR, 2024

Which Algorithms Have Tight Generalization Bounds?

Michael Gastpar, Ido Nachum, Jonathan Shafer, Thomas Weinberger

CoRR, 2024

Fantastic Generalization Measures are Nowhere to be Found.

Michael Gastpar, Ido Nachum, Jonathan Shafer, Thomas Weinberger

Proceedings of the Twelfth International Conference on Learning Representations, 2024

2022

Finite Littlestone Dimension Implies Finite Information Complexity.

Aditya Pradeep, Ido Nachum, Michael Gastpar

Proceedings of the IEEE International Symposium on Information Theory, 2022

A Johnson-Lindenstrauss Framework for Randomly Initialized CNNs.

Ido Nachum, Jan Hazla, Michael Gastpar, Anatoly Khina

Proceedings of the Tenth International Conference on Learning Representations, 2022

2021

Almost-Reed-Muller Codes Achieve Constant Rates for Random Errors.

Emmanuel Abbe, Jan Hazla, Ido Nachum

IEEE Trans. Inf. Theory, 2021

Regularization by Misclassification in ReLU Neural Networks.

Elisabetta Cornacchia, Jan Hazla, Ido Nachum, Amir Yehudayoff

CoRR, 2021

2020

On Symmetry and Initialization for Neural Networks.

Ido Nachum, Amir Yehudayoff

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

On the Perceptron's Compression.

Shay Moran, Ido Nachum, Itai Panasoff, Amir Yehudayoff

Proceedings of the Beyond the Horizon of Computability, 2020

2019

Average-Case Information Complexity of Learning.

Ido Nachum, Amir Yehudayoff

Proceedings of the Algorithmic Learning Theory, 2019

2018

A Direct Sum Result for the Information Complexity of Learning.

Ido Nachum, Jonathan Shafer, Amir Yehudayoff

Proceedings of the Conference On Learning Theory, 2018

Learners that Use Little Information.

Raef Bassily, Shay Moran, Ido Nachum, Jonathan Shafer, Amir Yehudayoff

Proceedings of the Algorithmic Learning Theory, 2018

2017

Learners that Leak Little Information.

Raef Bassily, Shay Moran, Ido Nachum, Jonathan Shafer, Amir Yehudayoff

CoRR, 2017