Which of the following statements is not true about dual formulation in SVM optimisation problem?

Which of the following statements is not true about dual formulation in SVM optimisation problem? Correct Answer Number of free parameters is bounded by the number of variables

In dual formulation in SVM optimisation problem number of free parameters is bounded not by the number of variables but by the number of support vectors. All other three statements are benefits of dual formulation in SVM optimisation problem.
Bissoy MCQ

Related Questions

A Lagrange dual of a convex optimisation problem is another convex optimisation problem.
Suppose you have trained an SVM with linear decision boundary after training SVM, you correctly infer that your SVM model is under fitting. Which of the following is best option would you more likely to consider iterating SVM next time?
If a finite element model involves the natural and direct formulation of momentum and continuity equations, then it is known as the velocity-pressure formulation or mixed formulation.
We usually use feature normalization before using the Gaussian kernel in SVM. What is true about feature normalization?
1. We do feature normalization so that new feature will dominate other
2. Some times, feature normalization is not feasible in case of categorical variables
3. Feature normalization always helps when we use Gaussian kernel in SVM
In convex learning problems where the loss function is convex, the preceding problem is also a convex optimisation problem.
Given a primal problem f*, minimizing x2 subject to x >= b and a dual problem d*, maximizing d(α) subject to α >= 0. Then d* = f* if f is non convex and x*, α* satisfy zero gradient, primal feasibility dual feasibility, and complementary slackness.
Suppose you are building a SVM model on data X. The data X can be error prone which means that you should not trust any specific data point too much. Now think that you want to build a SVM model which has quadratic kernel function of polynomial degree 2 that uses Slack variable C as one of it's hyper parameter.What would happen when you use very large value of C(C->infinity)?
Suppose you are building a SVM model on data X. The data X can be error prone which means that you should not trust any specific data point too much. Now think that you want to build a SVM model which has quadratic kernel function of polynomial degree 2 that uses Slack variable C as one of it's hyper parameter.What would happen when you use very small C (C~0)?
The minimum time complexity for training an SVM is O(n2). According to this fact, what sizes of datasets are not best suited for SVM's?
Consider the following statements.
1. A transport problem is said to be a balanced problem if the number of origins and destination is equal.
2. Dual theory of simplex method of LP can be used to solve a game theory problem.
3. CPM is often referred to as time cost trade off.
4. Time is not the only variable in PERT.
5. In a single channel queueing models, μ = λ, infinitequeue will build up.