Francesco Tudisco

Keywords · Machine learning

computer vision

4 publications, 2017–2026

20172026

2026

Low Rank Affine Adversarial Attacks on Image Classifiers

Aizhan Issagali, Catherine F. Higham, Desmond J. Higham, Francesco Tudisco

Springer INdAM Series, 2026

Neural networks for image classification are vulnerable to adversarial attacks; an imperceptible perturbation to an image can cause a change in classification. Standard attack algorithms use explicit or approximate partial derivative information with respect to the input data. Here, we explore the idea of using a less …

2024

Low-Rank Adversarial PGD Attack

Dayana Savostianova, Emanuele Zangrando, Francesco Tudisco

Adversarial attacks on deep neural network models have seen rapid development and are extensively used to study the stability of these networks. Among various adversarial strategies, Projected Gradient Descent (PGD) is a widely adopted method in computer vision due to its effectiveness and quick implementation, making …

Geometry-aware training of factorized layers in tensor Tucker format

Emanuele Zangrando, Steffen Schotthöfer, Jonas Kusch, Gianluca Ceruti, Francesco Tudisco

Advances in Neural Information Processing Systems (NeurIPS), 2024

Reducing parameter redundancies in neural network architectures is crucial for achieving feasible computational and memory requirements during training and inference phases. Given its easy implementation and flexibility, one promising approach is layer factorization, which reshapes weight tensors into a matrix format …

2017

An Efficient Multilinear Optimization Framework for Hypergraph Matching

Quynh Nguyen, Francesco Tudisco, Antoine Gautier, Matthias Hein

IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 39, pp. 1054–1075, 2017

Hypergraph matching has recently become a popular approach for solving correspondence problems in computer vision as it allows to integrate higher-order geometric information. Hypergraph matching can be formulated as a third-order optimization problem subject to the assignment constraints which turns out to be NP-hard. …