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

[R] New neural-network rain forecasting based on satellite images

Hi! We significantly improved the current state of the art quality of nowcasting (rain detection and prediction up to 2 hours) based on satellite images and run it as a service.

We use meteoradar data, satellite images, and weather predictions to feed an unet-based neural network. For now, our service covers almost all Eurasia continent. The whole world will be covered soon!

Video: https://youtu.be/9zd3VR-prYU

Paper: https://arxiv.org/abs/1905.09932

Service: https://yandex.com/weather/nowcast

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

Life Imitating Art: AI Startup Resembles Pied Piper in HBO’s Silicon Valley

Like Silicon Valley’s plot on fictional startup Pied Piper, Compression AI is a scrappy team of developers working on media-compression technology in a tech incubator.

Except instead of being characters in a Hollywood-scripted startup, founders Francis Doumet and Migel Tissera met at a Vancouver coworking space, hired two employees and pulled late nighters to release  their first beta software, dubbed PixelDrive.

Founded in 2018, Compression AI aims to enable faster transmission of media files over the web, even on low-quality internet networks.

It reduces image file sizes up to 80 percent using the company’s neural compression technology, the product of the team’s custom work on convolutional neural networks trained on NVIDIA GPUs.

Doumet and Tissera initially launched PixelDrive as a consumer product. But they soon figured out that the underlying technology is much more valuable to developers because image compression enables faster web page load times and increases search engine rankings. They have since made the technology available as an API for developers.

Doumet and Tissera’s ultimate goal is to bring their technology to video compression. That’s because Tissera — a fan of watching UFC mixed martial arts fights but frustrated with choppy broadcasts — sees a need for improvement in video compression, especially where the internet quality is suboptimal.

Compression AI is a member of NVIDIA Inception, a virtual accelerator program that helps startups get to market faster.

Compressed Launch Date

The neural networks that run the developer API and PixelDrive were trained on the entire ImageNet set of images and many more that were collected from the web, totaling more than 10 million images, Doumet said.

The Compression AI team designed the neural networks, which focused on the part of CNNs known as auto-encoders, he said. The development allowed Compression AI to come up with the optimal image compression for each individual image down to the pixel, according to the company.

The deployed service is powered by NVIDIA P4 GPUs performing inference in the cloud. “We’re best in class in terms of image compression,” said Doumet.

Neural network training was also fast on desktop PCs running NVIDIA GPUs.

Online Business Applications

Improved image compression has potentially big implications for businesses. The startup has multiple pilot tests with companies exploring the benefits.

One is with a major online real estate site. Sites like these rank higher in Google searches if they load faster from better compression of images, said Doumet.

Another is video game apps because lighter file sizes from image compression get lower bounce rates at the time of download.

And online retailers are exploring pilots to get better sales results from fast load times of pages, according to Doumet.

Coming Attraction: Video 

Compression AI is focused on launching compression for video next.

Doumet and Tissera say that even with advances in 4G and the promise of 5G, mobile internet remains bandwidth constrained. For instance, a four-minute video shot in 4K on a mobile device takes roughly 13 minutes to transmit over the average U.S. internet connection.

“Advances in AI create an opportunity to develop more intelligent kinds of codecs that can adapt and optimize for any image to offer a reduced footprint in file size,” said Doumet.

 

Image license and credit: Creative Commons; photo by @noisytoy.net

The post Life Imitating Art: AI Startup Resembles Pied Piper in HBO’s Silicon Valley appeared first on The Official NVIDIA Blog.

[N] Natural Adversarial Examples Slash Image Classification Accuracy by 90%

Researchers from UC Berkeley and the Universities of Washington and Chicago have released a set of natural adversarial examples, which they call “ImageNet-A.” The images are described as real-world, naturally occurring examples that have the potential to highly degrade the performance of an image classifier. For example DenseNet-121 obtains only around two percent accuracy on the new ImageNet-A test set, a drop of approximately 90 percent.

The ImageNet challenge competition was closed in 2017, as it was generally agreed in the machine learning community that the task of image classification was mostly solved and that further improvements were not a priority. It should be noted however that the ImageNet test examples are mostly relatively uncluttered close-up images which do not represent the more challenging object contexts and representations found in real world.

