activity
20182026
most citedCross Tensor Approximation for Image and Video Completion

2 citations · 3 across the 19 of their papers we have counts for

collaborators

23 papers

math.NA2026

Efficient Low-Rank Approximation of Quaternion Matrices via Adaptive Cross Approximation

Salman Ahmadi-Asl, Yang Zhang

The adaptive cross approximation (ACA) algorithm is a powerful tool for constructing low-rank matrix approximations using only a small subset of matrix entries. While extensively s…

cs.LG2026

Tensor Methods for Language Models: From Token Representation to Training, Adaptation, Inference, Compression, and Interpretability

Matvei Tarasov, Salman Ahmadi-Asl, Andre L. F. de Almeida +1

Large language models (LLMs) are built from structured high-dimensional objects such as token representations, weights, adaptation updates, caches, and activations, whose multiline…

math.NA2026

Adaptive Randomized Pivoting for Tensor Cross Approximation in the T-Product Framework

Ahmadsho Akdodshoev, Valentin Leplat, Salman Ahmadi-Asl

This paper studies extensions of adaptive randomized pivoting (ARP), recently introduced for matrix column subset selection, to tensors in the t-product framework. We propose two c…

math.NA2026

A New Tensor Network: Tubal Tensor Train and Its Applications

Salman Ahmadi-Asl, Valentin Leplat, Anh-Huy Phan +1

We introduce the tubal tensor train (TTT) decomposition, a tensor-network model that combines the t-product algebra of the tensor singular value decomposition (T-SVD) with the low-…

cs.LG2025

SAGE: Streaming Agreement-Driven Gradient Sketches for Representative Subset Selection

Ashish Jha, Salman Ahmadi-Asl

Training modern neural networks on large datasets is computationally and energy intensive. We present SAGE, a streaming data-subset selection method that maintains a compact Freque…

math.NA2025

Iterative Methods for Computing the Moore-Penrose Pseudoinverse of Quaternion Matrices, with Applications

Valentin Leplat, Salman Ahmadi-Asl, JunJun Pan +1

We develop quaternion--native iterative methods for computing the Moore--Penrose (MP) pseudoinverse of quaternion matrices and analyze their convergence. Our starting point is a da…

math.NA2025

Pass-efficient Randomized Algorithms for Low-rank Approximation of Quaternion Matrices

Salman Ahmadi-Asl, Malihe Nobakht Kooshkghazi, Valentin Leplat

Randomized algorithms for low-rank approximation of quaternion matrices have gained increasing attention in recent years. However, existing methods overlook pass efficiency, the ab…

math.NA2025

Efficient iterative techniques for solving tensor problems with the T-product

Malihe Nobakht Kooshkghazi, Salman Ahmadi-Asl, Hamidreza Afshin

This paper develops two efficient iterative methods for solving tensor equations under the T-product framework. For T-symmetric positive definite tensor equations of the form $\mat…

math.NA2025

Randomized block Krylov method for approximation of truncated tensor SVD

Malihe Nobakht Kooshkghazi, Salman Ahmadi-Asl, Andre L. F. de Almeida

This paper is devoted to studying the application of the block Krylov subspace method for approximation of the truncated tensor SVD (T-SVD). The theoretical results of the proposed…

math.NA2025

Nonnegative Tensor Decomposition Via Collaborative Neurodynamic Optimization

Salman Ahmadi-Asl, Valentin Leplat, Anh-Huy Phan +1

This paper introduces a novel collaborative neurodynamic model for computing nonnegative Canonical Polyadic Decomposition (CPD). The model relies on a system of recurrent neural ne…

math.NA2024

Efficient Techniques for Low-Rank Tensor Approximation and Applications in Robust Object Detection

Salman Ahmadi-Asl, Naeim Rezaeian, Cesar F. Caiafa +1

This paper introduces efficient randomized fixed-precision and single-pass algorithms for low-tubal-rank approximation of third-order tensors. The proposed fixed-precision algorith…

math.NA2024

Fast randomized Kronecker tensor decomposition: algorithms and error analysis

