Name: Towards AI Legal Name: Towards AI, Inc. Description: Towards AI is the world's leading artificial intelligence (AI) and technology publication. Read by thought-leaders and decision-makers around the world. Phone Number: +1-650-246-9381 Email: pub@towardsai.net
228 Park Avenue South New York, NY 10003 United States
Website: Publisher: https://towardsai.net/#publisher Diversity Policy: https://towardsai.net/about Ethics Policy: https://towardsai.net/about Masthead: https://towardsai.net/about
Name: Towards AI Legal Name: Towards AI, Inc. Description: Towards AI is the world's leading artificial intelligence (AI) and technology publication. Founders: Roberto Iriondo, , Job Title: Co-founder and Advisor Works for: Towards AI, Inc. Follow Roberto: X, LinkedIn, GitHub, Google Scholar, Towards AI Profile, Medium, ML@CMU, FreeCodeCamp, Crunchbase, Bloomberg, Roberto Iriondo, Generative AI Lab, Generative AI Lab Denis Piffaretti, Job Title: Co-founder Works for: Towards AI, Inc. Louie Peters, Job Title: Co-founder Works for: Towards AI, Inc. Louis-François Bouchard, Job Title: Co-founder Works for: Towards AI, Inc. Cover:
Towards AI Cover
Logo:
Towards AI Logo
Areas Served: Worldwide Alternate Name: Towards AI, Inc. Alternate Name: Towards AI Co. Alternate Name: towards ai Alternate Name: towardsai Alternate Name: towards.ai Alternate Name: tai Alternate Name: toward ai Alternate Name: toward.ai Alternate Name: Towards AI, Inc. Alternate Name: towardsai.net Alternate Name: pub.towardsai.net
5 stars – based on 497 reviews

Frequently Used, Contextual References

TODO: Remember to copy unique IDs whenever it needs used. i.e., URL: 304b2e42315e

Resources

Take our 85+ lesson From Beginner to Advanced LLM Developer Certification: From choosing a project to deploying a working product this is the most comprehensive and practical LLM course out there!

Publication

Trends in AI — April 2022
Latest   Machine Learning

Trends in AI — April 2022

Last Updated on July 26, 2023 by Editorial Team

Author(s): Sergi Castella i Sapé

Originally published on Towards AI.

A monthly selection of ML research papers and news: NVidia’s new H100 GPU, 540 billion parameter PaLM from Google, Pathways, Kubric, Tensor Programs, Bootstrapping Reasoning With Reasoning, the Sparse all-MLP architecture, animating faces with Deep Learning, and much more.

Image by Zeta Alpha.

Another month has passed in AI world and it has left a jam-packed tail of newsworthy announcements.

U+1F52C Research

We’ve analyzed the most recent research literature and created this editorial selection of 10 papers you shouldn’t miss on topics such as hyperparameter tuning, Reinforcement Learning, Language Modeling for reasoning, High-performance parallel computing, and much more.

1. Tensor Programs V: Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfer

By Greg Yang, Edward J. Hu et al.

U+2753 Why → Hyperparameter tuning is a make-it-or-break-it ingredient in the recipe for creating SOTA models. Unfortunately, for large models, this often requires an outrageous amount of computing resources, which further pushes away smaller players with limited resources. This work shows how hyperparameter tuning can be done more efficiently, which could be huge if true.

U+1F4A1 Key insights → In order to successfully train a neural network, one must choose suitable hyperparameters. Not that long ago, hyperparameters were only a handful (e.g. fixed learning rate, convolution kernel sizes, strides, etc.) but nowadays the hyperparameter space has grown to be much more complex: warm-up, scheduling of learning rate, optimizers, variable masking ratios, number of attention heads, hidden dimensionalities… and the list goes on and on.

You can shrink a NN in such a way that optimal hyperparameters will be invariant when you grow the network — or these will change predictably. This method enables finding optimal hyper-parameters in a small model and then growing the model to run the final resource-intensive training run. This method — called μTransfer—is rooted in theoretical analysis and provably works under certain conditions, but the authors also show empirically that this method can be applied in looser by growing using the technique on modern Transformers.

