{"id":"https://openalex.org/W2138145347","doi":null,"title":"EfficientL 1 regularized logistic regression","display_name":"EfficientL 1 regularized logistic regression","publication_year":2006,"publication_date":"2006-07-16","ids":{"openalex":"https://openalex.org/W2138145347","mag":"2138145347"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.187.8662","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.8662","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.washington.edu/homes/suinlee/papers/suinlee_aaai2006.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5048011229","display_name":"Sun-In Lee","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sun-In Lee","raw_affiliation_strings":["[Computer Science Department, Stanford University, Stanford, CA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[Computer Science Department, Stanford University, Stanford, CA]","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108652283","display_name":"Honglak Lee","orcid":"https://orcid.org/0000-0002-4109-327X","observed_orcids":["https://orcid.org/0000-0002-4109-327X"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Honglak Lee","raw_affiliation_strings":["[Computer Science Department, Stanford University, Stanford, CA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[Computer Science Department, Stanford University, Stanford, CA]","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049349154","display_name":"Pieter Abbeel","orcid":"https://orcid.org/0009-0007-0628-9932","observed_orcids":["https://orcid.org/0009-0007-0628-9932"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pieter Abbeel","raw_affiliation_strings":["[Computer Science Department, Stanford University, Stanford, CA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[Computer Science Department, Stanford University, Stanford, CA]","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102617494","display_name":"Andrew Y. Ng","orcid":"https://orcid.org/0000-0001-5547-3196","observed_orcids":["https://orcid.org/0000-0001-5547-3196"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Y. Ng","raw_affiliation_strings":["[Computer Science Department, Stanford University, Stanford, CA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[Computer Science Department, Stanford University, Stanford, CA]","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":10.2531,"has_fulltext":false,"cited_by_count":285,"citation_normalized_percentile":{"value":0.98356084,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"401","last_page":"408"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.7681000232696533,"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"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.7681000232696533,"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"}},{"id":"https://openalex.org/T10136","display_name":"Statistical Methods and Inference","score":0.18629999458789825,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.01119999960064888,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/l1-regularized-logistic-regression","display_name":"L1-regularized logistic regression","score":0.984000027179718},{"id":"https://openalex.org/keywords/l1-regularization","display_name":"L1 regularization","score":0.6930000185966492},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"convex optimization","score":0.8769999742507935},{"id":"https://openalex.org/keywords/second-order-approximation","display_name":"second-order approximation","score":0.8560000061988831},{"id":"https://openalex.org/keywords/lars","display_name":"LARS","score":0.871999979019165},{"id":"https://openalex.org/keywords/global-convergence","display_name":"global convergence","score":0.6919999718666077},{"id":"https://openalex.org/keywords/large-scale-classification","display_name":"large-scale classification","score":0.6850000023841858},{"id":"https://openalex.org/keywords/sparse-modeling","display_name":"sparse models","score":0.3269999921321869}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5958396196365356},{"id":"https://openalex.org/C151956035","wikidata":"https://www.wikidata.org/wiki/Q1132755","display_name":"Logistic regression","level":2,"score":0.5920185446739197},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5311787128448486},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5176166296005249},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.47507280111312866},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4461652338504791},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4375028908252716},{"id":"https://openalex.org/C61722155","wikidata":"https://www.wikidata.org/wiki/Q6667643","display_name":"Logistic model tree","level":3,"score":0.4271593689918518},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4136032164096832},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38277167081832886},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3425249457359314},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3052443265914917},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.187.8662","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.8662","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.washington.edu/homes/suinlee/papers/suinlee_aaai2006.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.323.1278","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.323.1278","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.aaai.org/Papers/AAAI/2006/AAAI06-064.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.419.8381","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.419.8381","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.robotics.stanford.edu/~ang/papers/aaai06-l1logisticregression.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.64.1993","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.1993","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.robotics.stanford.edu/~ang/papers/aaai06-efficientL1logisticregression.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.76.6804","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.6804","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.robotics.stanford.edu/~ang/papers/aaai06-efficientL1logisticregression.ps","raw_type":"text"},{"id":"mag:2138145347","doi":null,"is_oa":false,"landing_page_url":"http://ai.stanford.edu/%7Eang/papers/aaai06-efficientL1logisticregression.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420577","display_name":"National Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"National Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1528905581","https://openalex.org/W1542491098","https://openalex.org/W1887132526","https://openalex.org/W1984568490","https://openalex.org/W2004915807","https://openalex.org/W2063978378","https://openalex.org/W2084812512","https://openalex.org/W2135046866","https://openalex.org/W2145473366","https://openalex.org/W2181470043","https://openalex.org/W2296319761","https://openalex.org/W2801490189","https://openalex.org/W2903718010"],"related_works":["https://openalex.org/W2129680346","https://openalex.org/W1982519483","https://openalex.org/W138876763","https://openalex.org/W7100795720","https://openalex.org/W7099829274","https://openalex.org/W7100318982","https://openalex.org/W7100066164","https://openalex.org/W1983599491","https://openalex.org/W2027197817","https://openalex.org/W4388093412"],"abstract_inverted_index":{"L1":[0,24,66,88,106,156],"regularized":[1,25,67,157],"logistic":[2,26,68,158],"regression":[3,27,159],"is":[4,12,118],"now":[5],"a":[6,30,78],"workhorse":[7],"of":[8],"machine":[9],"learning:":[10],"it":[11,93],"widely":[13],"used":[14],"for":[15,37,65,136],"many":[16,22,54],"classification":[17],"problems,":[18],"particularly":[19],"ones":[20],"with":[21],"features.":[23],"requires":[28],"solving":[29,38,137],"convex":[31,39,138],"optimization":[32,40,109,139],"problem.":[33,110,160],"However,":[34],"standard":[35,134],"algorithms":[36,135,148],"problems":[41],"do":[42],"not":[43],"scale":[44],"well":[45],"enough":[46],"to":[47,102,120,122,153],"handle":[48],"the":[49,74,82,87,95,104,123,155],"large":[50],"datasets":[51],"encountered":[52],"in":[53],"practical":[55],"settings.":[56],"In":[57,90],"this":[58],"paper,":[59],"we":[60],"propose":[61],"an":[62],"efficient":[63,96],"algorithm":[64,71,101,117,131,143],"regression.":[69],"Our":[70,111,126],"iteratively":[72],"approximates":[73],"objective":[75],"function":[76],"by":[77],"quadratic":[79,108],"approximation":[80],"at":[81],"current":[83],"point,":[84],"while":[85],"maintaining":[86],"constraint.":[89],"each":[91],"iteration,":[92],"uses":[94],"LARS":[97],"(Least":[98],"Angle":[99],"Regression)":[100],"solve":[103,154],"resulting":[105],"constrained":[107],"theoretical":[112],"results":[113],"show":[114,128],"that":[115,129,149],"our":[116,130,142],"guaranteed":[119],"converge":[121],"global":[124],"optimum.":[125],"experiments":[127],"significantly":[132],"outperforms":[133,144],"problems.":[140],"Moreover,":[141],"four":[145],"previously":[146],"published":[147],"were":[150],"specifically":[151],"designed":[152]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":19},{"year":2020,"cited_by_count":19},{"year":2019,"cited_by_count":21},{"year":2018,"cited_by_count":21},{"year":2017,"cited_by_count":18},{"year":2016,"cited_by_count":23},{"year":2015,"cited_by_count":26},{"year":2014,"cited_by_count":27},{"year":2013,"cited_by_count":20},{"year":2012,"cited_by_count":16}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}