default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOsman Asif Malik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Nuojin Cheng, Osman Asif Malik
, Yiming Xu, Stephen Becker, Alireza Doostan, Akil Narayan:
Subsampling of Parametric Models with Bifidelity Boosting. SIAM/ASA J. Uncertain. Quantification 12(2): 213-241 (2024)- [c7]Vivek Bharadwaj, Osman Asif Malik, Riley Murray, Aydin Buluç, James Demmel:
Distributed-Memory Randomized Algorithms for Sparse Tensor CP Decomposition. SPAA 2024: 155-168 - [i17]Vivek Bharadwaj, Beheshteh T. Rakhshan, Osman Asif Malik, Guillaume Rabusseau:
Efficient Leverage Score Sampling for Tensor Train Decomposition. CoRR abs/2406.02749 (2024) - [i16]Pu Ren, Rie Nakata, Maxime Lacour, Ilan Naiman, Nori Nakata, Jialin Song, Zhengfa Bi, Osman Asif Malik, Dmitriy Morozov, Omri Azencot, N. Benjamin Erichson, Michael W. Mahoney:
Learning Physics for Unveiling Hidden Earthquake Ground Motions via Conditional Generative Modeling. CoRR abs/2407.15089 (2024) - 2023
- [j3]Richard Border, Osman Asif Malik:
rBahadur: efficient simulation of structured high-dimensional genotype data with applications to assortative mating. BMC Bioinform. 24(1): 314 (2023) - [c6]Vivek Bharadwaj, Osman Asif Malik, Riley Murray, Laura Grigori, Aydin Buluç, James Demmel:
Fast Exact Leverage Score Sampling from Khatri-Rao Products with Applications to Tensor Decomposition. NeurIPS 2023 - [i15]Vivek Bharadwaj, Osman Asif Malik, Riley Murray, Laura Grigori, Aydin Buluç, James Demmel:
Fast Exact Leverage Score Sampling from Khatri-Rao Products with Applications to Tensor Decomposition. CoRR abs/2301.12584 (2023) - [i14]Yotam Yaniv, Osman Asif Malik, Pieter Ghysels, Xiaoye S. Li:
Construction of Hierarchically Semi-Separable matrix Representation using Adaptive Johnson-Lindenstrauss Sketching. CoRR abs/2302.01977 (2023) - [i13]Riley Murray, James Demmel, Michael W. Mahoney, N. Benjamin Erichson, Maksim Melnichenko, Osman Asif Malik, Laura Grigori, Piotr Luszczek, Michal Derezinski, Miles E. Lopes, Tianyu Liang, Hengrui Luo, Jack J. Dongarra:
Randomized Numerical Linear Algebra : A Perspective on the Field With an Eye to Software. CoRR abs/2302.11474 (2023) - [i12]Nuojin Cheng, Osman Asif Malik, Stephen Becker, Alireza Doostan:
Bi-fidelity Variational Auto-encoder for Uncertainty Quantification. CoRR abs/2305.16530 (2023) - 2022
- [c5]Osman Asif Malik:
More Efficient Sampling for Tensor Decomposition With Worst-Case Guarantees. ICML 2022: 14887-14917 - [i11]Osman Asif Malik, Yiming Xu, Nuojin Cheng, Stephen Becker, Alireza Doostan, Akil Narayan:
Fast Algorithms for Monotone Lower Subsets of Kronecker Least Squares Problems. CoRR abs/2209.05662 (2022) - [i10]Nuojin Cheng, Osman Asif Malik, Yiming Xu, Stephen Becker, Alireza Doostan, Akil Narayan:
Quadrature Sampling of Parametric Models with Bi-fidelity Boosting. CoRR abs/2209.05705 (2022) - [i9]Osman Asif Malik, Vivek Bharadwaj, Riley Murray:
Sampling-Based Decomposition Algorithms for Arbitrary Tensor Networks. CoRR abs/2210.03828 (2022) - [i8]Vivek Bharadwaj, Osman Asif Malik, Riley Murray, Aydin Buluç, James Demmel:
Distributed-Memory Randomized Algorithms for Sparse Tensor CP Decomposition. CoRR abs/2210.05105 (2022) - 2021
- [j2]Osman Asif Malik, Stephen Becker:
Randomization of approximate bilinear computation for matrix multiplication. Int. J. Comput. Math. Comput. Syst. Theory 6(1): 54-93 (2021) - [c4]Osman Asif Malik, Stephen Becker:
A Sampling-Based Method for Tensor Ring Decomposition. ICML 2021: 7400-7411 - [c3]Osman Asif Malik, Shashanka Ubaru, Lior Horesh, Misha E. Kilmer, Haim Avron:
Dynamic Graph Convolutional Networks Using the Tensor M-Product. SDM 2021: 729-737 - [c2]Osman Asif Malik, Venkatalakshmi Vyjayanthi Narumanchi, Stephen Becker, Todd W. Murray:
Superresolution Photoacoustic Tomography Using Random Speckle Illumination and Second Order Moments. WASPAA 2021: 141-145 - [i7]Osman Asif Malik:
More Efficient Sampling for Tensor Decomposition. CoRR abs/2110.07631 (2021) - 2020
- [j1]Osman Asif Malik, Stephen Becker:
Fast randomized matrix and tensor interpolative decomposition using CountSketch. Adv. Comput. Math. 46(6): 76 (2020) - [i6]Osman Asif Malik, Stephen Becker:
A Sampling Based Method for Tensor Ring Decomposition. CoRR abs/2010.08581 (2020) - [i5]Osman Asif Malik, Hayato Ushijima-Mwesigwa, Arnab Roy, Avradip Mandal, Indradeep Ghosh:
Binary Matrix Factorization on Special Purpose Hardware. CoRR abs/2010.08693 (2020)
2010 – 2019
- 2019
- [i4]Osman Asif Malik, Stephen Becker:
Fast Randomized Matrix and Tensor Interpolative Decomposition Using CountSketch. CoRR abs/1901.10559 (2019) - [i3]Osman Asif Malik, Stephen Becker:
Randomization of Approximate Bilinear Computation for Matrix Multiplication. CoRR abs/1905.07439 (2019) - [i2]Osman Asif Malik, Shashanka Ubaru, Lior Horesh, Misha E. Kilmer, Haim Avron:
Tensor Graph Convolutional Networks for Prediction on Dynamic Graphs. CoRR abs/1910.07643 (2019) - [i1]Osman Asif Malik, Stephen Becker:
Guarantees for the Kronecker Fast Johnson-Lindenstrauss Transform Using a Coherence and Sampling Argument. CoRR abs/1911.08424 (2019) - 2018
- [c1]Osman Asif Malik, Stephen Becker:
Low-Rank Tucker Decomposition of Large Tensors Using TensorSketch. NeurIPS 2018: 10117-10127
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