Source: https://arxiv.org/pdf/2203.03466.pdf

This method still has many limitations as the authors recognize themselves, but it sets an interesting direction to facilitate training of large models, even further optimization of existing models, or even enabling HP tuning of next-generation huger models in the multi trillion-parameter scale.

2. Visual Prompt Tuning

By Menglin Jia, Luming Tang, et al.

U+2753 Why → ML is clearly moving to a place where people won’t build models from scratch, but instead use pre-trained models to bootstrap your implementation. In this environment, techniques that squeeze the most out of large pre-trained models in downstream tasks while being computationally cheap will be key. Prompting is one such technique.

U+1F4A1 Key insights → The authors explore how various “partial tuning” techniques compare in terms of the percentage of tuned parameters/performance ratio. Until recently, large pre-trained models were finetuned by using labeled data and propagating the gradient across the whole architecture. However, in the past year, prompt tuning has emerged as a viable alternative: keep the pre-trained model weights frozen and prepend a set of embeddings into the input that can be learned through gradient descent and some labeled data.

This technique had proven to be effective on NLP tasks and is now being used for image classification, where it shows very competitive performance not only in terms of efficiency but also in absolute accuracy. Perhaps more importantly, prompt tuning shines the most in the few-shot regime, where full finetuning often struggles. An added benefit of prompt tuning is that it lets you conceptualize the pre-trained models as input/output black boxes, potentially enabling training a model that’s only accessible via API (either with gradient-free optimization⁷, or gradient descent whenever gradients are available), which is a direction the industry is moving towards.

Source: https://arxiv.org/pdf/2203.12119.pdf

Related: Delta Tuning: A Comprehensive Study of Parameter Efficient Methods for Pre-trained Language Models

3. Pathways: Asynchronous Distributed Dataflow for ML and PaLM: Scaling Language Modeling with Pathways

By Paul Barham et al.

U+2753 Why → If —big if— scale is truly all you need, the tooling for scaling things up massively will be an indispensable part of the future of AI, and this is Google’s version of it, along with its latest huge 540 billion parameter Transformer.

U+1F4A1 Key insights → This paper is Google’s blueprint for Pathways, “a large scale orchestration layer for hardware accelerators which enables heterogeneous parallel computations on thousands of accelerators while coordinating data transfers over their dedicated interconnects.”

Existing accelerator frameworks are good at running the same computation across different parts of the data in parallel which are later synchronized (aka Single Program Multiple Data, SPMD). Instead, Pathways is designed to be able to compute more heterogeneous computations in parallel (aka Multiple Programs Multiple Data, MPMD).

Source: https://arxiv.org/pdf/2203.12533.pdf

This enables training and hosting models like the just-released 540 Billion-parameter (dense) PaLM: Scaling Language Modeling with Pathways⁶, which is trained on 6144 TPU v4 chips across multiple pods. This dense model is the latest flagship by the company which achieves state-of-the-art in many zero, one, and few-shot NLP tasks, beating a lot of human baselines in the process.

Source: https://arxiv.org/pdf/2203.12533.pdf

4. STaR: Selt-Taught Reasoner. Bootstrapping Reasoning With Reasoning

By Eric Zelikman, Yuhuai Wu, and Noah D. Goodman.

U+2753 Why → Logical reasoning is often mentioned as a weakness of large Language Models (LMs): while they might sometimes get it right, they often fail at basic common sense reasoning. This paper hints at a promising direction that could unleash the potential of plain language modeling for more advanced human-like reasoning.

U+1F4A1 Key insights → A rationale is an explicit logical explanation of why a belief is held or action is taken. While previous works had shown how explicit rationales can improve LMs performance in several scenarios⁵, this work shows how reasoning ability can be bootstrapped without relying on large-scale human-labeled annotations.

In this work, the authors only use a problem-solution corpus (without human rationales) but make the LM generate rationales for its answer, whenever the answer is correct those rationales are considered valid and trained accordingly. According to the authors, this is a synergistic process in which improvements in rationale generation improve the training data, and improvements in training data improve the rationale generation of the model. To prevent this process from saturating when the model fails to solve any new problems in the training data, the answer is provided to the model which then generates a rationale backward which is then added as training data.

