{"id":"https://openalex.org/W7161138844","doi":"https://doi.org/10.1145/3746467.3801519","title":"Prompt Optimization for Large Language Models via Squirrel Search Algorithm","display_name":"Prompt Optimization for Large Language Models via Squirrel Search Algorithm","publication_year":2026,"publication_date":"2026-04-23","ids":{"openalex":"https://openalex.org/W7161138844","doi":"https://doi.org/10.1145/3746467.3801519"},"language":null,"primary_location":{"id":"doi:10.1145/3746467.3801519","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3746467.3801519","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 ACM Southeast Conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3746467.3801519","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034992443","display_name":"Yash Patel","orcid":"https://orcid.org/0000-0001-9373-529X"},"institutions":[{"id":"https://openalex.org/I99490713","display_name":"Stetson University","ror":"https://ror.org/01efrfk30","country_code":"US","type":"education","lineage":["https://openalex.org/I99490713"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yash Patel","raw_affiliation_strings":["Stetson University, DeLand, FL, USA"],"raw_orcid":"https://orcid.org/0009-0005-3121-4161","affiliations":[{"raw_affiliation_string":"Stetson University, DeLand, FL, USA","institution_ids":["https://openalex.org/I99490713"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136120591","display_name":"Nour Amri","orcid":"https://orcid.org/0009-0002-2014-1073"},"institutions":[{"id":"https://openalex.org/I99490713","display_name":"Stetson University","ror":"https://ror.org/01efrfk30","country_code":"US","type":"education","lineage":["https://openalex.org/I99490713"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nour Amri","raw_affiliation_strings":["Stetson University, DeLand, FL, USA"],"raw_orcid":"https://orcid.org/0009-0002-2014-1073","affiliations":[{"raw_affiliation_string":"Stetson University, DeLand, FL, USA","institution_ids":["https://openalex.org/I99490713"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020121506","display_name":"Hala ElAarag","orcid":"https://orcid.org/0000-0001-8053-638X"},"institutions":[{"id":"https://openalex.org/I99490713","display_name":"Stetson University","ror":"https://ror.org/01efrfk30","country_code":"US","type":"education","lineage":["https://openalex.org/I99490713"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hala Elaarag","raw_affiliation_strings":["Department of Mathematics and Computer Science, Stetson University, DeLand, USA"],"raw_orcid":"https://orcid.org/0000-0001-8053-638X","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Stetson University, DeLand, USA","institution_ids":["https://openalex.org/I99490713"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034992443"],"corresponding_institution_ids":["https://openalex.org/I99490713"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.95196029,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"211","last_page":"216"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10028","display_name":"Topic Modeling","score":0.16580000519752502,"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/T10028","display_name":"Topic Modeling","score":0.16580000519752502,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.0966000035405159,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.07769999653100967,"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/metaheuristic","display_name":"Metaheuristic","score":0.5321000218391418},{"id":"https://openalex.org/keywords/language-model","display_name":"Language model","score":0.4465000033378601},{"id":"https://openalex.org/keywords/search-based-software-engineering","display_name":"Search-based software engineering","score":0.43700000643730164},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.42239999771118164},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.41359999775886536},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.37400001287460327},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.3605000078678131}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7369999885559082},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5321000218391418},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.49160000681877136},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.484499990940094},{"id":"https://openalex.org/C137293760","wikidata":"https://www.wikidata.org/wiki/Q3621696","display_name":"Language model","level":2,"score":0.4465000033378601},{"id":"https://openalex.org/C139143892","wikidata":"https://www.wikidata.org/wiki/Q7441615","display_name":"Search-based software engineering","level":5,"score":0.43700000643730164},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.42239999771118164},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.41359999775886536},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.37400001287460327},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.3605000078678131},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3578999936580658},{"id":"https://openalex.org/C205711294","wikidata":"https://www.wikidata.org/wiki/Q176953","display_name":"Rendering (computer graphics)","level":2,"score":0.3458999991416931},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.34049999713897705},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3294999897480011},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30300000309944153},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.2583000063896179},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.25769999623298645},{"id":"https://openalex.org/C91852762","wikidata":"https://www.wikidata.org/wiki/Q3307742","display_name":"Fitness landscape","level":3,"score":0.25769999623298645}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3746467.3801519","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3746467.3801519","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 ACM Southeast Conference","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3746467.3801519","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3746467.3801519","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 ACM Southeast Conference","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W2118044993","https://openalex.org/W2138432470","https://openalex.org/W2152195021","https://openalex.org/W2160660844","https://openalex.org/W2251939518","https://openalex.org/W2791899797","https://openalex.org/W4211173803","https://openalex.org/W4386566526","https://openalex.org/W4386839807","https://openalex.org/W4390362751","https://openalex.org/W4393034763","https://openalex.org/W4404729147","https://openalex.org/W4410188761","https://openalex.org/W4416036567"],"related_works":[],"abstract_inverted_index":{"Adapting":[0],"Large":[1],"Language":[2],"Models":[3],"(LLMs)":[4],"to":[5,22,34,83,107,143],"perform":[6],"effectively":[7],"on":[8,63,129],"specific":[9],"tasks":[10,132],"remains":[11],"challenging.":[12],"Traditional":[13],"methods":[14],"such":[15],"as":[16,113],"Full":[17],"Fine-Tuning":[18,50],"(FFT)":[19],"employ":[20],"backpropagation":[21],"update":[23],"model":[24],"parameters,":[25],"incurring":[26],"substantial":[27],"computational":[28],"and":[29,122],"temporal":[30],"costs.":[31],"Furthermore,":[32],"access":[33],"internal":[35],"parameters":[36],"is":[37],"restricted":[38],"for":[39,162],"black-box":[40,163],"models":[41],"deployed":[42],"through":[43,66],"APIs,":[44],"rendering":[45],"gradient-based":[46],"approaches":[47],"infeasible.":[48],"Parameter-Efficient":[49],"(PEFT)":[51],"techniques,":[52],"particularly":[53],"prompt":[54,68,75,109],"tuning,":[55],"address":[56],"these":[57],"limitations":[58],"by":[59],"optimizing":[60],"task":[61],"performance":[62],"frozen":[64],"LLMs":[65],"systematic":[67],"engineering":[69],"rather":[70,90],"than":[71,91],"parameter":[72,135],"modification.":[73],"However,":[74],"optimization":[76],"constitutes":[77],"a":[78,98,158],"discrete":[79],"combinatorial":[80],"problem":[81],"amenable":[82],"metaheuristic":[84],"solutions":[85],"that":[86,153],"seek":[87],"near-optimal":[88],"configurations":[89],"guaranteed":[92],"global":[93],"optima.":[94],"This":[95],"work":[96],"presents":[97],"novel":[99],"application":[100],"of":[101,141],"the":[102],"Squirrel":[103],"Search":[104],"Algorithm":[105],"(SSA)":[106],"automated":[108],"optimization,":[110],"encoding":[111],"prompts":[112],"continuous":[114],"genome":[115],"vectors":[116],"representing":[117],"instruction":[118],"templates,":[119],"reasoning":[120],"strategies,":[121],"output":[123],"formats.":[124],"We":[125],"evaluate":[126],"our":[127],"approach":[128],"sentiment":[130],"analysis":[131],"using":[133],"3.8B-20B":[134],"models,":[136],"achieving":[137],"relative":[138],"fitness":[139],"reductions":[140],"up":[142],"57%":[144],"with":[145],"convergence":[146],"within":[147],"10\u201333":[148],"iterations.":[149],"Our":[150],"results":[151],"demonstrate":[152],"nature-inspired":[154],"meta-heuristic":[155],"algorithms":[156],"provide":[157],"viable":[159],"gradient-free":[160],"alternative":[161],"LLM":[164],"adaptation.":[165]},"counts_by_year":[],"updated_date":"2026-05-15T06:12:33.780692","created_date":"2026-05-15T00:00:00"}