Timeline for Complexity of computing derivatives
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 20, 2011 at 6:56 | vote | accept | onemoreuser | ||
| Aug 26, 2011 at 21:20 | comment | added | onemoreuser | Is there a lower bound available? maybe that is the catch. it does not seem to be clear what kind of model of computation we are talking about here. | |
| Aug 26, 2011 at 6:44 | comment | added | Robert Israel | I don't see how you could expect to do much better, since the output $\nabla f(x)$ has $n$ components. | |
| Aug 26, 2011 at 0:31 | comment | added | onemoreuser | informally, $n$ times slowdown seems to be sufficient because of first-order taylor expansion. but is it really the best one can do? this is bad, I guess but maybe in practice one can get away with much lesser. | |
| Aug 24, 2011 at 21:58 | history | edited | Robert Israel | CC BY-SA 3.0 |
added 87 characters in body
|
| Aug 24, 2011 at 19:35 | history | edited | Robert Israel | CC BY-SA 3.0 |
added 323 characters in body
|
| Aug 24, 2011 at 19:29 | history | answered | Robert Israel | CC BY-SA 3.0 |