{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T07:39:05Z","timestamp":1763192345412,"version":"3.45.0"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T00:00:00Z","timestamp":1751241600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T00:00:00Z","timestamp":1751241600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,30]]},"DOI":"10.1109\/ijcnn64981.2025.11229146","type":"proceedings-article","created":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T18:46:15Z","timestamp":1763145975000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["FlexFFN: Hierarchical Dynamic Selection of Feedforward Networks for Large Language Models"],"prefix":"10.1109","author":[{"given":"Miaobo","family":"Hu","sequence":"first","affiliation":[{"name":"Chinese Academy of Sciences,Institute of Information Engineering,BeiJing,China"}]},{"given":"Bokun","family":"Wang","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences,Institute of Information Engineering,BeiJing,China"}]},{"given":"Haoyuan","family":"Teng","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences,Institute of Information Engineering,BeiJing,China"}]},{"given":"Hongyu","family":"Yao","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences,Institute of Information Engineering,BeiJing,China"}]},{"given":"Daren","family":"Zha","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences,Institute of Information Engineering,BeiJing,China"}]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences,Institute of Information Engineering,BeiJing,China"}]},{"given":"Jun","family":"Xiao","sequence":"additional","affiliation":[{"name":"University of Chinese Academy of Sciences,BeiJing,China"}]},{"given":"Lei","family":"Wang","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences,Institute of Information Engineering,BeiJing,China"}]}],"member":"263","reference":[{"author":"Shazeer","key":"ref1","article-title":"Outrageously large neural networks: The sparsely-gated mixture-of-experts layer"},{"author":"Liu","key":"ref2","article-title":"KAN: Kolmogorov-arnold networks"},{"volume":"36","article-title":"Qlora: Efficient finetuning of quantized llms","author":"Dettmers","key":"ref3"},{"key":"ref4","first-page":"5547","article-title":"Glam: Efficient scaling of language models with mixture-of-experts","volume-title":"International Conference on Machine Learning","author":"Du"},{"author":"Lepikhin","key":"ref5","article-title":"GShard: Scaling giant models with conditional computation and automatic sharding"},{"author":"Touvron","key":"ref6","article-title":"LLaMA: Open and efficient foundation language models"},{"article-title":"Episodic memory reader: Learning what to remember for question answering from streaming data","author":"Han","key":"ref7","doi-asserted-by":"crossref","DOI":"10.18653\/v1\/P19-1434"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00276"},{"article-title":"Answering complex open-domain questions through iterative query generation","author":"Qi","key":"ref9","doi-asserted-by":"crossref","DOI":"10.18653\/v1\/D19-1261"},{"article-title":"Bilateral multi-perspective matching for natural language sentences","author":"Wang","key":"ref10","doi-asserted-by":"crossref","DOI":"10.24963\/ijcai.2017\/579"},{"article-title":"The winograd schema challenge","volume-title":"Thirteenth international conference on the principles of knowledge representation and reasoning","author":"Levesque","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3474381"},{"key":"ref13","first-page":"4860","article-title":"AI feynman 2.0: Pareto-optimal symbolic regression exploiting graph modularity","volume":"33","author":"Udrescu"}],"event":{"name":"2025 International Joint Conference on Neural Networks (IJCNN)","start":{"date-parts":[[2025,6,30]]},"location":"Rome, Italy","end":{"date-parts":[[2025,7,5]]}},"container-title":["2025 International Joint Conference on Neural Networks (IJCNN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11227166\/11227148\/11229146.pdf?arnumber=11229146","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T07:36:19Z","timestamp":1763192179000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11229146\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,30]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/ijcnn64981.2025.11229146","relation":{},"subject":[],"published":{"date-parts":[[2025,6,30]]}}}