{"id":"https://openalex.org/W7165656503","doi":"https://doi.org/10.48550/arxiv.2606.23419","title":"GRINQH: Graded Input-based Quantization Hierarchy for Efficient LLM Generation","display_name":"GRINQH: Graded Input-based Quantization Hierarchy for Efficient LLM Generation","publication_year":2026,"publication_date":"2026-06-22","ids":{"openalex":"https://openalex.org/W7165656503","doi":"https://doi.org/10.48550/arxiv.2606.23419"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.23419","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.23419","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":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.2606.23419","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012115497","display_name":"Jette Oberl\u00e4nder","orcid":"https://orcid.org/0000-0002-8941-3359"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Oberl\u00e4nder, Jette","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079469147","display_name":"Jan Finkbeiner","orcid":"https://orcid.org/0000-0003-4556-3758"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Finkbeiner, Jan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139190181","display_name":"Catherine M. Sch\u00f6fmann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sch\u00f6fmann, Catherine M.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5139192732","display_name":"Emre Neftci","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Neftci, Emre","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/T10901","display_name":"Advanced Data Compression Techniques","score":0.5756000280380249,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.5756000280380249,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10036","display_name":"Advanced Neural Network Applications","score":0.23680000007152557,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.026900000870227814,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/quantization","display_name":"Quantization (signal processing)","score":0.7663999795913696},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6294000148773193},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.6187000274658203},{"id":"https://openalex.org/keywords/memory-hierarchy","display_name":"Memory hierarchy","score":0.4187999963760376},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.35440000891685486},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.33329999446868896},{"id":"https://openalex.org/keywords/dynamic-random-access-memory","display_name":"Dynamic random-access memory","score":0.3240000009536743},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.3179999887943268}],"concepts":[{"id":"https://openalex.org/C28855332","wikidata":"https://www.wikidata.org/wiki/Q198099","display_name":"Quantization (signal processing)","level":2,"score":0.7663999795913696},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6850000023841858},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6294000148773193},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.6187000274658203},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4927999973297119},{"id":"https://openalex.org/C2778100165","wikidata":"https://www.wikidata.org/wiki/Q1589327","display_name":"Memory hierarchy","level":3,"score":0.4187999963760376},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.35440000891685486},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.33329999446868896},{"id":"https://openalex.org/C118702147","wikidata":"https://www.wikidata.org/wiki/Q189396","display_name":"Dynamic random-access memory","level":3,"score":0.3240000009536743},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.3179999887943268},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3160000145435333},{"id":"https://openalex.org/C159877910","wikidata":"https://www.wikidata.org/wiki/Q2202883","display_name":"Autoregressive model","level":2,"score":0.3012999892234802},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.30059999227523804},{"id":"https://openalex.org/C5317259","wikidata":"https://www.wikidata.org/wiki/Q4462361","display_name":"Trellis quantization","level":5,"score":0.2985999882221222},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.28859999775886536},{"id":"https://openalex.org/C199833920","wikidata":"https://www.wikidata.org/wiki/Q612536","display_name":"Vector quantization","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C12186640","wikidata":"https://www.wikidata.org/wiki/Q6815743","display_name":"Memory model","level":3,"score":0.2680000066757202},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.2635999917984009},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.257099986076355},{"id":"https://openalex.org/C61326573","wikidata":"https://www.wikidata.org/wiki/Q1496376","display_name":"Gaussian process","level":3,"score":0.2554999887943268},{"id":"https://openalex.org/C205203396","wikidata":"https://www.wikidata.org/wiki/Q612143","display_name":"Bilinear interpolation","level":2,"score":0.2535000145435333},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.23419","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.23419","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.23419","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.23419","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":false,"raw_source_name":null,"raw_type":"Preprint"},"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":{"Autoregressive":[0],"decoding":[1,47,63],"with":[2],"LLMs":[3],"is":[4,17],"primarily":[5],"bottlenecked":[6],"by":[7,64,124],"GPU":[8,137],"memory":[9,129],"bandwidth,":[10],"especially":[11],"in":[12,134],"edge-computing":[13],"settings.":[14],"While":[15],"quantization":[16,59,66],"essential":[18],"for":[19,36,76,131,147],"mitigating":[20],"this":[21],"bottleneck,":[22],"most":[23],"existing":[24],"methods":[25],"treat":[26],"inference":[27,158],"as":[28,73],"a":[29,56,74,126,135,142,151],"uniform":[30],"process":[31],"and":[32,44,67,98,105,111,157],"fail":[33],"to":[34,79,84],"account":[35],"the":[37,40,45],"asymmetry":[38],"between":[39,154],"compute-bound":[41],"prefill":[42],"stage":[43],"memory-bound":[46],"stage.":[48],"We":[49,119],"propose":[50],"GRINQH":[51,69,101,140],"(GRaded":[52],"INput-based":[53],"Quantization":[54],"Hierarchy),":[55],"weight-only":[57],"post-training":[58],"framework":[60],"that":[61],"accelerates":[62],"unifying":[65],"sparsification.":[68],"leverages":[70],"activation":[71],"magnitudes":[72],"proxy":[75],"computational":[77],"importance":[78],"dynamically":[80],"assign":[81],"weight":[82],"channels":[83],"different":[85],"precision":[86],"levels,":[87],"enabling":[88,115,150],"flexible":[89],"average":[90],"bit":[91],"widths":[92],"during":[93],"decoding.":[94],"Evaluated":[95],"on":[96],"Llama3":[97],"Qwen3":[99],"models,":[100],"outperforms":[102],"state-of-the-art":[103,144],"fixed-":[104],"mixed-precision":[106],"baselines":[107],"at":[108],"comparable":[109],"3-":[110],"4-bit":[112],"settings,":[113],"even":[114],"effective":[116],"2-bit":[117],"generation.":[118],"experimentally":[120],"verify":[121],"theoretical":[122],"speedups":[123],"leveraging":[125],"hierarchical":[127],"nested":[128],"layout":[130],"multi-precision":[132],"storage":[133],"custom":[136],"kernel.":[138],"Ultimately,":[139],"establishes":[141],"new":[143],"Pareto":[145],"frontier":[146],"LLM":[148],"generation,":[149],"dynamic":[152],"trade-off":[153],"generation":[155],"quality":[156],"speed.":[159]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-24T00:00:00"}