Student Projects
The following projects appropriate for undergraduate, Masters (MCOMP), PhD students and visiting (summer) scholars. Please email the provided contact if you are interested in a project.
If you are interested in doing a PhD with an advisor in the SML, please email Tiberio Caetano (first.last@nicta.com.au) as well as any SML staff members whose research interests you.
For Summer Scholar Projects, please apply to CECS at ANU by 31 August 2008 to complete a Summer Scholar project.
- Supervisor: Dr Wray BuntineRead the literature and improve upon the use of semi-Markov CRFs in automatic paragraph segmentation.
- Supervisor: Dr Wray BuntineOpen-ended project on building a semantic-based search engine for Parliament House.
- Supervisor: Dr Scott SannerHave you ever wanted to ask your computer a question in natural language and have it reply with the correct answer? Build a small prototype using reinforcement learning for natural language query answering in Wikipedia.
- Supervisor: Dr Scott SannerExamine automated feature induction methods via latent variable learning, for a task in a simulated environment such as learning to play a game, learning to make inferences for logical query answering, and learning to optimize program control structure.
- Supervisor: Dr Scott SannerChoose a task and implement a small learning and inference engine based on an appropriate knowledge and conditional random fields (CRF), using Java tools.
- Supervisor: Dr Scott SannerChoose one of the above program domains, and implement an optimal planning system for this task. This project offers the chance to learn about the theory of optimal sequential decisionmaking and its application to practical problems.
- Supervisor: Dr Scott SannerA partner at the ANU is looking for better process schedulers for a supercomputing system. Perform data analysis on server longs, develop a model of process performance, and then feed that data to a constrained scheduler.
- Supervisor: Dr Marcus HutterThe dream of creating artificial devices to reach or outperform human intelligence is an old one; investigate some of the hundreds of open questions of universal artificial intelligence.
- Supervisor: Dr Marcus HutterInvestigate the problem of compressing the first hundred megabytes of Wikipedia better than your predecessors.
- Supervisor: Dr Marcus HutterHumans learn from experience; how should inductive inference be completed? Consider some open problems such as the black raven paradox, the zero p(oste)rior problem, reparametrization invariance, old-evidence, and updating problems, and study Solmonoff's theory of universal induction.
- Supervisor: Dr Marcus HutterSolmonoff's theory based on Occam's razor essentially specifies a universal model class and prior. But the No Free Lunch theorem states that all optimization or search algorithms are equally good/bad, if a uniform average over the space of all functions is taken. Investigate this ongoing battle of theories.
- Supervisor: Dr Li ChengWork on an intelligent video footage storage and management system based on event detection, in a project important in many applications.
- Supervisor: Dr Li ChengBuild a hierachial or tree structure for an imput image, where each level reveals a sensible segmentation of the image. This project is analogous to the semantic hierachies of text.