{"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/an-interactive-greedy-approach-to-group","title":"An Interactive Greedy Approach to Group Sparsity in High Dimensions","arxiv_id":"1707.02963","date":"2017-07-10","proceeding":null,"authors":["Wei Qian","Wending Li","Yasuhiro Sogawa","Ryohei Fujimaki","Xitong Yang","Ji Liu"],"abstract":"Sparsity learning with known grouping structure has received considerable\nattention due to wide modern applications in high-dimensional data analysis.\nAlthough advantages of using group information have been well-studied by\nshrinkage-based approaches, benefits of group sparsity have not been\nwell-documented for greedy-type methods, which much limits our understanding\nand use of this important class of methods. In this paper, generalizing from a\npopular forward-backward greedy approach, we propose a new interactive greedy\nalgorithm for group sparsity learning and prove that the proposed greedy-type\nalgorithm attains the desired benefits of group sparsity under high dimensional\nsettings. An estimation error bound refining other existing methods and a\nguarantee for group support recovery are also established simultaneously. In\naddition, we incorporate a general M-estimation framework and introduce an\ninteractive feature to allow extra algorithm flexibility without compromise in\ntheoretical properties. The promising use of our proposal is demonstrated\nthrough numerical evaluations including a real industrial application in human\nactivity recognition at home. Supplementary materials for this article are\navailable online.","url_abs":"http://arxiv.org/abs/1707.02963v5","url_pdf":"http://arxiv.org/pdf/1707.02963v5.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":"an-interactive-greedy-approach-to-group","repo_url":"https://github.com/weiqian1/IGA","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"activity-recognition","task_name":"Activity Recognition"},{"task_slug":"human-activity-recognition","task_name":"Human Activity Recognition"},{"task_slug":"high","task_name":"Vocal Bursts Intensity Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"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":[{"repo":"weiqian1/IGA","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":"2d9e974fed703b6338745aedebb2b9ca563e001e89d31bfbac12d4a2d0c8bc85","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}