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.

Amirhossein Afsharrad

dblp:360/4678 · 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% Representation and self-supervised learning · 30%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness › adversarial robustness › adversarial training
adversarial fine-tuning
0.912025
LORE: Lagrangian-Optimized Robust Embeddings for Visual Encoders · NeurIPS 2025
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.912025
LORE: Lagrangian-Optimized Robust Embeddings for Visual Encoders · NeurIPS 2025
Machine learning › Representation and self-supervised learning › representation learning
visual representation learning
0.912025
LORE: Lagrangian-Optimized Robust Embeddings for Visual Encoders · NeurIPS 2025
Machine learning › Trustworthy machine learning
interpretability
0.312025
LORE: Lagrangian-Optimized Robust Embeddings for Visual Encoders · NeurIPS 2025

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

lagrangian optimization · 0.9constrained optimization · 0.9
YearPublicationVenuePosition
2025 LORE: Lagrangian-Optimized Robust Embeddings for Visual Encoders
abstract
Visual encoders have become fundamental components in modern computer vision pipelines. However, ensuring robustness against adversarial perturbations remains a critical challenge. Recent efforts have explored both supervised and unsupervised adversarial fine-tuning strategies. We identify two key limitations in these approaches: (i) they often suffer from instability, especially during the early stages of fine-tuning, resulting in suboptimal convergence and degraded performance on clean data, and (ii) they exhibit a suboptimal trade-off between robustness and clean data accuracy, hindering the simultaneous optimization of both objectives. To overcome these challenges, we propose **L**agrangian-**O**ptimized **R**obust **E**mbeddings (LORE), a novel unsupervised adversarial fine-tuning framework. LORE utilizes constrained optimization, which offers a principled approach to balancing competing goals, such as improving robustness while preserving nominal performance. By enforcing embedding-space proximity constraints, LORE effectively maintains clean data performance throughout adversarial fine-tuning. Extensive experiments show that LORE stabilizes training and significantly improves zero-shot adversarial robustness with minimal degradation in clean data accuracy. Furthermore, we demonstrate the effectiveness of the adversarially fine-tuned image encoder in out-of-distribution generalization and enhancing the interpretability of image embeddings. The code is available on [GitHub](https://github.com/Theborna/LORE-Lagrangian-Optimized-Robust-Embeddings).
Borna Khodabandeh, Amirabbas Afzali, Amirhossein Afsharrad, Seyed Shahabeddin Mousavi, Sanjay Lall, Sajjad Amini, Seyed-Mohsen Moosavi-Dezfooli
NeurIPS3