What’s more, it has been shown that adversarial examples that succeed in fooling one classification model can also fool other models that use different architecture or were trained on different datasets. Adversarial attacks therefore have the potential to cause serious and widespread security vulnerabilities across popular AI applications such as facial recognition, self-driving cars, etc.

More in article:

https://medium.com/syncedreview/natural-adversarial-examples-slash-image-classification-accuracy-by-90-702f381acbb8

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

[D] Is the Parallel Distributed Processing book still relevant today?

I was searching for any insightful blog/paper about distributed representation and stumbled upon Chapter 3, titled ‘Distributed Representation’, in the PDP book, and it was quite insightful for me; one of its authors is Geoffrey Hinton after all. There are other cool chapters that I want to read, but I don’t know whether I should invest time in reading a book from the 80’s, so I came here for advice; should I read it in 2019, or there is a better alternative?

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

[D] Is a paper detailing results of a novel application publishable?

I’ve been working on a project relating to learned document embeddings applied in a novel setting for an internship. Would it be worthwhile to write up the results found (which currently look promising) and submit to conferences?

Most papers seem to focus on novel architectures/methods, is there value in papers concerning novel applications? Are there any conferences that are friendlier towards novel applications? Thanks!

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

[D] Good approach for generating treatment plans

I am keeping a record of my mood and what I eat. Also any supplements I take. What I would like to do is generate a sequence of things to eat, supplements to take to try to maximise mood.

I was thinking I could treat it as a sequence of tokens #cereal #lavender #5htp #mcdonalds #dietcoke #sleep8hours #mood-6. Then generate new sequences where you have high mood values. Or I could do auto-correlation between mood and the controllable variables, then find the best correlations. Or I could cast it as a reinforcement learning problem. The agent says what I should do during the next day to try to maximise mood.

Can you guys point me in the direction of some good techniques? I’m a software dev and have some experience with tensorflow…

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

[P] Tweet about your AI/ML Research on @HumansofML!

Do you work in machine learning/artificial intelligence? Do you want to share your work with the public? Sign up to curate @HumansofML, a Twitter account that showcases the people behind the algorithms on a weekly basis!

I created this account in the hopes that highlighting the people behind algorithm development might increase public literacy surrounding artificial intelligence, or at least start conversations about what people are interested in.

The signup form is here: https://forms.gle/Mk4vhgAkn91q3eoG8

The Twitter account can be found at http://twitter.com/humansofml

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

[R] Post ICCV-19 Reviews –Improving Mean Absolute Error against CCE

https://github.com/XinshaoAmosWang/Improving-Mean-Absolute-Error-against-CCE

Improving MAE’s Fitting Ability: Fundamental and Thorough Analysis with A Simple Solution

Project page for Improving Mean Absolute Error against CCE.

Since this paper is released, for your better reference, the ICCV-19 reviews results are released following the practice of OpenReview

A Open Question on whether clean or noisy validation set for ML/DL researchers caring about label noise

  • Reviewer#3’s opinion in final justification: `The validation sets are required to be clean, which greatly decrease the contribution. Many existing methods employ noisy validation set to choose hyper-parameters, e.g., when the risk is consistent. As minimizing risks on the noisy validation set is asymptotically equal to minimizing risk on the clean data.’
  • My opinion discussed with my collaborators: Following the ML literature, a validation set should be clean as we should not expect a ML model to predict noisy data well. In other words, we cannot evaluate/decide a model’s performance on noisy validation/test data. Our goal is to avoid learning faults from noisy data and generalise better during inference.

Positive comments we collected

  • The proposed modification IMAE is quite simple and should be considerably more efficient than other methods that deal with label noise.
  • The theoretical analysis of CCE and MAE is thorough and provides an explanation of the tendency of CCE to overfit to incorrect labels and the underfitting of MAE to the correct labels.
  • The experiments show a significant improvement over CCE in the case of noisy labels which validates the approach. I also appreciate the experiment on MARS with realistic label noise. I appreciate the comparison on Clothing-1M provided by the authors. The results there suggest that under realistic label noise the method actually works well when compared to SotA methods.

What next?

  • We will improve our work based on the ICCV-19 reviews, e.g., adding more experiments.

Introduction

Research questions:

  • Why does MAE work much worse than CCE although it is noise-robust?
  • How to improve MAE against CCE to embrace noise-robustness and high generalisation performance?

