This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
What is MDD | |
make any kind of change to a model as well as to the code generated from that model | |
= round-trip engineering = fordward engineering + reserver engineering | |
1. Increased likelihood of scope creep due to ease of change | |
easier to extend function | |
an existing meta-model may contain more functionality than specified in the requirements | |
=> impact supplier & client => confused to identify original requirements & change request |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
1 what is antenna | |
way of converting guided waves in waveguide, feeder cable or transmission line into radiating waves | |
art of antenna design is to ensure this process efficiently as possible | |
2 conditions for radiation | |
charges + not uniform motion = reversing direction = direction changing or oscillating in periodic motion |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Architecture | |
fundamental | |
define guideline | |
communicate with stakeholder | |
cross-cutting concern | |
manage uncertainty | |
conceptual intergrity | |
what kind of storage, how modules interact, where recovery system |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Purpose | |
Data -> classifier -> intelligence | |
Input x -> sentence sentiment classifier -> y (positive or negative) | |
App: | |
Spam filtering | |
image classification | |
Impact of classification |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
find best classifier => maximize likelihood over all possible w0 w1 w2 | |
Data likelihood | |
quality metric -> probability of data | |
learn logistic regression model with maximum likelihood estimation MLE | |
finding best linear classifier with gradient ascent | |
convergence criteria, optimize when dl/dw = 0 but in practice we stop when dl/dw < epsilon |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
step 1 start with empty tree | |
step 2 select a feature to split data | |
FOr each split of tree | |
step3 if nothing more to, make predictions | |
step4 ohter wise go to step 2 and continue recurse on this split | |
Feature split learning = decision stump learning | |
what better: split on credit or term |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Learning simpler decision trees | |
early stopping -> limit depth, use classification error on limit depth of tree, if very few data points | |
Pruning: simplify tree after learning algorithm terminates | |
cost function | |
step 1: consider a split | |
step 2: computer total cost C(t) of split |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
combine multiple simple classifier -> ensemble classifiers | |
y hat = sign(f(x)) | |
Adaboost | |
start same weight for all points alpha = 1/N | |
For t = 1..T | |
learn f(t) with data weight alpha |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Logític clasìication -> stochastic ooptimization | |
-> data and parameter tuning -> deep networks | |
-> regularization -> convolutional networks | |
-> embeddings -> recurrent models | |
deep learning apply in all field, reasearcher, engineer, data scientist |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Precision: fraction of positive predictions that are actually positive | |
recall: fraction of positive data predicted to be positive | |
optimistic = low precision high recall | |
pesstimistic = high precision low recall | |
trade off | |
OlderNewer