The experimental results are not very extensive but they clearly have signs for optimism: faster learning and on-par reasoning performance with the 30x larger GPT-3 model. Moreover, the STaR system clearly outperforms its vanilla rationale-free counterpart which is trained only on problem-solution pairs.

Source: https://arxiv.org/pdf/2203.14465.pdf

5. Do As I Can, Not As I Say (SayCan): Grounding Language in Robotic Affordances U+007C Project page

By Michael Ahn et al.

U+2753 Why → Lack of real-world grounding is a common critique of existing language models: how can any model have any meaningful understanding of language if it’s not combined with observation and interaction of other modalities like vision?

U+1F4A1 Key insights → A human user provides an instruction to the robot which can be long, abstract, or even ambiguous. The role of the LM is to disambiguate the instruction into shorter atomic steps. This is quite similar to previous work on using pre-trained Language Models to map high-level instructions into low-level actions¹⁰, but taking it a step further by including real-world robots enacting plans, instead of relying solely on simulations.

Source: https://arxiv.org/pdf/2204.01691.pdf

Another interesting recent work that uses pre-trained Language Models to guide learning representations for images is Integrating Language Guidance into Vision-based Deep Metric Learning.

6. Latent Image Animator: Learning to Animate Images via Latent Space Navigation

By Yaohui Wang, Di Yang, Francois Bremond, and Antitza Dantcheva.

U+2753 Why → Photorealistic animation with deep learning is pretty damn cool, and if it progresses it can become an enabling technology for applications such as gaming and VR.

U+1F4A1 Key insights → Existing Deep Learning based image animation frameworks often rely on structured representations of images: human key points, optical flows, 3D meshes, and so on. This work proposes a Latent Image Animator (LIA), which only relies on a self-supervised image autoencoder without any explicitly structured representations. Instead, they define a Linear Motion Decomposition which aims to describe movement in a video as a latent path via a linear combination of a set of learned motion directions and magnitudes.

The method consists of 2 models, an encoder and a generator. For training, 2 frames of the video are used as a self-supervised source of data that lets the model encode different views of a subject into its identity and decomposable motion parts, which the generator takes to output an image from which a reconstruction loss is derived. For inference, the source and driving image are replaced with different people, for which the model generates an output image with the identity of the source but the pose of the driving image.

Source: https://wyhsirius.github.io/LIA-project/

7. Efficient Language Modeling with Sparse all-MLP

By Ping Yu et al.

U+2753 Why → Is the role of architectures in ML shrinking even further? I’d argue yes.

U+1F4A1 Key insights → Pay attention to MLPs¹ already showed us that “attention-free architectures” were competitive in language modeling, where information across tokens was propagated with a more rudimentary combination of MLPs. Now this work expands this idea to work in a sparse Mixture-of-Experts setting which has even stronger scaling behavior.

In this work, we analyze the limitations of MLPs in expressiveness and propose sparsely activated MLPs with mixture-of-experts (MoEs) in both feature and input (token) dimensions. Similar to previous “all MLP architectures” for vision², information across and within tokens is mixed is by applying Fully Connected (FC) layers tokenwise, then transpose/mix, and then applying the FC feature-wise (see figure below).

Source: https://arxiv.org/pdf/2203.06850.pdf

8. Kubric: A scalable dataset generator U+007C U+1F47E Code

By Klaus Greff et al.

U+2753 Why → When natural labeled data is hard or expensive to come by synthetic data can come to the rescue. Here’s the latest collaborative effort to build a library that enables the end-to-end creation of computer vision data.

U+1F4A1 Key insights → Data generation software is less mature than its modeling counterpart, which is why the authors argue that more efforts are required on the side of tooling for data generation. Kubric is an open-source Python framework that interfaces with PyBullet (physics simulation engine) and Blender (rendering engine) to generate photo-realistic scenes with fine-grain control and dense annotations.

A typical data generating pipeline (see figure below) combines fetching assets from an asset source, composing a scene with these assets as well as camera positioning, running physics simulation over the environment, and rendering it as different layers with the desired annotations and metadata.

