Python Daily
频道 @pythondaily
Daily Python News Question, Tips and Tricks, Best Practices on Python Programming Language Find more reddit channels over at @r_channels
评分(满分 10) 5.6 评分(满分 10) 5.6 /10 系统评分 · 评分说明
- 订阅者
- 2,569
- 最近发帖
- 1 天前
资料采集于 2026-11-21 · 非实时
简介
Daily Python News Question, Tips and Tricks, Best Practices on Python Programming Language Find more reddit channels over at @r_channels
查看 Telegram 上的原始简介
Daily Python News
Question, Tips and Tricks, Best Practices on Python Programming Language
Find more reddit channels over at @r_channels
评分构成
算法 v1 · 评分说明系统基础分 5.6(1 + 维度贡献 4.59) · 最终 5.6
维度 输入 维度值 权重 贡献
内容质量 未经判官审核 (按中性值 0.5 计) · 40% 0.50 40% +1.80
安全风险 未经判官审核 (按中性值 0.5 计) · 30% 0.50 30% +1.35
受众规模 2,569 订阅者 · 12% 0.50 12% +0.54
近期活跃 最近发帖 1 天前 · 10% 1.00 10% +0.90
Telegram 认证 无认证 · 4% 0.00 4% —
官网互链 无关联工具 · 4% 0.00 4% —
近期动态
在 Telegram 查看全部required distance contract.
A correctness gate had been added, but the final independent test still detected a failure.
This illustrates why adding a validation step and achieving complete specification coverage are different problems.
# The measurement problem
A related difficulty emerged during kNN performance evaluation.
When several Docker sandboxes were benchmarked concurrently, the identical seed program received scores ranging from approximately 0.02 to 1.0.
Because runtime was part of the fitness function, system load could substantially affect candidate rankings.
The study ther…
2 次浏览
quality: How good was the best valid candidate found anywhere in the search?
Selection quality: How good was the program the system actually chose?
These are not necessarily the same.
The approximate selection regrets across the three runs were 0.000, 2.204, and 2.258.
The sample is too small to establish a general relationship between search budget and reliability. Nevertheless, it demonstrates a concrete failure mode: increasing the number of generated candidates can produce strong valid solutions without ensuring that the selection mechanism retains them.
# Finding 2: Higher fitness sc…
2 次浏览
Can LLM-guided evolution optimize the wrong objective? An empirical study of OpenEvolve, evaluator failures, and independently verified algorithm quality R
https://preview.redd.it/etdxyixkwx2i1.png?width=1536&format=png&auto=webp&s=548b6a3539765b7c4548c46e9bae3408076ac748
https://preview.redd.it/xfewtn11wx2i1.png?width=1536&format=png&auto=webp&s=4d6a4cc3f81e32419f89be5a18de86a9acba5a01
There is an interesting problem at the intersection of LLM-guided program synthesis, evolutionary computation, and automated scientific discovery.
What happens when an AI system successfully discovers a be…
2 次浏览
Help me to understand the basics D
Attention , multi head attention for every word there could be multiple queries. Multi head repeat multiple times .
And Einstein sum ?
1. Query key similarity
2.Attention weight
3. Weighted average
What are all of these ? I am super confused with all of these things
https://redd.it/1y1seqg
@pythondaily
5 次浏览
dataviz 1.0: a fast plotting crate (120+ chart types, live windows, 3D, maps) with Python/JS/C
I just released 1.0 of dataviz, a plotting library I've been building in Rust. Some numbers from the reproducible benchmarks (800×600 PNG, one thread):
| Chart | dataviz | plotters | matplotlib |
|---|---:|---:|---:|
| line, 100k points | 2.2 ms | 5.9 ms | 50 ms |
| scatter, 100k points | 9.9 ms | 16.6 ms | 82 ms |
| histogram, 1M values | 2.1 ms | 2.8 ms | 50 ms |
| line, 10M points | 0.13 s, +7 MB | 0.48 s, +315 MB | 0.53 s, +1162 MB |
What's in it:
- its own anti-aliased rasterizer (multi-core,…
9 次浏览