Skip to main content

Blog

Learn About Our Meetup

5000+ Members

MEETUPS

LEARN, CONNECT, SHARE

Join our meetup, learn, connect, share, and get to know your Toronto AI community. 

JOB POSTINGS

INDEED POSTINGS

Browse through the latest deep learning, ai, machine learning postings from Indeed for the GTA.

CONTACT

CONNECT WITH US

Are you looking to sponsor space, be a speaker, or volunteer, feel free to give us a shout.

Author: torontoai

[D] Implementation of Paper ‘vGraph: A Generative Model For Joint Community Detection and Node Representational Learning’ under NeurIPS Reproducibility Challenge 2019

Hi, I have made an implementation of paper ‘vGraph: A Generative Model For Joint Community Detection and Node Representational Learning’ under NeurIPS Reproducibility Challenge 2019, which you can find here: https://github.com/aniket-agarwal1999/vGraph-Pytorch

Hope you all find it useful, feedback on the same would be appreciated.

submitted by /u/aniket_agarwal
[link] [comments]

[R] Why not use e.g. SGD coordinate-wise: learning rate ~ sqrt(variance(theta)/variance(g)) ?

Working on estimating position of minimum by modelling where linear trend of gradients interests zero, simple approximation (corr(g,theta)=1) leads to looking obvious:

learning rate ~ sqrt(var(theta)/var(g))

proportional to width of displacement of theta, and inversely proportional to width of displacement of gradients – assuming they are in line (corr(g,theta)=1), such learning rate would take us exactly to g=0 minimum of parabola in one step.

Adaptive variance estimation is just a matter of maintaining two exponential moving averages: of value and of value2, hence we can e.g. cheaply do it coordinate-wise in SGD – getting 2nd order adaptation of learning rate independently for each coordinate (5th page here).

There is popular square root of mean gradient2 in denominator (e.g. RMSprop, ADAM), but have anybody seen use of variance in SGD optimizers?

submitted by /u/jarekduda
[link] [comments]

[R] New version of MSG-GAN

We are releasing the new version of our MSG-GAN work. https://arxiv.org/abs/1903.06048 today.

Code at https://github.com/akanimax/msg-stylegan-tf.

We present much better experimental evaluation of the method and also incorporate the Multi-scale modifications in stylegan. We also experiment with our newly created (Indian Celebs) dataset (very small 3K) and get very nice results.

Please do check it out. Any feedback / suggestions are most welcome.

submitted by /u/akanimax
[link] [comments]

[R] Demos and Paper – The Weighted Tsetlin Machine: Compressed Representations with Clause Weighting

[R] Demos and Paper - The Weighted Tsetlin Machine: Compressed Representations with Clause Weighting

The Weighted Tsetlin Machine

The real-valued weighting of clauses allows one clause to replace multiple and supports fine-tuning the impact of each clause. The Weighted Tsetlin Machine (WTM) achieves the same accuracy as the vanilla Tsetlin Machine (TM) on MNIST, IMDb, and Connect-4, requiring only 1/4, 1/3, and 1/50 of the clauses, respectively. With the same number of clauses, the WTM outperforms the TM, obtaining peak test accuracies of respectively 98. 58%, 90.15%, and 87.49%. The demos also include FashionMNIST with weighted convolution: https://github.com/cair/pyTsetlinMachine, https://arxiv.org/abs/1911.12607

submitted by /u/olegranmo
[link] [comments]