The Bare Necessities
Jun. 21st, 2007 | 09:56 pm
posted by:
kazgrace in
kcdcc_cm
I think a great place to kick off here is to outline what exactly we want from that underlying system that is generalisable to all of us. From there we can go straight to "how" and then then holy grail of "using what?" No illusions - the first implementations we do won't work to everyone's satisfaction, but without getting our hands dirty we won't know until it's too late.
I think we can all benefit from adopting Barsalou's method of talking about conceptualisation, and start defining our "core conceptual system" in terms of simulators and the re-enactment of perceptual symbols, but that's open for debate - if it doesn't fit someone's research, speak up now.
So, my first stab at the basics. Trying to stay as abstract as possible, we all need:
1. A way to learn about regularities present in sense data and the relationships and associations between them. This should be modality-specific but domain-general.
2. A way to construct "simulations" (John would say "experiences", I guess) that are interpretations of the agent's past experiences as they apply to current intentions in the current context (that is, other simulations that are "active").
3. An attentional system that both regulates construction (preventing it from becoming a "greedy algorithm" situation) and guides interpretation (selectively attending to interesting things).
4. A way to learn from the simulations the agent constructs; associations, actions (both internal and external and both successful and failed) particular interpretations and anything else should be accessible to the construction process in the future.
So, to me, that's our wish-list. Well enough there to occupy someone for five years, so I'm glad there're five of us with at least a year each.
So, anything else to add to the list? Big, small, anything? Disagreements with what I've got there or how I've said it?
Link | Leave a comment {1} | Add to Memories | Tell a Friend
Probability Problem
Jun. 21st, 2007 | 04:33 pm
posted by:
illykai in
kcdcc_cm
The prior odds of H from (1.16)
O(H) = P(H) / P(!H)
So I don't follow why the probability of H from (1.20) is
P(H) = O(H) / 1 + O(H)
I've juggled around algebra a whole lot and can't manage to form that equality. What is going on?
Link | Leave a comment {2} | Add to Memories | Tell a Friend
Dynamic Link Matching
Jun. 8th, 2007 | 01:37 pm
posted by:
kazgrace in
kcdcc_cm
Here's the original paper, or as original as I can find:
http://nn.cs.utexas.edu/web-pubs/htmlbo
Here's the updated version that appears to be SOM-based, called FDLM:
ftp://ftp.neuroinformatik.ruhr-uni-bochu
And here's an interesting variant based on spiking neurons, called ODLM:
http://www-edu.gel.usherbrooke.ca/picr1
Basically, they're all pattern-recognition-from-maps algorithms, with the useful property of being robust to affine transformations.
Link | Leave a comment {1} | Add to Memories | Tell a Friend
Meeting this Friday? (8/6)
Jun. 6th, 2007 | 09:26 pm
posted by:
kazgrace in
kcdcc_cm
If there's anything in particular people want to talk about then, maybe they could bring it up now? I want to talk a bit about particle systems, which I think are really interesting and we could maybe use them to make something resembling a Barsalou PSS if we can get over a few hurdles. I've attached a paper (Lee and Mumford, talking about particle systems and how they could be used to model the cortex) that I found interesting. You can skip over the maths in this if you feel inclined, I still got my head around it without reading the equations.
OK, no attach feature that I can see, here's a link: http://citeseer.ist.psu.edu/559717.h
Link | Leave a comment {2} | Add to Memories | Tell a Friend
Open document for editing
Jun. 4th, 2007 | 04:11 pm
posted by:
aldorath in
kcdcc_cm
I took last week off from doing work, so sorry for missing the meeting. Did I miss much? I have noticed that since the meeting posts on the board have dropped off, so I figure we should have another think about what it is about this that interests each of us.
Are people interested in using an open document that we work on to develop the paper that we think may result from this work? Hopefully you have all received an invitation in your inboxes so go and take a read and go edit-crazy on it. Make a start on the body text if you are feeling adventurous, even if it is just copy and pasting other work you have done so that we can all argue about it... (although quote and reference yourself even if it's just a research report so that we know we have to rewrite it...).
Enjoy!
Nick
Link | Leave a comment {1} | Add to Memories | Tell a Friend
cognitive bias
May. 29th, 2007 | 02:37 pm
posted by:
aldorath in
kcdcc_cm
http://www.healthbolt.net/2007/02/1
Link | Leave a comment | Add to Memories | Tell a Friend
Sydney data miners meetup
May. 29th, 2007 | 10:35 am
posted by:
illykai in
kcdcc_cm
Link | Leave a comment {2} | Add to Memories | Tell a Friend
Algorithms problems
May. 29th, 2007 | 09:32 am
posted by:
illykai in
kcdcc_cm
1) Construct the most efficient algorithm you can that takes arbitrary strings like XXXABXAXXBB and finds the number of possible combinations of A followed by B, where there can be any number of intervening characters between the A and the B. For example, the previously mentioned string has 5 such combinations.
( Solution )
2) Construct the most efficient algorithm you can that takes a set of N numbers and generates all the products of the numbers in subsets with N-1 members. For example, { 1, 2, 3, 4 } would give 24, 12, 8, 6.
( Solution )
Somwrita: My solution to the second problem is different to what I gave you before and I think might be more efficient than the answer that you gave me if I remember yours right, plus also uses less memory since it only stores the last product, rather than several intermediate products.
If anyone has better solutions, commentary, or question please post them.
Link | Leave a comment | Add to Memories | Tell a Friend
Some help needed with MySQL
May. 27th, 2007 | 07:28 pm
posted by:
somwrita in
kcdcc_cm
HI all,
This is probably a stupid question, but I have never used MySQL before and need the following help:
I have installed MySQL - I installed the client as well as the server.
I can use MySQL as a local user on the local server, which means that if I go to the start up and start the MySQL command line prompt, it prompts me for my password, and I can then start working.
However, what do I do if I want to connect to another server, one that is not running on this machine? Example: andy's research server (which I have permission to use, as he has created an account for me). So the instructions tell me go to C:> and then type in "mysql -h andy@arch.usyd.edu.au -u somwrita -p" but when I do this, it returns that "mysql is not recognized as an internal or external command, operable program or file name", is this an environment variable problem?
Please help, (I remember Owen said he worked with mysql before).
Thanks, Som.
Link | Leave a comment {3} | Add to Memories | Tell a Friend
Notes from meeting
May. 25th, 2007 | 02:11 pm
posted by:
aldorath in
kcdcc_cm
1. The input to our agents are closed shapes, expressed as a 200x200 bitmap.
2. Agents need to have some kind of generalised knowledge; see Barsalou (2005 Dynamic Interpretation paper) for a definition of summary representation that I think we should adopt for anything that we write up on this.
3. The agents respond to the queries:
a. What does a shape look like
b. What are some shapes like this one?
We will create five agents that all approach the problem in a different way, but that are all attempts to implement a constructive memory. Ideas used to represent concepts include:
LSI, PSS, Shape grammars, Owen's one, and Kaz's one (I forget).
Within the next week we agreed put together at least ten random shapes saved as a 200x200 bitmap
Does anybody know of a site where you can get free online storage? (e.g. google, yahoo) and maybe store them there... We could also be optimistic and start a google open document to start writing the paper as we go (just a thought).
Link | Leave a comment {6} | Add to Memories | Tell a Friend
Greg on constructive memory
May. 24th, 2007 | 03:09 pm
posted by:
illykai in
kcdcc_cm
"I updated the notes from last week, in Section 1 of this weeks notes. Not finished though. I also added an example in Section 2. It also is unfinished. It turned out to be more difficult than expected."
I know how he feels.
Link | Leave a comment | Add to Memories | Tell a Friend
Web implementation - a sketch of the start of an idea
May. 22nd, 2007 | 05:00 pm
posted by:
aldorath in
kcdcc_cm
One of the features of a perceptual symbol system (PSS; Barsalou 1999) is that it develops concepts on the basis of selective attention in interaction with the environment.
There are two levels of conceptual development:
1. The movement from sense data -> feature maps (i.e. a connectionist analog of the sense data internally) -> concepts that hold the 'features' or the selected important parts of these feature maps
2. The development of frames from holding links between concepts in space and time.
The web can be used to provide a nice example of the selective attention part of this (I think...)
Web pages have both 'physical' structure and code structure. A user interacts with web pages with an agent looking over there shoulder (the user helps us break away form having agents be motivated or anything).
Now, the whole web page onscreen is visible, as is the code (to the agent). But attention is only paid to those things that are being clicked.
So the only things that go towards the development of concepts and frames are those parts of the site that you paid attention to.
And then this is used for something... I am just not sure what. Am I making sense?
Thanks.
Link | Leave a comment {2} | Add to Memories | Tell a Friend
Lunch Friday 25th 12pm
May. 22nd, 2007 | 04:55 pm
posted by:
aldorath in
kcdcc_cm
So if that suits everybody let's say meet somewhere between Rob's office and our labs and walk somewhere nice for lunch.
Nick
Link | Leave a comment {4} | Add to Memories | Tell a Friend
Algorithms refresher/ grilling
May. 22nd, 2007 | 06:40 am
posted by:
somwrita in
kcdcc_cm
Hi all, here is an idea: I discussed this with Owen, and he thought it was good, how about having an online or real discussion forum for "algorithms" as part of our SCM - this wont have much to do with constructive memory directly, but the good thing will be that we will all have our bag of tricks ready for tackling any sorts of problem in new ways...wait for an update comment on this for a full plan of what we may do....
Link | Leave a comment {6} | Add to Memories | Tell a Friend
SCM meeting on Friday
May. 21st, 2007 | 11:19 am
posted by:
illykai in
kcdcc_cm
The main thrust of the meeting was discussing the current proposal that Greg has made for taking an essentially Bayesian network style approach to building a constructive memory system. The idea is that elements of memories are represented by nodes in a Bayesian network containing values for the degree of belief that the memory system places in them. Nodes are arranged in layers that represent belief values for sense data through to percepts and concepts. A memory is constructed by performing belief propagation through the network. Belief propagation is triggered either from new sense data coming though the bottom, or from new hypotheses being added at higher layers. Hypotheses are nodes which are added temporarily to the network that are equivalent to goals or situations.
The current plan is to implement such a system using NuPIC, which is Numenta's platform for working with HTMs, but we would not use the Zeta1 nodes that come with their distribution, instead developing our own Bayesian alternative.
The most recent plans that Greg has come up with for making this all happen are here and here.
John was concerned that the scheme lacked a model of the pull component of push-pull. Greg responded by saying that pull works by a constructive induction search, which changes hypotheses within the system and then causes the belief values to be re-propagated. This process differentiates the proposed system from other kinds of Bayesian systems.
John asked Greg to provide more detailed examples explaining how this would happen, which Greg is working on for next week.
John and Greg are particularly happy with this approach because the use of Bayes' theorem gives an elegant method for performing abductive reasoning.
Link | Leave a comment {5} | Add to Memories | Tell a Friend
About implementations - owen and greg
May. 16th, 2007 | 08:23 pm
posted by:
somwrita in
kcdcc_cm
Hi,
This is basic interest for beginnings of implementations. Could Owen give a description of the constructive memory system Greg and he are implementing ? I mean the computational algorithm, how its being done?
Som.
Link | Leave a comment {1} | Add to Memories | Tell a Friend
Anticipatory learning
May. 15th, 2007 | 12:39 pm
posted by:
kcdcc in
kcdcc_cm
http://www.springerlink.com.ezproxy2.li
But the whole issue is dedicated to anticipatory learning, which some of us are interested in.
-Nick
Link | Leave a comment | Add to Memories | Tell a Friend
Post notification and your friends list.
May. 15th, 2007 | 11:28 am
posted by:
illykai in
kcdcc_cm
The first one is that you should sign yourself up to be notified about responses to your posts. This works best if you use GMail, because the way that GMail threads email exchanges corresponds pretty much exactly to the way that comment threads get handled on LJ, so your inbox doesn't get cluttered up with responses. If you don't use GMail you may instead just want to check the community once a day or so rather than being spammed with auto-notification messages, but seriously the auto-notification thing is awesome because you'll be notified even if someone replies to a comment that you made years ago and there's generally no way you'd notice that happening otherwise.
The second one is that you should add the community to your friends list. Any time there's a main-page update to the community (like this message for instance) it will appear in your friends page. The friends page is really the main feature that makes LiveJournal excellent. It's basically like having a news aggregator for everyone on your friends list. If you sign up for other communities like the BoingBoing or SecondLife communities or whathaveyou then you should whack them on your friends list too so they pop up on your friends page too.
Once you have this stuff set up, then you can also use iGoogle to keep track of things by both having your GMail inbox appear on the page and also finding a plug-in for displaying your LJ friends list, of which there are several.
Link | Leave a comment {5} | Add to Memories | Tell a Friend
Ideas!
May. 15th, 2007 | 10:46 am
posted by:
illykai in
kcdcc_cm
The way that I see this journal being used is as a discussion area for looking at ways that we can collaborate, and things that we can get up and running to support collaboration.
Ideas that we talked about were having:
- a central repository for code (can owen or kaz volunteer to look into rubyforge for feasibility? www.rubyforge.org)
- start on some kind of primitive development of a Barsalou-type model that satisfies our own curiousity
Does anybody have any other ideas?
I plan to hassle people about this if I don't hear back from them because unless we keep it alive we will all get distracted in our own worlds.
-Nick