The DOI matches its Crossref record; 66 of the 66 references it cites were found in a registry or an index.
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Open accessAbstract
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and collaborative filtering. Although specific instances can often be solved with specialized algorithms, the general affine rank minimization problem is NP-hard because it contains vector cardinality minimization as a special case. In this paper, we show that if a certain restricted isometry property holds for the linear transformation defining the constraints, the minimum-rank solution can be recovered by solving a convex optimization problem, namely, the minimization of the nuclear norm over the given affine space. We present several random ensembles of equations where the restricted isometry property holds with overwhelming probability, provided the codimension of the subspace is sufficiently large. The techniques used in our analysis have strong parallels in the compressed sensing framework. We discuss how affine rank minimization generalizes this preexisting concept and outline a dictionary relating concepts from cardinality minimization to those of rank minimization. We also discuss several algorithmic approaches to minimizing the nuclear norm and illustrate our results with numerical examples.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Donoho, D. L. (2004) · Cited by 16,703
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Cited by
Robust principal component analysis?
Candès, E. J., Li, X., Ma, Y., & Wright, J. (2011) · Journal of the ACM · doi:10.1145/1970392.1970395 · Cited by 6,921
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Self-citationHalko, N., Martinsson, P. G., & Tropp, J. A. (2011) · SIAM Review · doi:10.1137/090771806 · Cited by 4,002
Sparse Subspace Clustering: Algorithm, Theory, and Applications
Elhamifar, E., & Vidal, R. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.57 · Cited by 3,106
Kuybeda, O., Frank, G. A., Bartesaghi, A., Borgnia, M., Subramaniam, S., & Sapiro, G. (2013) · Journal of Structural Biology · doi:10.1016/j.jsb.2012.10.010 · Cited by 2,162
Tensor Completion for Estimating Missing Values in Visual Data
Liu, J., Musialski, P., Wonka, P., & Ye, J. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.39 · Cited by 2,063
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Candes, E. J., & Tao, T. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2044061 · Cited by 2,060
Candes, E. J., & Plan, Y. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2035722 · Cited by 1,709
Tensor Decomposition for Signal Processing and Machine Learning
Sidiropoulos, N. D., De Lathauwer, L., Fu, X., Huang, K., Papalexakis, E. E., & Faloutsos, C. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2690524 · Cited by 1,617
Wright, S. J. (2015) · Mathematical Programming · doi:10.1007/s10107-015-0892-3 · Cited by 1,438
Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
Yang, J., & Zhang, Y. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/090777761 · Cited by 1,201
Zero Duality Gap in Optimal Power Flow Problem
Lavaei, J., & Low, S. H. (2012) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2011.2160974 · Cited by 1,195
Compressed Sensing Off the Grid
Tang, G., Bhaskar, B. N., Shah, P., & Recht, B. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2277451 · Cited by 1,163
Self-citationXu, Y., & Yin, W. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/120887795 · Cited by 1,160
Exact matrix completion via convex optimization
Candès, E., & Recht, B. (2012) · Communications of the ACM · doi:10.1145/2184319.2184343 · Cited by 996
Self-citationOff-Grid Direction of Arrival Estimation Using Sparse Bayesian Inference
Yang, Z., Xie, L., & Zhang, C. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2222378 · Cited by 968
Hyperspectral Image Restoration Using Low-Rank Matrix Recovery
Zhang, H., He, W., Zhang, L., Shen, H., & Yuan, Q. (2014) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2013.2284280 · Cited by 887
The Convex Geometry of Linear Inverse Problems
Chandrasekaran, V., Recht, B., Parrilo, P. A., & Willsky, A. S. (2012) · Foundations of Computational Mathematics · doi:10.1007/s10208-012-9135-7 · Cited by 886
Self-citationHigh-Dimensional Statistics: A Non-Asymptotic Viewpoint
Wainwright, M. J. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108627771 · Cited by 882
Optimization for Machine Learning
(2011) · The MIT Press eBooks · doi:10.7551/mitpress/8996.001.0001 · Cited by 875
Fast and Accurate Matrix Completion via Truncated Nuclear Norm Regularization
Hu, Y., Zhang, D., Ye, J., Li, X., & He, X. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.271 · Cited by 829
Low-rank matrix completion using alternating minimization
Jain, P., Netrapalli, P., & Sanghavi, S. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488693 · Cited by 817
Wen, Z., Yin, W., & Zhang, Y. (2012) · Mathematical Programming Computation · doi:10.1007/s12532-012-0044-1 · Cited by 774
Tensor completion and low-n-rank tensor recovery via convex optimization
Gandy, S., Recht, B., & Yamada, I. (2011) · Inverse Problems · doi:10.1088/0266-5611/27/2/025010 · Cited by 738
Self-citationA unified approach to salient object detection via low rank matrix recovery
Shen, X., & Wu, Y. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247758 · Cited by 691
Rank-Sparsity Incoherence for Matrix Decomposition
Chandrasekaran, V., Sanghavi, S., Parrilo, P. A., & Willsky, A. S. (2011) · SIAM Journal on Optimization · doi:10.1137/090761793 · Cited by 686
Self-citationA Simpler Approach to Matrix Completion
Recht, B. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0910.0651 · Cited by 673
Self-citationAccelerated Dynamic MRI Exploiting Sparsity and Low-Rank Structure: k-t SLR
Lingala, S. G., Hu, Y., DiBella, E., & Jacob, M. (2011) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2010.2100850 · Cited by 664
Matrix completion from a few entries
Keshavan, R. H., Oh, S., & Montanari, A. (2009) · 2009 IEEE International Symposium on Information Theory · doi:10.1109/isit.2009.5205567 · Cited by 650
Moving Object Detection by Detecting Contiguous Outliers in the Low-Rank Representation
Zhou, X., Yang, C., & Yu, W. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.132 · Cited by 648
Recovering Low-Rank Matrices From Few Coefficients in Any Basis
Gross, D. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2104999 · Cited by 602
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
Koltchinskii, V., Lounici, K., & Tsybakov, A. B. (2011) · The Annals of Statistics · doi:10.1214/11-aos894 · Cited by 598
Atomic Norm Denoising With Applications to Line Spectral Estimation
Bhaskar, B. N., Tang, G., & Recht, B. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2273443 · Cited by 579
Self-citationCandès, E. J., & Plan, Y. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2111771 · Cited by 569
Phase Retrieval via Matrix Completion
Candès, E. J., Eldar, Y. C., Strohmer, T., & Voroninski, V. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/110848074 · Cited by 565
Estimation of (near) low-rank matrices with noise and high-dimensional scaling
Negahban, S., & Wainwright, M. J. (2011) · The Annals of Statistics · doi:10.1214/10-aos850 · Cited by 537
An accelerated gradient method for trace norm minimization
Ji, S., & Ye, J. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553434 · Cited by 517
Low-Rank Matrix Completion by Riemannian Optimization
Vandereycken, B. (2013) · SIAM Journal on Optimization · doi:10.1137/110845768 · Cited by 491
Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
Liu, Z., & Vandenberghe, L. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/090755436 · Cited by 490
Hankel Matrix Rank Minimization with Applications to System Identification and Realization
Fazel, M., Pong, T. K., Sun, D., & Tseng, P. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/110853996 · Cited by 487
Self-citationRobust video denoising using low rank matrix completion
Ji, H., Liu, C., Shen, Z., & Xu, Y. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539849 · Cited by 483
Low rank subspace clustering (LRSC)
Vidal, R., & Favaro, P. (2014) · Pattern Recognition Letters · doi:10.1016/j.patrec.2013.08.006 · Cited by 482
Phase Retrieval via Matrix Completion
Candès, E. J., Eldar, Y. C., Strohmer, T., & Voroninski, V. (2015) · SIAM Review · doi:10.1137/151005099 · Cited by 481
Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
Bengua, J. A., Phien, H. N., Tuan, H. D., & Do, M. N. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2672439 · Cited by 461
Compressive sensing: From theory to applications, a survey
Qaisar, S., Bilal, R. M., Iqbal, W., Naureen, M., & Lee, S. (2013) · Journal of Communications and Networks · doi:10.1109/jcn.2013.000083 · Cited by 457
52nd IEEE Conference on Decision and Control
(2013) · doi:10.1109/cdc20427.2013 · Cited by 452
Robust PCA via Outlier Pursuit
Xu, H., Caramanis, C., & Sanghavi, S. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2173156 · Cited by 445
An Overview of Low-Rank Matrix Recovery From Incomplete Observations
Davenport, M. A., & Romberg, J. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2539100 · Cited by 439
Living on the edge: phase transitions in convex programs with random data
Amelunxen, D., Lotz, M., McCoy, M. B., & Tropp, J. A. (2014) · Information and Inference · doi:10.1093/imaiai/iau005 · Cited by 413
Modern regularization methods for inverse problems
Benning, M., & Burger, M. (2018) · Acta Numerica · doi:10.1017/s0962492918000016 · Cited by 412
Cui, S., Wang, S., Zhuo, J., Li, L., Huang, Q., & Tian, Q. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00400 · Cited by 411
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
Negahban, S. N., & Wainwright, M. J. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1009.2118 · Cited by 402
Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
Semerci, O., Hao, N., Kilmer, M. E., & Miller, E. L. (2014) · IEEE Transactions on Image Processing · doi:10.1109/tip.2014.2305840 · Cited by 389
Blind Deconvolution Using Convex Programming
Ahmed, A., Recht, B., & Romberg, J. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2294644 · Cited by 387
Self-citationImproved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
Lai, M.-J., Xu, Y., & Yin, W. (2013) · SIAM Journal on Numerical Analysis · doi:10.1137/110840364 · Cited by 385
Latent variable graphical model selection via convex optimization
Chandrasekaran, V., Parrilo, P. A., & Willsky, A. S. (2012) · The Annals of Statistics · doi:10.1214/11-aos949 · Cited by 377
Self-citationSingle-Frame Infrared Small-Target Detection: A survey
Zhao, M., Li, W., Li, L., Hu, J., Ma, P., & Tao, R. (2022) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2022.3145502 · Cited by 368
Non-convex Optimization for Machine Learning
Jain, P., & Kar, P. (2017) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000058 · Cited by 364
Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
Chi, Y., Lu, Y. M., & Chen, Y. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2937282 · Cited by 360
Yang, J., Luo, L., Qian, J., Tai, Y., Zhang, F., & Xu, Y. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2535218 · Cited by 360
Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
Flammia, S. T., Gross, D., Liu, Y.-K., & Eisert, J. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/9/095022 · Cited by 358
A review of speaker diarization: Recent advances with deep learning
Park, T. J., Kanda, N., Dimitriadis, D., Han, K. J., Watanabe, S., & Narayanan, S. (2022) · Computer Speech & Language · doi:10.1016/j.csl.2021.101317 · Cited by 354
On Gridless Sparse Methods for Line Spectral Estimation From Complete and Incomplete Data
Yang, Z., & Xie, L. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2420541 · Cited by 352
Rank Awareness in Joint Sparse Recovery
Davies, M. E., & Eldar, Y. C. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2173722 · Cited by 351
Tulyakov, S., Alameda-Pineda, X., Ricci, E., Yin, L., Cohn, J. F., & Sebe, N. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.263 · Cited by 340
An alternating direction algorithm for matrix completion with nonnegative factors
Xu, Y., Yin, W., Wen, Z., & Zhang, Y. (2012) · Frontiers of Mathematics in China · doi:10.1007/s11464-012-0194-5 · Cited by 339
Estimation of high-dimensional low-rank matrices
Rohde, A., & Tsybakov, A. B. (2011) · The Annals of Statistics · doi:10.1214/10-aos860 · Cited by 330
Sparse Bayesian Methods for Low-Rank Matrix Estimation
Babacan, S. D., Luessi, M., Molina, R., & Katsaggelos, A. K. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2197748 · Cited by 327
Haldar, J. P. (2014) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2013.2293974 · Cited by 326
Vidal, R., Ma, Y., & Sastry, S. S. (2016) · Interdisciplinary Applied Mathematics · doi:10.1007/978-0-387-87811-9_2 · Cited by 324
Experimental robustness of Fourier ptychography phase retrieval algorithms
Yeh, L.-H., Dong, J., Zhong, J., Tian, L., Chen, M., Tang, G., Soltanolkotabi, M., & Waller, L. (2015) · Optics Express · doi:10.1364/oe.23.033214 · Cited by 320
Secure Control Systems: A Quantitative Risk Management Approach
(2015) · IEEE Control Systems · doi:10.1109/mcs.2014.2364709 · Cited by 316
“For general information about 1 , relaxation; see, for example, [55]–[57].”
BackgroundIntegrating low-rank and group-sparse structures for robust multi-task learning
Chen, J., Zhou, J., & Ye, J. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020423 · Cited by 311
Blum, A., Hopcroft, J., & Kannan, R. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108755528 · Cited by 304
Parallel stochastic gradient algorithms for large-scale matrix completion
Recht, B., & Ré, C. (2013) · Mathematical Programming Computation · doi:10.1007/s12532-013-0053-8 · Cited by 300
Self-citationRobust Photometric Stereo via Low-Rank Matrix Completion and Recovery
Wu, L., Ganesh, A., Shi, B., Matsushita, Y., Wang, Y., & Ma, Y. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19318-7_55 · Cited by 298
Yang, Z., Xie, L., & Stoica, P. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2553041 · Cited by 292
A Unified Framework for High-Dimensional Analysis of $M$-Estimators with Decomposable Regularizers
Negahban, S. N., Ravikumar, P., Wainwright, M. J., & Yu, B. (2012) · Statistical Science · doi:10.1214/12-sts400 · Cited by 287
Hussein, S., Kandel, P., Bolan, C. W., Wallace, M. B., & Bagci, U. (2019) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2019.2894349 · Cited by 285
A Globally Convergent Algorithm for Nonconvex Optimization Based on Block Coordinate Update
Xu, Y., & Yin, W. (2017) · Journal of Scientific Computing · doi:10.1007/s10915-017-0376-0 · Cited by 285
Sparse PCA: Optimal rates and adaptive estimation
Cai, T. T., Ma, Z., & Wu, Y. (2013) · The Annals of Statistics · doi:10.1214/13-aos1178 · Cited by 283
Bayesian Robust Principal Component Analysis
Ding, X., He, L., & Carin, L. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2156801 · Cited by 282
Bilinear Generalized Approximate Message Passing—Part I: Derivation
Parker, J. T., Schniter, P., & Cevher, V. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2357776 · Cited by 281
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
Agarwal, A., Negahban, S., & Wainwright, M. J. (2012) · The Annals of Statistics · doi:10.1214/12-aos1000 · Cited by 280
Smooth PARAFAC Decomposition for Tensor Completion
Yokota, T., Zhao, Q., & Cichocki, A. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2586759 · Cited by 279
TILT: Transform Invariant Low-Rank Textures
Zhang, Z., Ganesh, A., Liang, X., & Ma, Y. (2012) · International Journal of Computer Vision · doi:10.1007/s11263-012-0515-x · Cited by 277
Hong, D., He, W., Yokoya, N., Yao, J., Gao, L., Zhang, L., Chanussot, J., & Zhu, X. (2021) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2021.3064051 · Cited by 275
A Survey of Relaxations and Approximations of the Power Flow Equations
Molzahn, D. K., & Hiskens, I. A. (2019) · Foundations and Trends® in Electric Energy Systems · doi:10.1561/3100000012 · Cited by 272
A Simple Prior-Free Method for Non-rigid Structure-from-Motion Factorization
Dai, Y., Li, H., & He, M. (2014) · International Journal of Computer Vision · doi:10.1007/s11263-013-0684-2 · Cited by 270
Spatio-Temporal Compressive Sensing and Internet Traffic Matrices (Extended Version)
Roughan, M., Zhang, Y., Willinger, W., & Qiu, L. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2011.2169424 · Cited by 267
ADMiRA: Atomic Decomposition for Minimum Rank Approximation
Lee, K., & Bresler, Y. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054251 · Cited by 267
Multi-energy CT based on a prior rank, intensity and sparsity model (PRISM)
Gao, H., Yu, H., Osher, S., & Wang, G. (2011) · Inverse Problems · doi:10.1088/0266-5611/27/11/115012 · Cited by 264
Geometric median and robust estimation in Banach spaces
Minsker, S. (2015) · Bernoulli · doi:10.3150/14-bej645 · Cited by 261
Robust Visual Tracking Via Consistent Low-Rank Sparse Learning
Zhang, T., Liu, S., Ahuja, N., Yang, M.-H., & Ghanem, B. (2015) · International Journal of Computer Vision · doi:10.1007/s11263-014-0738-0 · Cited by 256
Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
Oymak, S., Jalali, A., Fazel, M., Eldar, Y. C., & Hassibi, B. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2401574 · Cited by 252
Self-citationDC formulations and algorithms for sparse optimization problems
Gotoh, J.-Y., Takeda, A., & Tono, K. (2018) · Mathematical Programming · doi:10.1007/s10107-017-1181-0 · Cited by 184
An Exact and Robust Conformal Inference Method for Counterfactual and Synthetic Controls
Chernozhukov, V., Wüthrich, K., & Zhu, Y. (2021) · Journal of the American Statistical Association · doi:10.1080/01621459.2021.1920957 · Cited by 176
Implicit Regularization in Matrix Factorization
Gunasekar, S., Woodworth, B., Bhojanapalli, S., Neyshabur, B., & Srebro, N. (2018) · 2018 Information Theory and Applications Workshop (ITA) · doi:10.1109/ita.2018.8503198 · Cited by 170
Risk Factors Associated with Canine Heartworm Infection
Selby, L. A., Corwin, R. M., & Hayes, H. M. (1980) · Journal of the American Veterinary Medical Association · doi:10.2460/javma.1980.176.01.33 · Cited by 49
Efficient dynamic skinning with low-rank helper bone controllers
Mukai, T., & Kuriyama, S. (2016) · ACM Transactions on Graphics · doi:10.1145/2897824.2925905 · Cited by 31
Metadata
- Authors
- Recht, B., Fazel, M., & Parrilo, P. A.
- Venue
- SIAM Review
- Published
- 2010-01
- Volume
- 52
- Issue
- 3
- Pages
- 471-501
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2118550318
- Cited by
- 3,471
- References
- 66
- FWCI
- 184.44
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.