{"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/hybrid-orthogonal-projection-and-estimation","title":"Hybrid Orthogonal Projection and Estimation (HOPE): A New Framework to Probe and Learn Neural Networks","arxiv_id":"1502.00702","date":"2015-02-03","proceeding":null,"authors":["Shiliang Zhang","Hui Jiang"],"abstract":"In this paper, we propose a novel model for high-dimensional data, called the\nHybrid Orthogonal Projection and Estimation (HOPE) model, which combines a\nlinear orthogonal projection and a finite mixture model under a unified\ngenerative modeling framework. The HOPE model itself can be learned\nunsupervised from unlabelled data based on the maximum likelihood estimation as\nwell as discriminatively from labelled data. More interestingly, we have shown\nthe proposed HOPE models are closely related to neural networks (NNs) in a\nsense that each hidden layer can be reformulated as a HOPE model. As a result,\nthe HOPE framework can be used as a novel tool to probe why and how NNs work,\nmore importantly, to learn NNs in either supervised or unsupervised ways. In\nthis work, we have investigated the HOPE framework to learn NNs for several\nstandard tasks, including image recognition on MNIST and speech recognition on\nTIMIT. Experimental results have shown that the HOPE framework yields\nsignificant performance gains over the current state-of-the-art methods in\nvarious types of NN learning problems, including unsupervised feature learning,\nsupervised or semi-supervised learning.","url_abs":"http://arxiv.org/abs/1502.00702v2","url_pdf":"http://arxiv.org/pdf/1502.00702v2.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":[],"tasks":[{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"speech-recognition","task_name":"Speech Recognition"},{"task_slug":"speech-recognition-1","task_name":"speech-recognition"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-classification-on-mnist","task":"Image Classification","dataset":"MNIST","model":"HOPE","rank_in_archive_order":27,"of":81,"metrics":{"Percentage error":"0.4"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"369a29adb66f2aaeba024e972f52699fa34564f5e599f59ae04356aaead6ba50","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}