Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

We obtain a new lower bound on the information-based complexity of first-order minimization of smooth and convex functions. We… Expand

Is this relevant?

Highly Cited

2013

Highly Cited

2013

We consider the problem of eciently exploring the arms of a stochastic bandit to identify the best subset of a specied size… Expand

Is this relevant?

Highly Cited

2012

Highly Cited

2012

The primary goal of this paper is to define and study the interactive information complexity of functions. Let f(x,y) be a… Expand

Is this relevant?

Highly Cited

2012

Highly Cited

2012

Multiphase converter topologies for use in high-performance applications have received increasing interest in recent years. This… Expand

Is this relevant?

Highly Cited

2011

Highly Cited

2011

We study the intrinsic limitations of sequential convex optimization through the lens of feedback information theory. In the… Expand

Is this relevant?

2010

2010

Collaboration technology enhances the ability of work groups to acquire and share large volumes of information within a short… Expand

Is this relevant?

Highly Cited

2006

Highly Cited

2006

Suppose x is an unknown vector in Ropfm (a digital image or signal); we plan to measure n general linear functionals of x and… Expand

Is this relevant?

Highly Cited

2006

Highly Cited

2006

We consider an extension of e-entropy to a KL-divergence based complexity measure for randomized density estimation methods… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

We examine the relation between analysts' earnings forecasts and firms' intangible assets, including technology-based intangibles… Expand

Is this relevant?

1992

1992

x being the unknown. Assume that, given an instance (A, b), we wish to solve it to a given accuracy E on the basis of “matrix… Expand

Is this relevant?