default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark Tygert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]François Charton, Kristin E. Lauter, Cathy Yuanchen Li, Mark Tygert:
An Efficient Algorithm for Integer Lattice Reduction. SIAM J. Matrix Anal. Appl. 45(1): 353-367 (2024)- [i25]Kamalika Chaudhuri, Chuan Guo, Laurens van der Maaten, Saeed Mahloujifar, Mark Tygert:
Guarantees of confidentiality via Hammersley-Chapman-Robbins bounds. CoRR abs/2404.02866 (2024) - 2023
- [j16]Mark Tygert:
Calibration of P-values for calibration and for deviation of a subpopulation from the full population. Adv. Comput. Math. 49(5): 70 (2023) - [i24]François Charton, Kristin E. Lauter, Cathy Yuanchen Li, Mark Tygert:
An efficient algorithm for integer lattice reduction. CoRR abs/2303.02226 (2023) - [i23]Isabel M. Kloumann, Hannah Korevaar, Chris McConnell, Mark Tygert, Jessica Zhao:
Cumulative differences between paired samples. CoRR abs/2305.11323 (2023) - 2022
- [j15]Aaron Defazio, Mark Tygert, Rachel A. Ward, Jure Zbontar:
Compressed sensing with a jackknife and a bootstrap. J. Data Sci. Stat. Vis. 2(4) (2022) - [j14]Imanol Arrieta Ibarra, Paman Gujral, Jonathan Tannen, Mark Tygert, Cherie Xu:
Metrics of Calibration for Probabilistic Predictions. J. Mach. Learn. Res. 23: 351:1-351:54 (2022) - [i22]Mark Tygert:
Calibration of P-values for calibration and for deviation of a subpopulation from the full population. CoRR abs/2202.00100 (2022) - [i21]Imanol Arrieta Ibarra, Paman Gujral, Jonathan Tannen, Mark Tygert, Cherie Xu:
Metrics of calibration for probabilistic predictions. CoRR abs/2205.09680 (2022) - 2021
- [j13]Mark Tygert
:
Cumulative deviation of a subpopulation from the full population. J. Big Data 8(1): 117 (2021) - [j12]Mark Tygert:
A graphical method of cumulative differences between two subpopulations. J. Big Data 8(1): 158 (2021) - [i20]Mark Tygert:
Cumulative differences between subpopulations. CoRR abs/2108.02666 (2021) - [i19]Mark Tygert:
Controlling for multiple covariates. CoRR abs/2112.00672 (2021) - 2020
- [i18]Chuan Guo, Awni Y. Hannun, Brian Knott, Laurens van der Maaten, Mark Tygert, Ruiyu Zhu:
Secure multiparty computations in floating-point arithmetic. CoRR abs/2001.03192 (2020) - [i17]Mark Tygert:
Plots of the cumulative differences between observed and expected values of ordered Bernoulli variates. CoRR abs/2006.02504 (2020) - [i16]Isabel M. Kloumann, Mark Tygert:
An optimizable scalar objective value cannot be objective and should not be the sole objective. CoRR abs/2006.02577 (2020) - [i15]Mark Tygert:
Plotting the cumulative deviation of a subgroup from the full population as a function of score. CoRR abs/2008.01779 (2020)
2010 – 2019
- 2018
- [j11]Huamin Li, Yuval Kluger, Mark Tygert:
Randomized algorithms for distributed computation of principal component analysis and singular value decomposition. Adv. Comput. Math. 44(5): 1651-1672 (2018) - [i14]Mark Tygert, Jure Zbontar:
Simulating single-coil MRI from the responses of multiple coils. CoRR abs/1811.08026 (2018) - 2017
- [j10]Arthur Szlam, Andrew Tulloch, Mark Tygert:
Accurate Low-Rank Approximations Via a Few Iterations of Alternating Least Squares. SIAM J. Matrix Anal. Appl. 38(2): 425-433 (2017) - [j9]Huamin Li, George C. Linderman, Arthur Szlam, Kelly P. Stanton, Yuval Kluger, Mark Tygert:
Algorithm 971: An Implementation of a Randomized Algorithm for Principal Component Analysis. ACM Trans. Math. Softw. 43(3): 28:1-28:14 (2017) - [i13]Cinna Wu, Mark Tygert, Yann LeCun:
Hierarchical loss for classification. CoRR abs/1709.01062 (2017) - [i12]Mark Tygert:
Regression-aware decompositions. CoRR abs/1710.04238 (2017) - 2016
- [j8]Mark Tygert, Joan Bruna, Soumith Chintala, Yann LeCun, Serkan Piantino, Arthur Szlam:
A Mathematical Motivation for Complex-Valued Convolutional Networks. Neural Comput. 28(5): 815-825 (2016) - [i11]Mark Tygert:
Poor starting points in machine learning. CoRR abs/1602.02823 (2016) - [i10]Arthur Szlam, Andrew Tulloch, Mark Tygert:
Accurate principal component analysis via a few iterations of alternating least squares. CoRR abs/1603.01765 (2016) - [i9]Huamin Li, Yuval Kluger, Mark Tygert:
Randomized algorithms for distributed computation of principal component analysis and singular value decomposition. CoRR abs/1612.08709 (2016) - 2015
- [i8]Joan Bruna, Soumith Chintala, Yann LeCun, Serkan Piantino, Arthur Szlam, Mark Tygert:
A theoretical argument for complex-valued convolutional networks. CoRR abs/1503.03438 (2015) - [i7]Soumith Chintala, Marc'Aurelio Ranzato, Arthur Szlam, Yuandong Tian, Mark Tygert, Wojciech Zaremba:
Scale-invariant learning and convolutional networks. CoRR abs/1506.08230 (2015) - 2014
- [i6]Arthur Szlam, Yuval Kluger, Mark Tygert:
An implementation of a randomized algorithm for principal component analysis. CoRR abs/1412.3510 (2014) - 2011
- [j7]William Perkins, Mark Tygert, Rachel A. Ward:
Computing the confidence levels for a root-mean-square test of goodness-of-fit. Appl. Math. Comput. 217(22): 9072-9084 (2011) - [j6]E. S. Coakley, Vladimir Rokhlin, Mark Tygert:
A Fast Randomized Algorithm for Orthogonal Projection. SIAM J. Sci. Comput. 33(2): 849-868 (2011) - [j5]Nathan Halko, Per-Gunnar Martinsson, Yoel Shkolnisky, Mark Tygert:
An Algorithm for the Principal Component Analysis of Large Data Sets. SIAM J. Sci. Comput. 33(5): 2580-2594 (2011) - 2010
- [j4]Mark Tygert:
Fast algorithms for spherical harmonic expansions, III. J. Comput. Phys. 229(18): 6181-6192 (2010) - [i5]Nathan Halko, Per-Gunnar Martinsson, Yoel Shkolnisky, Mark Tygert:
An algorithm for the principal component analysis of large data sets. CoRR abs/1007.5510 (2010)
2000 – 2009
- 2009
- [j3]Vladimir Rokhlin, Arthur Szlam, Mark Tygert:
A Randomized Algorithm for Principal Component Analysis. SIAM J. Matrix Anal. Appl. 31(3): 1100-1124 (2009) - [i4]Mark Tygert:
A fast algorithm for computing minimal-norm solutions to underdetermined systems of linear equations. CoRR abs/0905.4745 (2009) - [i3]Mark Tygert:
Fast algorithms for spherical harmonic expansions, III. CoRR abs/0910.5435 (2009) - [i2]Vladimir Rokhlin, Mark Tygert:
A fast randomized algorithm for orthogonal projection. CoRR abs/0912.1135 (2009) - 2008
- [j2]Mark Tygert:
Fast algorithms for spherical harmonic expansions, II. J. Comput. Phys. 227(8): 4260-4279 (2008) - 2006
- [j1]Vladimir Rokhlin, Mark Tygert:
Fast Algorithms for Spherical Harmonic Expansions. SIAM J. Sci. Comput. 27(6): 1903-1928 (2006) - [i1]Mark Tygert:
Recurrence relations and fast algorithms. CoRR abs/cs/0609081 (2006)
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-04 20:59 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:
