做了一个面向张量计算的语言,可从 Python 调用,支持显式索引和自动求导 - V2EX
V2EX = way to explore
V2EX 是一个关于分享和探索的地方
现在注册
已注册用户请  登录
推荐学习书目
Learn Python the Hard Way
Python Sites
PyPI - Python Package Index
http://diveintopython.org/toc/index.html
Pocoo
值得关注的项目
PyPy
Celery
Jinja2
Read the Docs
gevent
pyenv
virtualenv
Stackless Python
Beautiful Soup
结巴中文分词
Green Unicorn
Sentry
Shovel
Pyflakes
pytest
Python 编程
pep8 Checker
Styles
PEP 8
Google Python Style Guide
Code Style from The Hitchhiker's Guide
bowenfu

做了一个面向张量计算的语言,可从 Python 调用,支持显式索引和自动求导

  •  
  •   bowenfu 3 天前 593 次点击

    最近一直在做一个小项目Einlanghttps://github.com/einlang/einlang ),出发点主要是希望代码本身像数学公式一样直观(但是要够精准无歧义,不需要动脑)。希望下面这几点

    • 张量怎么按索引算
    • 哪里要求和
    • 对谁求导

    都直接体现在代码里。比如平时常见写法可能是这样:

    np.einsum("ik,kj->ij", A, B) jax.grad(loss_fn)(W) 

    在 Einlang 里可以这样写:

    let C[i, j] = sum[k](A[i, k] * B[k, j]); let dloss_dW = @loss / @W; 

    语法上会有一点 Rust 的影子,比如 let 和分号。可以从 Python 调用,也可以直接走命令行。

    如果想试一下,可以执行

     python3 -m pip install "git+https://github.com/einlang/einlang.git" python3 -m einlang -c "let x = 1 + 1; print(x);" 

    不知道这种实现在 AI 时代是否还有意义,希望能看到大家的点评和建议。

    除了矩阵运算和自动求导,Einlang 语法还支持递推。下面这段代码不需要先在外面写循环,再在循环里求导,而是可以直接把“每一步依赖前一步”的关系写出来:

    let alpha = 0.25; let x[0] = 8.0; let x[k in 1..6] = { let prev = x[k - 1]; let loss = prev * prev; let g = @loss / @prev; prev - alpha * g }; 
    目前尚无回复
    关于     帮助文档     自助推广系统     博客     API     FAQ     Solana     865 人在线   最高记录 6679       Select Language
    创意工作者们的社区
    World is powered by solitude
    VERSION: 3.9.8.5 30ms UTC 22:29 PVG 06:29 LAX 15:29 JFK 18:29
    Do have faith in what you're doing.
    ubao msn snddm index pchome yahoo rakuten mypaper meadowduck bidyahoo youbao zxmzxm asda bnvcg cvbfg dfscv mmhjk xxddc yybgb zznbn ccubao uaitu acv GXCV ET GDG YH FG BCVB FJFH CBRE CBC GDG ET54 WRWR RWER WREW WRWER RWER SDG EW SF DSFSF fbbs ubao fhd dfg ewr dg df ewwr ewwr et ruyut utut dfg fgd gdfgt etg dfgt dfgd ert4 gd fgg wr 235 wer3 we vsdf sdf gdf ert xcv sdf rwer hfd dfg cvb rwf afb dfh jgh bmn lgh rty gfds cxv xcv xcs vdas fdf fgd cv sdf tert sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf shasha9178 shasha9178 shasha9178 shasha9178 shasha9178 liflif2 liflif2 liflif2 liflif2 liflif2 liblib3 liblib3 liblib3 liblib3 liblib3 zhazha444 zhazha444 zhazha444 zhazha444 zhazha444 dende5 dende denden denden2 denden21 fenfen9 fenf619 fen619 fenfe9 fe619 sdf sdf sdf sdf sdf zhazh90 zhazh0 zhaa50 zha90 zh590 zho zhoz zhozh zhozho zhozho2 lislis lls95 lili95 lils5 liss9 sdf0ty987 sdft876 sdft9876 sdf09876 sd0t9876 sdf0ty98 sdf0976 sdf0ty986 sdf0ty96 sdf0t76 sdf0876 df0ty98 sf0t876 sd0ty76 sdy76 sdf76 sdf0t76 sdf0ty9 sdf0ty98 sdf0ty987 sdf0ty98 sdf6676 sdf876 sd876 sd876 sdf6 sdf6 sdf9876 sdf0t sdf06 sdf0ty9776 sdf0ty9776 sdf0ty76 sdf8876 sdf0t sd6 sdf06 s688876 sd688 sdf86