Jie Hua’s Bioinformatics Notes
  • Archive
  • About

Home

A working notebook of reproducible bioinformatics — genomes, structures, and data visualization.

Bioinformatics Notes · Vol. 01

Jie Hua

Notes on bioinformatics, genomes, and the craft of data visualization.

Search the notes Ctrl K

Browse the archive

Since 2025 · Biomedical Center, LMU · Munich

Genomes Structures Viz

Latest notes

From the notebook

View all notes

图 1 ECO 的结构:基因组 → 表达 → 程序 → 行为 → 选择,选择结果通过变异回到基因组。橙色箭头是唯一的”学习”通道,它不包含梯度。 | Figure 1. The ECO architecture: genome → expression → program → behaviour → selection, with the result of selection returning to the genome through mutation. The orange arrow is the only learning channel, and it contains no gradient.

What If We Never Invented Neural Networks?
如果计算的单位不是权重,而是可遗传的程序:一个约 300 行的寄存器机系统、20 个种子、五组消融,记录它能适应什么、不能适应什么。
Jie Hua
Nov 17, 2026

图 1 (a)Rastrigin 景观上的两种搜索:梯度流从一个点出发,选择维持一个种群。背景为损失等值线。(b)最优损失随评估次数的变化。梯度流困在局部极小(损失约 18),选择找到了接近全局的解(约 0.3)。 | Figure 1. (a) Two searches on the Rastrigin landscape: gradient flow starts from a single point, selection maintains a population. The background shows loss contours. (b) Best loss against evaluations. Gradient flow stalls in a local minimum (loss about 18) while selection finds a near-global solution (about 0.3).

Is Intelligence Evolved or Trained?
从细菌趋化到人工生态系统:四个可复现实验,比较梯度下降与自然选择、拓扑演化、质量—多样性搜索与分工的收益,并记录演化的失败条件。
Jie Hua
Nov 16, 2026

图 14 (a)被动学习器需要更多干预样本才能适应;主动学习器一开始就在正确的位置。(b)反事实效应估计:环境 B 的真值为 0,环境 C 的真值为 −0.6。被动学习器在 C 中给出 +0.11,符号错了。 | Figure 14. (a) The passive learner needs many more interventional samples to adapt; the active learner starts in the right place. (b) Counterfactual effect estimates: the true value is 0 in environment B and −0.6 in C. The passive learner gives +0.11 in C — the wrong sign.

Is the LLM the Final Road to AGI?
九个基准、四十条公开成绩与三组原创计算:LLM 的能力增长是否真的在放缓,Scaling Law 能推到哪一步,以及被动语料为何不足以识别因果结构。
Jie Hua
Nov 15, 2026

图 1 成本景观。(a) 在”一万块 H100、理想弱扩展”情景下,模拟不同原子数与不同生物时间所需的墙钟年数(对数色标);白线是 1 天、1 年、10³ 年、10⁶ 年的等值线。(b) 一年墙钟时间能触及的生物时间,作为原子数的函数;蓝线标出最小细胞的 105 分钟细胞周期。 | Figure 1. Cost landscape. (a) Wall-clock years needed to simulate a given atom count for a given biological time, under an ideal “10,000 H100” weak-scaling scenario (log colour scale); white contours mark one day, one year, 10³ and 10⁶ years. (b) Biological time reachable in one wall-clock year as a function of atom count; the blue line marks the 105-minute cell cycle of the minimal cell.

From Molecules to Cells: Can Microphysics Derive Life?
十组可复现计算,从全原子 MD 的成本墙、结构不可辨识性、Mori–Zwanzig 记忆,到非平衡通量、分岔、误差传播、空间与量子尺度。
Jie Hua
Nov 12, 2026

图 1 (a)两千年间的求仙与抗衰时间线,横轴为距今年数(对数刻度),颜色区分传说/宫廷记载、炼丹文本、对照实验与人体试验。(b)从机制被证明到”完成的人体健康寿命终点试验”之间的年数;八条机制中,至今没有一条走完这一步。 | Figure 1. (a) Two millennia of immortality claims and ageing research; the x-axis is years before 2026 on a log scale, colours distinguish legend/court record, alchemical text, controlled experiment and human trial. (b) Years between a mechanism’s demonstration and a completed human healthspan endpoint; none of the eight has completed that step.

Longevity: From Immortality Elixirs to Anti-Aging Myths
十五组可复现计算,从求仙史、进化衰老理论、十二项衰老标志,到表观遗传时钟、重编程安全窗、癌症权衡与死亡风险的数学边界。
Jie Hua
Nov 12, 2026

图 1 AI 建模范式的六个阶段。每个阶段不是替代前一个,而是把模型必须回答的问题向前推一格:从”是什么”到”像什么”,到”接下来是什么”,到”如果这样做会怎样”,最后到”这个系统能不能自己维持下去”。 | Figure 1. Six stages in AI modelling. Each stage does not replace the previous one; it pushes the question one notch outward: from “what is it” to “what does it look like”, to “what comes next”, to “what happens if I do this”, and finally to “can the system keep itself alive”.

Simulating Life: The Final Sanctuary of Artificial Intelligence
从语言、图像、物理到虚拟细胞:四组可复现实验,追问 AI 模拟生命究竟还差哪几步。
Jie Hua
Nov 6, 2026

Is Evolution a Search Algorithm? How Life Explores Nearly Infinite Possibilities
把进化写成一个搜索问题:搜索空间有多大、适应度景观为什么崎岖、漂变与选择如何分工、中性网络怎样让生命穿越低谷,最后把自然选择、贝叶斯推断、梯度下降与强化学习放进同一个更新规则里比较。
Jie Hua
Nov 2, 2026
No matching items
Jie Hua Bioinformatics Notes
Archive About Homepage GitHub RSS
© 2025 · Built with Quarto · Published on Netlify