{"id":"https://openalex.org/W2507622370","doi":"https://doi.org/10.1109/ssp.2016.7551783","title":"Bilevel feature selection in nearly-linear time","display_name":"Bilevel feature selection in nearly-linear time","publication_year":2016,"publication_date":"2016-06-01","ids":{"openalex":"https://openalex.org/W2507622370","doi":"https://doi.org/10.1109/ssp.2016.7551783","mag":"2507622370"},"language":"en","primary_location":{"id":"doi:10.1109/ssp.2016.7551783","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssp.2016.7551783","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Statistical Signal Processing Workshop (SSP)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066142047","display_name":"Chinmay Hegde","orcid":"https://orcid.org/0000-0003-4574-8066"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chinmay Hegde","raw_affiliation_strings":["Electrical and Computer Engineering, Iowa State University"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, Iowa State University","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5066142047"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":0.304,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60623452,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10136","display_name":"Statistical Methods and Inference","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9786999821662903,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/thresholding","display_name":"Thresholding","score":0.7799258232116699},{"id":"https://openalex.org/keywords/feature-selection","display_name":"Feature selection","score":0.7772439122200012},{"id":"https://openalex.org/keywords/bilevel-optimization","display_name":"Bilevel optimization","score":0.7309355735778809},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7011861801147461},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.6244856715202332},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5990124344825745},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.5747388601303101},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.537325918674469},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3797096610069275},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.28938934206962585},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.10206380486488342}],"concepts":[{"id":"https://openalex.org/C191178318","wikidata":"https://www.wikidata.org/wiki/Q2256906","display_name":"Thresholding","level":3,"score":0.7799258232116699},{"id":"https://openalex.org/C148483581","wikidata":"https://www.wikidata.org/wiki/Q446488","display_name":"Feature selection","level":2,"score":0.7772439122200012},{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.7309355735778809},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7011861801147461},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.6244856715202332},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5990124344825745},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.5747388601303101},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.537325918674469},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3797096610069275},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.28938934206962585},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.10206380486488342},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssp.2016.7551783","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssp.2016.7551783","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Statistical Signal Processing Workshop (SSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1589848011","https://openalex.org/W1826818071","https://openalex.org/W1987371344","https://openalex.org/W2005732955","https://openalex.org/W2054596996","https://openalex.org/W2054667730","https://openalex.org/W2095377654","https://openalex.org/W2120160881","https://openalex.org/W2125680629","https://openalex.org/W2130357047","https://openalex.org/W2137317896","https://openalex.org/W2158068051","https://openalex.org/W2160979406","https://openalex.org/W2163224677","https://openalex.org/W2164431108","https://openalex.org/W2206455100","https://openalex.org/W2281354239","https://openalex.org/W2289917018","https://openalex.org/W2406740263","https://openalex.org/W2507622370","https://openalex.org/W2950559108","https://openalex.org/W2952160444","https://openalex.org/W3099014882","https://openalex.org/W3125735862","https://openalex.org/W4230981723","https://openalex.org/W6638709362","https://openalex.org/W6683368909","https://openalex.org/W6684103851","https://openalex.org/W6687875348","https://openalex.org/W6725194404"],"related_works":["https://openalex.org/W4237041411","https://openalex.org/W1588628884","https://openalex.org/W1542224353","https://openalex.org/W1661087619","https://openalex.org/W1994745260","https://openalex.org/W2382404424","https://openalex.org/W2116854923","https://openalex.org/W2750730210","https://openalex.org/W4386564352","https://openalex.org/W2952668426"],"abstract_inverted_index":{"Selection":[0],"of":[1,5,23,26,44,51,61,81,107],"a":[2,11,42,48,58,71,111,120,138,147],"small":[3,49,59],"subset":[4,50],"informative":[6],"features":[7,27,33,53],"from":[8],"data":[9,32,52],"is":[10,28,110],"basic":[12],"technique":[13],"in":[14,78],"signal":[15],"processing,":[16],"machine":[17],"learning,":[18],"and":[19],"statistics.":[20],"Joint":[21],"selection":[22,40,69,98],"entire":[24],"groups":[25],"desirable":[29],"if":[30],"the":[31,79,82,157],"exhibit":[34],"shared":[35],"grouping":[36],"structures.":[37],"Bilevel":[38],"feature":[39,62,68,97,163],"constitutes":[41],"refinement":[43],"these":[45],"ideas,":[46],"producing":[47],"that":[54,74,99,151,166],"themselves":[55],"belong":[56],"to":[57,132,171],"number":[60],"groups.":[63],"However,":[64],"algorithms":[65],"for":[66,95,115,119,161],"bilevel":[67,96,116,162],"suffer":[70],"computational":[72,102],"cost":[73],"can":[75],"be":[76],"cubic":[77],"size":[80],"data,":[83],"hence":[84],"impeding":[85],"their":[86],"utility.":[87],"In":[88],"this":[89,101,133,144],"paper,":[90],"we":[91],"propose":[92],"an":[93,129],"approach":[94,109],"resolves":[100],"challenge.":[103],"The":[104],"core":[105],"component":[106],"our":[108],"novel":[112],"fast":[113],"algorithm":[114,127,145],"hard":[117],"thresholding":[118,149],"specific":[121],"non-convex,":[122],"discrete":[123],"optimization":[124],"problem.":[125],"Our":[126],"produces":[128],"approximate":[130],"solution":[131],"problem,":[134],"but":[135,165],"only":[136],"incurs":[137],"nearly-linear":[139],"running":[140],"time.":[141],"We":[142],"extend":[143],"into":[146],"two-stage":[148],"method":[150],"performs":[152],"statistically":[153],"as":[154,156],"well":[155,170],"best":[158],"available":[159],"methods":[160],"selection,":[164],"also":[167],"scales":[168],"extremely":[169],"massive":[172],"dataset":[173],"sizes.":[174]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}