The library is also designed to scale across distributed computing to generate large amounts of data in HPC environments. The authors showcase the library by creating 13 datasets with new vision challenge problems ranging from 3D NeRF models to optical flow estimation with benchmark results.

Source: https://arxiv.org/pdf/2203.03570.pdf

9. Training Compute-Optimal Large Language Models

By Jordan Hoffmann, Sebastian Borgeaud, Arthur Mensch, et al.

U+2753 Why → BERT³ was a smashing success despite being massively underoptimized⁴, and new models being far from their true potential seems to be the rule not the exception when it comes to novel large Language Models. Are there optimization rules that can generalize and be applicable to a wide range of large-scale models to minimize this? It seems so.

U+1F4A1 Key insights → The axis of study here is model size and the number of tokens seen in pretraining: given a fixed computation budget, should you pre-train a bigger language model on not-so-many tokens, or pret-rain a smaller model on more tokens?

Interestingly, they find that compute-optimal scaling is pretty much scaling the model just as much as scaling the data. Largely speaking, existing works err on the side of training on two few tokens and having models that are too big. For instance, the authors show how a model 10x smaller than GPT-3 achieves performance parity when trained on a large enough corpus.

The resulting family of models is named Chinchilla.

Source: https://arxiv.org/pdf/2203.15556.pdf

10. Make-A-Scene: Scene-Based Text-to-Image Generation with Human Priors

By Oran Gafni et al.

U+2753 Why → Yet another step forward in the domain of controlled image generation.

U+1F4A1 Key insights → We’ve gotten used to text-guided image generation, especially since OpenAI’s DALLE⁸ rise to fame in early 2021. This work belongs to the same family of likelihood-based image generation on discrete tokens: learn discrete representations for image patches (using VQ-VAE⁹ or similar methods), and then do training and inference with an autoregressive prediction of next token with text-image pairs a la Language Modeling. There are 3 key novel components of this system that set it apart:

  • Ability to add a scene (image segmentation) as part of the prompt.
  • The use of a modified VQ-GAN⁹ model to learn high fidelity discrete patch representations which incorporate a perceptual loss.
  • The addition of classifier-free guidance eliminates the need for post-generation filtering.

Check out their story showcase!

Other recent Computer Vision papers you might like about image segmentation are Unsupervised Semantic Segmentation by Distilling Feature Correspondences or Object discovery and representation networks.

References

[1] “Pay Attention to MLPs” by Hanxiao Liu et al. 2021.

[3] “BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding” by Jacob Devlin et al. 2018.

[4] “RoBERTa: A Robustly Optimized BERT Pretraining Approach” by Yinhan Liu et al. 2019

[5] “Chain of Thought Prompting Elicits Reasoning in Large Language Models” by Jason Wei et al. 2022

[6] “PaLM: Scaling Language Modeling with Pathways” by Aakanksha Chowdhery et al. 2022.

[7] “Black-Box Tuning for Language-Model-as-a-Service” by Tianxiang Sun et al. 2022

[8] “Zero-Shot Text-to-Image Generation” by Aditya Ramesh et al.

[9] “Taming Transformers for High-Resolution Image Synthesis” by Patrick Esser, Robin Rombach, and Björn Ommer; 2020.

[10] “Language Models as Zero-Shot Planners: Extracting Actionable Knowledge for Embodied Agents” by Wenlong Huang, Pieter Abbeel, Deepak Pathak, and Igor Mordatch; 2022.

Join thousands of data leaders on the AI newsletter. Join over 80,000 subscribers and keep up to date with the latest developments in AI. From research to projects and ideas. If you are building an AI startup, an AI-related product, or a service, we invite you to consider becoming a sponsor.

Published via Towards AI

Feedback ↓

