{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:42:29Z","timestamp":1763811749947,"version":"3.45.0"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:00:00Z","timestamp":1759104000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:00:00Z","timestamp":1759104000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,9,29]]},"DOI":"10.1109\/itw62417.2025.11240519","type":"proceedings-article","created":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T18:39:40Z","timestamp":1763750380000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Algorithm for Sparse Fourier Transform of Generalized q-ary Functions"],"prefix":"10.1109","author":[{"given":"Darin","family":"Tsui","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology,School of Electrical and Computer Engineering,Atlanta,GA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunal","family":"Talreja","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology,School of Electrical and Computer Engineering,Atlanta,GA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amirali","family":"Aghazadeh","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology,School of Electrical and Computer Engineering,Atlanta,GA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.7554\/eLife.16965"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2016.7795442"},{"key":"ref3","first-page":"723","article-title":"A scalable Walsh-Hadamard regularizer to overcome the low-degree spectral bias of neural networks","volume-title":"Uncertainty in Artificial Intelligence","author":"Gorji","year":"2023"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-021-25371-3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2109649118"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206686"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.4286571"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1038\/nature17995"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1004771"},{"article-title":"SHAP zero explains all-order feature interactions in black-box genomic models with near-zero query cost","year":"2024","author":"Tsui","key":"ref14"},{"article-title":"On recovering higher-order interactions from protein language models","year":"2024","author":"Tsui","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2017.2746568"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214029"},{"key":"ref18","article-title":"Efficiently learning Fourier sparse set functions","volume":"32","author":"Amrollahi","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.93"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.36"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736670"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2679053"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-7865-4_5"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875155"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2404441"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3029050"},{"key":"ref28","doi-asserted-by":"crossref","DOI":"10.1109\/ITW62417.2025.11240519","article-title":"Efficient algorithm for sparse fourier transform of generalized q-ary functions","author":"Tsui","year":"2025"},{"volume-title":"Heart disease","year":"1989","author":"Janosi","key":"ref29"}],"event":{"name":"2025 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2025,9,29]]},"location":"Sydney, Australia","end":{"date-parts":[[2025,10,3]]}},"container-title":["2025 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11240243\/11240249\/11240519.pdf?arnumber=11240519","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T05:56:54Z","timestamp":1763791014000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11240519\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,29]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/itw62417.2025.11240519","relation":{},"subject":[],"published":{"date-parts":[[2025,9,29]]}}}