{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/green-a-lightweight-architecture-using","title":"GREEN: a lightweight architecture using learnable wavelets and Riemannian geometry for biomarker exploration","arxiv_id":null,"date":"2024-05-14","proceeding":"bioRxiv 2024 5","authors":["Joseph Paillard","Jörg F. Hipp","Denis A. Engemann"],"abstract":"Spectral analysis using wavelets has proven useful for analyzing electroencephalographic (EEG) signals and identifying biomarkers in a clinical context. Over the past decade, Riemannian geometry has crystalized as a theoretical framework providing robust methods for modeling biomedical outcomes and brain function from multi-channel EEG recordings. Combining both approaches yields applications with higher interpretability and efficiency. Yet these approaches rely on handcrafted rules and sequential optimization. On the contrary, the growing deep learning (DL) literature provides end-to-end trainable models for processing raw EEG. Despite state-of-the-art performance on various prediction tasks, clinical impact remains a challenge, which is at least in part due to their lack of interpretability and interoperability with established neuroscience concepts. In this work we introduce a new lightweight neural network for processing raw EEG data building on wavelet transforms and Riemannian geometry. The proposed architecture termed GREEN (Gabor Riemann EEGNet) is benchmarked on five different prediction tasks (age, sex, eyes-closed detection, dementia diagnosis, EEG pathology) from three different datasets (TUAB, CAUEEG, TDBRAIN) encompassing data from more than 5000 human participants. This new architecture significantly outperformed state-of-the-art non-deep models on several of the benchmarks and performed favorably compared to large DL models on the CAU bench-mark using orders of magnitude fewer parameters. Computational experiments revealed how GREEN facilitates learning sparse representations without compromising performance. We further demonstrate that the modularity of the GREEN architecture allows computing classical measures of phase synchrony, such as pairwise phase-locking values which are found to convey information relevant for predicting dementia diagnosis. Furthermore, the learned wavelets can easily be interpreted as bandpass filters, therefore making this architecture explainable by design. We illustrate this with a classical example of the Berger effect i.e. modulation of 8-10Hz power when closing the eyes. By integrating domain-knowledge in architecture choices, the proposed model benefits from desirable complexity-performance trade-off and learns interpretable representations of EEG. The source code is made publicly available.","url_abs":"https://www.biorxiv.org/content/10.1101/2024.05.14.594142v1","url_pdf":"https://www.biorxiv.org/content/10.1101/2024.05.14.594142v1.full.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"green-a-lightweight-architecture-using","repo_url":"https://github.com/Roche/neuro-green","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"eeg-1","task_name":"EEG"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"Roche/neuro-green","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"73241e3183787debb192e9efbdcf0f581846a0fba9f1d8f3c4e0502bad6184bd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}