{"id":"https://openalex.org/W4415338148","doi":"https://doi.org/10.48550/arxiv.2509.25439","title":"Norm-Q: Effective Compression Method for Hidden Markov Models in Neuro-Symbolic Applications","display_name":"Norm-Q: Effective Compression Method for Hidden Markov Models in Neuro-Symbolic Applications","publication_year":2025,"publication_date":"2025-09-29","ids":{"openalex":"https://openalex.org/W4415338148","doi":"https://doi.org/10.48550/arxiv.2509.25439"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2509.25439","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.25439","pdf_url":"https://arxiv.org/pdf/2509.25439","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2509.25439","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5107052693","display_name":"Hanyuan Gao","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gao, Hanyuan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5080236384","display_name":"Xiaoxuan Yang","orcid":"https://orcid.org/0000-0002-2553-2631"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yang, Xiaoxuan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5107052693"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10320","display_name":"Neural Networks and Applications","score":0.8521000146865845,"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/T10320","display_name":"Neural Networks and Applications","score":0.8521000146865845,"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/hidden-markov-model","display_name":"Hidden Markov model","score":0.650600016117096},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5758000016212463},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.5376999974250793},{"id":"https://openalex.org/keywords/quantization","display_name":"Quantization (signal processing)","score":0.5059000253677368},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44609999656677246},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4336000084877014},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.3991999924182892},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.38609999418258667},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.3668999969959259},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.3614000082015991}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7378000020980835},{"id":"https://openalex.org/C23224414","wikidata":"https://www.wikidata.org/wiki/Q176769","display_name":"Hidden Markov model","level":2,"score":0.650600016117096},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5758000016212463},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.5376999974250793},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5098000168800354},{"id":"https://openalex.org/C28855332","wikidata":"https://www.wikidata.org/wiki/Q198099","display_name":"Quantization (signal processing)","level":2,"score":0.5059000253677368},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44609999656677246},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4336000084877014},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.3991999924182892},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.39480000734329224},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.38609999418258667},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.3668999969959259},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.3614000082015991},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.3490000069141388},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.34880000352859497},{"id":"https://openalex.org/C64939953","wikidata":"https://www.wikidata.org/wiki/Q3859882","display_name":"Hidden semi-Markov model","level":5,"score":0.3481000065803528},{"id":"https://openalex.org/C196956702","wikidata":"https://www.wikidata.org/wiki/Q6795829","display_name":"Maximum-entropy Markov model","level":5,"score":0.34619998931884766},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.3287999927997589},{"id":"https://openalex.org/C94835093","wikidata":"https://www.wikidata.org/wiki/Q3113333","display_name":"Data compression ratio","level":5,"score":0.3260999917984009},{"id":"https://openalex.org/C199833920","wikidata":"https://www.wikidata.org/wiki/Q612536","display_name":"Vector quantization","level":2,"score":0.32260000705718994},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.31619998812675476},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.3052000105381012},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.30309998989105225},{"id":"https://openalex.org/C114289077","wikidata":"https://www.wikidata.org/wiki/Q3284399","display_name":"Statistical model","level":2,"score":0.296099990606308},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29580000042915344},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.2870999872684479},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.27469998598098755},{"id":"https://openalex.org/C196455857","wikidata":"https://www.wikidata.org/wiki/Q5473264","display_name":"Forward algorithm","level":5,"score":0.27219998836517334},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.26350000500679016},{"id":"https://openalex.org/C28490314","wikidata":"https://www.wikidata.org/wiki/Q189436","display_name":"Speech recognition","level":1,"score":0.2614000141620636},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C182081679","wikidata":"https://www.wikidata.org/wiki/Q1275153","display_name":"Expectation\u2013maximization algorithm","level":3,"score":0.25999999046325684},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.2524999976158142}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2509.25439","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.25439","pdf_url":"https://arxiv.org/pdf/2509.25439","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2509.25439","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2509.25439","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2509.25439","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.25439","pdf_url":"https://arxiv.org/pdf/2509.25439","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Hidden":[0],"Markov":[1,20],"models":[2],"(HMM)":[3],"are":[4],"commonly":[5],"used":[6],"in":[7,15],"generation":[8,145],"tasks":[9],"and":[10,30,36,44,56,59,96,99],"have":[11],"demonstrated":[12],"strong":[13],"capabilities":[14],"neuro-symbolic":[16],"applications":[17,23],"for":[18,74,115,184],"the":[19,25,46,84,88,140,143,174,185,188],"property.":[21],"These":[22],"leverage":[24],"strengths":[26],"of":[27,48,87,142,147,156,182,187],"neural":[28],"networks":[29],"symbolic":[31,77],"reasoning":[32],"to":[33,135,160],"create":[34],"robust":[35],"interpretable":[37],"AI":[38],"systems.":[39],"However,":[40],"they":[41],"may":[42],"inherit":[43],"amplify":[45],"shortcomings":[47],"both":[49],"approaches.":[50],"Both":[51],"components":[52],"require":[53],"dense":[54],"computation":[55],"data":[57,89],"transfer,":[58],"their":[60],"communication":[61],"further":[62],"hinders":[63],"performance.":[64],"This":[65],"paper":[66],"proposes":[67],"Norm-Q,":[68],"a":[69,109,126,179],"normalized":[70,110],"linear":[71],"quantization":[72,137],"approach":[73],"compressing":[75],"probabilistic":[76,116],"models,":[78,150],"such":[79],"as":[80],"HMMs.":[81],"We":[82],"reduce":[83],"bit":[85],"width":[86],"with":[90,130,170],"minimal":[91],"impact,":[92],"thereby":[93],"alleviating":[94],"memory":[95],"bandwidth":[97],"stress":[98],"enabling":[100],"deployment":[101],"on":[102],"potential":[103],"custom":[104],"hardware.":[105],"Our":[106],"method":[107,176],"introduces":[108],"quantization-aware":[111],"expectation":[112],"maximization":[113],"process":[114],"model":[117],"training.":[118],"The":[119,190],"experimental":[120],"results":[121],"show":[122],"that":[123],"Norm-Q":[124,175],"achieves":[125],"higher":[127],"compression":[128,180],"rate":[129,181],"reasonable":[131],"score":[132],"loss":[133,164],"compared":[134],"traditional":[136],"methods.":[138],"In":[139],"case":[141],"constrained":[144],"task":[146],"large":[148],"language":[149],"we":[151],"successfully":[152],"quantize":[153],"an":[154],"HMM":[155],"4096":[157],"hidden":[158],"states":[159],"8":[161],"bits":[162,169],"without":[163],"and,":[165],"at":[166,195],"most,":[167],"3":[168],"acceptable":[171],"loss.":[172],"Notably,":[173],"can":[177],"achieve":[178],"99%":[183],"weights":[186],"HMM.":[189],"code":[191],"is":[192],"open":[193],"source":[194],"https://github.com/superstarghy/Norm-Q.":[196]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-19T00:00:00"}