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.

Category: Reddit MachineLearning

[D] Transfer-Learning for Image classification with effificientNet in Keras/Tensorflow 2 (stanford cars dataset)

I recently wrote about, how to use a ‘imagenet’ pretrained efficientNet implementation from keras to create a SOTA image classifier on custom data, in this case the stanford car dataset. There are some details about BatchNormalization and how to start by training only the classifier layer and later train the complete network. But in the end it’s a good starter for beginners (using the jupyter notebook).

http://digital-thinking.de/keras-transfer-learning-for-image-classification-with-effificientnet/

If you are looking for a PyTorch example (not mine):

https://github.com/morganmcg1/stanford-cars

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

[D] Does winning a Kaggle competition really help your career?

I’ve been wondering about this question:

  • On one hand, conventional wisdom has that winning a Kaggle competition is quite a feather in your cap and it will open all sorts of doors for you. You will have to fend off recruiters with bear spray, given the amount of corporate attention you will receive once you win.
  • On the other the few Kaggle winners that I follow personally (connecting on LinkedIn, following their blogs, etc…) don’t seem to have their careers impacted by their achievements. You don’t see them switching to Google or FB or something a few months after they win. They all stay in the relatively obscure tier 2 role they worked in. Sometimes not even that, they turn out to be freelancers and they remain that way, or something like that….

Any thoughts on what is the more accurate depiction of Kaggle winners?

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

[D] How to test the practical ML knowledge of a job applicant?

I’m involved in evaluating candidates for positions in ML and have been asked how to test their practical skills. We are looking at both potential ML engineers and research scientists. The positions are quite junior, so project management is not something we need to look for. We have a quite broad set of applications going on spanning computer vision, NLP, time series analysis and tabular data.

What I would like to do is to formulate a task (or tasks) that I can use to test the applicants’ practical problem solving abilities. My problem is that the tasks I work with involve a bit sensitive data that I can’t share. Open datasets on the other hand are often already formatted in a “ready-to-model” format with plenty of publicly available solutions, which is usually not the case in real-life projects.

I would like to discuss options that can also serve as a resource for struggling research scientists involved in recruiting. How would you formulate a task that:

  • Is solvable within reasonable time before a job interview
  • Is not more hardware demanding than that you can solve it in a Collab notebook
  • Is not trivially solvable by reading online tutorials
  • Shows that the applicant avoid some common pitfall encountered in practice (data leakage, imbalanced datasets, test set peeking)
  • Shows that the applicant actually has some practical know-how?

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

[R] Beyond Vector Spaces: Compact Data Representations Differentiable Weighted Graphs

[R] Beyond Vector Spaces: Compact Data Representations Differentiable Weighted Graphs

Paper: https://arxiv.org/abs/1910.03524 (NeurIPS 2019)

Code: https://github.com/stanis-morozov/prodige

The paper proposes an embedding layer based on weighted graph instead of vectors. Intuitively, this layer learns to represent concepts/words by their relation to other. Trains by backprop w.r.t. graph edges.

(Left) PRODIGE learned on a subset of MNIST. (Right) zoom-in of some clusters.

  • + Learns interpretable hierarchies from raw objects;
  • + The model is much smaller than typical vector embeddings;
  • The official code is CPU-only, it aint too fast

Interactive version of the plot above: https://neurips-anonymous.github.io/index.html

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