Dataford
Interview QuestionsInterview GuidesExperiencesCoaching
New
Pricing
Get started
Dataford
Popular roles
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Browse
Browse All RolesEvery role hub, from analyst to MLBrowse All CompaniesCompany-specific interview loopsAll Interview GuidesThe full guide library
Top questions by role
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Top questions by skill
SQLPythonStatisticsMachine LearningA/B TestingSystem DesignGenerative AIProduct SenseMetricsBehavioral
Browse all questions →Try a mock interview
Experiences
Practice
Mock InterviewsTimed interview simulations with feedbackCoaching1:1 coaching with people at your target companiesSuccess PathYour 6-week structured planModulesCurated lessons by topicWebinarsTalks from ex-Big Tech data leadsPlaygroundA free-form scratch editor
Learn
BlogInterview strategy and career adviceTech Job Market ReportHiring trends across data and AI rolesFor UniversitiesDataford for career centersAbout DatafordWho we are and how we build
Pricing
Build my plan
Implement Gradient Descent
00:00
5 left

Implement Gradient Descent

EasyPython

Problem

Plymouth Rock Assurance is prototyping a simple claim-severity model: prediction = weight * x + bias. Implement batch gradient descent to minimize mean squared error across training examples.

Formal Specification

Implement gradient_descent(x, y, learning_rate, iterations).

  • x is a list of numeric feature values.
  • y is a list of numeric target values, where y[i] corresponds to x[i].
  • Start with weight = 0.0 and bias = 0.0.
  • For each iteration, compute gradients over the entire dataset before updating either parameter:
    • error_i = weight * x[i] + bias - y[i]
    • d_weight = (2 / n) * sum(error_i * x[i])
    • d_bias = (2 / n) * sum(error_i)
  • Update both parameters using the learning rate.
  • Return [weight, bias], rounded to 10 decimal places.

Constraints

  • 1 <= len(x) == len(y) <= 10^4
  • -10^3 <= x[i], y[i] <= 10^3
  • 0 < learning_rate <= 1
  • 0 <= iterations <= 10^4
  • Return weight and bias rounded to 10 decimal places

Function Signature

def gradient_descent(x, y, learning_rate, iterations):
Interviewer

Your question is Implement Gradient Descent. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.
CodePython 3
Sign up free to run your codeLog inLn 2
Run your code to see test output here.