Salman Ahmadi-Asl, Naeim Rezaeian, Andre L. F. de Almeida +1

This paper proposes fast randomized algorithms for computing the Kronecker Tensor Decomposition (KTD) by replacing the sequence of deterministic SVDs in the TTr1SVD framework with…

cs.CV2023★ 1 cited

Lightweight Attribute Localizing Models for Pedestrian Attribute Recognition

Ashish Jha, Dimitrii Ermilov, Konstantin Sobolev +8

Pedestrian Attribute Recognition (PAR) focuses on identifying various attributes in pedestrian images, with key applications in person retrieval, suspect re-identification, and sof…

cs.CV2023

Image Reconstruction using Superpixel Clustering and Tensor Completion

Maame G. Asante-Mensah, Anh Huy Phan, Salman Ahmadi-Asl +2

This paper presents a pixel selection method for compact image representation based on superpixel segmentation and tensor completion. Our method divides the image into several regi…

math.NA2023

Adaptive Cross Tubal Tensor Approximation

Salman Ahmadi-Asl, Anh Huy Phan, Andrzej Cichocki +4

In this paper, we propose a new adaptive cross algorithm for computing a low tubal rank approximation of third-order tensors, with less memory and lower computational complexity th…

math.NA2023

Robust Low-Tubal-rank tensor recovery Using Discrete Empirical Interpolation Method with Optimized Slice/Feature Selection

Salman Ahmadi-Asl, Anh-Huy Phan, Cesar F. Caiafa +1

In this paper, we extend the Discrete Empirical Interpolation Method (DEIM) to the third-order tensor case based on the t-product and use it to select important/ significant latera…

math.NA2023

Fast randomized algorithms for computing the generalized tensor SVD based on the tubal product

Salman Ahmadi-Asl, Ugochukwu Ugwu

This work deals with developing two fast randomized algorithms for computing the generalized tensor singular value decomposition (GTSVD) based on the tubal product (t-product). The…

math.NA2023

A note on generalized tensor CUR approximation for tensor pairs and tensor triplets based on the tubal product

Salman Ahmadi-Asl, Naeim Rezaeian, Keivan Ramazani

In this note, we briefly present a generalized tensor CUR (GTCUR) approximation for tensor pairs (X,Y) and tensor triplets (X,Y,Z) based on the tubal product (t-product). We use th…

math.NA2022

A Randomized Algorithm for Tensor Singular Value Decomposition using an Arbitrary Number of Passes

Salman Ahmadi-Asl, Anh-Huy Phan, Andrzej Cichocki

Efficient and fast computation of a tensor singular value decomposition (t-SVD) with a few passes over the underlying data tensor is crucial because of its many potential applicati…

math.NA2022

An Efficient Randomized Fixed-Precision Algorithm for Tensor Singular Value Decomposition

Salman Ahmadi-Asl

The existing randomized algorithms need an initial estimation of the tubal rank to compute a tensor singular value decomposition. This paper proposes a new randomized fixedprecisio…

math.NA2022★ 2 cited

Cross Tensor Approximation for Image and Video Completion

Salman Ahmadi-Asl, Maame Gyamfua Asante-Mensah, Andrzej Cichocki +3

This paper proposes a general framework to use the cross tensor approximation or tensor ColUmn-Row (CUR) approximation for reconstructing incomplete images and videos. The key impo…

math.NA2020

Randomized Algorithms for Computation of Tucker decomposition and Higher Order SVD (HOSVD)

Salman Ahmadi-Asl, Stanislav Abukhovich, Maame G. Asante-Mensah +4

Big data analysis has become a crucial part of new emerging technologies such as the internet of things, cyber-physical analysis, deep learning, anomaly detection, etc. Among many…

math.NA2018

Tensor Networks for Latent Variable Analysis: Higher Order Canonical Polyadic Decomposition

Anh-Huy Phan, Andrzej Cichocki, Ivan Oseledets +3

The Canonical Polyadic decomposition (CPD) is a convenient and intuitive tool for tensor factorization; however, for higher-order tensors, it often exhibits high computational cost…