- 23 7月, 2011 13 次提交
-
-
由 Pascal Lamblin 提交于
-
由 Frederic Bastien 提交于
-
由 Frederic Bastien 提交于
-
由 James Bergstra 提交于
-
由 Frederic Bastien 提交于
-
由 James Bergstra 提交于
-
由 James Bergstra 提交于
Rationale: its name shadowed the scipy package, and it was not successful in simplifying other modules' code that had to do scipy version checks. (Which is only two places anyway).
-
由 James Bergstra 提交于
-
由 James Bergstra 提交于
-
由 James Bergstra 提交于
-
由 Frederic Bastien 提交于
-
由 Pascal Lamblin 提交于
-
由 Frederic Bastien 提交于
-
- 22 7月, 2011 27 次提交
-
-
由 Razvan Pascanu 提交于
-
由 Razvan Pascanu 提交于
-
由 Razvan Pascanu 提交于
-
由 Razvan Pascanu 提交于
The test checks the depricated return_steps
-
由 Razvan Pascanu 提交于
This will help during debugging
-
由 Razvan Pascanu 提交于
After talking to Pascal, I decided to leave until in scan_module and not to export it to theano.until. So I had to fix the tests as well for this.
-
由 Razvan Pascanu 提交于
I needed to do this when debugging, because I wanted to know both of their values, but there was nothing wrong with the test, and with or without this change it is the same. I just wanted to stay in a more clear form ( so people don't get confused by which f1 we talking about)
-
由 Razvan Pascanu 提交于
-
由 Razvan Pascanu 提交于
return_steps has been depricated, and store_steps as well (it actually not used anymore)
-
由 Razvan Pascanu 提交于
-
由 Razvan Pascanu 提交于
This follows the suggestion of Pascal that flatten just culters the namespace.
-
由 Razvan Pascanu 提交于
Errors are obvious, first of all the data of the constants don't have to scalars, and secondly, is not enough for outputs that have no owner to have same type, but they should have the same index (i.e. correspond to the same input). As I have all corresponding pairs of inputs in `common` and these outputs are equal with their inputs, is sufficient to check if them ( as pair) are part of common
-
由 Razvan Pascanu 提交于
This was in an attempt to fix a stochastic optimization error in DEBUG MODE.
-
由 Razvan Pascanu 提交于
They used to be there, because at one point I was timing the function under the believe that it takes way to much. Is not the case anymore.
-
由 Razvan Pascanu 提交于
This follows the discussion that I had with Pascal, that tries to simplify how scan deals with what the user gives it. In that direction I first depricated some of the possibilities the user had, in order to get better clarity in the code.
-
由 Razvan Pascanu 提交于
fix following Pascal's suggestion
-
由 Razvan Pascanu 提交于
We don't want scalars to be converted into TensorScalars ( the pushout optimization will fail if that happens)
-
由 Razvan Pascanu 提交于
-
由 Razvan Pascanu 提交于
Those used to belong to the original implementation of the optimization, which I changed to fit the new equal_computation function.
-
由 Razvan Pascanu 提交于
It used to be used by the old implementation of equal_computations, but now is not needed anymore
-
由 Razvan Pascanu 提交于
There is no reason for this, just that I had a lot of problems with this optimization. It turned out the problem to be caused by local_useless_subtensor optimization (fix which I will push later). In my attempts to debug it though, I ended up converting it into a global optimizer, and I don't want to go through the pain of reverting it and making sure also that it works.
-
由 Razvan Pascanu 提交于
-
由 Razvan Pascanu 提交于
-
由 Razvan Pascanu 提交于
-
由 Razvan Pascanu 提交于
-
由 Razvan Pascanu 提交于
-
由 Razvan Pascanu 提交于
-