FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2397159611> ?p ?o ?g. }

• W2397159611 endingPage "25" @default.
• W2397159611 startingPage "1" @default.
• W2397159611 abstract "The Unique Games Conjecture (UGC) has emerged in recent years as the starting point for several optimal inapproximability results. While for none of these results a reverse reduction to Unique Games is known, the assumption of bijective projections in the Label Cover instance nevertheless seems critical in these proofs. In this work, we bypass the need for UGC assumption in inapproximability results for two geometric problems, obtaining a tight NP-hardness result in each case. The first problem, known as L p Subspace Approximation, is a generalization of the classic least squares regression problem. Here, the input consists of a set of points X = {α 1 , … , α m } ⊆ R n and a parameter k (possibly depending on n ). The goal is to find a subspace H of R n of dimension k that minimizes the ℓ p norm of the Euclidean distances to the points in X . For p = 2, k = n − 1, this reduces to the least squares regression problem, while for p = ∞, k = 0 it reduces to the problem of finding a ball of minimum radius enclosing all the points. We show that for any fixed p ∈ (2, ∞), and for k = n − 1, it is NP-hard to approximate this problem to within a factor of γ p − ϵ for constant ϵ > 0, where γ p is the p th norm of a standard Gaussian random variable. This matches the γ p approximation algorithm obtained by Deshpande, Tulsiani, and Vishnoi who also showed the same hardness result under the UGC. The second problem we study is the related L p Quadratic Grothendieck Maximization Problem, considered by Kindler, Naor, and Schechtman. Here, the input is a multilinear quadratic form ∑ n i , j = 1 a ij x i x j and the goal is to maximize the quadratic form over the ℓ p unit ball, namely, all x with ∑ n i = 1 | x i | p ⩽ 1. The problem is polynomial time solvable for p = 2. We show that for any constant p ∈ (2, ∞), it is NP-hard to approximate the quadratic form to within a factor of γ 2 p − ϵ for any ϵ > 0. The same hardness factor was shown under the UGC by Kindler et al. We also obtain a γ 2 p -approximation algorithm for the problem using the convex relaxation of the problem defined by Kindler et al. A γ 2 p approximation algorithm has also been independently obtained by Naor and Schechtman. These are the first approximation thresholds, proven under P ≠ NP, that involve the Gaussian random variable in a fundamental way. Note that the problem statements themselves do not explicitly involve the Gaussian distribution." @default.
• W2397159611 created "2016-06-24" @default.
• W2397159611 creator A5011759026 @default.
• W2397159611 creator A5044412015 @default.
• W2397159611 creator A5068388812 @default.
• W2397159611 creator A5073986426 @default.
• W2397159611 date "2016-02-08" @default.
• W2397159611 modified "2023-10-12" @default.
• W2397159611 title "Bypassing UGC from Some Optimal Geometric Inapproximability Results" @default.
• W2397159611 cites W1868897294 @default.
• W2397159611 cites W1886138972 @default.
• W2397159611 cites W1970259241 @default.
• W2397159611 cites W1970670479 @default.
• W2397159611 cites W1973898585 @default.
• W2397159611 cites W1984675750 @default.
• W2397159611 cites W1999797449 @default.
• W2397159611 cites W2017008844 @default.
• W2397159611 cites W2019578639 @default.
• W2397159611 cites W2030987833 @default.
• W2397159611 cites W2056590617 @default.
• W2397159611 cites W2072331102 @default.
• W2397159611 cites W2087038607 @default.
• W2397159611 cites W2095315734 @default.
• W2397159611 cites W2110871651 @default.
• W2397159611 cites W2113238413 @default.
• W2397159611 cites W2120358419 @default.
• W2397159611 cites W2137118456 @default.
• W2397159611 cites W2144539217 @default.
• W2397159611 cites W2148352980 @default.
• W2397159611 cites W2152299057 @default.
• W2397159611 cites W2155618818 @default.
• W2397159611 cites W2163925208 @default.
• W2397159611 cites W2167681887 @default.
• W2397159611 cites W3023108254 @default.
• W2397159611 doi "https://doi.org/10.1145/2737729" @default.
• W2397159611 hasPublicationYear "2016" @default.
• W2397159611 type Work @default.
• W2397159611 sameAs 2397159611 @default.
• W2397159611 citedByCount "9" @default.
• W2397159611 countsByYear W23971596112013 @default.
• W2397159611 countsByYear W23971596112021 @default.
• W2397159611 countsByYear W23971596112022 @default.
• W2397159611 countsByYear W23971596112023 @default.
• W2397159611 crossrefType "journal-article" @default.
• W2397159611 hasAuthorship W2397159611A5011759026 @default.
• W2397159611 hasAuthorship W2397159611A5044412015 @default.
• W2397159611 hasAuthorship W2397159611A5068388812 @default.
• W2397159611 hasAuthorship W2397159611A5073986426 @default.
• W2397159611 hasBestOaLocation W23971596111 @default.
• W2397159611 hasConcept C112955886 @default.
• W2397159611 hasConcept C114614502 @default.
• W2397159611 hasConcept C118615104 @default.
• W2397159611 hasConcept C122041747 @default.
• W2397159611 hasConcept C134306372 @default.
• W2397159611 hasConcept C148764684 @default.
• W2397159611 hasConcept C191948623 @default.
• W2397159611 hasConcept C2780990831 @default.
• W2397159611 hasConcept C33923547 @default.
• W2397159611 hasConceptScore W2397159611C112955886 @default.
• W2397159611 hasConceptScore W2397159611C114614502 @default.
• W2397159611 hasConceptScore W2397159611C118615104 @default.
• W2397159611 hasConceptScore W2397159611C122041747 @default.
• W2397159611 hasConceptScore W2397159611C134306372 @default.
• W2397159611 hasConceptScore W2397159611C148764684 @default.
• W2397159611 hasConceptScore W2397159611C191948623 @default.
• W2397159611 hasConceptScore W2397159611C2780990831 @default.
• W2397159611 hasConceptScore W2397159611C33923547 @default.
• W2397159611 hasFunder F4320306076 @default.
• W2397159611 hasFunder F4320306079 @default.
• W2397159611 hasFunder F4320306151 @default.
• W2397159611 hasIssue "1" @default.
• W2397159611 hasLocation W23971596111 @default.
• W2397159611 hasLocation W23971596112 @default.
• W2397159611 hasOpenAccess W2397159611 @default.
• W2397159611 hasPrimaryLocation W23971596111 @default.
• W2397159611 hasRelatedWork W1970843405 @default.
• W2397159611 hasRelatedWork W2013467167 @default.
• W2397159611 hasRelatedWork W2029981401 @default.
• W2397159611 hasRelatedWork W2056977145 @default.
• W2397159611 hasRelatedWork W2740334431 @default.
• W2397159611 hasRelatedWork W2951982256 @default.
• W2397159611 hasRelatedWork W3105874183 @default.
• W2397159611 hasRelatedWork W3123287700 @default.
• W2397159611 hasRelatedWork W4212808623 @default.
• W2397159611 hasRelatedWork W4301344670 @default.
• W2397159611 hasVolume "12" @default.
• W2397159611 isParatext "false" @default.
• W2397159611 isRetracted "false" @default.
• W2397159611 magId "2397159611" @default.
• W2397159611 workType "article" @default.