Murad Tukan

Mr. Murad Tukan

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 August 2021 in Sensors
Verified
Journal Article
Open access
PDF file
MTMurad Tukan
Murad Tukan
AMAlaa Maalouf
Alaa Maalouf
MWMatan Weksler
Matan Weksler
DFDan Feldman
Dan Feldman
A common technique for compressing a neural network is to compute the k-rank ℓ2 approximation Ak of the matrix A∈Rn×d via SVD that corresponds to a fully connected layer (or embedding layer). Here, d is the number of input neurons in the layer, n is the number in the next one, and Ak is stored in O((n+d)k) memory instead of O(nd). Then, a fine-tuning step is used to improve this initial compression. However, end users may not have the required computation resources, time, or budget to run this fine-tuning stage. Furthermore, the original training set may not be available. In this paper, we provide an algorithm for compressing neural networks using a similar initial compression time (to common techniques) but without the fine-tuning step. The main idea is replacing the k-rank ℓ2 approximation with ℓp, for p∈[1,2], which is known to be less sensitive to outliers but much harder to compute. Our main technical result is a practical and provable approximation algorithm to compute it for any p≥1, based on modern techniques in computational geometry. Extensive experimental results on the GLUE benchmark for compressing the networks BERT, DistilBERT, XLNet, and RoBERTa confirm this theoretical advantage.

1 October 2021 in Theoretical Computer Science
Verified
Journal Article
Closed access
MTMurad Tukan
Murad Tukan
CBCenk Baykal
Cenk Baykal
DFDan Feldman
Dan Feldman
DRDaniela Rus
Daniela Rus

4 June 2024 in IEEE Journal of Oceanic Engineering
Verified
Journal Article
Closed access
MTMurad Tukan
Murad Tukan
EBEli Biton
Eli Biton
Roee DiamantRoee Diamant
Roee Diamant
Water current prediction is essential for understanding ecosystems, and to shed light on the role of the ocean in the global climate context. Solutions vary from physical modeling, and long-term observations, to short-term measurements. In this article, we consider a common approach for water current prediction that uses Lagrangian floaters for water current prediction by interpolating the trajectory of the elements to reflect the velocity field. Here, an important aspect that has not been addressed before is where to initially deploy the drifting elements such that the acquired velocity field would efficiently represent the water current. To that end, we use a clustering approach that relies on a physical model of the velocity field. Our method segments the modeled map and determines the deployment locations as those that will lead the floaters to “visit” the center of the different segments. This way, we validate that the area covered by the floaters will capture the inhomogeneity of the velocity field. Exploration over a dataset of velocity field maps that span over a year demonstrates the applicability of our approach, and shows a considerable improvement over the common approach of uniformly randomly choosing the initial deployment sites. We share our Python implementation code for reproducibility in (Jubran et al., 2022).

8 October 2021 in Sensors
Verified
Journal Article
Open access
PDF file
AMAlaa Maalouf
Alaa Maalouf
IJIbrahim Jubran
Ibrahim Jubran
MTMurad Tukan
Murad Tukan
DFDan Feldman
Dan Feldman
Coreset is usually a small weighted subset of an input set of items, that provably approximates their loss function for a given set of queries (models, classifiers, hypothesis). That is, the maximum (worst-case) error over all queries is bounded. To obtain smaller coresets, we suggest a natural relaxation: coresets whose average error over the given set of queries is bounded. We provide both deterministic and randomized (generic) algorithms for computing such a coreset for any finite set of queries. Unlike most corresponding coresets for the worst-case error, the size of the coreset in this work is independent of both the input size and its Vapnik–Chervonenkis (VC) dimension. The main technique is to reduce the average-case coreset into the vector summarization problem, where the goal is to compute a weighted subset of the n input vectors which approximates their sum. We then suggest the first algorithm for computing this weighted subset in time that is linear in the input size, for n≫1/ε, where ε is the approximation error, improving, e.g., both [ICML’17] and applications for principal component analysis (PCA) [NIPS’16]. Experimental results show significant and consistent improvement also in practice. Open source code is provided.

9 October 2020
Verified
Book Chapter
Closed access
PDF file
MTMurad Tukan
Murad Tukan
CBCenk Baykal
Cenk Baykal
DFDan Feldman
Dan Feldman
DRDaniela Rus
Daniela Rus

19 June 2020 in arXiv
Verified
Preprint
Open access
PDF file
MTMurad Tukan
Murad Tukan
AMAlaa Maalouf
Alaa Maalouf
DFDan Feldman
Dan Feldman
Coreset is usually a small weighted subset of $n$ input points in $\mathbb{R}^d$, that provably approximates their loss function for a given set of queries (models, classifiers, etc.). Coresets become increasingly common in machine learning since existing heuristics or inefficient algorithms may be improved by running them possibly many times on the small coreset that can be maintained for streaming distributed data. Coresets can be obtained by sensitivity (importance) sampling, where its size is proportional to the total sum of sensitivities. Unfortunately, computing the sensitivity of each point is problem dependent and may be harder to compute than the original optimization problem at hand. We suggest a generic framework for computing sensitivities (and thus coresets) for wide family of loss functions which we call near-convex functions. This is by suggesting the $f$-SVD factorization that generalizes the SVD factorization of matrices to functions. Example applications include coresets that are either new or significantly improves previous results, such as SVM, Logistic regression, M-estimators, and $\ell_z$-regression. Experimental results and open source are also provided.