Breaking Chains with Trees: Model-Parallel Deep Learning with $\mathcal{O}(\log N)$ Time Complexity
用树打破链:具有 $\mathcal{O}(\log N)$ 并行时间复杂度的深度学习
Neeraj Mohan Sushma, Aditya Nagarsekar, Cabrel Teguemne Fokam, Robin Schiewer, Amit Kumar Pal, Anand Subramoney, David Kappel
机构
*
Center for Cognitive Interaction Technology, Bielefeld University(比勒费尔德大学认知交互技术中心)
;
Ruhr Universität Bochum(波鸿鲁尔大学)
;
Birla Institute of Technology and Science, Pilani, Goa Campus(比拉理工学院皮拉尼校区果阿分校)
;
Royal Holloway, University of London(伦敦大学皇家霍洛威学院)
Journal refYoonwon Jung, Aaron S. Cohen, and Ben Bergen. 2026. Discovering Lexical Gaps Using Embeddings from Multilingual LLMs. In Proceedings of the 30th Conference on Computational Natural Language Learning, pages 641-660
The Truncation Blind Spot: How Decoding Strategies Systematically Exclude Human-Like Token Choices
截断盲区:解码策略如何系统性地排除人类样式的令牌选择
Esteban Garces Arias, Nurzhan Sapargali, Christian Heumann, Matthias Aßenmacher
机构
*
Department of Statistics, Ludwig Maximilian University, Munich, Germany(统计系,路德维希-马克西米利安大学,慕尼黑,德国)
;
Munich Center for Machine Learning (MCML)(慕尼黑机器学习中心(MCML))
Leveraging Natural Language Processing to Unravel the Mystery of Life: A Review of NLP Approaches in Genomics, Transcriptomics, and Proteomics
利用自然语言处理解开生命之谜:基因组学、转录组学和蛋白质组学中自然语言处理方法综述
Ella Rannon, David Burstein
机构
*
The Shmunis School of Biomedicine and Cancer Research, George S. Wise Faculty of Life Sciences, Tel-Aviv University(谢蒙尼生物医学与癌症研究学院,乔治·S·威斯生命科学学院,特拉维夫大学)
CommentsPresented at the MFS Cultural AI Conference, Purdue University, September 19, 2025. This essay is provisionally forthcoming in MFS: Modern Fiction Studies