Suppose we have a set of points in 2D (2-feature vectors), drawn i.i.d. from some unknown distribution D, each labelled 0(-) or 1 (+). Suppose the origin of the labels are unknown (agnostic setting). Consider a hypothesis class H formed by2-dimensional convex quadrilaterals such that for a disk h = H, we have h(x) = 1 if the point is a part of h (inside or onthe circumference of the quadrilateral h) and h(x) = 0 otherwise.Here are some examples of convex quadrilaterals:(a) Describe a polynomial time algorithm that runs in polynomial-time (in m) and outputs a hypothesis from H that ismost consistent with the labelled data. That is, a convex quadrilateral with minimum empirical error. Describe theasymptotic running time of your algorithm.(b) What is the VC dimension of a convex quadrilateral? Provide a proof of your answer. This proof requires two parts:a proof that at least d points can be shattered with a disk, and a proof that no more than d points can be shatteredfor some d.(c) Use the result from part (b) to specify an upper bound for the sample size to achieve PAC guarantees using H withgiven accuracy and confidence parameters and б.

(a) Describe a polynomial time algorithm that runs in polynomial-time (in \( m \)) and outputs a…

Answered: Suppose we have a set of points in 2D…

Similar questions

Write Algorithm for Element from a Base ImageInput : a group G acting on f2 = { 1,2 ..... n };the base image [71, 72 ..... 7k[ of an element g of G;a base and strong generating set for G;Schreier vectors v (i) ,1 <_ i < k, for the stabiliser chain;Output : the element g = uk • Uk-1 X 9 9 9 X u 1;
3. Below given a point set in the rectilinear metric (the height/width of any cell=1) where the closest pair of points should be found using divide and conquer. Show - the first partition of the point set (draw a line) -the closest pair in the left part (connect solid), 8en and the right part (connect solid), 6icht - the middle strip (shade) - pairs in the middle strip for which distances should be computed (connect dashed) closest pair in the middle strip (connect solid)
---DON'T CARES IN KARNAUGH MAPS (K-MAPS). 5.) Given this truth table, find the unoptimized formula this corresponds to, along with the version which was optimized with a K-Map. A B C D | O 0 0 0 0 1 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 X 0 1 x 0 x 0 x 0 1 0 1 0 X 0 Unoptimized Sum of Products equation 5a) 0 = Draw the K-map and simplify Optimized Sum of Products equation 5b) 0 =
(9) Suppose that we are given f : A → B and subsets X ⊂ A respectively Y ⊂ B so that we can define the direct image f(X) ⊂ B and the inverse image f^−1(Y ) ⊂ A. So that if X ⊂ A, then f(X) is a set and if Y ⊂ B, then f^−1(Y) is a set; you are proving things about these definitions. (a) Prove that f^−1(X ∪ Y ) = f^−1(X) ∪ f^−1(Y ). (b) Prove that if f is surjective then Y ⊂ f(f^−1(Y )).
Let (X, Y) - Uniform(D) with DC R2 being a disc contered at the point (a, b) (s00 the Figure below). Dofine V(x-a)2 +(Y-6)2 Out of the four random variables X, Y,0, R. find a pair which Y-by = arctan and R is independent. (,4) O (X,Y) O (X, R) O (X, e) O (R,Y) o (e,Y) O (R,e) 1. Out of the four random variables X,Y, R, 0. find a pair which is independent. True O False 2. The random variables X, Y aro uncorrolatod.
Let f be an s,t-flow in an s, t-network D = (V, A) with capacities c : A → R>o, and assume that there is no augmenting path. Let X be the set of vertices that can be reached from s by unsaturated paths. Let (a, b) E A(X,V\ X). Explain why f(a,b) = c(a, b).
Prove that there exists a maximum flow f in G, such that the set of edges carrying positive flowis acyclic. In other words, f has the property that for every directed cycle in G made up of edgese1, e2, . . . , ek, at least one of the values f (e1), f (e2), . . . , f (ek) is equal to zero.
In this problem, we consider the class of n-dimensional axis-aligned boxes. Each function c in this class is specified by aset of 2n values ℓ1, . . . , ℓn and u1, . . . , un in [0, 1], which defines an axis-aligned n-dimensional box. Given an n-dimensionalinput vector x, c(x) is defined to be 1 (or ‘+’) if for every i ∈ {1, . . . , n} the i’th coordinate of x lies in [ℓi, ui]. Otherwise,c(x) is defined to be 0 (or ‘-’) .An example of a 2-dimensional axis-aligned box is shown in the figure below. (a) Let C be the class of n-dimensional axis-aligned boxes, and c ∈ C be the unknown target function. State an efficientalgorithm that takes as input an arbitrary set of points x1, x2, . . . , xm each a point in n-dimensional space, and theircorresponding labels c(x1), c(x2), . . . , c(xm), and outputs a function h ∈ C that is consistent with this data. Youralgorithm should run in polynomial time in m, n and facilitate answering part (b) below. Let D be an arbitrary, unknown distribution, and…
4. Consider the set V of vectors (x, X2, X3, X4) ER such that X1 + x3 = 0 and x, + x4 = 0. a) Prove that V is a subspace of R*. b) Give a basis and the dimension of V.
Algorithm to Determining an orbit and Schreier vectorInput : a set S = {s 1, s2 ..... Sm} of generators of a group G acting on f2; a point 5;Output : the orbit ~G; a Schreier vector v and backward pointers w of the orbit 8 G relative to the set S of generators;
Develop an SP client that performs a sensitivity analysis on the edge-weighted digraph’s edges with respect to a given pair of vertices s and t: Compute a V-by-V boolean matrix such that, for every v and w, the entry in row v and column w is true if v->w is an edge in the edge-weighted digraphs whose weight can be increasedwithout the shortest-path length from v to w being increased and is false otherwise.
We have a list of three dimensional points [(7, 8, 1).(3, 7, 5).(6, 4, 1).(6, 9, 5).(0, 5, 2).(9, 9, 0)]. We sort these in ascending order by the third coordinate. Which of the following corresponds to a stable sort of this input?

SEE MORE QUESTIONS