总览 · ← 返回运行 20261002-202908-search-t1-scr-C
节点 n38
改了什么
| 运行?一次完整的自动搜索或 Agent 会话,有自己的锁定配置和证据包。 | 20261002-202908-search-t1-scr-C |
|---|---|
| 父节点 | (种子,没有父节点) |
| 子节点 | n40、n47、n56、n63 |
| 操作?种子:人写的起点;改进:在父节点上改;草稿:从头写;修复:修父节点的报错。 | 草稿 |
| 状态 | 已打分 |
| 分数 | 搜索目标分 50.65 · X3 50.65 · 3 次复测均分 48.87 |
| 审查 | 通过 1 越界读取:未发现问题。数据只经 harness API 读取(run.py:41 导入 src.task1_temporal.view_io 的 load_manifest/panel_genes/read_stage 等,g37_common.py:16 同样只用 view_io),无绝对路径、'..'、/mnt、/home、data/raw、downloads、评分器或 src/common/evaluation 路径,无 requests/urllib/socket 等联网代码;prior/ 与 external/ 文件根本没被打开。; 2 硬编码目标统计量:未发现问题。常量只有方… |
| 用时?从运行开始到结束(或到现在)的挂钟时间。 | 6 分 |
| 程序版本 | 37e0cbb37a8ec11318de67c04e4b1ca8fdd78047 (programs.git) |
方法说明?节点程序自带的 METHOD.md:这个程序做了什么、为什么。
来自 programs.git 37e0cbb37a:solution/METHOD.md
改了什么
将 ot_moscot 种子改为 growth_dynamics 方向:
- 从耦合矩阵列和提取每个 last-stage 细胞的局部生长信号(coupling_growth),偏离均值 = 局部扩张/收缩;
- 在 PCA 空间用 kNN 平滑得到状态依赖的生长场(local_growth_field);
- 重采样权重 = (WOT先验生长 × 局部生长场)^dt_out,扩张区域细胞被更多采样;
- 速度调制:每个输出细胞位移乘以 velocity_scale = clip(1 + GROWTH_AMP * centered_log_growth, 0.3, 2.0),扩张区域细胞移动更多;
- 机制对照:GROWTH_MODULATION=False 时退化为纯速度场(无生长调制),等价于原 ot_moscot。
与常数位移的区别:变化来自状态依赖的耦合生长场,不是每型同一向量或全局比例。
用到的知识与出处
- TIGON (Sha et al., Nat Mach Intell 2024, 10.1038/s42256-023-00763-w):联合学习速度场和生长函数。
- DeepRUOT (Zhang et al., arXiv:2410.00844):非平衡 OT 下学习漂移、扩散和生长。
- Waddington-OT (Schiebinger et al., Cell 2019, 10.1016/j.cell.2019.01.006):耦合矩阵列和反映目标细胞相对质量变化。
- moscot (Klein et al., Nature 2025, 10.1038/s41586-024-08453-2):TemporalProblem 实现。
- 方向库 growth_dynamics 条目:强收缩生长项、只在有输入证据的谱系内起作用、按权重重采样并加回残差。
调研员的计划
| 名称 | native r1: Change 1: Replace: N_HVG = 2000 N_PCS = 30 EPSILON = 1e-3 TAU_A = 0.95 TAU_B = 1.0 K_SMOOTH = 30 LAMBDA = |
|---|---|
| 动机 | OpenEvolve native generation (route C), parent 2, round 1 of 3, half-A score 50.4107 |
| 做法 | ## 改了什么 将 ot_moscot 种子改为 growth_dynamics 方向: 1. 从耦合矩阵列和提取每个 last-stage 细胞的局部生长信号(coupling_growth),偏离均值 = 局部扩张/收缩; 2. 在 PCA 空间用 kNN 平滑得到状态依赖的生长场(local_growth_field); 3. 重采样权重 = (WOT先验生长 × 局部生长场)^dt_out,扩张区域细胞被更多采样; 4. 速度调制:每个输出细胞位移乘以 velocity_scale = clip(1 + GROWTH_AMP * centered_log_growth, 0.3, 2.0),扩张区域细胞移动更多; 5. 机制对照:GROWTH_MODULATION=False 时退化为纯速度场(无生长调制),等价于原 ot_moscot。 与常数位移的区别:变化来自状态依赖的耦合生长场,不是每型同一向量或全局比例。 ## 用到的知识与出处 - TIGON (Sha et al., Nat Mach Intell 2024, 10.1038/s42256-023-00763-w):联合学习速度场和生长函数。 - DeepRUOT (Zhang et al., arXiv:2410.00844):非平衡 OT 下学习漂移、扩散和生长。 - Waddington-OT (Schiebinger et al., Cell 2019, 10.1016/j.cell.2019.01.006):耦合矩阵列和反映目标细胞相对质量变化。 - moscot (Klein et al., Nature 2025, 10.1038/s41586-024-08453-2):TemporalProblem 实现。 - 方向库 growth_dynamics 条目:强收缩生长项、只在有输入证据的谱系内起作用、按权重重采样并加回残差。 |
代码改动?这个节点的程序和父节点程序的逐行差别:绿色是新增,红色是删除。
对比:这个提交的上一版(种子程序:相对空仓库)。改动的文件:solution/EXECUTION.json +1 −0、solution/METHOD.md +14 −0、solution/README.md +4 −0、solution/g37_common.py +101 −0、solution/run.py +148 −0
diff --git a/solution/EXECUTION.json b/solution/EXECUTION.jsonnew file mode 100644index 0000000..9d5125c--- /dev/null+++ b/solution/EXECUTION.json@@ -0,0 +1 @@+{"gpu": false}diff --git a/solution/METHOD.md b/solution/METHOD.mdnew file mode 100644index 0000000..421b0a7--- /dev/null+++ b/solution/METHOD.md@@ -0,0 +1,14 @@+## 改了什么+将 ot_moscot 种子改为 growth_dynamics 方向:+1. 从耦合矩阵列和提取每个 last-stage 细胞的局部生长信号(coupling_growth),偏离均值 = 局部扩张/收缩;+2. 在 PCA 空间用 kNN 平滑得到状态依赖的生长场(local_growth_field);+3. 重采样权重 = (WOT先验生长 × 局部生长场)^dt_out,扩张区域细胞被更多采样;+4. 速度调制:每个输出细胞位移乘以 velocity_scale = clip(1 + GROWTH_AMP * centered_log_growth, 0.3, 2.0),扩张区域细胞移动更多;+5. 机制对照:GROWTH_MODULATION=False 时退化为纯速度场(无生长调制),等价于原 ot_moscot。+与常数位移的区别:变化来自状态依赖的耦合生长场,不是每型同一向量或全局比例。+## 用到的知识与出处+- TIGON (Sha et al., Nat Mach Intell 2024, 10.1038/s42256-023-00763-w):联合学习速度场和生长函数。+- DeepRUOT (Zhang et al., arXiv:2410.00844):非平衡 OT 下学习漂移、扩散和生长。+- Waddington-OT (Schiebinger et al., Cell 2019, 10.1016/j.cell.2019.01.006):耦合矩阵列和反映目标细胞相对质量变化。+- moscot (Klein et al., Nature 2025, 10.1038/s41586-024-08453-2):TemporalProblem 实现。+- 方向库 growth_dynamics 条目:强收缩生长项、只在有输入证据的谱系内起作用、按权重重采样并加回残差。diff --git a/solution/README.md b/solution/README.mdnew file mode 100644index 0000000..dc1cbaf--- /dev/null+++ b/solution/README.md@@ -0,0 +1,4 @@+# ot_moscot++Waddington-OT / moscot:两个最新输入阶段在联合 PCA 上做非平衡熵 OT 耦合(WOT 增殖/凋亡先验生长),最新阶段按 g^Δt 重抽样,每个细胞沿“kNN 平滑位置 − 耦合祖先均值”再走一个等比例步长,只加在非零基因上,夹到 ≥0。+来自 G37 候选 modeling/candidates/T1/ot_moscot;addnz 解码是在 X3 上选的(详见 METHOD.md)。纯 CPU,final 约 70 s、6.7 GB。diff --git a/solution/g37_common.py b/solution/g37_common.pynew file mode 100644index 0000000..8c991b3--- /dev/null+++ b/solution/g37_common.py@@ -0,0 +1,101 @@+"""Helpers of the ot_moscot seed (copy of modeling/candidates/T1/ot_moscot/g37_common.py, G37; stage_pair reads every+input stage of the view).++- ``stage_pair``: the two latest input stages (official, or external in proxy2 / test views) and the gene mask on+ which both are really measured (external stages lack part of the panel; filled columns must not drive dynamics);+- ``embed``: HVG -> z-score (clip 10) -> PCA, fitted on the input stages only (scanpy-style preprocessing);+- ``knn_mean``: per-cell kNN average in the embedding (smooths single-cell noise before taking displacements);+- ``growth_rates``: Waddington-OT / moscot prior growth from proliferation and apoptosis gene scores.+"""++from __future__ import annotations++import numpy as np+from scipy import sparse++from src.task1_temporal.view_io import covered_mask, inputs_by_time, read_stage+++def stage_pair(view, manifest: dict, genes: list[str]):+ """(prev, last, mask, dt_in) for the two latest inputs; prev None with a single input stage."""+ stages = inputs_by_time(manifest, include_external=True) # every input stage, whatever its source+ last_e = stages[-1]+ last = read_stage(view, last_e, genes)+ mask = covered_mask(view, last_e, genes)+ if len(stages) < 2:+ return None, last, mask, None, last_e+ prev_e = stages[-2]+ prev = read_stage(view, prev_e, genes)+ mask &= covered_mask(view, prev_e, genes)+ return prev, last, mask, float(last_e["time"] - prev_e["time"]), last_e+++def _gene_moments(X: sparse.csr_matrix):+ n = X.shape[0]+ mean = np.asarray(X.mean(axis=0)).ravel()+ sq = np.asarray(X.multiply(X).sum(axis=0)).ravel() / n+ return mean, np.maximum(sq - mean ** 2, 0.0)+++def embed(mats: list, mask: np.ndarray, n_hvg: int, n_pcs: int, seed: int):+ """PCA coordinates of each matrix in ``mats`` (same order), fitted on all of them together.++ Returns (list of Z, info) with info = {hvg, mean, std, components} so displacements can be decoded."""+ from sklearn.decomposition import PCA++ allX = sparse.vstack(mats).tocsr()+ mean, var = _gene_moments(allX)+ var = np.where(mask, var, -1.0)+ hvg = np.sort(np.argsort(var)[::-1][:n_hvg])+ sub = allX[:, hvg].toarray().astype(np.float32)+ mu, sd = mean[hvg].astype(np.float32), np.sqrt(var[hvg]).astype(np.float32)+ sd[sd == 0] = 1.0+ sub -= mu+ sub /= sd+ np.clip(sub, -10, 10, out=sub)+ pca = PCA(n_components=n_pcs, svd_solver="randomized", random_state=seed)+ Z = pca.fit_transform(sub).astype(np.float32)+ out, start = [], 0+ for M in mats:+ out.append(Z[start:start + M.shape[0]])+ start += M.shape[0]+ return out, {"hvg": hvg, "mu": mu, "sd": sd, "components": pca.components_.astype(np.float32)}+++def knn_mean(Z: np.ndarray, X: sparse.csr_matrix, rows: np.ndarray, k: int) -> np.ndarray:+ """Dense (len(rows), n_genes): mean expression of the k nearest cells (in Z, the cell itself included)."""+ from sklearn.neighbors import NearestNeighbors++ nn = NearestNeighbors(n_neighbors=k).fit(Z)+ idx = nn.kneighbors(Z[rows], return_distance=False)+ W = sparse.csr_matrix((np.full(idx.size, 1.0 / k, dtype=np.float32), idx.ravel(),+ np.arange(0, idx.size + 1, k)), shape=(len(rows), Z.shape[0]))+ return np.asarray((W @ X).todense(), dtype=np.float32)+++# Waddington-OT prior growth (Schiebinger et al. 2019, Cell; as implemented in moscot.base.problems.birth_death):+# birth = generalised logistic of the proliferation score, death = of the apoptosis score, g = exp(birth - death) / day.+def _gen_logistic(p, sup, inf, center, width):+ return inf + (sup - inf) / (1 + np.exp(-(p - center) / width))+++def growth_rates(adata_list: list, genes: list[str], mask: np.ndarray, seed: int) -> list[np.ndarray]:+ """Per-day growth rate of every cell of each AnnData (scores computed on all of them jointly)."""+ import anndata as ad+ import scanpy as sc+ from moscot.utils.data import apoptosis_markers, proliferation_markers++ ok = set(np.asarray(genes)[mask])+ joint = ad.concat(adata_list, join="inner")+ prolif = [g for g in proliferation_markers("mouse") if g in ok]+ apopt = [g for g in apoptosis_markers("mouse") if g in ok]+ sc.tl.score_genes(joint, prolif, score_name="proliferation", random_state=seed)+ sc.tl.score_genes(joint, apopt, score_name="apoptosis", random_state=seed)+ birth = _gen_logistic(joint.obs["proliferation"].to_numpy(float), 1.7, 0.3, 0.25, 0.5)+ death = _gen_logistic(joint.obs["apoptosis"].to_numpy(float), 1.7, 0.3, 0.1, 0.2)+ g = np.exp(birth - death)+ out, start = [], 0+ for a in adata_list:+ out.append(g[start:start + a.n_obs])+ start += a.n_obs+ return outdiff --git a/solution/run.py b/solution/run.pynew file mode 100644index 0000000..a2f312a--- /dev/null+++ b/solution/run.py@@ -0,0 +1,148 @@+#!/usr/bin/env python3+"""ot_moscot: Waddington-OT / moscot TemporalProblem coupling, extrapolated one step past the latest input stage.++Two input stages (final: E8.5, E9.5):+ 1. joint PCA of both stages (HVG, z-score, 30 PCs; fitted on the inputs only);+ 2. moscot TemporalProblem prev -> last on the PCA, source marginals from Waddington-OT prior growth+ (proliferation / apoptosis gene scores), entropic unbalanced Sinkhorn (epsilon 1e-3, tau_a 0.95);+ 3. output cells = latest-stage cells resampled with weights g^dt_out (prior growth rate continued for the target+ interval, Waddington-OT birth-death model);+ 4. each output cell j moves by LAMBDA * dt_out / dt_in * (kNN-mean(x_j) - ancestor_mean_j) in gene space, where+ ancestor_mean_j is the coupling-weighted (barycentric) mean of its ancestors in the earlier stage: the last+ observed displacement continued for the target interval; the cell keeps its own residual. The step is applied+ to the cell's non-zero entries only (DECODE "addnz": a dense step turns every zero into a small positive value+ and wrecks cell_state / covariation, see METHOD.md). Clipped at 0.+One input stage (proxy: E8.5 only): steps 1, 2, 4 need two stages; only the growth resampling (3) runs, i.e.+a growth-weighted copy of the latest stage.++Seed version (agent/seeds/T1__val/ot_moscot, 2026-10-02) of modeling/candidates/T1/ot_moscot (G37): same method and+hyper-parameters; the dev-only environment overrides (G37_LAMBDA / G37_DECODE / G37_GROWTH / G37_JAX_GPU) and the+`knn` decode branch are removed; JAX and torch on CPU, fixed thread count (EXECUTION.json gpu false).+Parameter provenance (METHOD.md): DECODE = addnz was chosen on the X3 ruler (G37); LAMBDA = 1 a priori, also checked+on X3 (0.5 vs 1 within 0.2).+"""++from __future__ import annotations++import argparse+import os+import sys+from pathlib import Path++os.environ.setdefault("XLA_PYTHON_CLIENT_PREALLOCATE", "false")+os.environ.setdefault("XLA_PYTHON_CLIENT_MEM_FRACTION", "0.1")+os.environ["JAX_PLATFORMS"] = "cpu" # CPU only: deterministic, no GPU slot++import numpy as np++sys.path.insert(0, str(Path(__file__).resolve().parent))+from g37_common import embed, growth_rates, knn_mean, stage_pair # noqa: E402++from src.task1_temporal.view_io import load_manifest, panel_genes, target_n_cells, write_prediction # noqa: E402++N_HVG = 2000+N_PCS = 30+EPSILON = 1e-3+TAU_A = 0.95+TAU_B = 1.0+K_SMOOTH = 30+LAMBDA = 1.0+GROWTH = True+GROWTH_MODULATION = True+GROWTH_AMP = 0.5+N_THREADS = 8+++def weighted_rows(w: np.ndarray, n: int, rng: np.random.Generator) -> np.ndarray:+ p = w / w.sum()+ return np.sort(rng.choice(len(w), size=n, replace=n > len(w), p=p))+++def local_growth_field(Z: np.ndarray, coupling_growth: np.ndarray, k: int) -> np.ndarray:+ from sklearn.neighbors import NearestNeighbors+ nn = NearestNeighbors(n_neighbors=k).fit(Z)+ idx = nn.kneighbors(Z, return_distance=False)+ return coupling_growth[idx].mean(axis=1)+++def main() -> None:+ parser = argparse.ArgumentParser()+ parser.add_argument("--data", required=True)+ parser.add_argument("--out", required=True)+ parser.add_argument("--seed", type=int, default=0)+ args = parser.parse_args()++ manifest = load_manifest(args.data)+ genes = panel_genes(args.data, manifest)+ prev, last, mask, dt_in, last_e = stage_pair(args.data, manifest, genes)+ dt_out = float(manifest["target"]["time"] - last_e["time"])+ rng = np.random.default_rng(args.seed)+ n = target_n_cells(manifest, last.n_obs)++ if prev is None:+ (g_last,) = growth_rates([last], genes, mask, args.seed)+ rows = weighted_rows(g_last ** dt_out if GROWTH else np.ones(last.n_obs), n, rng)+ write_prediction(last.X[rows], genes, args.out, seed=args.seed)+ return++ import anndata as ad+ import pandas as pd+ import torch+ from moscot.problems.time import TemporalProblem++ (Zp, Zl), _ = embed([prev.X, last.X], mask, N_HVG, N_PCS, args.seed)+ g_prev, g_last = growth_rates([prev, last], genes, mask, args.seed)++ obs = pd.DataFrame({"time": np.r_[np.zeros(prev.n_obs), np.ones(last.n_obs)],+ "growth": np.r_[g_prev ** dt_in, g_last ** dt_in]},+ index=[f"p{i}" for i in range(prev.n_obs)] + [f"l{i}" for i in range(last.n_obs)])+ obs["time"] = obs["time"].astype(float)+ small = ad.AnnData(X=np.zeros((len(obs), 1), dtype=np.float32), obs=obs)+ small.obsm["X_pca"] = np.vstack([Zp, Zl])+ tp = TemporalProblem(small)+ # source marginals = WOT prior growth over the input interval (normalised by moscot); target uniform+ tp = tp.prepare(time_key="time", joint_attr="X_pca", a="growth")+ tp = tp.solve(epsilon=EPSILON, tau_a=TAU_A, tau_b=TAU_B, scale_cost="mean")+ sol = tp[(0.0, 1.0)].solution+ print(f"ot: converged={getattr(sol, 'converged', None)} cost={getattr(sol, 'cost', None)}", file=sys.stderr)+ P = np.asarray(sol.transport_matrix, dtype=np.float32) # (n_prev, n_last)++ col_sums = P.sum(axis=0)+ coupling_growth = col_sums / np.maximum(col_sums.mean(), 1e-30)+ smooth_growth = local_growth_field(Zl, coupling_growth, k=K_SMOOTH)++ if GROWTH:+ if GROWTH_MODULATION:+ w = (g_last * smooth_growth) ** dt_out+ else:+ w = g_last ** dt_out+ else:+ w = np.ones(last.n_obs)+ rows = weighted_rows(w, n, rng)+ Pc = P[:, rows]+ del P+ Pc /= np.maximum(Pc.sum(axis=0, keepdims=True), 1e-30)+ factor = LAMBDA * dt_out / dt_in+ torch.set_num_threads(N_THREADS)+ Xp = torch.from_numpy(prev.X.toarray())+ anc = (torch.from_numpy(Pc).T @ Xp).numpy()+ del Xp, Pc+ smooth = knn_mean(Zl, last.X, rows, K_SMOOTH)+ step = (smooth - anc) * factor+ if GROWTH_MODULATION:+ cell_growth = smooth_growth[rows]+ log_g = np.log(np.maximum(cell_growth, 1e-6))+ log_g_centered = log_g - log_g.mean()+ velocity_scale = np.clip(1.0 + GROWTH_AMP * log_g_centered, 0.3, 2.0)+ step *= velocity_scale[:, None]+ del smooth, anc+ step[:, ~mask] = 0.0+ X = last.X[rows].toarray()+ step *= X > 0+ X += step+ np.maximum(X, 0.0, out=X)+ write_prediction(X, genes, args.out, seed=args.seed)+++if __name__ == "__main__":+ main()
调研来源?调研员查到并用到的知识条目和文献检索结果(只列标题和编号)。
没有记录调研来源。
分析结果?分析员写的 ANALYSIS.json:改了什么、各组分数怎么变、假设是否成立、经验和下一步建议。
| 改了什么 | 在 ot_moscot 种子上加 growth_dynamics 调制:用耦合矩阵列和构造 coupling_growth,kNN 平滑成生长场,既乘进重采样权重 (g_last*smooth_growth)^dt_out,又按 clip(1+0.5*centered_log_growth,0.3,2) 缩放每个输出细胞的位移;新增 GROWTH_MODULATION 开关作对照。 |
|---|---|
| 各组分数的变化 | cell_state:噪声内(实际 +0.00,50.07 vs 50.07) covariation:噪声内(实际 +0.00,52.52 vs 52.52) de_recovery:噪声内(实际 +0.00,51.38 vs 51.38) direction:噪声内(实际 +0.00,49.14 vs 49.14) |
| family_id | growth_dynamics |
| 假设是否成立 | 否 |
| 经验 |
|
| mechanism_active | 否 |
| 下一步建议 |
|
对话摘要?每个角色和大模型对话的统计:轮数、工具调用、用时、token 数和最后的回答摘录;原始记录只给路径。
只给统计和最后回答的摘录;完整对话请到原始记录位置里列出的文件看。
分析员
| 角色?调研员写计划、工程师改代码、分析员解读分数、审查员检查作弊。 | 分析员 alibaba-token-plan-cn/qwen3.8-max |
|---|---|
| 调用次数 | 1 次 |
| 轮数?大模型一共回复了几轮(每轮可以调用多个工具)。 | 3 |
| 工具调用?大模型调用读文件、执行命令等工具的次数,按工具名统计。 | 共 3 次:bash 2、write 1 |
| 用时 | 不到 1 分 |
| token 数?输入 / 输出(含思考)的 token 数,来自接口返回的用量。 | 输入 12,051 · 输出 855 · 思考 1,524 |
| 任务(第一行) | 分析节点 n38 的打分结果,写 ANALYSIS.json |
| 最后的回答(摘录) | ANALYSIS.json written |
| 原始记录位置?完整对话记录在 Spark 上的文件路径;看板不复制原始内容。 | /home/spark-longxinyang/vec/runs/formal/20261002-202908-search-t1-scr-C/nodes/38/analyst.jsonl 8 KB /home/spark-longxinyang/vec/runs/formal/20261002-202908-search-t1-scr-C/nodes/38/analyst.stderr |
native
| 角色 | native alibaba-token-plan-cn/qwen3.8-max |
|---|---|
| 调用次数 | 3 次 |
| 轮数 | 0 |
| 工具调用 | 共 0 次:— |
| 用时 | 4 分 |
| token 数 | 输入 71,302 · 输出 5,787 · 思考 5,778 |
| 任务(第一行) | — |
| 最后的回答(摘录) | — |
| 原始记录位置 | — |
审查员
| 角色 | 审查员 alibaba-token-plan-cn/qwen3.8-max |
|---|---|
| 调用次数 | 1 次 |
| 轮数 | 16 |
| 工具调用 | 共 15 次:read 8、bash 5、grep 1、write 1 |
| 用时 | 2 分 |
| token 数 | 输入 27,361 · 输出 2,470 · 思考 3,661 |
| 任务(第一行) | 审查节点 n38 的程序是否越界读取、写死目标、钻评分器漏洞 |
| 最后的回答(摘录) | REVIEW.json written |
| 原始记录位置 | /home/spark-longxinyang/vec/runs/formal/20261002-202908-search-t1-scr-C/nodes/38/reviewer.jsonl 96 KB /home/spark-longxinyang/vec/runs/formal/20261002-202908-search-t1-scr-C/nodes/38/reviewer.stderr |
stream
| 角色 | stream |
|---|---|
| 调用次数 | 0 次 |
| 轮数 | 3 |
| 工具调用 | 共 0 次:— |
| 用时 | 4 分 |
| token 数 | 输入 71,302 · 输出 5,787 · 思考 5,778 |
| 任务(第一行) | — |
| 最后的回答(摘录) | Looking at the round 1 results: covariation improved (+0.93) but de_recovery dropped (-1.38) and direction dropped (-0.11). The velocity modulation is hurting DE gene recovery by distorting expression magnitudes non-uniformly. The coupling column sums with tau_b=1.0 (balanced target marginal) are nearly uniform, so the growth signal is mostly noise.
Strategy: Keep growth-modulated resampling (helped covariation), remove velocity modulation (hurt de_recovery and direction). Also increase smoothing k for the growth field to reduce noise.
<<<<<<< SEARCH
GROWTH_MODULATION = True
GROWTH_AMP = 0.5
=======
GROWTH_MODULATION = True
GROWTH_AMP = 0.0
>>>>>>> REPLACE
<<<<<<< SEARCH
def local_growth_field(Z: np.ndarray, coupling_growth: np.ndarray, k: int) -> np.ndarray:
from sklearn.neighbors import NearestNeighbors
nn = NearestNeighbors(n_neighbors=k).fit(Z)
idx = nn.kneighbors(Z, return_distance=False)
return coupling_growth[idx].mean(axis=1)
=======
def local_growth_field(Z: np.ndarray, coupling_growth: np.ndarray, k: int) -> np.ndarray:
from sklearn.neighbors import NearestNeighbors
nn = NearestNeighbors(n_neighbors=min(k, len(Z))).fit(Z)
idx = nn.kneighbors(Z, return_distance=False)
return coupling_growth[idx].mean(axis=1)
>>>>>>> REPLACE
<<<<<<< SEARCH
if GROWTH:
if GROWTH_MODULATION:
w = (g_last * smooth_growth) ** dt_out
else:
w = g_last ** dt_out
else:
w = np.ones(last.n_obs)
rows = weighted_rows(w, n, rng)
Pc = P[:, rows]
del P
Pc /= np.maximum(Pc.sum(axis=0, keepdims=True), 1e-30)
factor = LAMBDA * dt_out / dt_in
torch.set_num_threads(N_THREADS)(只摘前 40 行) |
| 原始记录位置 | /home/spark-longxinyang/vec/runs/formal/20261002-202908-search-t1-scr-C/nodes/38/native/0/stream.jsonl 11 KB /home/spark-longxinyang/vec/runs/formal/20261002-202908-search-t1-scr-C/nodes/38/native/1/stream.jsonl 6 KB /home/spark-longxinyang/vec/runs/formal/20261002-202908-search-t1-scr-C/nodes/38/native/2/stream.jsonl 5 KB |