ENHANCING DATA

SCIENCE OUTCOMES
WITH EFFICIENT
WORKFLOW
NVIDIA DLI
 WORKSHOP OUTLINE

Lab 1 Advanced ETL

• Focuses on developing pipeline for ETL
• Discuss Parquet file format
• Perform EDA on real behavior dataset
• Explore various feature engineering techniques for categorical and continuous features
• Demonstrate interoperability

Lab 2 Advanced Analytics

• Build tree-based classification models
• Perform feature selection and fine-tune models with hyperparameter optimization
• Create additional features using neural network embeddings

Lab 3 Deployment
• Deploy data processing pipeline to Triton Inference Server
• Experiment various inference configurations to optimize performance

Assessment
2
 DATA SCIENCE IS NOT A LINEAR PROCESS
Faster Data Processing Leads to Better Data Science Outcomes

Cross Validate
Exhaustive Feature Selection
Benefits of Accelerated Data Science Workflow Grid Search

• Higher productivity

• More explorations and iterations can improve model accuracy and optimize inference performance

• Lower time to insight and total cost of ownership

3
AGENDA

Lab 1 – Advanced ETL

Lab 2 – Advanced Analytics

• Build tree-based classification models
• Perform feature selection and fine-tune models with
hyperparameter optimization
• Create additional features using neural network embeddings

Lab 3 – Deployment

Assessment

4
 MACHINE LEARNING PROBLEMS
Use Cases in Every Industry

Supervised Unsupervised
• Spam / Not Spam • Group Articles in Categories
Online Services
• Predict Probability Customer Will Click on Ad • Similar Search Results

Financial Services • Credit Card Fraud • Anomaly Detection

Telecom • Predict Customer Churn

• Probability of Readmission
Health Care • Patient Similarity
• Predict Days of Hospital Stay

Real Estate • Predict House Price

• Similar Customers
• Predict Price
• Product Similarity
Retail • Forecast Sales
• Customer Group
• Sentiment Analysis
• Products Which Are Purchased Together

5
 PROBLEM
Data Sizes Continue to Grow

6
 TREE-BASED ENSEMBLE METHODS
Using Multiple Decision Trees

(Random Forest) Bagging is an ensemble technique used to reduce (Gradient Boosting Decision Tree) Boosting is another type of
the variance of predictions by considering results from multiple ensemble learning that combines weak learners to achieve improved
decision tree models that were trained on different sub-samples of the model performance. Weak learners are simple models that predict
same data set relatively poorly. The concept of boosting is to sequentially train
models, each time trying to fit better than before using residual errors
8
 XGBOOST + RAPIDS (LINK)
Optimized Distributed Gradient Boosting Machine Learning Algorithm

• Extreme Gradient Boosting, is a scalable, distributed gradient-boosted decision

tree machine learning algorithm

• Builds upon supervised machine learning, decision trees, ensemble

learning, and gradient boosting concepts

• Gradient boosting is an extension of boosting where the process of additively generating weak models
is formalized as a gradient descent algorithm over an objective function. Gradient boosting sets
targeted outcomes for the next model to minimize errors

• With XGBoost, trees are built in parallel. It follows a level-wise strategy, scanning across gradient values
and using these partial sums to evaluate the quality of splits at every possible split in the training set

• XGBoost includes seamless GPU acceleration, including loading data from cuDF DataFrames and cuPy
arrays. This significantly speeds up model training and improves accuracy for better predictions. The
Dask API makes it easy to scale to multiple nodes or multiple GPUs. Furthermore, the RAPIDS Memory
Manager (RMM) integrates with XGBoost to enable a single, shared, high-speed memory pool

9
 CLASSIFICATION MODEL PERFORMANCE
AUC – ROC Curve

• The AUC (Area Under The Curve) ROC (Receiver Operating Characteristics) curve is an important
evaluation metric for classification models

• ROC – probability curve created by plotting with TPR (True Positive Rate) against FPR (False Positive
Rate)

• AUC – indicates the model’s ability to distinguish classes, a.k.a. separability

• An excellent model has AUC close to 1. When AUC is 0.5, it indicates the model has low class separation
capacity

10
 MODEL TUNING
Low Data Processing Cycle Time Translates to More Experimentation and Higher
Productivity

• Faster runtime means more iterations to improve accuracy

• Faster runtime shortens development time and improves productivity

• Cross validation – resampling method to protect against overfitting

• Feature selection – finding the optimal subset of features

Select Features
• Reduce noise and irrelevant features
and Model Training Evaluation
Parameters
• Reduce model complexity and training time
Iterate
• Improve model inference performance

• Hyperparameter Tuning

• Grid Search

11
 FEATURE SELECTION
Some Methods Require Iterative Model Training

Filter Method Wrapper Method Embedded Method

Definition Generic set of methods Evaluates on a specific Embeds (fix) features during
which do not incorporate a learning algorithm to find model building process.
specific machine learning optimal features Feature selection is done by
algorithm observing each iteration of
model training phase
Time Much faster compared to High computation time Between
Requirement wrapper methods
Strengths Less prone to overfitting High chance of overfitting Reduce overfitting by
because it involves training penalizing the coefficients of
machine learning models a model being too large
with different combination of
features
Methods Correlation, Chi-Square Test, Forward Selection, Backward LASSO, Elastic Net, Ridge
ANOVA, Information Gain Selection, Stepwise Regression
Selection
12
 ENTITY EMBEDDING
Representing Categorical Data With Multiple Dimensions

Entity embedding is a technique for applying deep learning to tabular data. It involves representing the
categorical variables in a continuous way while retaining the relationship between different data values

• Product embedding

• Customer embedding

13
 FINDING THE EMBEDDING SPACE
Applying Deep Learning to Tabular Data

• The embeddings are found by

Embeddin
Categoric
setting up a surrogate problem

al

g
• The embeddings retain semantic
information between categories

Embeddin
Categoric

Dropout
al

g
• Can be used to encode categorical

Dense Linear

Dense Linear
Batch Norm

Batch Norm
variables

Dropout

Dropout

Output
Linear
Embeddin
Categoric
• Dask can be used to enable

al
distributed training:

g
• Data parallelism

• Model parallelism
Continuo

Batch
Norm
us

14
 BUILD DATA PROCESSING PIPELINE AND FINAL
MODEL
Optimize Pipeline Throughput By Eliminating Noisy Features

Cross Validate
Exhaustive Feature Selection
Benefits of Accelerated Data Science Workflow Grid Search

• Higher productivity

• More explorations and iterations can improve model accuracy and optimize inference performance

• Lower time to insight and total cost of ownership

18
END OF LAB 2
19
 LAB 1 SUMMARY

• Focuses on developing pipeline for ETL

• Discuss Parquet file format

• Perform EDA on real behavior dataset

• Explore various feature engineering techniques for categorical and continuous features

• Demonstrate interoperability

20
 LAB 2 SUMMARY

• Build tree-based classification models

• Perform feature selection and fine-tune models with hyperparameter optimization

• Create additional features using neural network embeddings

21
 WHAT’S NEXT (LAB 3)

• Deploy data processing pipeline to Triton Inference Server

• Experiment various inference configurations to optimize performance

22