Media
Stochastic Shared Embeddings: Data-driven Regularization of Embedding Layers
Wu, Liwei, Li, Shuqing, Hsieh, Cho-Jui, Sharpnack, James
In deep neural nets, lower level embedding layers account for a large portion of the total number of parameters. Tikhonov regularization, graph-based regularization, and hard parameter sharing are approaches that introduce explicit biases into training in a hope to reduce statistical complexity. Alternatively, we propose stochastically shared embeddings (SSE), a data-driven approach to regularizing embedding layers, which stochastically transitions between embeddings during stochastic gradient descent (SGD). Because SSE integrates seamlessly with existing SGD algorithms, it can be used with only minor modifications when training large scale neural networks. We develop two versions of SSE: SSE-Graph using knowledge graphs of embeddings; SSE-SE using no prior information. We provide theoretical guarantees for our method and show its empirical effectiveness on 6 distinct tasks, from simple neural networks with one hidden layer in recommender systems, to the transformer and BERT in natural languages. We find that when used along with widely-used regularization methods such as weight decay and dropout, our proposed SSE can further reduce overfitting, which often leads to more favorable generalization results.
Are YOU a kinesthetic or auditory learner?
Whether you're studying for an exam or revising for a presentation, a quiz on identifying different learning methods promises to help you maximise the amount of information you can retain. Formed of ten questions, the quick quiz by Tutor House asks participants to consider how they would respond in a series of scenarios. This technique reveals if they would benefit most from visual, auditory, read and write or kinesthetic (interactive) learning methods. Created by Tutor House in partnership with educational experts, the quiz considers the widely used VARK (Visual, Aural, Read/write, and Kinesthetic) learning styles developed by Fleming's in 1987. Visual learners are likely to respond to visual stimuli like photos and videos to remember things.
r/MachineLearning - [News] Sam Altman on OpenAI's Business model
Sounds a lot like the road that led to an AI winter historically... I think we're well past the point where that's a genuine risk of AI interest globally cooling down at all (it's already very practical and profitable in many arenas just with what we have) but openAI themselves? If historical trends are any indication, that kind of talk will buy them at most 5 years of normal investor questions, 5 years of severe questions, then bankruptcy. They've very generously got a decade to figure something actually practical out, and realistically the clock might only have five years on it or less. Wonder if they'll invent a thing that'll teach them to make money before then, haha.
Machine Learning Engineer โ NLP
The Personalization team makes deciding what to play next on Spotify easier and more enjoyable for every listener. We seek to understand the world of music and podcasts better than anyone else so that we can make great recommendations to every individual person and keep the world listening. Everyday, hundreds of millions of people all over the world use the products we build which include destinations like
No Time Like Now to Leverage AI - TEK2day
In deploying artificial intelligence ("AI") or one of its sibling technologies โ machine learning and deep learning โ the first order of business is defining the business problem. Next, understand your enterprise data and third party data in terms of scope and quality. Once those elements are in place, you are ready to embark on your AI journey upon which your imagination will be the primary limiting factor. These are problems that can be answered by deploying some combination of AI, machine learning, deep learning/neural networks and/or natural language processing ("NLP"). Data quality is important โ "garbage in, garbage out".
Samsung developing algorithm that only needs one picture to create a fake video
As if the world of deep-faked pictures and video wasn't scary enough, researchers from Samsung's AI center in Moscow have demonstrated an algorithm that can fabricate videos using only one image. In a video demonstration and a paper published in the pre-print journal ArXiv, the researchers show the capabilities of what is described as'one-shot' and'few-shot' machine learning. The results of their system bring to life popular faces like those of surrealist painter Salvador Dali and actress Marilyn Monroe using a single still image. The more images that are fed into the program, the more realistic the resulting video becomes. Though a single image translated into a moving face may look noticeably altered, a sample of 32 images produces a moving picture with near lifelike accuracy.
Using Deep Networks and Transfer Learning to Address Disinformation
Dhamani, Numa, Azunre, Paul, Gleason, Jeffrey L., Corcoran, Craig, Honke, Garrett, Kramer, Steve, Morgan, Jonathon
We also demonstrate the the detection of inflammatory, inauthentic, or otherwise ability to use this architecture to transfer knowledge nefarious communication. Character-level convolutional from labeled data in one domain to related neural networks (CNNs) are particularly well-suited for (supervised and unsupervised) tasks. Characterlevel this task--as opposed to a word-level model--because they neural networks and transfer learning are allow for non-vernacular discourse, misspelling, and other particularly valuable tools in the disinformation social media features (e.g., emoticons) to be learned without space because of the messy nature of social media, the constraint of fixed vocabularies (Zhang et al., 2015). We lack of labeled data, and the multi-channel tactics implement an adaptation of a neural network architecture of influence campaigns. We demonstrate their effectiveness recently demonstrated to be effective for text classification in several tasks relevant for detecting (Zhang et al., 2015; Jรณzefowicz et al., 2016). The method disinformation: spam emails, review bombing, is purely content-based and does not require any additional political sentiment, and conversation clustering.
Scaling Video Analytics on Constrained Edge Nodes
Canel, Christopher, Kim, Thomas, Zhou, Giulio, Li, Conglong, Lim, Hyeontaek, Andersen, David G., Kaminsky, Michael, Dulloor, Subramanya R.
As video camera deployments continue to grow, the need to process large volumes of real-time data strains wide area network infrastructure. When per-camera bandwidth is limited, it is infeasible for applications such as traffic monitoring and pedestrian tracking to offload high-quality video streams to a datacenter. This paper presents FilterForward, a new edge-to-cloud system that enables datacenter-based applications to process content from thousands of cameras by installing lightweight edge filters that backhaul only relevant video frames. FilterForward introduces fast and expressive per-application "microclassifiers" that share computation to simultaneously detect dozens of events on computationally constrained edge nodes. Only matching events are transmitted to the cloud. Evaluation on two real-world camera feed datasets shows that FilterForward reduces bandwidth use by an order of magnitude while improving computational efficiency and event detection accuracy for challenging video content. This paper is an extended version of (Canel et al., 2019).
Gravity-Inspired Graph Autoencoders for Directed Link Prediction
Salha, Guillaume, Limnios, Stratis, Hennequin, Romain, Tran, Viet Anh, Vazirgiannis, Michalis
Graph autoencoders (AE) and variational autoencoders (VAE) recently emerged as powerful node embedding methods. In particular, graph AE and VAE were successfully leveraged to tackle the challenging link prediction problem, aiming at figuring out whether some pairs of nodes from a graph are connected by unobserved edges. However, these models focus on undirected graphs and therefore ignore the potential direction of the link, which is limiting for numerous real-life applications. In this paper, we extend the graph AE and VAE frameworks to address link prediction in directed graphs. We present a new gravity-inspired decoder scheme that can effectively reconstruct directed graphs from a node embedding. We empirically evaluate our method on three different directed link prediction tasks, for which standard graph AE and VAE perform poorly. We achieve competitive results on three real-world graphs, outperforming several popular baselines.