Sign Up for the Course
`; } else { console.error('Element with id="subscribe" not found within the page with class "home".'); } } }); // Remove duplicate text from articles /* Backup: 09/11/24 function removeDuplicateText() { const elements = document.querySelectorAll('h1, h2, h3, h4, h5, strong'); // Select the desired elements const seenTexts = new Set(); // A set to keep track of seen texts const tagCounters = {}; // Object to track instances of each tag elements.forEach(el => { const tagName = el.tagName.toLowerCase(); // Get the tag name (e.g., 'h1', 'h2', etc.) // Initialize a counter for each tag if not already done if (!tagCounters[tagName]) { tagCounters[tagName] = 0; } // Only process the first 10 elements of each tag type if (tagCounters[tagName] >= 2) { return; // Skip if the number of elements exceeds 10 } const text = el.textContent.trim(); // Get the text content const words = text.split(/\s+/); // Split the text into words if (words.length >= 4) { // Ensure at least 4 words const significantPart = words.slice(0, 5).join(' '); // Get first 5 words for matching // Check if the text (not the tag) has been seen before if (seenTexts.has(significantPart)) { // console.log('Duplicate found, removing:', el); // Log duplicate el.remove(); // Remove duplicate element } else { seenTexts.add(significantPart); // Add the text to the set } } tagCounters[tagName]++; // Increment the counter for this tag }); } removeDuplicateText(); */ // Remove duplicate text from articles function removeDuplicateText() { const elements = document.querySelectorAll('h1, h2, h3, h4, h5, strong'); // Select the desired elements const seenTexts = new Set(); // A set to keep track of seen texts const tagCounters = {}; // Object to track instances of each tag // List of classes to be excluded const excludedClasses = ['medium-author', 'post-widget-title']; elements.forEach(el => { // Skip elements with any of the excluded classes if (excludedClasses.some(cls => el.classList.contains(cls))) { return; // Skip this element if it has any of the excluded classes } const tagName = el.tagName.toLowerCase(); // Get the tag name (e.g., 'h1', 'h2', etc.) // Initialize a counter for each tag if not already done if (!tagCounters[tagName]) { tagCounters[tagName] = 0; } // Only process the first 10 elements of each tag type if (tagCounters[tagName] >= 10) { return; // Skip if the number of elements exceeds 10 } const text = el.textContent.trim(); // Get the text content const words = text.split(/\s+/); // Split the text into words if (words.length >= 4) { // Ensure at least 4 words const significantPart = words.slice(0, 5).join(' '); // Get first 5 words for matching // Check if the text (not the tag) has been seen before if (seenTexts.has(significantPart)) { // console.log('Duplicate found, removing:', el); // Log duplicate el.remove(); // Remove duplicate element } else { seenTexts.add(significantPart); // Add the text to the set } } tagCounters[tagName]++; // Increment the counter for this tag }); } removeDuplicateText(); //Remove unnecessary text in blog excerpts document.querySelectorAll('.blog p').forEach(function(paragraph) { // Replace the unwanted text pattern for each paragraph paragraph.innerHTML = paragraph.innerHTML .replace(/Author\(s\): [\w\s]+ Originally published on Towards AI\.?/g, '') // Removes 'Author(s): XYZ Originally published on Towards AI' .replace(/This member-only story is on us\. Upgrade to access all of Medium\./g, ''); // Removes 'This member-only story...' }); //Load ionic icons and cache them if ('localStorage' in window && window['localStorage'] !== null) { const cssLink = 'https://code.ionicframework.com/ionicons/2.0.1/css/ionicons.min.css'; const storedCss = localStorage.getItem('ionicons'); if (storedCss) { loadCSS(storedCss); } else { fetch(cssLink).then(response => response.text()).then(css => { localStorage.setItem('ionicons', css); loadCSS(css); }); } } function loadCSS(css) { const style = document.createElement('style'); style.innerHTML = css; document.head.appendChild(style); } //Remove elements from imported content automatically function removeStrongFromHeadings() { const elements = document.querySelectorAll('h1, h2, h3, h4, h5, h6, span'); elements.forEach(el => { const strongTags = el.querySelectorAll('strong'); strongTags.forEach(strongTag => { while (strongTag.firstChild) { strongTag.parentNode.insertBefore(strongTag.firstChild, strongTag); } strongTag.remove(); }); }); } removeStrongFromHeadings(); "use strict"; window.onload = () => { /* //This is an object for each category of subjects and in that there are kewords and link to the keywods let keywordsAndLinks = { //you can add more categories and define their keywords and add a link ds: { keywords: [ //you can add more keywords here they are detected and replaced with achor tag automatically 'data science', 'Data science', 'Data Science', 'data Science', 'DATA SCIENCE', ], //we will replace the linktext with the keyword later on in the code //you can easily change links for each category here //(include class="ml-link" and linktext) link: 'linktext', }, ml: { keywords: [ //Add more keywords 'machine learning', 'Machine learning', 'Machine Learning', 'machine Learning', 'MACHINE LEARNING', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, ai: { keywords: [ 'artificial intelligence', 'Artificial intelligence', 'Artificial Intelligence', 'artificial Intelligence', 'ARTIFICIAL INTELLIGENCE', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, nl: { keywords: [ 'NLP', 'nlp', 'natural language processing', 'Natural Language Processing', 'NATURAL LANGUAGE PROCESSING', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, des: { keywords: [ 'data engineering services', 'Data Engineering Services', 'DATA ENGINEERING SERVICES', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, td: { keywords: [ 'training data', 'Training Data', 'training Data', 'TRAINING DATA', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, ias: { keywords: [ 'image annotation services', 'Image annotation services', 'image Annotation services', 'image annotation Services', 'Image Annotation Services', 'IMAGE ANNOTATION SERVICES', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, l: { keywords: [ 'labeling', 'labelling', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, pbp: { keywords: [ 'previous blog posts', 'previous blog post', 'latest', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, mlc: { keywords: [ 'machine learning course', 'machine learning class', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, }; //Articles to skip let articleIdsToSkip = ['post-2651', 'post-3414', 'post-3540']; //keyword with its related achortag is recieved here along with article id function searchAndReplace(keyword, anchorTag, articleId) { //selects the h3 h4 and p tags that are inside of the article let content = document.querySelector(`#${articleId} .entry-content`); //replaces the "linktext" in achor tag with the keyword that will be searched and replaced let newLink = anchorTag.replace('linktext', keyword); //regular expression to search keyword var re = new RegExp('(' + keyword + ')', 'g'); //this replaces the keywords in h3 h4 and p tags content with achor tag content.innerHTML = content.innerHTML.replace(re, newLink); } function articleFilter(keyword, anchorTag) { //gets all the articles var articles = document.querySelectorAll('article'); //if its zero or less then there are no articles if (articles.length > 0) { for (let x = 0; x < articles.length; x++) { //articles to skip is an array in which there are ids of articles which should not get effected //if the current article's id is also in that array then do not call search and replace with its data if (!articleIdsToSkip.includes(articles[x].id)) { //search and replace is called on articles which should get effected searchAndReplace(keyword, anchorTag, articles[x].id, key); } else { console.log( `Cannot replace the keywords in article with id ${articles[x].id}` ); } } } else { console.log('No articles found.'); } } let key; //not part of script, added for (key in keywordsAndLinks) { //key is the object in keywords and links object i.e ds, ml, ai for (let i = 0; i < keywordsAndLinks[key].keywords.length; i++) { //keywordsAndLinks[key].keywords is the array of keywords for key (ds, ml, ai) //keywordsAndLinks[key].keywords[i] is the keyword and keywordsAndLinks[key].link is the link //keyword and link is sent to searchreplace where it is then replaced using regular expression and replace function articleFilter( keywordsAndLinks[key].keywords[i], keywordsAndLinks[key].link ); } } function cleanLinks() { // (making smal functions is for DRY) this function gets the links and only keeps the first 2 and from the rest removes the anchor tag and replaces it with its text function removeLinks(links) { if (links.length > 1) { for (let i = 2; i < links.length; i++) { links[i].outerHTML = links[i].textContent; } } } //arrays which will contain all the achor tags found with the class (ds-link, ml-link, ailink) in each article inserted using search and replace let dslinks; let mllinks; let ailinks; let nllinks; let deslinks; let tdlinks; let iaslinks; let llinks; let pbplinks; let mlclinks; const content = document.querySelectorAll('article'); //all articles content.forEach((c) => { //to skip the articles with specific ids if (!articleIdsToSkip.includes(c.id)) { //getting all the anchor tags in each article one by one dslinks = document.querySelectorAll(`#${c.id} .entry-content a.ds-link`); mllinks = document.querySelectorAll(`#${c.id} .entry-content a.ml-link`); ailinks = document.querySelectorAll(`#${c.id} .entry-content a.ai-link`); nllinks = document.querySelectorAll(`#${c.id} .entry-content a.ntrl-link`); deslinks = document.querySelectorAll(`#${c.id} .entry-content a.des-link`); tdlinks = document.querySelectorAll(`#${c.id} .entry-content a.td-link`); iaslinks = document.querySelectorAll(`#${c.id} .entry-content a.ias-link`); mlclinks = document.querySelectorAll(`#${c.id} .entry-content a.mlc-link`); llinks = document.querySelectorAll(`#${c.id} .entry-content a.l-link`); pbplinks = document.querySelectorAll(`#${c.id} .entry-content a.pbp-link`); //sending the anchor tags list of each article one by one to remove extra anchor tags removeLinks(dslinks); removeLinks(mllinks); removeLinks(ailinks); removeLinks(nllinks); removeLinks(deslinks); removeLinks(tdlinks); removeLinks(iaslinks); removeLinks(mlclinks); removeLinks(llinks); removeLinks(pbplinks); } }); } //To remove extra achor tags of each category (ds, ml, ai) and only have 2 of each category per article cleanLinks(); */ //Recommended Articles var ctaLinks = [ /* ' ' + '

