5 ms·

I am using J on and off, but I am not aware of a ML package for it. Are you writing all algorithms yourself or could you recommend a package?

by pvitz 5y ago

ruste 5y ago
I'd also like to know. I'm considering writing some for fun in GNU APL right now.
liveranga 5y ago
There's a handful of resources around that look fun though I haven't dug into them yet. There's this on the J wiki: https://code.jsoftware.com/wiki/User:Brian_Schott/code/feedforwardNN/code/feedforwardNN https://code.jsoftware.com/wiki/User:Brian_Schott/code/feedf... And there's this YouTube series for APL: https://youtube.com/playlist?list=PLgTqamKi1MS3p-O0QAgjv5vt4NY5OgpiM https://youtube.com/playlist?list=PLgTqamKi1MS3p-O0QAgjv5vt4...
eggy 5y ago
I have a bunch of links to ML material for either APL or J. I don't know of any particular library for J. J is interpreted, so it is not as fast as other implementations. I am mainly using it to experiment on concepts and teach myself more ML in J because of the iterative nature of the REPL, and the succinct code. I can keep what's going on in my head, and glance at less than 100 lines, usually 15 lines, of code to refresh it. There is a series of videos of learning neural networks in APL cited by others here on this thread. Pandas author, Wes McKinney, cited J as an influence in his work on Pandas. Extreme Learning Machine in J (code and PDF are here too): https://github.com/peportier/jelm https://github.com/peportier/jelm Convolutional neural networks in APL (PDF and video on page): https://dl.acm.org/doi/10.1145/3315454.3329960 https://dl.acm.org/doi/10.1145/3315454.3329960 A DSL to implement MENACE (Matchbox Educable Noughts And Crosses Engine) in APL (Noughts and Crosses or Tic-tac-toe): https://romilly.github.io/o-x-o/an-introduction.html https://romilly.github.io/o-x-o/an-introduction.html
- rscho 5y ago
  > J is interpreted, so it is not as fast as other implementations Which implementations are you comparing J to? To my knowledge, all of APLs, K, J are interpreted. BQN is compiled, but still very new. I also know that Dyalog was experimenting on a byte code compiler. I don't think there exists convincing benchmarks comparing those languages.
  - eggy 5y ago
    Yes, not clear on my part. I meant to other ML languages, not other array languages. It's amazing the speed you get from J as an interpreted language; it's been honed by a bunch of clever people over the last few decades.

I am using J on and off, but I am not aware of a ML package for it. Are you writing all algorithms yourself or could you recommend a package?

by pvitz 5y ago

I am using J on and off, but I am not aware of a ML package for it. Are you writing all algorithms yourself or could you recommend a package?

ruste 5y ago

I'd also like to know. I'm considering writing some for fun in GNU APL right now.

liveranga 5y ago

There's a handful of resources around that look fun though I haven't dug into them yet. There's this on the J wiki: https://code.jsoftware.com/wiki/User:Brian_Schott/code/feedforwardNN/code/feedforwardNN https://code.jsoftware.com/wiki/User:Brian_Schott/code/feedf... And there's this YouTube series for APL: https://youtube.com/playlist?list=PLgTqamKi1MS3p-O0QAgjv5vt4NY5OgpiM https://youtube.com/playlist?list=PLgTqamKi1MS3p-O0QAgjv5vt4...

eggy 5y ago

I have a bunch of links to ML material for either APL or J. I don't know of any particular library for J. J is interpreted, so it is not as fast as other implementations. I am mainly using it to experiment on concepts and teach myself more ML in J because of the iterative nature of the REPL, and the succinct code. I can keep what's going on in my head, and glance at less than 100 lines, usually 15 lines, of code to refresh it. There is a series of videos of learning neural networks in APL cited by others here on this thread. Pandas author, Wes McKinney, cited J as an influence in his work on Pandas. Extreme Learning Machine in J (code and PDF are here too): https://github.com/peportier/jelm https://github.com/peportier/jelm Convolutional neural networks in APL (PDF and video on page): https://dl.acm.org/doi/10.1145/3315454.3329960 https://dl.acm.org/doi/10.1145/3315454.3329960 A DSL to implement MENACE (Matchbox Educable Noughts And Crosses Engine) in APL (Noughts and Crosses or Tic-tac-toe): https://romilly.github.io/o-x-o/an-introduction.html https://romilly.github.io/o-x-o/an-introduction.html

rscho 5y ago
> J is interpreted, so it is not as fast as other implementations Which implementations are you comparing J to? To my knowledge, all of APLs, K, J are interpreted. BQN is compiled, but still very new. I also know that Dyalog was experimenting on a byte code compiler. I don't think there exists convincing benchmarks comparing those languages.
- eggy 5y ago
  Yes, not clear on my part. I meant to other ML languages, not other array languages. It's amazing the speed you get from J as an interpreted language; it's been honed by a bunch of clever people over the last few decades.