For and , use the Lasso objective . Suppose the noise score has maximum norm at most , the true support has size , and . For any nonempty , the Karush-Kuhn-Tucker conditions implyThe upper bound is the Cauchy-Schwarz inequality. Hence . A finite first index violating this inequality must exceed . Its minimality also gives . If no such index exists within , use the always defined bound .
Articles by others on the same topic
There are currently no matching articles.