I'd be interested in seeing your sin-fitting network as well.
Phil
On Monday, February 1, 2016 at 9:34:16 AM UTC-8, michae...@gmail.com wrote:
>
> Thanks everyone for the comments and pointers to code. I have coded up a
> simple example, fitting y=sin(x) + error, and the results very good,
TensorFlow is written in C++ and they use SWIG to generate wrappers for
Python. There is no Julia target for SWIG, but looking at some discussions
here seems to indicate that SWIG for Julia is kind of pointless given that
things like Cxx.jl exist.
However, Cxx.jl requires special dev versions
Will this talk be recorded?
On Sunday, December 13, 2015 at 10:58:31 AM UTC-8, Christian Peel wrote:
>
> This thursday Dec 17 Ehsan Totoni of Intel Labs will speak on
> ParallelAccelerator.jl [1] in San Francisco to the SF Julia Users group
> [2]. ParallelAccelerator is a compiler that
rFlow without Python, Julia
> is in a good position since it's very good at talking to both Python and
> C++.
>
>
Interesting.
>
> On Mon, Dec 14, 2015 at 2:17 PM, Phil Tomson <philt...@gmail.com
> > wrote:
>
>> TensorFlow is written in C++ and they use
On Monday, November 16, 2015 at 11:46:14 AM UTC-8, George Coles wrote:
>
> Does MXNet provide features that are analogous with Theano? I would rather
> do machine learning in one language, than a mix of python + c + a DSL like
> Theano.
MXNet.jl is a wrapper around libmxnet so there is c
et, but certainly
>> we're already repeating ourselves in many areas.
>>
>> On Monday, November 9, 2015 at 4:02:36 PM UTC-5, Phil Tomson wrote:
>>>
>>> Google has released it's deep learning library called TensorFlow as open
>>> source code:
>>>
>>
On Tuesday, November 10, 2015 at 8:28:32 PM UTC-8, Alireza Nejati wrote:
>
> Randy: To answer your question, I'd reckon that the two major gaps in
> julia that TensorFlow could fill are:
>
> 1. Lack of automatic differentiation on arbitrary graph structures.
> 2. Lack of ability to map
Looks like they used SWIG to create the Python bindings. I don't see Julia
listed as an output target for SWIG.
On Monday, November 9, 2015 at 1:02:36 PM UTC-8, Phil Tomson wrote:
>
> Google has released it's deep learning library called TensorFlow as open
> source code:
Google has released it's deep learning library called TensorFlow as open
source code:
https://github.com/tensorflow/tensorflow
They include Python bindings, Any ideas about how easy/difficult it would
be to create Julia bindings?
Phil
Are there any docs on moving from 0.3 to 0.4? Or do we just look in the
changelog?
I know some things have been deprecated and other things added. Also
looking for kind of a "Best practices" sort of guideline for 0.4 - I
suspect there were practices in 0.3 that aren't recommended now in 0.4.
Several comments here about the need to de-vectorize code and use for-loops
instead. However, vectorized code is a lot more compact and generally
easier to read than lots of for-loops. I seem to recall that there was
discussion in the past about speeding up vectorized code in Julia so that
it
On Wednesday, September 2, 2015 at 11:21:35 AM UTC-7, Erik Schnetter wrote:
>
> If I recall correctly, the two sets of ASCII bracketing operators ([] and
> {}) were deemed to be more usefully employed for arrays;
>
How has have the curly braces "{" and "}" been reused for arrays in 0.4?
Maybe this is expected, but it was a bit of a surprise to me:
julia function foo()
red::Uint8 = 0x33
blue::Uint8 = 0x36
(red-blue)
end
julia foo()
0xfffd
julia typeof(foo())
Uint64
The fact that it overflowed wasn't surprising, but
On Wednesday, April 8, 2015 at 8:00:42 AM UTC-7, Tim Holy wrote:
It's a matter of taste, really, but in general I agree that the Julian way
is
to reduce the number of accesses to fields directly. That said, I do
sometimes
access the fields.
However, your iterator example is a good
in the second link there and achieve a little bit of a
speedup (still not great performance, but about a 20% speedup in the small
testcase I tried)
On Thursday, 26 March 2015 05:41:10 UTC+11, Phil Tomson wrote:
Maybe this is just obvious, but it's not making much sense to me.
If I have
Maybe this is just obvious, but it's not making much sense to me.
If I have a reference to a function (pardon if that's not the correct
Julia-ish terminology - basically just a variable that holds a Function
type) and call it, it runs much more slowly (persumably because it's
allocating a lot
FastAnonymous or NumericFuns).
--Tim
On Wednesday, March 25, 2015 11:41:10 AM Phil Tomson wrote:
Maybe this is just obvious, but it's not making much sense to me.
If I have a reference to a function (pardon if that's not the correct
Julia-ish terminology - basically just a variable
it outside of the function:
julia f = @anon abs
ERROR: `anonsplice` has no method matching anonsplice(::Symbol)
--Tim
On Wednesday, March 25, 2015 01:00:27 PM Phil Tomson wrote:
I have a couple of instances where a function is determined by some
parameters (in a JSON file in this case
/phil/.julia/v0.3/FastAnonymous/src/FastAnonymous.jl:2
in test_time2 at none:5
--Tim
On Wednesday, March 25, 2015 01:30:28 PM Phil Tomson wrote:
On Wednesday, March 25, 2015 at 1:08:24 PM UTC-7, Tim Holy wrote:
Don't use a macro, just use the @anon macro to create an object
I want to be able to pass in a symbol which represents a function name into
a macro and then have that function applied to an expression, something
like:
@apply_func :abs (x - y)
(where (x-y) could stand in for some expression or a single number)
I did a bit of searching here and came up
, March 25, 2015 at 2:59:42 PM UTC-7, ele...@gmail.com wrote:
On Thursday, March 26, 2015 at 8:06:41 AM UTC+11, Phil Tomson wrote:
On Wednesday, March 25, 2015 at 1:52:04 PM UTC-7, Tim Holy wrote:
No, it's
f = @anon x-abs(x)
and then pass f to test_time. Declare the function like
performant code in Julia.
On Wed, 2015-03-25 at 19:41, Phil Tomson philt...@gmail.com javascript:
wrote:
Maybe this is just obvious, but it's not making much sense to me.
If I have a reference to a function (pardon if that's not the correct
Julia-ish terminology - basically just a variable
23:43:58 UTC, Phil Tomson wrote:
I thought I'd give 0.4 a spin to try out the new garbage collector.
On my current codebase developed with 0.3 I ran into several warnings
(*float32()
should now be Float32()* - that sort of thing)
And then this error:
*ERROR: LoadError: LoadError
at the LLVM IR output to see what's happening there.
In fact that would save
you a comparisons in each iteration irrespective of @simd.
Yes, that's a good point. I think I'll just pre-load those two columns
(the 1st and last columns of the matrix)
On Thu, 2015-03-12 at 02:17, Phil Tomson
and
run the loop like: @simd for x in 2:img.wid-1 . In fact that would save
you a comparisons in each iteration irrespective of @simd.
On Thu, 2015-03-12 at 02:17, Phil Tomson philt...@gmail.com javascript:
wrote:
I transformed it into a single-file testcase
I thought I'd give 0.4 a spin to try out the new garbage collector.
On my current codebase developed with 0.3 I ran into several warnings
(*float32()
should now be Float32()* - that sort of thing)
And then this error:
*ERROR: LoadError: LoadError: LoadError: LoadError: LoadError:
On Wednesday, March 11, 2015 at 4:49:06 PM UTC-7, Diego Tapias wrote:
Quick question: what does this mean
julia Array(Int,1)
1-element Array{Int64,1}:
139838919411184
?
And another question:
Is this just used for initializing an array?
Typically you would use something like:
I started out by putting an '@time' macro call on the function that I
figured was taking the most time, results looked like:
elapsed time: 8.429919506 seconds (4275452256 bytes allocated, 37.36% gc
time)
... so lots of bytes being allocated.
To get a better picture of where that was happening
Given:
abstract ABSGene
type NuGene : Genetic.ABSGene
fqnn::ANN
dcqnn::ANN
score::Float32
end
function mutate_copy{T:ABSGene}(gene::T)
all_fields_except_score = filter(x-x != :score, names(T))
all_fields_except_score =
Let's say I want to define a type that contains a Function type:
type IterFunc
iter_trigger::Int64
func::Function
end
Is there any way to say that the func member in that type should be a
function that takes arguments of a certain type?
Something like (not valid syntax, I tried):
type
Just wondering if there is any way to get a list of functions defined in a
module?
Say I want to do something like Boids simulation in Julia
(http://en.wikipedia.org/wiki/Boids), what packages are available to show
the animations? These are easy(ish) things to do in Processing, but Julia
is more capable mathematically and performance should be better.
I know there's the
%2Fwww.oscon.com%2Fopen-source-2015%2Fpublic%2Fcfp%2F360sa=Dsntz=1usg=AFQjCNGnugQLYPpLXmuaRhg3KCplOimxHw
Phil
On Tuesday, January 6, 2015 at 7:16:07 AM UTC-8, Phil Tomson wrote:
Hello Julia users:
I'm on the program committee for OSCON (the O'Reilly Open Source
Convention) and we're always
I'm using the Debug package. I want to set a break point and then step into
another external package (in this case Mocha), I tried something like this:
*using Mochausing Debug#...set up a lot of Mocha stuff ...#@debug (()-
begin println(break point!) @bp solve(solver,net)end)()*
Hello Julia users:
I'm on the program committee for OSCON (the O'Reilly Open Source
Convention) and we're always looking for interesting programming talks. I'm
pretty sure that there hasn't been any kind of Julia talk at OSCON in the
past. Given the rising visibility of the language it would
julia typeof(-0b111)
Uint64
julia typeof(-7)
Int64
julia typeof(-0x7)
Uint64
julia typeof(-7)
Int64
I find this a bit surprising. Why does the base of the number determine
signed or unsigned-ness? Is this intentional or possibly a bug?
On Sunday, December 7, 2014 5:08:45 PM UTC-8, ele...@gmail.com wrote:
On Monday, December 8, 2014 10:21:52 AM UTC+10, Phil Tomson wrote:
julia typeof(-0b111)
Uint64
julia typeof(-7)
Int64
julia typeof(-0x7)
Uint64
julia typeof(-7)
Int64
I find this a bit surprising. Why does
37 matches
Mail list logo
