समस्या
Instead of a formula, train the line y = w × x + b with batch gradient descent on the mean squared error MSE = Σ(w × x + b - y)² / n.
Start with w = 0 and b = 0. In each epoch, using all points:
- errorᵢ = w × xᵢ + b - yᵢ
- dw = (2 / n) × Σ errorᵢ × xᵢ and db = (2 / n) × Σ errorᵢ
- w ← w - learning_rate × dw and b ← b - learning_rate × db (both computed from the same errors)
Implement train_linear_regression(xs, ys, learning_rate, epochs).
Input
xs, ys: The data points (same length).
learning_rate, epochs: The step size and the number of updates.
Output
Return [w, b] after training.
सीमाएँ
1 ≤ number of points ≤ 1,000, 0 ≤ epochs ≤ 10,000
0 < learning_rate ≤ 1
-100 ≤ each value ≤ 100
उदाहरण
इनपुट:
xs = [1.0, 2.0]
ys = [2.0, 4.0]
learning_rate = 0.1
epochs = 1
अपेक्षित आउटपुट:
expected = [1.0, 0.6]
इनपुट:
std::vector<double> xs = {1.0, 2.0};
std::vector<double> ys = {2.0, 4.0};
double learning_rate = 0.1;
long long epochs = 1;
अपेक्षित आउटपुट:
std::vector<double> expected = {1.0, 0.6};
इनपुट:
double[] xs = new double[] {1.0, 2.0};
double[] ys = new double[] {2.0, 4.0};
double learning_rate = 0.1;
long epochs = 1;
अपेक्षित आउटपुट:
double[] expected = new double[] {1.0, 0.6};
व्याख्या
With w = b = 0 the errors are -2 and -4. dw = (2 / 2) × (-2×1 - 4×2) = -10 and db = (2 / 2) × (-2 - 4) = -6, so w = 0 - 0.1 × (-10) = 1 and b = 0 - 0.1 × (-6) = 0.6. Result: [1, 0.6].
इनपुट:
xs = [1.0, 2.0, 3.0]
ys = [3.0, 5.0, 7.0]
learning_rate = 0.05
epochs = 2000
अपेक्षित आउटपुट:
expected = [2.0, 1.0]
इनपुट:
std::vector<double> xs = {1.0, 2.0, 3.0};
std::vector<double> ys = {3.0, 5.0, 7.0};
double learning_rate = 0.05;
long long epochs = 2000;
अपेक्षित आउटपुट:
std::vector<double> expected = {2.0, 1.0};
इनपुट:
double[] xs = new double[] {1.0, 2.0, 3.0};
double[] ys = new double[] {3.0, 5.0, 7.0};
double learning_rate = 0.05;
long epochs = 2000;
अपेक्षित आउटपुट:
double[] expected = new double[] {2.0, 1.0};
व्याख्या
The data lies on y = 2x + 1. After 2,000 epochs gradient descent has converged to w = 2 and b = 1, the same answer as the least squares formula.
कैसे हल करें
पहले खुद कोशिश करें, फिर एक-एक करके संकेत खोलें।
संकेत 1
Each epoch uses every point to measure how wrong the current line is.
संकेत 2
Accumulate the gradient from all samples before updating both parameters together.
संकेत 3
Be careful not to update one parameter early, because both updates must use the same epoch’s errors.
अपेक्षित जटिलता
O(epochs × n) time, O(1) extra space
संदर्भ
यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।