- 12 4月, 2014 1 次提交
-
-
由 Frederic 提交于
-
- 11 4月, 2014 6 次提交
- 10 4月, 2014 5 次提交
-
-
由 Arnaud Bergeron 提交于
-
由 Arnaud Bergeron 提交于
-
由 abergeron 提交于
add tests for as_op decorator
-
由 John Salvatier 提交于
-
由 John Salvatier 提交于
-
- 09 4月, 2014 9 次提交
-
-
由 abergeron 提交于
Make the slow scan test fast!
-
由 Frederic 提交于
-
由 Frederic 提交于
-
由 Frederic 提交于
-
由 Frederic 提交于
This last commit finish to bring from 584s to 66s the slow scan test: theano/scan_module/tests/test_scan.py:T_Scan.test_hessian_bug_grad_grad_two_scans The changed optimization: local_abs_merge, local_mul_switch_sink, local_upcast_elemwise_constant_inputs, local_remove_switch_const_con are called on nodes that aren't yet part of the graph, during local_subtensor_merge optimization. They aren't supposed to work on node that are in the graph, but as they called get_scalar_constant_value() they traversed it very frequently! This pre_greedy_local_optimizer call is needed as it would introduce too much scrapt that will be optimized away. So we preoptimize the graph. As now we do the constant_folding in the phase (canonicalize/stabilize/specialize) where those changed opt are used, they can work directly on Constant. Other opt will make sure their inputs get constant if possible.
-
由 Frederic 提交于
-
由 Frederic 提交于
Indent what is inside. I'll use that in the next commit. This will make the change more visible.
-
由 Gabe Schwartz 提交于
Bytes need to be decoded prior to performing any string operations, such as split/strip, on them.
-
- 08 4月, 2014 4 次提交
-
-
由 Frédéric Bastien 提交于
Added usecases for scan tutorial
-
由 Frédéric Bastien 提交于
Fix usage of Popen.wait().
-
由 Arnaud Bergeron 提交于
-
由 abergeron 提交于
Recursion limit
-
- 07 4月, 2014 6 次提交
-
-
由 Frederic 提交于
-
由 Arnaud Bergeron 提交于
-
由 Arnaud Bergeron 提交于
-
由 Arnaud Bergeron 提交于
-
由 Frederic 提交于
It was making too much tests fail, but it still should keep the opt I wanted.
-
由 Frederic 提交于
-
- 04 4月, 2014 7 次提交
-
-
由 Frederic 提交于
-
由 Frederic 提交于
Speed up. get_scalar_constant_value and slow scan test.
-
由 Frederic 提交于
-
由 Frederic 提交于
This make less condition being tested. It speed up the slow scan tests.
-
由 Frederic 提交于
The 2 subtensors tests change probably due to optimization order changes. The 2->22 is that in the past, the Composite wasn't flattened, so the outer Composite was smaller.
-
由 Frederic 提交于
We fix for atleast 158 loops of that problem.
-
由 Frederic 提交于
-
- 03 4月, 2014 2 次提交
-
-
由 Frederic 提交于
with Composite. This allow to pickle bigger Composite graph as it simplify the graph, so we bust later the max recursion limit.
-
由 Frederic 提交于
Flatten Composite. This help gh-689 as it allow it to support up to 57 iteration of the loop instead of just 43. This could also help Theano cache in the case where graph could have different fusion order, so different way the composite are in each other, but do the same computation. This make the printing of Composite more readable.
-