{"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/dependent-relevance-determination-for-smooth","title":"Dependent relevance determination for smooth and structured sparse regression","arxiv_id":"1711.10058","date":"2017-11-28","proceeding":null,"authors":["Anqi Wu","Oluwasanmi Koyejo","Jonathan W. Pillow"],"abstract":"In many problem settings, parameter vectors are not merely sparse but\ndependent in such a way that non-zero coefficients tend to cluster together. We\nrefer to this form of dependency as \"region sparsity.\" Classical sparse\nregression methods, such as the lasso and automatic relevance determination\n(ARD), which model parameters as independent a priori, and therefore do not\nexploit such dependencies. Here we introduce a hierarchical model for smooth,\nregion-sparse weight vectors and tensors in a linear regression setting. Our\napproach represents a hierarchical extension of the relevance determination\nframework, where we add a transformed Gaussian process to model the\ndependencies between the prior variances of regression weights. We combine this\nwith a structured model of the prior variances of Fourier coefficients, which\neliminates unnecessary high frequencies. The resulting prior encourages weights\nto be region-sparse in two different bases simultaneously. We develop Laplace\napproximation and Monte Carlo Markov Chain (MCMC) sampling to provide efficient\ninference for the posterior. Furthermore, a two-stage convex relaxation of the\nLaplace approximation approach is also provided to relax the inevitable\nnon-convexity during the optimization. We finally show substantial improvements\nover comparable methods for both simulated and real datasets from brain\nimaging.","url_abs":"http://arxiv.org/abs/1711.10058v3","url_pdf":"http://arxiv.org/pdf/1711.10058v3.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":"dependent-relevance-determination-for-smooth","repo_url":"https://github.com/waq1129/DRD","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"regression-1","task_name":"regression"}],"methods":[{"method_slug":"gaussian-process","method_name":"Gaussian Process"},{"method_slug":"linear-regression","method_name":"Linear Regression"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1711.10058","atlas_url":"https://app.syntology.ai/?focus=1711.10058","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":"1711.10058"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1711.10058\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1711.10058"},"call":"get_concepts_for_paper(arxiv_id=\"1711.10058\")"}],"by_repo":[{"repo":"waq1129/DRD","kind":"official","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":"0f0ce11d60ea55f591fc1051df2100179f15311a68e5712a8f3912e7404881b8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}