{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/grassmannian-learning-embedding-geometry","title":"Grassmannian Learning: Embedding Geometry Awareness in Shallow and Deep Learning","arxiv_id":"1808.02229","date":"2018-08-07","proceeding":null,"authors":["Jiayao Zhang","Guangxu Zhu","Robert W. Heath Jr.","Kaibin Huang"],"abstract":"Modern machine learning algorithms have been adopted in a range of\nsignal-processing applications spanning computer vision, natural language\nprocessing, and artificial intelligence. Many relevant problems involve\nsubspace-structured features, orthogonality constrained or low-rank constrained\nobjective functions, or subspace distances. These mathematical characteristics\nare expressed naturally using the Grassmann manifold. Unfortunately, this fact\nis not yet explored in many traditional learning algorithms. In the last few\nyears, there have been growing interests in studying Grassmann manifold to\ntackle new learning problems. Such attempts have been reassured by substantial\nperformance improvements in both classic learning and learning using deep\nneural networks. We term the former as shallow and the latter deep Grassmannian\nlearning. The aim of this paper is to introduce the emerging area of\nGrassmannian learning by surveying common mathematical problems and primary\nsolution approaches, and overviewing various applications. We hope to inspire\npractitioners in different fields to adopt the powerful tool of Grassmannian\nlearning in their research.","url_abs":"http://arxiv.org/abs/1808.02229v2","url_pdf":"http://arxiv.org/pdf/1808.02229v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"grassmannian-learning-embedding-geometry","repo_url":"https://github.com/matthew-mcateer/Keras_pruning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"deep-learning","task_name":"Deep Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1808.02229","atlas_url":"https://app.syntology.ai/?focus=1808.02229","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1808.02229"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1808.02229\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1808.02229"},"call":"get_concepts_for_paper(arxiv_id=\"1808.02229\")"}],"by_repo":[{"repo":"matthew-mcateer/Keras_pruning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"80440f3ede1f5c44145becac7de3e35a6aea760a9af09d08cb453256d92a11b1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}