{"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/spsa-fsr-simultaneous-perturbation-stochastic","title":"SPSA-FSR: Simultaneous Perturbation Stochastic Approximation for Feature Selection and Ranking","arxiv_id":"1804.05589","date":"2018-04-16","proceeding":null,"authors":["Zeren D. Yenice","Niranjan Adhikari","Yong Kai Wong","Vural Aksakalli","Alev Taskin Gumus","Babak Abbasi"],"abstract":"This manuscript presents the following: (1) an improved version of the Binary\nSimultaneous Perturbation Stochastic Approximation (SPSA) Method for feature\nselection in machine learning (Aksakalli and Malekipirbazari, Pattern\nRecognition Letters, Vol. 75, 2016) based on non-monotone iteration gains\ncomputed via the Barzilai and Borwein (BB) method, (2) its adaptation for\nfeature ranking, and (3) comparison against popular methods on public benchmark\ndatasets. The improved method, which we call SPSA-FSR, dramatically reduces the\nnumber of iterations required for convergence without impacting solution\nquality. SPSA-FSR can be used for feature ranking and feature selection both\nfor classification and regression problems. After a review of the current\nstate-of-the-art, we discuss our improvements in detail and present three sets\nof computational experiments: (1) comparison of SPSA-FS as a (wrapper) feature\nselection method against sequential methods as well as genetic algorithms, (2)\ncomparison of SPSA-FS as a feature ranking method in a classification setting\nagainst random forest importance, chi-squared, and information main methods,\nand (3) comparison of SPSA-FS as a feature ranking method in a regression\nsetting against minimum redundancy maximum relevance (MRMR), RELIEF, and linear\ncorrelation methods. The number of features in the datasets we use range from a\nfew dozens to a few thousands. Our results indicate that SPSA-FS converges to a\ngood feature set in no more than 100 iterations and therefore it is quite fast\nfor a wrapper method. SPSA-FS also outperforms popular feature selection as\nwell as feature ranking methods in majority of test cases, sometimes by a large\nmargin, and it stands as a promising new feature selection and ranking method.","url_abs":"http://arxiv.org/abs/1804.05589v1","url_pdf":"http://arxiv.org/pdf/1804.05589v1.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":"spsa-fsr-simultaneous-perturbation-stochastic","repo_url":"https://github.com/pat-s/paper_hyperspectral","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"spsa-fsr-simultaneous-perturbation-stochastic","repo_url":"https://github.com/vaksakalli/spFtSel_py","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"spsa-fsr-simultaneous-perturbation-stochastic","repo_url":"https://github.com/vaksakalli/spfsr","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"spsa-fsr-simultaneous-perturbation-stochastic","repo_url":"https://github.com/vaksakalli/spsaml_py","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"spsa-fsr-simultaneous-perturbation-stochastic","repo_url":"https://github.com/zerenyenice/spsa-fsr","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"feature-selection","task_name":"feature selection"},{"task_slug":"regression-1","task_name":"regression"}],"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":"pat-s/paper_hyperspectral","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"vaksakalli/spFtSel_py","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"vaksakalli/spfsr","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"vaksakalli/spsaml_py","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"zerenyenice/spsa-fsr","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":"2de4654992abe431774d3e439baf1ad0fa5edb5d80c423e0cd06f1380fc86457","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}