Gaussian linear models are often insufficient in practical applications, where noise can be heavy- tailed. In this problem, we consider a linear model of the form yi = a · xi + b + ei. The (ei) are independent noise from a distribution that depends on x as well as on global parameters; however, the noise distribution has conditional mean zero given x. The goal is to derive a good estimator for the parameters a and b based on a sample of observed (x, y) pairs. 1.1 Instructions: 1. Load the data, which is provided as (x, y) pairs in CSV format. Each file contains a data set generated with different values of a and b. The noise distribution, conditional on x, is the same for all data sets. 2. Formulate a model for the data-generating process. 3. Based on your model, formulate a loss function for all parameters: a, b, and any additional parameters needed for your model. 4. Solve a suitable optimization problem, corresponding to your chosen loss function, to obtain point estimates for the model parameters. 5. Formulate and carry out an assessment of the quality of your parameter estimates. 6. Try additional models if necessary, repeating steps 2 − 5.
Member Technical Staff Interview Questions
11,278 member technical staff interview questions shared by candidates
Why do you want to change your job?
2) Print the following pattern... Input : 3 Output: 0 303 23032 1230321
Explain overall polymorphism using uml diagram?
Be aware of current trends and what is around you
There is a dependency management system like maven, different class dependencies are given, print an order in which they are to be loaded, also identify a case when such an algorithm will fail: Input: A -> B, C B-> C C - > D D - >E E F - > A Output: E D C B A F
Architecture of my previous projects. Mostly LC Easy/Medium (Interval problems, Graphs and Trees, can't be more specific due to NDA). Challenging behavioral questions. Understanding of design, tests and code review. Questions on REST Api design patterns, basic security concepts.
questions were mostly based on computer networks, operating systems and dbms. No questions at all on programming or data structures. Only theoretical knowledge is not sufficient, questions were mostly application oriented.
Medium leetcode questions on arrays , linklist,DFS, KMP algo, optimization etc
Nothing as such. Just needed to explain basic concepts and algorithms. The toughest question was: Given n number of points in a Cartesian space, devise a method to find the minimum distance between any set of two points.
Viewing 31 - 40 interview questions