{"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/task-aware-compressed-sensing-with-generative","title":"Task-Aware Compressed Sensing with Generative Adversarial Networks","arxiv_id":"1802.01284","date":"2018-02-05","proceeding":null,"authors":["Maya Kabkab","Pouya Samangouei","Rama Chellappa"],"abstract":"In recent years, neural network approaches have been widely adopted for\nmachine learning tasks, with applications in computer vision. More recently,\nunsupervised generative models based on neural networks have been successfully\napplied to model data distributions via low-dimensional latent spaces. In this\npaper, we use Generative Adversarial Networks (GANs) to impose structure in\ncompressed sensing problems, replacing the usual sparsity constraint. We\npropose to train the GANs in a task-aware fashion, specifically for\nreconstruction tasks. We also show that it is possible to train our model\nwithout using any (or much) non-compressed data. Finally, we show that the\nlatent space of the GAN carries discriminative information and can further be\nregularized to generate input features for general inference tasks. We\ndemonstrate the effectiveness of our method on a variety of reconstruction and\nclassification problems.","url_abs":"http://arxiv.org/abs/1802.01284v1","url_pdf":"http://arxiv.org/pdf/1802.01284v1.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":"task-aware-compressed-sensing-with-generative","repo_url":"https://github.com/po0ya/csgan","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"compressed-sensing","task_name":"compressed sensing"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1802.01284","atlas_url":"https://app.syntology.ai/?focus=1802.01284","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":"1802.01284"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1802.01284\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1802.01284"},"call":"get_concepts_for_paper(arxiv_id=\"1802.01284\")"}],"by_repo":[{"repo":"po0ya/csgan","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":"61c6138bd57925d41d4f43bff67692c883397720576a91bdea241a9d4688cf54","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}