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

[News] Sam Altman on OpenAI’s Business model

Here is Sam Altman, CEO of OpenAI, talking about their business model (31:26 – 32:13)

https://youtu.be/TzcJlKg2Rc0?t=1886

When asked about how the business model is going to work, he replies:

“The honest answer is that we have no idea. We have never made any revenue. We have no current plans to make revenue. We have no idea about how we may one day generate revenue. We have made a soft promise to investors that once we build this sort-of generally intelligent system, basically we will ask it to figure out a way to generate an investment return.”

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

[D] An easy guide to gauge equivariant convolutional networks

After reading “Gauge Equivariant Convolutional Networks and the Icosahedral CNN” by Cohen et. al. posted here yesterday, I thought I’d share a non-math summary for everyone who doesn’t have the time to read up on an entire field of physics. I really think the fundamental idea of the paper is really cool for everyone doing deep learning.

https://medium.com/@kayzaks/an-easy-guide-to-gauge-equivariant-convolutional-networks-9366fb600b70

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

[P] A lightweight sparse implementation of GraRep (WWW 15)

[P] A lightweight sparse implementation of GraRep (WWW 15)

https://i.redd.it/sop8gops76031.png

Github: https://github.com/benedekrozemberczki/GraRep

Paper: https://www.researchgate.net/publication/301417811_GraRep

Abstract:

In this paper, we present GraRep, a novel model for learning vertex representations of weighted graphs. This model learns low dimensional vectors to represent vertices appearing in a graph and, unlike existing work, integrates global structural information of the graph into the learning process. We also formally analyze the connections between our work and several previous research efforts, including the DeepWalk model of Perozzi et al. as well as the skip-gram model with negative sampling of Mikolov et al. We conduct experiments on a language network, a social network as well as a citation network and show that our learned global representations can be effectively used as features in tasks such as clustering, classification and visualization. Empirical results demonstrate that our representation significantly outperforms other state-of-the-art methods in such tasks.

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

[R] Invitation to a Competition for AI under Uncertainty: Reconnaissance Blind Chess (NeurIPS 2019)

Summary: Create a bot that can play chess blind but with the ability to sense a 3×3 square of the board each turn, as part of a fun, online AI competition of NeurIPS 2019!

Participants do not need to attend the NeurIPS conference and there is no cost to participate. (Play now.)

Slightly Longer Story: All are invited to participate in a computer science competition that will be part of the 2019 Conference on Neural Information Processing Systems (NeurIPS, https://nips.cc/), Reconnaissance Blind Chess.

Many of the favorite studied games in artificial intelligence (AI) such as checkers, chess, and Go lack something that is common and critical in real-life decision making, uncertainty.

This is a competition with a simple but powerful twist on what may be considered the most classic game in AI history, chess. Reconnaissance Blind Chess (RBC) is like chess except a player cannot see where her opponent’s pieces are a priori. Rather, she learns partial information about them with the ability to sense a 3×3 square of the board each turn and from the results of moves.

In comparison to poker, which seems to be the most popularly studied game of imperfect information, RBC includes a critical component of long-term planning. Compared to phantom games like Kriegspiel, in RBC players have much more ability to manage their uncertainty, which we believe makes the game more interesting from an AI perspective and more realistic for most scenarios; players are not completely blind, but rather, metaphorically, they simply cannot look everywhere at once.

For more information on the NeurIPS competition, the game itself, or the API, or to play the game to get a feel for it, visit our website below.

All are welcome to create the best RBC bot they can, and see how well it can play against other bots in the tournament starting on October 21, 2019!

http://rbc.jhuapl.edu

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

[Research] Duration-of-Stay Storage Assignment under Uncertainty

A new type of dataset for all of the ML fellows here to work on (inquiry by email in paper, institution + use case). Longitudinal warehousing storage dataset – first of its kind (AFAAK). Try to predict how long it will stay in the warehouse! (Spoiler: You may first want to properly define what “how long” means first)

Not to mention the company transports 30% of American’s frozen food, so….see if what you eat is in there!

https://arxiv.org/abs/1903.05063

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

[N] Call for papers: RSS Workshop “Scalable Learning for Integrated Perception and Planning”

Workshop Website: https://scalableroboticlearning.github.io/

When: June 22, 2019

Where: Freiburg, Germany @Robotics: Science and Systems (RSS) Conference

Wanted: Extended Abstracts (2-4 pages) are due June 7th, 2019

Topics include

  • Automatized training procedures
  • Interactions between sensing, manipulation and planning
  • Scalable approaches for grasping and generalizing functional grasps
  • End-to-end vs. modular approaches (introspection, suitable metrics, ..)
  • Automatic recovery and failure proof systems

Invited Speakers

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

[P] Dimensionality Reduction Methods for a dataset with continuous and binary features?

I was told to use PCA from my postdoc supervisor, but I realized it is best for continuous features. I’ve looked into splitting my data to do a PCA with continuous features and MCA for binary. My postdoc supervisor said he combined the results – I was wondering how? A PCA returns PC1 and PC2 with coordinates (length = dataframe size). My MCA returns dim1 and dim2 but with 24 coordinates for the binary data. I’m not sure how to proceed?

But if there is another method that someone could recommend would be much appreciated! I am using R currently. But I can use Python too.

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

[D] Generating and Manipulating Faces Using Deep Learning

[D] Generating and Manipulating Faces Using Deep Learning

Nvidia’s research team proposed StyleGAN at the end of 2018, and instead of trying to create a fancy new technique to stabilize GAN training or introducing a new architecture, the paper says that their technique is “orthogonal to the ongoing discussion about GAN loss functions, regularization, and hyper-parameters.”

They also discuss some of the clever techniques (Adaptive Instance Normalization, Style Mixing, Stochastic Noise, Mapping Network) that you’d need to generate images that you exactly want.

This blog covers these topics and contains all the code you need to experiment on your images (Might be interesting to see what you’d look like when you grow old): https://blog.nanonets.com/stylegan-got

Processing gif 80h5lzfex4031…

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