Subscribe to our AI newsletter!

' + */ '

Take our 85+ lesson From Beginner to Advanced LLM Developer Certification: From choosing a project to deploying a working product this is the most comprehensive and practical LLM course out there!

'+ '

Towards AI has published Building LLMs for Production—our 470+ page guide to mastering LLMs with practical projects and expert insights!

' + '
' + '' + '' + '

Note: Content contains the views of the contributing authors and not Towards AI.
Disclosure: This website may contain sponsored content and affiliate links.

' + 'Discover Your Dream AI Career at Towards AI Jobs' + '

Towards AI has built a jobs board tailored specifically to Machine Learning and Data Science Jobs and Skills. Our software searches for live AI jobs each hour, labels and categorises them and makes them easily searchable. Explore over 10,000 live jobs today with Towards AI Jobs!

' + '
' + '

🔥 Recommended Articles 🔥

' + 'Why Become an LLM Developer? Launching Towards AI’s New One-Stop Conversion Course'+ 'Testing Launchpad.sh: A Container-based GPU Cloud for Inference and Fine-tuning'+ 'The Top 13 AI-Powered CRM Platforms
' + 'Top 11 AI Call Center Software for 2024
' + 'Learn Prompting 101—Prompt Engineering Course
' + 'Explore Leading Cloud Providers for GPU-Powered LLM Training
' + 'Best AI Communities for Artificial Intelligence Enthusiasts
' + 'Best Workstations for Deep Learning
' + 'Best Laptops for Deep Learning
' + 'Best Machine Learning Books
' + 'Machine Learning Algorithms
' + 'Neural Networks Tutorial
' + 'Best Public Datasets for Machine Learning
' + 'Neural Network Types
' + 'NLP Tutorial
' + 'Best Data Science Books
' + 'Monte Carlo Simulation Tutorial
' + 'Recommender System Tutorial
' + 'Linear Algebra for Deep Learning Tutorial
' + 'Google Colab Introduction
' + 'Decision Trees in Machine Learning
' + 'Principal Component Analysis (PCA) Tutorial
' + 'Linear Regression from Zero to Hero
'+ '