Our work is a further study of robust losses following MAE [1] and GCE [2]. They proved MAE is more robust than CCE when noise exists. However, MAE’s underfitting phenomenon is not exposed and studied in the literature. We analysed it thoroughly and proposed a simple solution to embrace both high fitting ability (accurate) and test stability (robust).

Our main purpose is not a proposal to push current best performance under label noise. Instead, we focus on analysing how different losses perform differently and why, which is a fundamental research question.

Our focus is to analyse why CCE overfits while MAE underfits as presented in ablation studies in Table 2. Under unknown real-world noise in Table 3, we only compared with GCE [2] as it is the most related and demonstrated to be the state-of-the-art.

IMAE is suitable for cases where inputs and labels may be unmatched.

Training DNNs requires rethinking data fitting and generalisation. Our main contribution is simple analysis and solution from the viewpoint of gradient magnitude with respect to logits.

Takeaways

📷 📷

  • By ‘CCE is noise-sensitive and overfits training data’, we mean CCE owns high data fitting accuracy but its final test accuracy drops a lot versus its best test accuracy.
  • By ‘MAE is robust’, we mean MAE’s final test accuracy drops only a bit versus its best test one.
  • By ‘MAE underfits training data’, we mean its training and best test accuracies are low.

Please see our empirical evidences which can be observed in Table 2 and Figures 3, 4.

MAE’s fitting ability is much worse than CCE. In other words, CCE overfits to incorrect labels while MAE underfits to correct labels.

  • The robustness/sensitive to noise is from the angle of test accuracy stability/trend, i.e., CCE’s final test accuracy drops a lot versus its best one while MAE’s final one is almost the same as its best one;
  • The claim ‘MAE works worse than CCE’ is from the aspect of best test accuracy since we generally apply early stopping to help CCE.

Results

Label noise is one of the most explicit cases where some observations and their labels are not matched in the training data. In this case, it is quite crucial to make your models learn meaningful patterns instead of errors.

Synthetic noise

📷

📷

📷

Real-world unknown noise

Video Person Re-identification/Retrieval on MARS [4]

📷

Classification on Clothing 1M [a] is here

📷

Hyper-paramter Analysis

📷

📷

📷

Discussion

1. The idea of this paper is quite close to “training deep neural-networks using a noise adaptation layer”? They both intend to change the weight of each sample before sending to softmax, definitely they do in different ways. It decreases the novelty of this paper?

Their critical differences are: 1) Noise Adaption explicitly estimates latent true labels by an additional softmax layer while our IMAE reweights examples based on their input-to-label relevance scores; 2) IMAE reweights samples after softmax, i.e., scaling their gradients as shown in Eq. (22) in our paper.

2. Why uniform noise (symmetric/class-independent noise )?

We choose uniform noise because it is more challenging than asymmetric (class-dependent) noise which was verified in [d] Vahdat et al. Toward robustness against label noise in training deep discriminative neural networks. In NeurIPS, 2017.

3. Why is the performance still okay when noise rate is 80%?

By adding uniform noise, even up to 80%, the correct portion is still the majority, since the 80% are relocated to other 9 classes evenly.

Being natural and intuitive, the majority voting decides the meaningful data patterns to learn. We believe that if the noise accounts the majority, DNNs is hard to learn meaningful patterns. Therefore, the majority voting is our reasonable assumption.

4. The study from the gradient perspective is not new, e.g., Truncated Cauchy Non-Negative Matrix Factorization, ang GCE [2].

Yes, we agree the perspective itself is not new. However, we find how we analyse fundamentally and go to the simple solution via the gradient viewpoint is novel.

Truncated Cauchy Non-Negative Matrix Factorization (TPAMI-2017) and GCE [2] truncate large errors to filter out extreme outliers. Instead, our IMAE adjusts weighting variance without dropping any samples.

5. The robustness is not specific for label noise. I think the method works well for general noise, e.g., outliers.

Yes, that is a great point. Our IMAE is suitable for all cases where inputs and their labels are not semantically matched, which may come from noisy data or labels. Since we only evaluated on label noise, we did not exaggerate its efficacy.

We will test more cases in the future.

6. Is the validation data clean or not? If clean, this would greatly reduce the contribution of the paper.

Following the ML literature, a validation set should be clean as we should not expect a ML model to predict noisy data well. In other words, we cannot evaluate a model’s performance on noisy validation/test data. Our goal is to avoid learning faults from noisy data and generalise better during inference.

