Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ori Shem-Ur

dblp:366/5332 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Trustworthy machine learning · 70% Deep learning architectures and training · 30%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › adversarial machine learning › adversarial defense
adversarial example detection
0.912025
Input Space Mode Connectivity in Deep Neural Networks · ICLR 2025
Machine learning › Trustworthy machine learning
interpretability
0.912025
Input Space Mode Connectivity in Deep Neural Networks · ICLR 2025
Machine learning › Deep learning architectures and training › loss landscape
loss landscape connectivity
0.912025
Input Space Mode Connectivity in Deep Neural Networks · ICLR 2025
Machine learning › Trustworthy machine learning
robustness
0.912025
Input Space Mode Connectivity in Deep Neural Networks · ICLR 2025

Methods — techniques the papers use, named apart from their topics

percolation theory · 0.9input optimization · 0.9feature visualization · 0.9
YearPublicationVenuePosition
2025 Input Space Mode Connectivity in Deep Neural Networks
abstract
We extend the concept of loss landscape mode connectivity to the input space of deep neural networks. Mode connectivity was originally studied within parameter space, where it describes the existence of low-loss paths between different solutions (loss minimizers) obtained through gradient descent. We present theoretical and empirical evidence of its presence in the input space of deep networks, thereby highlighting the broader nature of the phenomenon. We observe that different input images with similar predictions are generally connected, and for trained models, the path tends to be simple, with only a small deviation from being a linear path. Our methodology utilizes real, interpolated, and synthetic inputs created using the input optimization technique for feature visualization. We conjecture that input space mode connectivity in high-dimensional spaces is a geometric effect that takes place even in untrained models and can be explained through percolation theory. We exploit mode connectivity to obtain new insights about adversarial examples and demonstrate its potential for adversarial detection. Additionally, we discuss applications for the interpretability of deep networks.
Jakub Vrábel, Ori Shem-Ur, Yaron Oz, David Krueger 0001
ICLR2