The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Rank, Trace-Norm and Max-Norm
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Maximum-Margin Matrix Factorization
Srebro, N., Rennie, J. D. M., & Jaakkola, T. (2004) · Cited by 962
Self-citationEmpirical Margin Distributions and Bounding the Generalization Error of Combined Classifiers
Koltchinskii, V., & Panchenko, D. (2002) · The Annals of Statistics · doi:10.1214/aos/1015362183 · Cited by 451
An algorithmic theory of learning: Robust concepts and random projection
Arriaga, R. I., & Vempala, S. (2006) · Machine Learning · doi:10.1007/s10994-006-6265-7 · Cited by 316
Learning with matrix factorizations
Srebro, N., & Jaakkola, T. (2004) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 224
Self-citationAdaptive routing with end-to-end feedback: distributed learning and geometric approaches
Awerbuch, B., & Kleinberg, R. D. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007367 · Cited by 190
Generalization Error Bounds for Collaborative Prediction with Low-Rank Matrices
Srebro, N., Alon, N., & Jaakkola, T. (2004) · Cited by 124
Self-citationGeometrical realization of set systems and probabilistic communication complexity
Alon, N., Frankl, P., & Rödl, V. (1985) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1985.30 · Cited by 105
Limitations of Learning via Embeddings in Euclidean Half-Spaces
Ben-David, S., Eiron, N., & Simon, H. U. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44581-1_25 · Cited by 89
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces
Forster, J., Schmitt, N., Simon, H. U., & Suttorp, T. (2003) · Machine Learning · doi:10.1023/a:1022905618164 · Cited by 40
Cited by
(2014) · Cited by 33,419
Privacy-preserving deep learning
Shokri, R., & Shmatikov, V. (2015) · Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2810103.2813687 · Cited by 2,356
Fast maximum margin matrix factorization for collaborative prediction
Rennie, J. D. M., & Srebro, N. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102441 · Cited by 939
Self-citationKaratzoglou, A., Amatriain, X., Baltrunas, L., & Oliver, N. (2010) · Proceedings of the fourth ACM conference on Recommender systems · doi:10.1145/1864708.1864727 · Cited by 721
Joint covariate selection and joint subspace selection for multiple classification problems
Obozinski, G., Taskar, B., & Jordan, M. I. (2010) · Statistics and Computing · doi:10.1007/s11222-008-9111-x · Cited by 451
Metadata
- Authors
- Srebro, N., & Shraibman, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 545-560
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1492459858
- Cited by
- 316
- References
- 9
- FWCI
- 8.79
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Rank, Trace-Norm and Max-Norm. https://app.cochat.ai/papers/10.1007/11503415_37
- The paper
- Srebro, N., & Shraibman, A. (2005). Rank, Trace-Norm and Max-Norm. Lecture Notes in Computer Science. https://doi.org/10.1007/11503415_37
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.