7. More experiments with comparison to prior work and more evaluation on real-world datasets with unknown noise?

Our focus is to analyse why CCE overfits while MAE underfits as presented in ablation studies in Table 2. Under unknown real-world noise in Table 3, we only compared with GCE [2] as it is the most related and demonstrated to be the state-of-the-art.

Classification on Clothing 1M [a] is here

📷

Citation

Please kindly cite us if you find our work useful.

@article{wang2019improving, title={Improving {MAE} against {CCE} under Label Noise}, author={Wang, Xinshao and Kodirov, Elyor and Hua, Yang and Robertson, Neil M}, journal={arXiv preprint arXiv:1903.12141}, year={2019} } 

References

[1] A. Ghosh, H. Kumar, and P. Sastry. Robust loss functions under label noise for deep neural networks. In AAAI, 2017.

[2] Z. Zhang and M. R. Sabuncu. Generalized cross entropy loss for training deep neural networks with noisy labels. In NeurIPS 2018.

[3] C. Zhang, S. Bengio, M. Hardt, B. Recht, and O. Vinyals. Understanding deep learning requires rethinking generalization. In ICLR, 2017.

[4] L. Zheng, Z. Bie, Y. Sun, J. Wang, C. Su, S. Wang, and Q. Tian. Mars: A video benchmark for large-scale person re-identification. In ECCV, 2016.

[a] Xiao et al. Learning From Massive Noisy Labeled Data for Image Classification. In CVPR, 2015.

[b] Patrini et al. Making deep neural networks robust to label noise: A loss correction approach. In CVPR, 2017.

[c] Goldberger et al. Training deep neural-networks using a noise adaptation layer. In ICLR, 2017.

[d] Vahdat et al. Toward robustness against label noise in training deep discriminative neural networks. In NeurIPS, 2017.

[e] Tanaka et al. Joint optimization framework for learning with noisy labels. In CVPR, 2018.

[f] Han et al. Masking: A new perspective of noisy supervision. In NeurIPS, 2018.

[g] Jenni et al. Deep bilevel learning. In ECCV, 2018.

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

[P] ProSper: A Python Library for Probabilistic Sparse Coding with Non-Standard Priors and Superpositions

We recently released the source code of a number of Sparse Coding algorithms under a common Python module called ProSper. ProSper contains contains a parallelised implementation of the Binary Sparse Coding (BSC) [1], Gaussian Sparse Coding (GSC) [2], Maximum Causes Analysis (MCA) [3], Maximum Magnitude Causes Analysis (MMCA) [4], Ternary Sparse Coding (TSC) [5], and Discrete Sparse Coding [7] models. All these probabilistic generative models are trained using a truncated Expectation Maximisation (EM) algorithm [6].

It is designed to have a uniform interface across algorithms as well as logging and reporting utilities. Therefore, it simplifies switching between the different Sparse Coding algorithms.

[1] M. Henniges, G. Puertas, J. Bornschein, J. Eggert, and J. Lücke (2010). Binary Sparse Coding. Proc. LVA/ICA 2010, LNCS 6365, 450-457.

[2] A.-S. Sheikh, J. A. Shelton, J. Lücke (2014). A Truncated EM Approach for Spike-and-Slab Sparse Coding. Journal of Machine Learning Research, 15:2653-2687.

[3] G. Puertas, J. Bornschein, and J. Lücke (2010). The Maximal Causes of Natural Scenes are Edge Filters. Advances in Neural Information Processing Systems 23, 1939-1947.

[4] J. Bornschein, M. Henniges, J. Lücke (2013). Are V1 simple cells optimized for visual occlusions? A comparative study. PLOS Computational Biology 9(6): e1003062.

[5] G. Exarchakis, M. Henniges, J. Eggert, and J. Lücke (2012). Ternary Sparse Coding. International Conference on Latent Variable Analysis and Signal Separation (LVA/ICA), 204-212.

[6] J. Lücke and J. Eggert (2010). Expectation Truncation and the Benefits of Preselection in Training Generative Models. Journal of Machine Learning Research 11:2855-2900.

[7] G. Exarchakis, and J. Lücke (2017). Discrete Sparse Coding. Neural Computation, 29(11), 2979-3013.

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