Aarabi, Hadrien Foroughmand, and Geoffroy Peeters. 2018. “Music Retiler: Using NMF2D Source Separation for Audio Mosaicing.”
In Proceedings of the Audio Mostly 2018 on Sound in Immersion and Emotion
, 27:1–7. AM’18. New York, NY, USA: ACM.
Achlioptas, Dimitris. 2003. “Database-Friendly Random Projections: Johnson-Lindenstrauss with Binary Coins.” Journal of Computer and System Sciences
, Special Issue on PODS 2001, 66 (4): 671–87.
Aghasi, Alireza, Nam Nguyen, and Justin Romberg. 2016. “Net-Trim: A Layer-Wise Convex Pruning of Deep Neural Networks.” arXiv:1611.05162 [Cs, Stat]
Ang, Andersen Man Shun, and Nicolas Gillis. 2018. “Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation.” Neural Computation
31 (2): 417–39.
Arora, Sanjeev, Rong Ge, Yoni Halpern, David Mimno, Ankur Moitra, David Sontag, Yichen Wu, and Michael Zhu. 2012. “A Practical Algorithm for Topic Modeling with Provable Guarantees.” arXiv:1212.4777 [Cs, Stat]
Attias, Hagai. 1999. “Inferring Parameters and Structure of Latent Variable Models by Variational Bayes.”
In Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence
, 21–30. UAI’99. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.
Babacan, S. Derin, Martin Luessi, Rafael Molina, and Aggelos K. Katsaggelos. 2012. “Sparse Bayesian Methods for Low-Rank Matrix Estimation.” IEEE Transactions on Signal Processing
60 (8): 3964–77.
Bach, Francis. 2013. “Convex Relaxations of Structured Matrix Factorizations.” arXiv:1309.3117 [Cs, Math]
Bach, Francis R, and Michael I Jordan. 2002. “Kernel Independent Component Analysis.” Journal of Machine Learning Research 3 (July): 48.
Bach, Francis, Rodolphe Jenatton, and Julien Mairal. 2011. Optimization With Sparsity-Inducing Penalties
. Foundations and Trends(r) in Machine Learning 1.0. Now Publishers Inc.
Barbier, Jean, Nicolas Macris, and Léo Miolane. 2017. “The Layered Structure of Tensor Estimation and Its Mutual Information.” arXiv:1709.10368 [Cond-Mat, Physics:math-Ph]
Batson, Joshua, Daniel A. Spielman, and Nikhil Srivastava. 2008. “Twice-Ramanujan Sparsifiers.” arXiv:0808.0163 [Cs]
Bauckhage, Christian. 2015. “K-Means Clustering Is Matrix Factorization.” arXiv:1512.07548 [Stat]
Berry, Michael W., Murray Browne, Amy N. Langville, V. Paul Pauca, and Robert J. Plemmons. 2007. “Algorithms and Applications for Approximate Nonnegative Matrix Factorization.” Computational Statistics & Data Analysis
52 (1): 155–73.
Bertin, N., R. Badeau, and E. Vincent. 2010. “Enforcing Harmonicity and Smoothness in Bayesian Non-Negative Matrix Factorization Applied to Polyphonic Music Transcription.” IEEE Transactions on Audio, Speech, and Language Processing
18 (3): 538–49.
Bruckstein, A. M., Michael Elad, and M. Zibulevsky. 2008a. “Sparse Non-Negative Solution of a Linear System of Equations Is Unique.”
In 3rd International Symposium on Communications, Control and Signal Processing, 2008. ISCCSP 2008
Buch, Michael, Elio Quinton, and Bob L Sturm. 2017. “NichtnegativeMatrixFaktorisierungnutzendesKlangsynthesenSystem (NiMFKS): Extensions of NMF-Based Concatenative Sound Synthesis.” In Proceedings of the 20th International Conference on Digital Audio Effects, 7. Edinburgh.
Caetano, Marcelo, and Xavier Rodet. 2013. “Musical Instrument Sound Morphing Guided by Perceptually Motivated Features.” IEEE Transactions on Audio, Speech, and Language Processing
21 (8): 1666–75.
Cao, Bin, Dou Shen, Jian-Tao Sun, Xuanhui Wang, Qiang Yang, and Zheng Chen. n.d. “Detect and Track Latent Factors with Online Nonnegative Matrix Factorization.”
Carabias-Orti, J. J., T. Virtanen, P. Vera-Candeas, N. Ruiz-Reyes, and F. J. Canadas-Quesada. 2011. “Musical Instrument Sound Multi-Excitation Model for Non-Negative Spectrogram Factorization.” IEEE Journal of Selected Topics in Signal Processing
5 (6): 1144–58.
Chi, Yuejie, Yue M. Lu, and Yuxin Chen. 2019. “Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview.” IEEE Transactions on Signal Processing
67 (20): 5239–69.
Cichocki, A., R. Zdunek, and S. Amari. 2006. “New Algorithms for Non-Negative Matrix Factorization in Applications to Blind Source Separation.”
In 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings
Cohen, Albert, Ingrid Daubechies, and Jean-Christophe Feauveau. 1992. “Biorthogonal Bases of Compactly Supported Wavelets.” Communications on Pure and Applied Mathematics
45 (5): 485–560.
Combettes, Patrick L., and Jean-Christophe Pesquet. 2008. “A Proximal Decomposition Method for Solving Convex Variational.” Inverse Problems
24 (6): 065014.
Dasarathy, Gautam, Parikshit Shah, Badri Narayan Bhaskar, and Robert Nowak. 2013. “Sketching Sparse Matrices.” arXiv:1303.6544 [Cs, Math]
Dasgupta, Sanjoy, and Anupam Gupta. 2003. “An Elementary Proof of a Theorem of Johnson and Lindenstrauss.” Random Structures & Algorithms
22 (1): 60–65.
Defferrard, Michaël, Xavier Bresson, and Pierre Vandergheynst. 2016. “Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering.”
In Advances In Neural Information Processing Systems
Desai, A., M. Ghashami, and J. M. Phillips. 2016. “Improved Practical Matrix Sketching with Guarantees.” IEEE Transactions on Knowledge and Data Engineering
28 (7): 1678–90.
Ding, C., X. He, and H. Simon. 2005. “On the Equivalence of Nonnegative Matrix Factorization and Spectral Clustering.”
In Proceedings of the 2005 SIAM International Conference on Data Mining
, 606–10. Proceedings. Society for Industrial and Applied Mathematics.
Ding, C., Tao Li, and M.I. Jordan. 2010. “Convex and Semi-Nonnegative Matrix Factorizations.” IEEE Transactions on Pattern Analysis and Machine Intelligence
32 (1): 45–55.
Dokmanić, Ivan, and Rémi Gribonval. 2017. “Beyond Moore-Penrose Part II: The Sparse Pseudoinverse.” arXiv:1706.08701 [Cs, Math]
Driedger, Jonathan, and Thomas Pratzlich. 2015. “Let It Bee – Towards NMF-Inspired Audio Mosaicing.”
In Proceedings of ISMIR
, 7. Malaga.
Drineas, Petros, and Michael W. Mahoney. 2005. “On the Nyström Method for Approximating a Gram Matrix for Improved Kernel-Based Learning.” Journal of Machine Learning Research
6 (December): 2153–75.
Dueck, Delbert, Quaid D. Morris, and Brendan J. Frey. 2005. “Multi-Way Clustering of Microarray Data Using Probabilistic Sparse Matrix Factorization.” Bioinformatics
21 (suppl 1): i144–51.
Ellis, Robert L., and David C. Lay. 1992. “Factorization of Finite Rank Hankel and Toeplitz Matrices.” Linear Algebra and Its Applications
173 (August): 19–38.
Fairbanks, James P., Ramakrishnan Kannan, Haesun Park, and David A. Bader. 2015. “Behavioral Clusters in Dynamic Graphs.” Parallel Computing
, Graph analysis for scientific discovery, 47 (August): 38–50.
Flammia, Steven T., David Gross, Yi-Kai Liu, and Jens Eisert. 2012. “Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators.” New Journal of Physics
14 (9): 095022.
Fung, Wai Shing, Ramesh Hariharan, Nicholas J.A. Harvey, and Debmalya Panigrahi. 2011. “A General Framework for Graph Sparsification.”
In Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing
, 71–80. STOC ’11. New York, NY, USA: ACM.
Gemulla, Rainer, Erik Nijkamp, Peter J. Haas, and Yannis Sismanis. 2011. “Large-Scale Matrix Factorization with Distributed Stochastic Gradient Descent.”
In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
, 69–77. KDD ’11. New York, NY, USA: ACM.
Ghashami, Mina, Edo Liberty, Jeff M. Phillips, and David P. Woodruff. 2015. “Frequent Directions : Simple and Deterministic Matrix Sketching.” arXiv:1501.01711 [Cs]
Gordon, Geoffrey J. 2002. “Generalized² Linear² Models.”
In Proceedings of the 15th International Conference on Neural Information Processing Systems
, 593–600. NIPS’02. Cambridge, MA, USA: MIT Press.
Gross, D. 2011. “Recovering Low-Rank Matrices From Few Coefficients in Any Basis.” IEEE Transactions on Information Theory
57 (3): 1548–66.
Gross, David, Yi-Kai Liu, Steven T. Flammia, Stephen Becker, and Jens Eisert. 2010. “Quantum State Tomography via Compressed Sensing.” Physical Review Letters
Grosse, Roger, Ruslan R. Salakhutdinov, William T. Freeman, and Joshua B. Tenenbaum. 2012. “Exploiting Compositionality to Explore a Large Space of Model Structures.”
In Proceedings of the Conference on Uncertainty in Artificial Intelligence
Guan, Naiyang, Dacheng Tao, Zhigang Luo, and Bo Yuan. 2012. “NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization.” IEEE Transactions on Signal Processing
60 (6): 2882–98.
Guan, N., D. Tao, Z. Luo, and B. Yuan. 2012. “Online Nonnegative Matrix Factorization With Robust Stochastic Approximation.” IEEE Transactions on Neural Networks and Learning Systems
23 (7): 1087–99.
Hackbusch, Wolfgang. 2015. Hierarchical Matrices: Algorithms and Analysis. 1st ed. Springer Series in Computational Mathematics 49. Heidelberg New York Dordrecht London: Springer Publishing Company, Incorporated.
Hassanieh, Haitham, Piotr Indyk, Dina Katabi, and Eric Price. 2012. “Nearly Optimal Sparse Fourier Transform.”
In Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing
, 563–78. STOC ’12. New York, NY, USA: ACM.
Hassanieh, H., P. Indyk, D. Katabi, and E. Price. 2012. “Simple and Practical Algorithm for Sparse Fourier Transform.”
In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms
, 1183–94. Proceedings. Kyoto, Japan: Society for Industrial and Applied Mathematics.
Hastie, Trevor, Rahul Mazumder, Jason D Lee, and Reza Zadeh. n.d. “Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares,” 36.
Heinig, Georg, and Karla Rost. 2011. “Fast Algorithms for Toeplitz and Hankel Matrices.” Linear Algebra and Its Applications
435 (1): 1–59.
Hoffman, Matthew D, David M Blei, and Perry R Cook. 2010. “Bayesian Nonparametric Matrix Factorization for Recorded Music.”
In International Conference on Machine Learning
Hoffman, Matthew, Francis R. Bach, and David M. Blei. 2010. “Online Learning for Latent Dirichlet Allocation.”
In Advances in Neural Information Processing Systems
Hoyer, P.O. 2002. “Non-Negative Sparse Coding.”
In Proceedings of the 2002 12th IEEE Workshop on Neural Networks for Signal Processing, 2002
Hsieh, Cho-Jui, and Inderjit S. Dhillon. 2011. “Fast Coordinate Descent Methods with Variable Selection for Non-Negative Matrix Factorization.”
In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
, 1064–72. KDD ’11. New York, NY, USA: ACM.
Hu, Tao, Cengiz Pehlevan, and Dmitri B. Chklovskii. 2014. “A Hebbian/Anti-Hebbian Network for Online Sparse Dictionary Learning Derived from Symmetric Matrix Factorization.”
In 2014 48th Asilomar Conference on Signals, Systems and Computers
Huang, G., M. Kaess, and J. J. Leonard. 2013. “Consistent Sparsification for Graph Optimization.”
In 2013 European Conference on Mobile Robots (ECMR)
Iliev, Filip L., Valentin G. Stanev, Velimir V. Vesselinov, and Boian S. Alexandrov. 2018. “Nonnegative Matrix Factorization for Identification of Unknown Number of Sources Emitting Delayed Signals.” PLOS ONE
13 (3): e0193974.
Ji, S., D. Dunson, and L. Carin. 2009. “Multitask Compressive Sensing.” IEEE Transactions on Signal Processing
57 (1): 92–106.
Kannan, Ramakrishnan, Grey Ballard, and Haesun Park. 2016. “A High-Performance Parallel Algorithm for Nonnegative Matrix Factorization.”
In Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
, 9:1–11. PPoPP ’16. New York, NY, USA: ACM.
Keriven, Nicolas, Anthony Bourrier, Rémi Gribonval, and Patrick Pérez. 2016. “Sketching for Large-Scale Learning of Mixture Models.”
In 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
Keshava, Nirmal. 2003. “A Survey of Spectral Unmixing Algorithms.” Lincoln Laboratory Journal
14 (1): 55–78.
Khoromskij, B. N., A. Litvinenko, and H. G. Matthies. 2009. “Application of Hierarchical Matrices for Computing the Karhunen–Loève Expansion.” Computing
84 (1-2): 49–67.
Koren, Yehuda, Robert Bell, and Chris Volinsky. 2009. “Matrix Factorization Techniques for Recommender Systems.” Computer
42 (8): 30–37.
Koutis, Ioannis, Gary L. Miller, and Richard Peng. 2012. “A Fast Solver for a Class of Linear Systems.” Communications of the ACM
55 (10): 99–107.
Kruskal, J. B. 1964. “Nonmetric Multidimensional Scaling: A Numerical Method.” Psychometrika
29 (2): 115–29.
Kumar, N. Kishore, and Jan Shneider. 2016. “Literature Survey on Low Rank Approximation of Matrices.” arXiv:1606.06511 [Cs, Math]
Lahiri, Subhaneil, Peiran Gao, and Surya Ganguli. 2016. “Random Projections of Random Manifolds.” arXiv:1607.04331 [Cs, q-Bio, Stat]
Lawrence, Neil D., and Raquel Urtasun. 2009. “Non-Linear Matrix Factorization with Gaussian Processes.”
In Proceedings of the 26th Annual International Conference on Machine Learning
, 601–8. ICML ’09. New York, NY, USA: ACM.
Lee, Daniel D., and H. Sebastian Seung. 1999. “Learning the Parts of Objects by Non-Negative Matrix Factorization.” Nature
401 (6755): 788–91.
———. 2001. “Algorithms for Non-Negative Matrix Factorization.”
In Advances in Neural Information Processing Systems 13
, edited by T. K. Leen, T. G. Dietterich, and V. Tresp, 556–62. MIT Press.
Li, Chi-Kwong, and Edward Poon. 2002. “Additive Decomposition of Real Matrices.” Linear and Multilinear Algebra
50 (4): 321–26.
Li, S.Z., XinWen Hou, HongJiang Zhang, and Qiansheng Cheng. 2001. “Learning Spatially Localized, Parts-Based Representation.”
In Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2001. CVPR 2001
, 1:I-207-I-212 vol.1.
Liberty, Edo. 2013. “Simple and Deterministic Matrix Sketching.”
In Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
, 581–88. KDD ’13. New York, NY, USA: ACM.
Liberty, Edo, Franco Woolfe, Per-Gunnar Martinsson, Vladimir Rokhlin, and Mark Tygert. 2007. “Randomized Algorithms for the Low-Rank Approximation of Matrices.” Proceedings of the National Academy of Sciences
104 (51): 20167–72.
Lim, Yew Jin, and Yee Whye Teh. 2007. “Variational Bayesian Approach to Movie Rating Prediction.” In Proceedings of KDD Cup and Workshop, 7:15–21. Citeseer.
Liu, Tongliang, Dacheng Tao, and Dong Xu. 2016. “Dimensionality-Dependent Generalization Bounds for \(k\)-Dimensional Coding Schemes.” arXiv:1601.00238 [Cs, Stat]
Liu, T., and D. Tao. 2015. “On the Performance of Manhattan Nonnegative Matrix Factorization.” IEEE Transactions on Neural Networks and Learning Systems
PP (99): 1–1.
López-Serrano, Patricio, Christian Dittmar, Yigitcan Özer, and Meinard Müller. 2019. “NMF Toolbox: Music Processing Applications of Nonnegative Matrix Factorization.” In.
Mailhé, Boris, Rémi Gribonval, Pierre Vandergheynst, and Frédéric Bimbot. 2011. “Fast Orthogonal Sparse Approximation Algorithms over Local Dictionaries.” Signal Processing
, Advances in Multirate Filter Bank Structures and Multiscale Representations, 91 (12): 2822–35.
Mairal, Julien, Francis Bach, and Jean Ponce. 2014. Sparse Modeling for Image and Vision Processing
. Vol. 8.
Mairal, Julien, Francis Bach, Jean Ponce, and Guillermo Sapiro. 2009. “Online Dictionary Learning for Sparse Coding.”
In Proceedings of the 26th Annual International Conference on Machine Learning
, 689–96. ICML ’09. New York, NY, USA: ACM.
———. 2010. “Online Learning for Matrix Factorization and Sparse Coding.” The Journal of Machine Learning Research
Martinsson, Per-Gunnar, Vladimir Rockhlin, and Mark Tygert. 2006. “A Randomized Algorithm for the Approximation of Matrices.”
Mensch, Arthur, Julien Mairal, Bertrand Thirion, and Gael Varoquaux. 2017. “Stochastic Subsampling for Factorizing Huge Matrices.” arXiv:1701.05363 [Math, q-Bio, Stat]
Mnih, Andriy, and Russ R Salakhutdinov. 2008. “Probabilistic Matrix Factorization.” Advances in Neural Information Processing Systems, 8.
Nakajima, Shinichi, and Masashi Sugiyama. 2012. “Theoretical Analysis of Bayesian Matrix Factorization.” Journal of Machine Learning Research, 66.
Needell, Deanna, and Roman Vershynin. 2009. “Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit.” Foundations of Computational Mathematics
9 (3): 317–34.
Oymak, Samet, and Joel A. Tropp. 2015. “Universality Laws for Randomized Dimension Reduction, with Applications.” arXiv:1511.09433 [Cs, Math, Stat]
Pan, Gang, Wangsheng Zhang, Zhaohui Wu, and Shijian Li. 2014. “Online Community Detection for Large Complex Networks.” PLoS ONE
9 (7): e102799.
Raiko, Tapani, Alexander Ilin, and Juha Karhunen. 2007. “Principal Component Analysis for Large Scale Problems with Lots of Missing Values.”
In Machine Learning: ECML 2007
, edited by Joost N. Kok, Jacek Koronacki, Raomon Lopez de Mantaras, Stan Matwin, Dunja Mladenič, and Andrzej Skowron, 4701:691–98. Berlin, Heidelberg: Springer Berlin Heidelberg.
Rokhlin, Vladimir, Arthur Szlam, and Mark Tygert. 2009. “A Randomized Algorithm for Principal Component Analysis.” SIAM J. Matrix Anal. Appl.
31 (3): 1100–1124.
Rokhlin, Vladimir, and Mark Tygert. 2008. “A Fast Randomized Algorithm for Overdetermined Linear Least-Squares Regression.” Proceedings of the National Academy of Sciences
105 (36): 13212–17.
Ryabko, Daniil, and Boris Ryabko. 2010. “Nonparametric Statistical Inference for Ergodic Processes.” IEEE Transactions on Information Theory
56 (3): 1430–35.
Sachdeva, Noveen, Mehak Preet Dhaliwal, Carole-Jean Wu, and Julian McAuley. 2022. “Infinite Recommendation Networks: A Data-Centric Approach.”
Salakhutdinov, Ruslan, and Andriy Mnih. 2008. “Bayesian Probabilistic Matrix Factorization Using Markov Chain Monte Carlo.”
In Proceedings of the 25th International Conference on Machine Learning
, 880–87. ICML ’08. New York, NY, USA: ACM.
Schmidt, M.N., J. Larsen, and Fu-Tien Hsiao. 2007. “Wind Noise Reduction Using Non-Negative Sparse Coding.”
In 2007 IEEE Workshop on Machine Learning for Signal Processing
Seshadhri, C., Aneesh Sharma, Andrew Stolman, and Ashish Goel. 2020. “The Impossibility of Low-Rank Representations for Triangle-Rich Complex Networks.” Proceedings of the National Academy of Sciences
117 (11): 5631–37.
Shi, Jiarong, Xiuyun Zheng, and Wei Yang. 2017. “Survey on Probabilistic Models of Low-Rank Matrix Factorizations.” Entropy
19 (8): 424.
Singh, Ajit P., and Geoffrey J. Gordon. 2008. “A Unified View of Matrix Factorization Models.”
In Machine Learning and Knowledge Discovery in Databases
, 358–73. Springer.
Smaragdis, Paris. 2004. “Non-Negative Matrix Factor Deconvolution; Extraction of Multiple Sound Sources from Monophonic Inputs.”
In Independent Component Analysis and Blind Signal Separation
, edited by Carlos G. Puntonet and Alberto Prieto, 494–99. Lecture Notes in Computer Science. Granada, Spain: Springer Berlin Heidelberg.
Soh, Yong Sheng, and Venkat Chandrasekaran. 2017. “A Matrix Factorization Approach for Learning Semidefinite-Representable Regularizers.” arXiv:1701.01207 [Cs, Math, Stat]
Sorzano, C. O. S., J. Vargas, and A. Pascual Montano. 2014. “A Survey of Dimensionality Reduction Techniques.” arXiv:1403.2877 [Cs, q-Bio, Stat]
Spielman, Daniel A., and Shang-Hua Teng. 2004. “Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems.”
In Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing
, 81–90. STOC ’04. New York, NY, USA: ACM.
———. 2008a. “Spectral Sparsification of Graphs.” arXiv:0808.4134 [Cs]
Spielman, D., and N. Srivastava. 2011. “Graph Sparsification by Effective Resistances.” SIAM Journal on Computing
40 (6): 1913–26.
Sra, Suvrit, and Inderjit S. Dhillon. 2006. “Generalized Nonnegative Matrix Approximations with Bregman Divergences.”
In Advances in Neural Information Processing Systems 18
, edited by Y. Weiss, B. Schölkopf, and J. C. Platt, 283–90. MIT Press.
Srebro, Nathan, Jason D. M. Rennie, and Tommi S. Jaakkola. 2004. “Maximum-Margin Matrix Factorization.”
In Advances in Neural Information Processing Systems
, 17:1329–36. NIPS’04. Cambridge, MA, USA: MIT Press.
Stewart, G.W. 2000. “The Decompositional Approach to Matrix Computation.” Computing in Science Engineering
2 (1): 50–59.
Sun, Ying, and Michael L. Stein. 2016. “Statistically and Computationally Efficient Estimating Equations for Large Spatial Datasets.” Journal of Computational and Graphical Statistics
25 (1): 187–208.
Sundin, Martin. 2016. “Bayesian Methods for Sparse and Low-Rank Matrix Problems.” PhD Thesis, KTH Royal Institute of Technology.
Tropp, Joel A., Alp Yurtsever, Madeleine Udell, and Volkan Cevher. 2016. “Randomized Single-View Algorithms for Low-Rank Matrix Approximation.” arXiv:1609.00048 [Cs, Math, Stat]
———. 2017. “Practical Sketching Algorithms for Low-Rank Matrix Approximation.” SIAM Journal on Matrix Analysis and Applications
38 (4): 1454–85.
Turner, Richard E., and Maneesh Sahani. 2014. “Time-Frequency Analysis as Probabilistic Inference.” IEEE Transactions on Signal Processing
62 (23): 6171–83.
Udell, M., and A. Townsend. 2019. “Why Are Big Data Matrices Approximately Low Rank?” SIAM Journal on Mathematics of Data Science
1 (1): 144–60.
Vincent, E., N. Bertin, and R. Badeau. 2008. “Harmonic and Inharmonic Nonnegative Matrix Factorization for Polyphonic Pitch Transcription.”
In 2008 IEEE International Conference on Acoustics, Speech and Signal Processing
Vishnoi, Nisheeth K. 2013. “Lx = b.” Foundations and Trends® in Theoretical Computer Science
8 (1-2): 1–141.
Vo, Ba Ngu, Ba Tuong Vo, and Hung Gia Hoang. 2017. “An Efficient Implementation of the Generalized Labeled Multi-Bernoulli Filter.” arXiv:1606.08350 [Stat]
Wager, S., L. Chen, M. Kim, and C. Raphael. 2017. “Towards Expressive Instrument Synthesis Through Smooth Frame-by-Frame Reconstruction: From String to Woodwind.”
In 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
Wang, Boyue, Yongli Hu, Junbin Gao, Yanfeng Sun, Haoran Chen, and Baocai Yin. 2017. “Locality Preserving Projections for Grassmann Manifold.”
In PRoceedings of IJCAI, 2017
Wang, Shusen, Alex Gittens, and Michael W. Mahoney. 2017. “Sketched Ridge Regression: Optimization Perspective, Statistical Perspective, and Model Averaging.” arXiv:1702.04837 [Cs, Stat]
Wang, Y. X., and Y. J. Zhang. 2013. “Nonnegative Matrix Factorization: A Comprehensive Review.” IEEE Transactions on Knowledge and Data Engineering
25 (6): 1336–53.
Wang, Yuan, and Yunde Jia. 2004. “Fisher Non-Negative Matrix Factorization for Learning Local Features.” In In Proc. Asian Conf. On Comp. Vision, 27–30.
Wilkinson, William J., Michael Riis Andersen, Joshua D. Reiss, Dan Stowell, and Arno Solin. 2019. “End-to-End Probabilistic Inference for Nonstationary Audio Analysis.” arXiv:1901.11436 [Cs, Eess, Stat]
Woodruff, David P. 2014. Sketching as a Tool for Numerical Linear Algebra
. Foundations and Trends in Theoretical Computer Science 1.0. Now Publishers.
Woolfe, Franco, Edo Liberty, Vladimir Rokhlin, and Mark Tygert. 2008. “A Fast Randomized Algorithm for the Approximation of Matrices.” Applied and Computational Harmonic Analysis
25 (3): 335–66.
Xinghao Ding, Lihan He, and L. Carin. 2011. “Bayesian Robust Principal Component Analysis.” IEEE Transactions on Image Processing
20 (12): 3419–30.
Yang, Jiyan, Xiangrui Meng, and Michael W. Mahoney. 2015. “Implementing Randomized Matrix Algorithms in Parallel and Distributed Environments.” arXiv:1502.03032 [Cs, Math, Stat]
Yang, Linxiao, Jun Fang, Huiping Duan, Hongbin Li, and Bing Zeng. 2018. “Fast Low-Rank Bayesian Matrix Completion with Hierarchical Gaussian Prior Models.” IEEE Transactions on Signal Processing
66 (11): 2804–17.
Yang, Wenzhuo, and Huan Xu. 2015. “Streaming Sparse Principal Component Analysis.”
In Journal of Machine Learning Research
Ye, Ke, and Lek-Heng Lim. 2016. “Every Matrix Is a Product of Toeplitz Matrices.” Foundations of Computational Mathematics
16 (3): 577–98.
Yin, M., J. Gao, and Z. Lin. 2016. “Laplacian Regularized Low-Rank Representation and Its Applications.” IEEE Transactions on Pattern Analysis and Machine Intelligence
38 (3): 504–17.
Yoshii, Kazuyoshi. 2013. “Beyond NMF: Time-Domain Audio Source Separation Without Phase Reconstruction,” 6.
Yu, Chenhan D., William B. March, and George Biros. 2017. “An \(N \log N\) Parallel Fast Direct Solver for Kernel Matrices.”
In arXiv:1701.02324 [Cs]
Yu, Hsiang-Fu, Cho-Jui Hsieh, Si Si, and Inderjit S. Dhillon. 2012. “Scalable Coordinate Descent Approaches to Parallel Matrix Factorization for Recommender Systems.”
In IEEE International Conference of Data Mining
———. 2014. “Parallel Matrix Factorization for Recommender Systems.” Knowledge and Information Systems
41 (3): 793–819.
Zass, Ron, and Amnon Shashua. 2005. “A Unifying Approach to Hard and Probabilistic Clustering.”
In Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV’05) Volume 1 - Volume 01
, 294–301. ICCV ’05. Washington, DC, USA: IEEE Computer Society.
Zhang, Kai, Chuanren Liu, Jie Zhang, Hui Xiong, Eric Xing, and Jieping Ye. 2017. “Randomization or Condensation?: Linear-Cost Matrix Sketching Via Cascaded Compression Sampling.”
In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
, 615–23. KDD ’17. New York, NY, USA: ACM.
Zhang, Zhongyuan, Chris Ding, Tao Li, and Xiangsun Zhang. 2007. “Binary Matrix Factorization with Applications.”
In Seventh IEEE International Conference on Data Mining, 2007. ICDM 2007
, 391–400. IEEE.
Zhao, He, Lan Du, Wray Buntine, and Mingyuan Zhou. 2018. “Inter and Intra Topic Structure Learning with Word Embeddings.”
In Proceedings of the 35th International Conference on Machine Learning
, 5892–5901. PMLR.
Zhou, Mingyuan, Haojun Chen, John Paisley, Lu Ren, Guillermo Sapiro, and Lawrence Carin. 2009. “Non-Parametric Bayesian Dictionary Learning for Sparse Image Representations.”
In Proceedings of the 22nd International Conference on Neural Information Processing Systems
, 22:2295–2303. NIPS’09. Red Hook, NY, USA: Curran Associates Inc.
Zhou, Mingyuan, Lauren Hannah, David Dunson, and Lawrence Carin. 2012. “Beta-Negative Binomial Process and Poisson Factor Analysis.”
In Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics
, 1462–71. PMLR.
———. 2012. “Multi-Label Subspace Ensemble.” Journal of Machine Learning Research
Zitnik, Marinka, and Blaz Zupan. 2018. “NIMFA: A Python Library for Nonnegative Matrix Factorization.” arXiv:1808.01743 [Cs, q-Bio, Stat]