{"id":"https://openalex.org/W2106518611","doi":"https://doi.org/10.1109/lsp.2008.2011710","title":"A Quadratic Optimization Approach to Discriminative Training of CDHMMs","display_name":"A Quadratic Optimization Approach to Discriminative Training of CDHMMs","publication_year":2009,"publication_date":"2009-02-13","ids":{"openalex":"https://openalex.org/W2106518611","doi":"https://doi.org/10.1109/lsp.2008.2011710","mag":"2106518611"},"language":"en","primary_location":{"id":"doi:10.1109/lsp.2008.2011710","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2008.2011710","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Signal Processing Letters","raw_type":"journal-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/A5100346770","display_name":"Peng Liu","orcid":"https://orcid.org/0000-0001-8823-2399"},"institutions":[{"id":"https://openalex.org/I4210113369","display_name":"Microsoft Research Asia (China)","ror":"https://ror.org/0300m5276","country_code":"CN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210113369"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Peng Liu","raw_affiliation_strings":["Microsoft Research Asia, Beijing, China","Microsoft Research Asia, Beijing,"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Asia, Beijing, China","institution_ids":["https://openalex.org/I4210113369"]},{"raw_affiliation_string":"Microsoft Research Asia, Beijing,","institution_ids":["https://openalex.org/I4210113369"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065394791","display_name":"Frank K. Soong","orcid":"https://orcid.org/0000-0002-9088-3577"},"institutions":[{"id":"https://openalex.org/I4210113369","display_name":"Microsoft Research Asia (China)","ror":"https://ror.org/0300m5276","country_code":"CN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210113369"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"F. Soong","raw_affiliation_strings":["Microsoft Research Asia, Beijing, China","Microsoft Research Asia, Beijing,"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Asia, Beijing, China","institution_ids":["https://openalex.org/I4210113369"]},{"raw_affiliation_string":"Microsoft Research Asia, Beijing,","institution_ids":["https://openalex.org/I4210113369"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100346770"],"corresponding_institution_ids":["https://openalex.org/I4210113369"],"apc_list":null,"apc_paid":null,"fwci":1.3086,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.84465036,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"3","first_page":"149","last_page":"152"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9987999796867371,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9987999796867371,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9768999814987183,"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/T10201","display_name":"Speech Recognition and Synthesis","score":0.9715999960899353,"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/discriminative-model","display_name":"Discriminative model","score":0.7581439018249512},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5920100212097168},{"id":"https://openalex.org/keywords/ellipsoid","display_name":"Ellipsoid","score":0.5807203650474548},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5465043783187866},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5401100516319275},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5015711784362793},{"id":"https://openalex.org/keywords/divergence","display_name":"Divergence (linguistics)","score":0.49817848205566406},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.48220813274383545},{"id":"https://openalex.org/keywords/ellipsoid-method","display_name":"Ellipsoid method","score":0.469904363155365},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4643659293651581},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4545431137084961},{"id":"https://openalex.org/keywords/gaussian-process","display_name":"Gaussian process","score":0.4216320514678955},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4171209931373596},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.40270841121673584},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.3593946695327759},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33216148614883423},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2687106728553772},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.10807111859321594}],"concepts":[{"id":"https://openalex.org/C97931131","wikidata":"https://www.wikidata.org/wiki/Q5282087","display_name":"Discriminative model","level":2,"score":0.7581439018249512},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5920100212097168},{"id":"https://openalex.org/C57489055","wikidata":"https://www.wikidata.org/wiki/Q190046","display_name":"Ellipsoid","level":2,"score":0.5807203650474548},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5465043783187866},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5401100516319275},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5015711784362793},{"id":"https://openalex.org/C207390915","wikidata":"https://www.wikidata.org/wiki/Q1230525","display_name":"Divergence (linguistics)","level":2,"score":0.49817848205566406},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.48220813274383545},{"id":"https://openalex.org/C205451395","wikidata":"https://www.wikidata.org/wiki/Q378574","display_name":"Ellipsoid method","level":5,"score":0.469904363155365},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4643659293651581},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4545431137084961},{"id":"https://openalex.org/C61326573","wikidata":"https://www.wikidata.org/wiki/Q1496376","display_name":"Gaussian process","level":3,"score":0.4216320514678955},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4171209931373596},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.40270841121673584},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3593946695327759},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33216148614883423},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2687106728553772},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.10807111859321594},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lsp.2008.2011710","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2008.2011710","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Signal Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.7699999809265137}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1567923445","https://openalex.org/W2003123121","https://openalex.org/W2040193698","https://openalex.org/W2123119958","https://openalex.org/W2134969019","https://openalex.org/W2153307830","https://openalex.org/W2156060302","https://openalex.org/W2158289097","https://openalex.org/W2158808283","https://openalex.org/W2162965424","https://openalex.org/W2296319761","https://openalex.org/W2318633240","https://openalex.org/W2476885591","https://openalex.org/W4250589301"],"related_works":["https://openalex.org/W2031732959","https://openalex.org/W2235431948","https://openalex.org/W7739709","https://openalex.org/W2016090484","https://openalex.org/W2562629174","https://openalex.org/W1500330311","https://openalex.org/W2061711344","https://openalex.org/W2169170556","https://openalex.org/W2034124193","https://openalex.org/W2993619238"],"abstract_inverted_index":{"<para":[0],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[1],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">":[2],"In":[3],"this":[4],"letter,":[5],"we":[6,28],"reformulate":[7],"the":[8,42,59,73,91,117,132],"discriminative":[9],"training":[10],"(DT)":[11],"of":[12,48,103,142],"continuous":[13],"density":[14],"hidden":[15],"Markov":[16],"models":[17],"(CDHMMs)":[18],"as":[19,65,107],"an":[20,54],"ellipsoid":[21,37],"constrained":[22],"quadratic":[23,69],"programming":[24,70],"(ECQP)":[25],"problem,":[26],"and":[27,110,147],"solve":[29],"it":[30],"by":[31,116],"a":[32,67,80,97],"line":[33],"search":[34],"algorithm.":[35],"The":[36],"constraint":[38],"intrinsically":[39],"arises":[40],"from":[41],"step-size":[43],"control":[44],"in":[45,66,140],"each":[46],"iteration":[47],"DT":[49,102],"optimization,":[50],"which":[51,86],"leads":[52],"to":[53,62,79,89],"efficient":[55],"solution":[56],"without":[57],"relaxing":[58],"objective":[60],"function":[61],"be":[63,76,113],"convex,":[64],"general":[68],"problem.":[71],"Moreover,":[72],"problem":[74],"can":[75,112],"equivalently":[77],"converted":[78],"lower-dimensional":[81],"one":[82],"under":[83,96],"some":[84],"conditions,":[85],"helps":[87],"further":[88],"simplify":[90],"solution.":[92],"We":[93],"show":[94,130],"that":[95,131],"Kullback\u2013Leibler":[98],"divergence":[99],"(KLD)":[100],"constraint,":[101],"CDHMM":[104],"parameters":[105],"such":[106],"Gaussian":[108],"means":[109],"variances":[111],"efficiently":[114],"solved":[115],"proposed":[118],"algorithm,":[119],"with":[120],"only":[121],"mild":[122],"assumptions":[123],"adopted.":[124],"Experimental":[125],"results":[126],"on":[127],"two":[128],"tasks":[129],"ECQP":[133],"approach":[134],"considerably":[135],"outperforms":[136],"other":[137],"popular":[138],"algorithms":[139],"terms":[141],"both":[143],"final":[144],"recognition":[145],"accuracy":[146],"convergence":[148],"speed.":[149],"</para>":[150]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}