Register

Go Classes | DA Course | Machine Learning

118 views
0 0 votes

Consider a two-input perceptron being applied to the following set of data:
$$x_1 ((-1,-2), +1)$$ $$x_2 ((-1,-3),0)$$ $$X3 ((-3,-1), 0)$$


Which of the following sets of weights would correctly label this data? Check off all that apply.
 

  1. $W_0 = 0.8 \\\ W_1=0.3 \\\ W_2 = 0.2$
  2. $W_1 = 87 \\\ W_1 = 21 \\\ W_2 = 32 $
  3. $W_0 = 7 \\\ W_1 = 2 \\\ W_2 = 2$
  4. None

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
Answer:
← Previous · Go Classes | DA Cour...Next → · Go Classes | DA Cour...
← Previous in category · Go Classes | DA Cour...Next in category → · Go Classes | DA Cour...
Position:
Show:

Related questions

0 0 votes
0 0 answers
141
141 views
GO Classes asked Mar 29, 2025
141 views
Go Classes | DA Course | Machine Learning
The perceptron algorithm will converge:If the data is linearly separableEven if the data is linearly inseparableAs long as you initialize $\theta$ to all 0'sAlways
0 0 votes
0 0 answers
136
136 views
GO Classes asked Mar 29, 2025
136 views
Go Classes | DA Course | Machine Learning
Consider a binary classification problem. Suppose I have trained a model on a linearly separable training set, and now I get a new labeled data point which is correctly c...
0 0 votes
0 0 answers
112
112 views
GO Classes asked Mar 29, 2025
112 views
Go Classes | DA Course | Machine Learning
Consider the following perceptron, for which the inputs are the always 1 feature and two binary features $x_1 \in \{0, 1\}$ and $x2 \in \{0, 1\}$. The output $y \in \{0, ...
0 0 votes
1 1 answer
228
228 views
GO Classes asked Mar 29, 2025
228 views
Go Classes | DA Course | Machine Learning
If the training set is finite and linearly separable, then the perceptron convergence theorem says that the perceptron algorithm will learn a correct linear separator in ...