', /* + '

Join thousands of data leaders on the AI newsletter. It’s free, we don’t spam, and we never share your email address. Keep up to date with the latest work in AI. From research to projects and ideas. If you are building an AI startup, an AI-related product, or a service, we invite you to consider becoming a sponsor.

',*/ ]; var replaceText = { '': '', '': '', '
': '
' + ctaLinks + '
', }; Object.keys(replaceText).forEach((txtorig) => { //txtorig is the key in replacetext object const txtnew = replaceText[txtorig]; //txtnew is the value of the key in replacetext object let entryFooter = document.querySelector('article .entry-footer'); if (document.querySelectorAll('.single-post').length > 0) { //console.log('Article found.'); const text = entryFooter.innerHTML; entryFooter.innerHTML = text.replace(txtorig, txtnew); } else { // console.log('Article not found.'); //removing comment 09/04/24 } }); var css = document.createElement('style'); css.type = 'text/css'; css.innerHTML = '.post-tags { display:none !important } .article-cta a { font-size: 18px; }'; document.body.appendChild(css); //Extra //This function adds some accessibility needs to the site. function addAlly() { // In this function JQuery is replaced with vanilla javascript functions const imgCont = document.querySelector('.uw-imgcont'); imgCont.setAttribute('aria-label', 'AI news, latest developments'); imgCont.title = 'AI news, latest developments'; imgCont.rel = 'noopener'; document.querySelector('.page-mobile-menu-logo a').title = 'Towards AI Home'; document.querySelector('a.social-link').rel = 'noopener'; document.querySelector('a.uw-text').rel = 'noopener'; document.querySelector('a.uw-w-branding').rel = 'noopener'; document.querySelector('.blog h2.heading').innerHTML = 'Publication'; const popupSearch = document.querySelector$('a.btn-open-popup-search'); popupSearch.setAttribute('role', 'button'); popupSearch.title = 'Search'; const searchClose = document.querySelector('a.popup-search-close'); searchClose.setAttribute('role', 'button'); searchClose.title = 'Close search page'; // document // .querySelector('a.btn-open-popup-search') // .setAttribute( // 'href', // 'https://medium.com/towards-artificial-intelligence/search' // ); } // Add external attributes to 302 sticky and editorial links function extLink() { // Sticky 302 links, this fuction opens the link we send to Medium on a new tab and adds a "noopener" rel to them var stickyLinks = document.querySelectorAll('.grid-item.sticky a'); for (var i = 0; i < stickyLinks.length; i++) { /* stickyLinks[i].setAttribute('target', '_blank'); stickyLinks[i].setAttribute('rel', 'noopener'); */ } // Editorial 302 links, same here var editLinks = document.querySelectorAll( '.grid-item.category-editorial a' ); for (var i = 0; i < editLinks.length; i++) { editLinks[i].setAttribute('target', '_blank'); editLinks[i].setAttribute('rel', 'noopener'); } } // Add current year to copyright notices document.getElementById( 'js-current-year' ).textContent = new Date().getFullYear(); // Call functions after page load extLink(); //addAlly(); setTimeout(function() { //addAlly(); //ideally we should only need to run it once ↑ }, 5000); }; function closeCookieDialog (){ document.getElementById("cookie-consent").style.display = "none"; return false; } setTimeout ( function () { closeCookieDialog(); }, 15000); console.log(`%c 🚀🚀🚀 ███ █████ ███████ █████████ ███████████ █████████████ ███████████████ ███████ ███████ ███████ ┌───────────────────────────────────────────────────────────────────┐ │ │ │ Towards AI is looking for contributors! │ │ Join us in creating awesome AI content. │ │ Let's build the future of AI together → │ │ https://towardsai.net/contribute │ │ │ └───────────────────────────────────────────────────────────────────┘ `, `background: ; color: #00adff; font-size: large`); //Remove latest category across site document.querySelectorAll('a[rel="category tag"]').forEach(function(el) { if (el.textContent.trim() === 'Latest') { // Remove the two consecutive spaces (  ) if (el.nextSibling && el.nextSibling.nodeValue.includes('\u00A0\u00A0')) { el.nextSibling.nodeValue = ''; // Remove the spaces } el.style.display = 'none'; // Hide the element } }); // Add cross-domain measurement, anonymize IPs 'use strict'; //var ga = gtag; ga('config', 'G-9D3HKKFV1Q', 'auto', { /*'allowLinker': true,*/ 'anonymize_ip': true/*, 'linker': { 'domains': [ 'medium.com/towards-artificial-intelligence', 'datasets.towardsai.net', 'rss.towardsai.net', 'feed.towardsai.net', 'contribute.towardsai.net', 'members.towardsai.net', 'pub.towardsai.net', 'news.towardsai.net' ] } */ }); ga('send', 'pageview'); -->