Constrained weak identification of Allen--Cahn free energies with surface-tension calibration
该研究通过引入表面张力校准Allen-Cahn识别方法(STAC),解决了无法单独确定自由能势F和界面尺度ε的问题。
该研究通过引入表面张力校准Allen-Cahn识别方法(STAC),解决了无法单独确定自由能势F和界面尺度ε的问题。
研究探讨了在单轮心理健康问答中,选择性检索如何改善或影响回答质量,通过特定条件下的检索需求维度来优化检索策略。
为解决人机长期交互中信息更新不透明问题,提出Transfiver架构,通过共享可编辑状态实现人机协同推理。
本文提出STeReO,一种基于语音和文本检索器的重排序器,通过聚合不同模态数据库解决多模态场景下证据选择问题,提高问答性能。
Existing long-sequence memory models struggle to simultaneously achieve lossless long-term retention and effective overwriting of outdated information. This work proposes Naju, the first model to decouple forgetting and writing mechanisms within a discrete state space. By employing a learnable sigmoid forget gate, an independent write gate, and input-dependent linear read-write mappings, Naju decomposes recurrent updates into orthogonal operations. This design overcomes the theoretical trade-off between retention rate and write strength inherent in conventional single-gate architectures, all while preserving linear time and space complexity. Experiments demonstrate that Naju maintains superior memory retention and overwrite capabilities even when trained on sequences four times longer than baseline lengths, outperforming Mamba on WikiText-103, the Long Range Arena benchmark, and multi-query associative recall tasks, with performance comparable to Transformers.
该研究通过引入表面张力校准Allen-Cahn识别方法(STAC),解决了无法单独确定自由能势F和界面尺度ε的问题。
研究探讨了在单轮心理健康问答中,选择性检索如何改善或影响回答质量,通过特定条件下的检索需求维度来优化检索策略。
为解决人机长期交互中信息更新不透明问题,提出Transfiver架构,通过共享可编辑状态实现人机协同推理。
本文提出STeReO,一种基于语音和文本检索器的重排序器,通过聚合不同模态数据库解决多模态场景下证据选择问题,提高问答性能。
Existing long-sequence memory models struggle to simultaneously achieve lossless long-term retention and effective overwriting of outdated information. This work proposes Naju, the first model to decouple forgetting and writing mechanisms within a discrete state space. By employing a learnable sigmoid forget gate, an independent write gate, and input-dependent linear read-write mappings, Naju decomposes recurrent updates into orthogonal operations. This design overcomes the theoretical trade-off between retention rate and write strength inherent in conventional single-gate architectures, all while preserving linear time and space complexity. Experiments demonstrate that Naju maintains superior memory retention and overwrite capabilities even when trained on sequences four times longer than baseline lengths, outperforming Mamba on WikiText-103, the Long Range Arena benchmark, and multi-query associative recall tasks, with performance comparable to Transformers.