{"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/deep-active-subspaces-a-scalable-method-for","title":"Deep active subspaces - a scalable method for high-dimensional uncertainty propagation","arxiv_id":"1902.10527","date":"2019-02-27","proceeding":null,"authors":["Rohit Tripathy","Ilias Bilionis"],"abstract":"A problem of considerable importance within the field of uncertainty\nquantification (UQ) is the development of efficient methods for the\nconstruction of accurate surrogate models. Such efforts are particularly\nimportant to applications constrained by high-dimensional uncertain parameter\nspaces. The difficulty of accurate surrogate modeling in such systems, is\nfurther compounded by data scarcity brought about by the large cost of forward\nmodel evaluations. Traditional response surface techniques, such as Gaussian\nprocess regression (or Kriging) and polynomial chaos are difficult to scale to\nhigh dimensions. To make surrogate modeling tractable in expensive\nhigh-dimensional systems, one must resort to dimensionality reduction of the\nstochastic parameter space. A recent dimensionality reduction technique that\nhas shown great promise is the method of `active subspaces'. The classical\nformulation of active subspaces, unfortunately, requires gradient information\nfrom the forward model - often impossible to obtain. In this work, we present a\nsimple, scalable method for recovering active subspaces in high-dimensional\nstochastic systems, without gradient-information that relies on a\nreparameterization of the orthogonal active subspace projection matrix, and\ncouple this formulation with deep neural networks. We demonstrate our approach\non synthetic and real world datasets and show favorable predictive comparison\nto classical active subspaces.","url_abs":"http://arxiv.org/abs/1902.10527v2","url_pdf":"http://arxiv.org/pdf/1902.10527v2.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":"deep-active-subspaces-a-scalable-method-for","repo_url":"https://github.com/wedeling/EasySurrogate","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"LGPL-2.1"}}],"tasks":[{"task_slug":"dimensionality-reduction","task_name":"Dimensionality Reduction"},{"task_slug":"uncertainty-quantification","task_name":"Uncertainty Quantification"},{"task_slug":"high","task_name":"Vocal Bursts Intensity Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1902.10527","atlas_url":"https://app.syntology.ai/?focus=1902.10527","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":"1902.10527"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1902.10527\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1902.10527"},"call":"get_concepts_for_paper(arxiv_id=\"1902.10527\")"}],"by_repo":[{"repo":"wedeling/EasySurrogate","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":"608c79293118a7549a34c13d87689cf6446ddbfe5b217081a9d8f381ea760a93","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}