Check out our new paper on adversarial attacks for semantic segmentation! https://t.co/TDkpmk2bYN
Using a proximal splitting, we generate small perturbations (e.g. ‖δ‖_∞ < 1/255) for deep segmentation models, with high pixel success rates.
@YouTubeInsider@DeanoSauruz@earthklaans You are trying to be precise but you are mistaken in what GenAI means. Tranformers are not GenAI per se, they are a type of neural network building block that can be used in so called GenAI, but does not have to be.
@raymondh Second one: it implies that h(x) is the default case, and g(x) is a specific one conditioned on test. I think it is also dependent on what test is: are we expecting test(x) to be mostly true ?
If you are at #CVPR2023 drop by to see our posters for tomorrow.
AM: 289 - A strong baseline for generalized few-shot semantic segmentation.
PM: Class adaptive network calibration.
with @IsmailBenAyed1@bing_bingyuan@jerome_rony@adrian_galdran Sina Hajimiri and Malik Boudiaf
@DrewLinsley I can see a major issue here: \ell_2 PGD (and even C&W) is known to be weak to evaluate a model's robustness. There are much more reliable options (and less expensive than C&W) now: APGD, DDN, FMN, ALMA to name a few.
@Vicnent@MathisHammel@JacquesDelamar2 Sur les tests de Mathis, c'est environ 15% plus lent avec la condition (testé sur ma machine car CoderPad n'est pas très régulier sur les run-times)
@Vicnent@MathisHammel@JacquesDelamar2 Ça va beaucoup dépendre de la longueur de la meilleure solution: si elle est significativement plus courte que la liste initiale, ça n'affecte pas la complexité
@CSProfKGD No worries, just sharing my experience 🙂 Even though I sometimes end up disappointed for my own papers, I'm extremely grateful of the work ACs do!
@AMurderOfDucks@gabrielpeyre You can use it to minimize a sum of nonsmooth functions (e.g. infinity norm) by iteratively minimizing each using their respective proximity operator https://t.co/P2uIxkkZeO