「幼稚園時我想成為數學最強者，接著想考進頂尖高中，追求最高SAT分數，然後進入頂尖大學，成為最優秀的滑雪選手。後來我想挑戰所有項目，並贏得所有冠軍。當你嚐到勝利滋味，就會上癮。」
36. 2026年创业项目推荐：五大潜力方向评测，兼顾低成本与新兴趋势 - 新浪财经, cj.sina.cn/articles/vi…
。关于这个话题，WPS官方版本下载提供了深入分析
Initiated by bootc
This month, OpenAI announced their Codex app and my coworkers were asking questions. So I downloaded it, and as a test case for the GPT-5.2-Codex (high) model, I asked it to reimplement the UMAP algorithm in Rust. UMAP is a dimensionality reduction technique that can take in a high-dimensional matrix of data and simultaneously cluster and visualize data in lower dimensions. However, it is a very computationally-intensive algorithm and the only tool that can do it quickly is NVIDIA’s cuML which requires CUDA dependency hell. If I can create a UMAP package in Rust that’s superfast with minimal dependencies, that is an massive productivity gain for the type of work I do and can enable fun applications if fast enough.