0% found this document useful (0 votes)
17 views5 pages

Mobile Phone Policy in Exams

Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
17 views5 pages

Mobile Phone Policy in Exams

Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

POSSESSION OF MOBILES IN EXAMS IS A UFM PRACTICE.

Name \lcwJ-a~ jhl Enrolment No. d-,{jal.l(QllQ /81.\.


Jaypee Institute of Information Technology, Noida
I
Tl Examination, Odd Semester 2023
Semester - 7th
Course Title: Introduction to Deep Learning Max. Hours: 1Hr
Course Code: 18812CS428 Max. Marks: 20

After pursuing this course, the students will be able to:


C434-3.1 Summarized tJ1e basic concept of machine learning and deep learning.
C434-3.2 ldentify the basic theory of ANN, probability theory, error minimization, and regulari:zation techniques
C434-3.3 Experiment with the Convolution Neural Networks for image recognition and Computer Vision.
C434-3.4 Apply Recurrent Neural Networks and LSTM for temporal data
C434-3.S Assess the various deep learning techniques on real-time problems.

~ T h e National Center for Health Statistics publishes data on heights and weights in Vital and Health
Statistics. A random sample of 11 males aged 18-24 years gave the following data, where x denotes
height, in inches, and y denotes weight, in pounds. (CO-l(Understanding), 6 Marks]

J/"Deteranine the regression equation f o v ~ a r k s ]


].:,. Apply the stochastic gradient descent to the above equation to minimize error up to 2 iterations
assu1ning learning rate a=0.1 fl Marks
X 65 67 71 71 66 75 67 70 71 69 69
y 175 133 185 163 126 198 153 163 159 151 155
p---A coin is flipped I 00 times. Given that there were 55 heads, find the maximum likelihood estimation
for the probability p of heads on a single toss. [CO-2(Understanding), 3 Marks)
· y Given in the table reduce the dimension from 2 to I using the principal component analysis (PCA)
~ algorithm. [C0-1 (Understandin2), 6 Marksl
Feature!·
XI 4 8 13 7
X2 II 4 5 14
4. ,,0:1assify the two-dimensional pattern shown in the figure below using the perceptron network. The
symbol '+' indicates the + I and the symbol 'x' indicates the -1. Assume initial weights and bias zero
and a=l. The target output for pattern "C" is+ 1 and for "A." is -I
[CO-2(Understanding), 3 Marks]

+ + +
+ X X
+ + + Pattern "C"

X + x·
+ + + .Pattern "A"
+ ·x +
~ you implement XNOR with MP neuron Justify your answer with a proper explanation.
[CO-2(Understanding), 2 Marks]
,( POS§JfSSION OF MO BIL ES IN EXA M IS
UFM PRACTICE.
Nam e ~ &\'oh cl,{ J b"
Enr ollm ent No. &..o\o ~ ~
Jay pee Ins titu te of Info rma tion Technology
, Noida
Test-2 Exa min atio n, Od d Semester 2023
[Link] VII Semester
Course Title: Introduction to Deep Learnin
g Max. Time: 1 Hr
Course Code: 18B12CS428 •
Ma L Marks: 20
COi Understand the basic con t of machine leam
CO2
i .
Understand the basic theo of ANN, robabilit
C03 A the convolutional neural networks for i . [Link] and re [Link] techni ues.
C04 A recurrent neural networks and LSTM for d com uter vision.
COS Assess the various dee ues on rea - blems.
Note: Attempt all the questions.

~o ns ide r the convolutional neural network


defi
in the shape of output volume and number ~fpa ned by layer in the left column of table given below. Fill
rameters at each layer. You can write activation
fonnat (H,W,C), where H, W, C are height, widt shape in the
h and channel dimensions respectively. Unless
assume padding I, stride 1 where appropriate. specified,
Use notation as given belpw
• CONVx-N denotes the convolutional layer"wi
th N filters with height and width equal to x.
• POOL-n denotes an x n max pooling layer
with stride n and Opadding.
• [Link] flattens its inputs
• FC-N denotes a fully connected layer with
N neurons.
Layer Activation Volume Dimensions
j!l_Eut Number of parameters
32 X 32 X 3
CO~'V3-8 0
ReLU
POOL-2
CONV3-16
ReLU
POOL-2
FLATTEN
FC-10

~v en following input matrix, perform conv [C0-3(Apply); 6 mar u]


olution with stride 1 and 2.
1 1 1 0 0
0 1 1 1 0 1 0 1
0 0 1 1 1 0 1 0
0 0 1 1 0 1 0 1
0 1 1 0 0

Image input 3 x 3 kernel


I
Apply max pooling and average pooling to the
results from above convolutions. Use 2 x 2 filte
l for both the pooling operations. [C0-3(Apply r with stride
), 6 marks]

~ ~ u have a dataset Dl with 1 million labelled training exam


with l 00 labelled training examples. Your frien ples for classification and dataset D2
d trains a model from scratch on dataset D2.
train on D 1, and then apply transfer learning You decide to
to train on D2. State one problem your friend
with his approach. How does your approach is likely to find
address this problem? [ CO-l(Understandin
g), 2 Marks]
I

·, r
✓while the model does well on training set, it only achieves an accuracy of 85%
You conclude that model is over fitting and plan to use L on validation data set:
1 or L2 regularization to fix the issue. However,
before you can do so, you learn from lab mate that some
of the examples in the data may be incorrectly
labelled. Which form of regularization would you prefe
r to use and why? [ CO-2 (Und erstan ding) , 1
Marks]

~on side r the following network. Use backpropagation


to determine the updated weights of wS and w8
after first iteration, assum ing a learning rate of 0.5. the sigmo
id function is used as an activation function
in all layers. [C0-2 (lJnd entan ding) , S marks]

0-0~
!..l_
'1st POSSE SSION OF MOBIL ES IN EXAMS IS A UFM PRACT ICE.
tnc

-nt
IC, Name~ ~:JR~ Enrollmen t Nodd ~tl 4n <'(,
l11
Jaypee Institute of Information Technology, Noida
End Semester Examination, Odd Semester 2023
-
=1J
Semeste r- 7th
Course Title: Introduction to Deep Learning
Max. Hours: lHr
rI Course Code: 18B12CS428
Max. Marks: 3S
r

After punuing this course, the students will be able to:


C434-3.1 Summarized the basic concept of machine learning and deep learning.
C434-3.2 Identify the basic theory of ANN, probability theory. error minimization, and regularization techniques
C434-3.3 Experiment with the Convolution Neural Networks for image recognition and Computer Vision.
C434-3.4 Apply Recurrent Neural Networks and LSTM for temporal data
C434-3.S Assess the various deep learning techniques on real-time problems.
Note: Attempt all questions.
A-:- Compute the principal components for the following two-dimensional dataset.

X {xl, x2 )-={(l,2),(3,3),(3,5),(5,4),(5,6),(6,5),(8, 7),(9,8))

[CO-I (Understanding), 4 Marks)


y Given the following data:
Item· xt x2 Class ✓Are the data linearly s~parab~e? State reasons for your answer.
A 1 2 yes=l ~We ~ill train a perceptron on the data. We add a bias xo = -1 to
B each of the data points. Suppose the current weights to be w = (0,
.I
2 1 yes=l
·c • -1, 1). .Assume a learning rate of f!.l. How should the weights be
1 1 no~O
update~ -if point. A is cons~dered? How would the weights nave been
.L_D_~ ll___l_o___
ln_o_=_O__ updated if the algorithm instead had consider ed point B?
[C0-2 (Unders tanding) , 1+2=3 Marks]
V

Using the back-pro pagation algorithm,


find the new weights (only wo, w1, w1)
for the net shown in the figure. It Ois
presente d with the input pattern [O, l]
and the target output is 1. Use a lea1ning
rate a=0.25 and binary -siginoidal
Vo2 = 0.5
activatio n function.

V22-= 0.4
~o Note: Calculations should
perform ed up to two decin,al places.
[C0-2 (Unders tand), 5 Marks]
be

0 1
~~xpla in what effect \\'ill the- f?llo~i ng operati~~s have on the bias and varian~
e of your model. Reply
~ as one of 'increa ses', 'decreases , or no change · 1n each of the
cells: .
~ Regularizing the weights in a linear/logistic regression model t •
Y. Using dropout to train a deep neural network l
f Increasing the number of hidden units in an artificial neural network •,

y{Wh y are convolutional layers more commonly used than fully-connected layers t;,. ..
for image
processing? r.
• [C0-3 (Apply), 1+1+1+2=5 Marks]

I Compare GoogLeNet and Residual networks (ResNets). What are the main archite
each, and how did they lead to improvements over previous design? Use diagram
ctural features of
s of the networks as
appropriate. [C0-3(Apply), 4 Marks)

/.
d?(Ske tch a simple recurrent network, with inputx , output y, and r~current
state h. '
ti,,(Giv e the updated equations for a simple RNN unit in terms of x, y, and/,.
• • Jinearity Assum e it uses Tanh non-
.
(,if What is the difference betwee n the c and I, recurrent states in an LSTM (Long
Short-T erm Memor y)
recurrent unit?
(CO-4 (Apply), 1+2+3 =5 Marks)

Y . ~ a t do you m~ ?Y self-attention? Explain with the help of an examp


le. What is the benefit of
~~he aded attenti on 1n a transfo rmer? • •
ryupp ose you have been given a sentenc e of two words "cat" and "sat".

(i) The word embed dings of these words are [0.85, 0.29, -0.61] and [-0.37, 0.72,
0.45] respect ively.
Final input word .e~bed qings ar~__(o~~y~,_,~~!~.!}~_g~pQ~i!i_~n ve_c!<;>r to these
word embed dings.
Th~ positio n vectors are [0.04, 0.05,. 0.06] and [0.07, 0.08, 0.09]. Find ~nal
,vord en1heddings.
(ii) Consid ering output of part (i) as input find the query vector, key vector,
and value vector if Wq
and \\'Tk and Wv are 3x3 matrix given as:
Wq = [[0.1, -0.2, 0.3], [-0.4, 0.5, -0.6], [0.7, -0.8, 0.9]]
Wk= [[-0.9, 0.8, -0.7], [0.6, -0.5, 0.4], [-0.3, 0.2, -0.1]]
Wv = [[0.2, 0.3, -0.4], [0.5, -0.6, 0.7], [-0.8, 0.9, 1.0]]
(iii) . Find the output vector Z ~f the self-att ention layer in the transfo rmer
of the word "cat" using
query vector, key vector, and value vector compu ted in part(ii) assum e two
words in the
senten ce "cat" and "sat".
(C0-4 (Apply), 2+1+3 +3=9 Marks]

Common questions

Powered by AI

Convolutional layers are preferred in image processing because they efficiently use spatial hierarchy by applying filters that preserve spatial relationships between pixels. This local connectivity and weight sharing drastically reduce the number of parameters compared to fully-connected layers, making models less prone to overfitting . Fully-connected layers, using large numbers of parameters indiscriminately, do not efficiently capture the spatial structure of images, thus are less effective in handling high-dimensional image data.

Self-attention allows models to weigh the importance of different words in a sequence dynamically, capturing contextual relationships better than models relying on fixed feature sizes . Multi-headed attention extends this by allowing the model to focus on different positions simultaneously, enhancing the model's ability to learn multiple aspects of meaning in parallel . This parallel processing and dynamic context understanding enable transformers to outperform traditional sequence models like RNNs and LSTMs, especially in tasks requiring long-range dependencies and complex features.

Regularization, including L1 and L2 techniques, generally reduces a model's variance by preventing it from capturing noise, thus improving generalization at the cost of a slight increase in bias . Dropout, another regularization method, decreases variance by randomly ignoring neurons during training, which forces the model to learn robust features, thus also potentially increasing bias slightly . Both methods aim to balance the trade-off between bias and variance, ultimately leading to improved generalization abilities.

Training a model from scratch on a small dataset like D2 may lead to overfitting due to statistically insignificant data and a lack of generalization. Models trained this way might only capture noise rather than relevant patterns . Transfer learning mitigates this issue by leveraging pre-trained models on large datasets like D1, which can significantly reduce training time and improve performance. It allows models to learn refined feature representations, which are then fine-tuned with smaller datasets, leading to better generalization . Thus, transfer learning addresses small dataset limitations by utilizing established knowledge from larger datasets.

Stochastic Gradient Descent (SGD) enhances model training by performing updates iteratively and randomly on subsets of the data (mini-batches), which leads to more frequent updates compared to using the entire dataset in Batch Gradient Descent. This randomness helps in escaping local minima by introducing fluctuations that guide the model towards a global minimum . The algorithm is particularly effective in large-scale learning, where processing full datasets is computationally expensive, thereby facilitating efficient error minimization through iterative learning rates and convergence to optimal solutions.

When applying PCA, it's crucial to consider the trade-off between dimensionality reduction and information loss . PCA is useful for identifying the directions (principal components) that maximize variance in the dataset, effectively capturing the most informative aspects with fewer dimensions . However, reducing dimensions too aggressively can lead to loss of significant information, impacting the model's accuracy. Therefore, selecting the number of principal components should balance dimension reduction with preserving important data features.

Increasing the number of hidden units in an artificial neural network typically enhances the model's capacity to learn complex features and relationships, thus decreasing bias by allowing for more detailed representations of the input data . However, it can also increase variance, as more parameters can lead to overfitting, especially if the training data is limited. Therefore, while additional hidden units can improve learning capacity, careful application of regularization and cross-validation is critical to ensure that improved complexity doesn't compromise generalization.

Datasets with label inaccuracies often hinder learning as models may learn incorrect predictions, leading to imprecise classification and lower generalization abilities . Such challenges can be addressed by employing robust validation techniques and regularization methods like L1 or L2 to mitigate the effects of noise on the model's performance . Additionally, manual correction of labels or usage of cleaner datasets through data preprocessing can significantly enhance model accuracy and reliability.

Convolutional Neural Networks (CNNs) are primarily used for image recognition and computer vision tasks due to their ability to capture spatial hierarchies in images. They apply convolutional filters to input data, detecting patterns such as edges or textures, which are crucial for image processing . In contrast, Recurrent Neural Networks (RNNs), especially Long Short-Term Memory networks (LSTMs), are tailored for temporal data due to their feedback loops, which allow information to persist across time steps. This makes them suitable for tasks like sequence prediction and natural language processing . Thus, while CNNs excel in capturing spatial features, RNNs are adept at handling sequential data.

GoogLeNet introduces the inception module, which processes information through parallel convolutional operations of different sizes, allowing the network to capture various feature patterns at multiple scales . In contrast, Residual Networks (ResNets) introduce shortcut connections that bypass one or more layers, addressing the vanishing gradient problem and allowing for deeper networks . These shortcuts help in training much deeper models without degradation, facilitating learning across more layers while overcoming gradient dispersion issues.

You might also like