1 code implementation • 21 Apr 2022 • Nazmul Karim, Umar Khalid, Ashkan Esmaeili, Nazanin Rahnavard
After purification, we perform fine-tuning in a semi-supervised fashion that ensures the participation of all available samples.
1 code implementation • 6 Apr 2022 • Umar Khalid, Ashkan Esmaeili, Nazmul Karim, Nazanin Rahnavard
The method proposed in this work referred to as RODD outperforms SOTA detection performance on an extensive suite of benchmark datasets on OOD detection tasks.
Ranked #1 on Out-of-Distribution Detection on cifar100 (using extra training data)
no code implementations • 20 Jun 2021 • Ashkan Esmaeili
Deep compressed sensing assumes the data has sparse representation in a latent space, i. e., it is intrinsically of low-dimension.
no code implementations • 13 Jun 2021 • Ashkan Esmaeili, Mohsen Joneidi, Mehrdad Salimitari, Umar Khalid, Nazanin Rahnavard
The problem of simultaneous column and row subset selection is addressed in this paper.
no code implementations • 19 Mar 2021 • Ashkan Esmaeili, Marzieh Edraki, Nazanin Rahnavard, Mubarak Shah, Ajmal Mian
It is set forth that the proposed sparse perturbation is the most aligned sparse perturbation with the shortest path from the input sample to the decision boundary for some initial adversarial sample (the best sparse approximation of shortest path, likely to fool the model).
no code implementations • 1 Jan 2021 • Saeed Vahidian, Mohsen Joneidi, Ashkan Esmaeili, Siavash Khodadadeh, Sharare Zehtabian, Ladislau Boloni, Nazanin Rahnavard, Bill Lin, Mubarak Shah
The approach is based on the concept of {\em self-rank}, defined as the minimum number of samples needed to reconstruct all samples with an accuracy proportional to the rank-$K$ approximation.
no code implementations • 16 Nov 2018 • Ashkan Esmaeili, Farokh Marvasti
Sparse Inverse Covariance Estimation (SICE) is useful in many practical data analyses.
no code implementations • 29 Oct 2018 • Ashkan Esmaeili, Farokh Marvasti
Next, we form an unconstrained optimization problem by regularizing the rank function with Huber loss.
no code implementations • 7 Oct 2018 • Ashkan Esmaeili, Kayhan Behdin, Sina Al-E-Mohammad, Farokh Marvasti
In this paper, we propose a novel approach in order to recover a quantized matrix with missing information.
no code implementations • 19 May 2018 • Ashkan Esmaeili, Kayhan Behdin, Mohammad Amin Fakharian, Farokh Marvasti
In this paper, we propose two new algorithms for transduction with Matrix Completion (MC) problem.
1 code implementation • 7 Apr 2017 • Ali Mottaghi, Kayhan Behdin, Ashkan Esmaeili, Mohammadreza Heydari, Farokh Marvasti
In this paper, we design a system in order to perform the real-time beat tracking for an audio signal.
no code implementations • 3 Jan 2017 • Mohammad Amin Fakharian, Ashkan Esmaeili, Farokh Marvasti
The algorithm is then modified and optimized for missing scenarios.
no code implementations • 21 Nov 2016 • Ahmadreza Moradipari, Sina Shahsavari, Ashkan Esmaeili, Farokh Marvasti
When sparse models are also suffering from MI, the sparse recovery and inference of the missing models are taken into account simultaneously.
no code implementations • 26 Jun 2016 • Ashkan Esmaeili, Arash Amini, Farokh Marvasti
In this paper, we investigate the recovery of a sparse weight vector (parameters vector) from a set of noisy linear combinations.
no code implementations • 12 Jun 2016 • Ashkan Esmaeili, Farokh Marvasti
This paper will focus on comparing the power of IMAT in reconstruction of the desired sparse signal with LASSO.