← Search

Melih Barsbey

8 accepted papers

2026

Adversarial Vulnerability from Interference Between Features in Superposition

ICML 2026poster

Why do adversarial examples exist, and why do they transfer between models? Existing explanations appeal to high-dimensional geometry, non-robust patterns in the input, and decision boundary structure, but none provides a representation-level mechanism that explains why specific perturbations succee…

Cited by 0SourceScholar
2026

Correlations in the Data Lead to Semantically Rich Feature Geometry Under Superposition

ICLR 2026poster

Recent advances in mechanistic interpretability have shown that many features represented by deep learning models can be captured by dictionary learning approaches such as sparse autoencoders. However, our understanding of the structures formed by these internal representations is still limited. Ini…

Cited by 0SourcecodeScholar
2026

Multi-Way Representation Alignment

ICML 2026poster

The Platonic Representation Hypothesis suggests that independently trained neural networks converge to increasingly similar latent spaces. However, current strategies for mapping these representations are inherently pairwise, scaling quadratically with the number of models and failing to yield a con…

Cited by 0SourceScholar
2026

On the Interaction of Compressibility and Adversarial Robustness

ICLR 2026poster

Modern neural networks are expected to simultaneously satisfy a host of desirable properties: accurate fitting to training data, generalization to unseen inputs, parameter and computational efficiency, and robustness to adversarial perturbations. While compressibility and robustness have each been s…

Cited by 0SourceScholar
2025

Grokking at the Edge of Numerical Stability

ICLR 2025poster

Grokking, or sudden generalization that occurs after prolonged overfitting, is a surprising phenomenon that has challenged our understanding of deep learning. While a lot of progress has been made in understanding grokking, it is still not clear why generalization is delayed and why grokking often d…

2025

Large Learning Rates Simultaneously Achieve Robustness to Spurious Correlations and Compressibility

ICCV 2025poster

Robustness and resource-efficiency are two highly desirable properties for modern machine learning models. However, achieving them jointly remains a challenge. In this paper, we identify high learning rates as a facilitator for simultaneously achieving robustness to spurious correlations and network…

2024

Implicit Compressibility of Overparametrized Neural Networks Trained with Heavy-Tailed SGD

ICML 2024poster

Neural network compression has been an increasingly important subject, not only due to its practical relevance, but also due to its theoretical implications, as there is an explicit connection between compressibility and generalization error. Recent studies have shown that the choice of the hyperpar…

2021

Heavy Tails in SGD and Compressibility of Overparametrized Neural Networks

NeurIPS 2021poster

Neural network compression techniques have become increasingly popular as they can drastically reduce the storage and computation requirements for very large networks. Recent empirical studies have illustrated that even simple pruning strategies can be surprisingly effective, and several theoretical…