Paper List
-
Evolutionarily Stable Stackelberg Equilibrium
通过要求追随者策略对突变入侵具有鲁棒性，弥合了斯塔克尔伯格领导力模型与演化稳定性之间的鸿沟。
-
Recovering Sparse Neural Connectivity from Partial Measurements: A Covariance-Based Approach with Granger-Causality Refinement
通过跨多个实验会话累积协方差统计，实现从部分记录到完整神经连接性的重建。
-
Atomic Trajectory Modeling with State Space Models for Biomolecular Dynamics
ATMOS通过提供一个基于SSM的高效框架，用于生物分子的原子级轨迹生成，弥合了计算昂贵的MD模拟与时间受限的深度生成模型之间的差距。
-
Slow evolution towards generalism in a model of variable dietary range
通过证明是种群统计噪声（而非确定性动力学）驱动了模式形成和泛化食性的演化，解决了间接竞争下物种形成的悖论。
-
Grounded Multimodal Retrieval-Augmented Drafting of Radiology Impressions Using Case-Based Similarity Search
通过将印象草稿基于检索到的历史病例，并采用明确引用和基于置信度的拒绝机制，解决放射学报告生成中的幻觉问题。
-
Unified Policy–Value Decomposition for Rapid Adaptation
通过双线性分解在策略和价值函数之间共享低维目标嵌入，实现对新颖任务的零样本适应。
-
Mathematical Modeling of Cancer–Bacterial Therapy: Analysis and Numerical Simulation via Physics-Informed Neural Networks
提供了一个严格的、无网格的PINN框架，用于模拟和分析细菌癌症疗法中复杂的、空间异质的相互作用。
-
Sample-Efficient Adaptation of Drug-Response Models to Patient Tumors under Strong Biological Domain Shift
通过从无标记分子谱中学习可迁移表征，利用最少的临床数据实现患者药物反应的有效预测。
Covering Relations in the Poset of Combinatorial Neural Codes
Pacific Northwest National Laboratory | Florida Atlantic University
30秒速读
IN SHORT: This work addresses the core challenge of navigating the complex poset structure of neural codes to systematically test the conjecture linking convex neural codes to representable oriented matroids.
核心创新
- Methodology Provides the first complete characterization of upward covering relations in the poset P_Code of combinatorial neural codes.
- Theory Introduces a constructive method to generate all codes that cover a given neural code, based on the concept of isolated subsets within its intersection completion.
- Methodology Establishes a key lemma (Lemma 3.1) showing that a morphism between codes uniquely extends to a morphism between their intersection completions, preserving surjectivity.
主要结论
- A code C covers a code D in P_Code if and only if its intersection completion C_hat covers D_hat (Lemma 3.3).
- If C covers D, then C_hat is isomorphic to D_hat_[I] for some isolated subset I ⊆ D_hat (Theorem 3.5).
- All codes covering a given code D can be constructed via four explicit types of operations on isolated subsets of D_hat, as defined in Definition 3.9 and Table 1.
摘要: A combinatorial neural code is a subset of the power set 2[n] on [n]={1,…,n}, in which each 1≤i≤n represents a neuron and each element (codeword) represents the co-firing event of some neurons. Consider a space X⊆ℝd, simulating an animal’s environment, and a collection 𝒰={U1,…,Un} of open subsets of X. Each Ui⊆X simulates a place field which is a specific region where a place cell i is active. Then, the code of 𝒰 in X is defined as code(𝒰,X)={σ⊆[n]|⋂i∈σUi∖⋃j∉σUj≠∅}. If a neural code 𝒞=code(𝒰,X) for some X and 𝒰, we say 𝒞 has a realization of open subsets of some space X. Although every combinatorial neural code obviously has a realization by some open subsets, determining whether it has a realization by some open convex subsets remains unsolved. Many studies attempted to tackle this decision problem, but only partial results were achieved. In fact, a previous study showed that the decision problem of convex neural codes is NP-hard. Furthermore, the authors of this study conjectured that every convex neural code can be realized as a minor of a neural code arising from a representable oriented matroid, which can lead to an equivalence between convex and polytope convex neural codes. Even though this conjecture has been confirmed in dimension two, its validity in higher dimensions is still unknown. To advance the investigation of this conjecture, we provide a complete characterization of the covering relations within the poset 𝐏𝐂𝐨𝐝𝐞 of neural codes.