{"id":"https://openalex.org/W7106315350","doi":"https://doi.org/10.48550/arxiv.2511.15300","title":"Quant-Trim in Practice: Improved Cross-Platform Low-Bit Deployment on Edge NPUs","display_name":"Quant-Trim in Practice: Improved Cross-Platform Low-Bit Deployment on Edge NPUs","publication_year":2025,"publication_date":"2025-11-19","ids":{"openalex":"https://openalex.org/W7106315350","doi":"https://doi.org/10.48550/arxiv.2511.15300"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2511.15300","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.15300","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2511.15300","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Dhahri, Rayen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dhahri, Rayen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Urban, Steffen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Urban, Steffen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.6373000144958496,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.6373000144958496,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.22290000319480896,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.026599999517202377,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/quantization","display_name":"Quantization (signal processing)","score":0.689300000667572},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.5526000261306763},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.475600004196167},{"id":"https://openalex.org/keywords/code-refactoring","display_name":"Code refactoring","score":0.45249998569488525},{"id":"https://openalex.org/keywords/vendor","display_name":"Vendor","score":0.44029998779296875},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.43689998984336853},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.4302999973297119},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.4169999957084656},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4090000092983246},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.40610000491142273}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.751800000667572},{"id":"https://openalex.org/C28855332","wikidata":"https://www.wikidata.org/wiki/Q198099","display_name":"Quantization (signal processing)","level":2,"score":0.689300000667572},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5526000261306763},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.475600004196167},{"id":"https://openalex.org/C152752567","wikidata":"https://www.wikidata.org/wiki/Q116877","display_name":"Code refactoring","level":3,"score":0.45249998569488525},{"id":"https://openalex.org/C2777338717","wikidata":"https://www.wikidata.org/wiki/Q1762621","display_name":"Vendor","level":2,"score":0.44029998779296875},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.43689998984336853},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.4302999973297119},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.4171000123023987},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4169999957084656},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4090000092983246},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.40610000491142273},{"id":"https://openalex.org/C197115733","wikidata":"https://www.wikidata.org/wiki/Q1003136","display_name":"Forcing (mathematics)","level":2,"score":0.3993000090122223},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.39430001378059387},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.3855000138282776},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.3677999973297119},{"id":"https://openalex.org/C138236772","wikidata":"https://www.wikidata.org/wiki/Q25098575","display_name":"Edge device","level":3,"score":0.34549999237060547},{"id":"https://openalex.org/C2778456923","wikidata":"https://www.wikidata.org/wiki/Q5337692","display_name":"Edge computing","level":3,"score":0.3370000123977661},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.33570000529289246},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32739999890327454},{"id":"https://openalex.org/C105339364","wikidata":"https://www.wikidata.org/wiki/Q2297740","display_name":"Software deployment","level":2,"score":0.3260999917984009},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3222000002861023},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.31940001249313354},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.3012000024318695},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2939000129699707},{"id":"https://openalex.org/C2779231336","wikidata":"https://www.wikidata.org/wiki/Q7534724","display_name":"Sketch","level":2,"score":0.2922999858856201},{"id":"https://openalex.org/C157202957","wikidata":"https://www.wikidata.org/wiki/Q1659609","display_name":"Image warping","level":2,"score":0.28679999709129333},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2833000123500824},{"id":"https://openalex.org/C43364308","wikidata":"https://www.wikidata.org/wiki/Q8799","display_name":"Byte","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.2709999978542328},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2700999975204468},{"id":"https://openalex.org/C124913957","wikidata":"https://www.wikidata.org/wiki/Q1232548","display_name":"Zoom","level":3,"score":0.2565999925136566},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.2554999887943268},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.2513999938964844},{"id":"https://openalex.org/C165021410","wikidata":"https://www.wikidata.org/wiki/Q55564","display_name":"Lossy compression","level":2,"score":0.2513999938964844},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2511.15300","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.15300","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2511.15300","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.15300","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Specialized":[0],"edge":[1,123],"accelerators":[2],"rely":[3],"on":[4,112],"low-bit":[5],"quantization,":[6],"but":[7],"vendor":[8],"compilers":[9],"differ":[10],"in":[11],"scaling,":[12],"clipping,":[13],"and":[14,59,75,95,103,115,122,130,136],"kernel":[15],"support,":[16],"often":[17],"as":[18],"black":[19],"boxes.":[20],"The":[21],"same":[22],"floating-point":[23],"(FP)":[24],"checkpoint":[25,55],"can":[26],"therefore":[27],"yield":[28],"inconsistent":[29],"accuracy":[30,121],"across":[31],"backends,":[32],"forcing":[33],"practitioners":[34],"to":[35,41,57,67,78,89],"tweak":[36],"flags":[37],"or":[38],"refactor":[39],"models":[40,102],"vendor-friendly":[42],"operator":[43,138],"subsets.":[44],"We":[45,119],"introduce":[46],"Quant-Trim,":[47],"a":[48,53],"training-phase":[49],"method":[50],"that":[51],"produces":[52],"hardware-neutral":[54],"robust":[56],"backend":[58],"precision":[60],"choices.":[61],"It":[62],"combines":[63],"progressive":[64],"fake":[65],"quantization":[66,90],"align":[68],"training":[69],"with":[70],"the":[71,107],"deployed":[72],"integer":[73],"grid":[74],"reverse":[76],"pruning":[77],"tame":[79],"outlier-driven":[80],"scale":[81],"inflation":[82],"while":[83],"preserving":[84],"learnability.":[85],"Quant-Trim":[86],"is":[87],"agnostic":[88],"schemes":[91],"(symmetric/asymmetric,":[92],"per-tensor/per-channel,":[93],"INT8/INT4)":[94],"requires":[96],"no":[97],"vendor-specific":[98],"graph":[99],"changes.":[100],"Across":[101],"tasks,":[104],"it":[105],"narrows":[106],"FP-to-low-bit":[108],"gap,":[109],"reduces":[110],"dependence":[111],"compiler":[113],"heuristics/calibration,":[114],"avoids":[116],"per-backend":[117],"retraining.":[118],"report":[120],"metrics":[124],"latency,":[125],"throughput,":[126],"energy":[127],"per":[128],"inference,":[129],"cost":[131],"under":[132],"static/dynamic":[133],"activation":[134],"scaling":[135],"varying":[137],"coverage.":[139]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-11-23T00:00:00"}