Skip to content

Latest commit

 

History

History
88 lines (69 loc) · 5.07 KB

README.md

File metadata and controls

88 lines (69 loc) · 5.07 KB

GSoC Ideas List: aimacode

(Note: aimacode is not participating in GSOC for 2020)

In the past, the aimacode project has enjoyed the support of the Google Summer of Code. We may do so again in 2021. We had a few student interns help write code. Here are some of the requirements and project ideas from past years:

  • Very strong coding ability. Give us a link to some projects you've done.
  • Very clear coding, commenting, and documentation writing skills. Your code not only has to be correct, it also has to be easy top understand, and easy to see the connection between your code and the description of the algorithms in the textbook.
  • Enthusiasm for helping other people by explaining things well. Show us some examples of your work in this area.
  • Some experience, or familiarity, or willingness to learn about artificial intelligence and machine learning.

Project Ideas

(1) Exercises Website

Unlike the previous editions, the upcoming 4th edition of Artificial Intelligence: A Modern Approach will not have exercises in the book; they will be online only. We need help in launching a website for the exercises, and in developing some new exercises and answers. Last year we got a good start on the project; this year we need to finish the interface, refine the mechanism for showing answers and hints, test it, and do performance load measurements to make sure it will hold up under load. Skills: testing, user interface design. Possible mentors: Nalin Chhibber

(2) Java Algorithms

Finish implementing all the pseudocode algorithms in the book in Java. A majority of the algorithms from the 3rd edition are done, but there are some new ones in the upcoming 4th edition, as described in the aima-pseudocode project. Make sure the code follows the pseudocode well, and also shows good style. Also, provide examples of usage, documentation, and thorough test cases. Skills: Java programming, documentation. Possible mentors: Peter Norvig

(3) Python Algorithms

Finish implementing all the pseudocode algorithms in the book in Python. Almost all of the algorithms from the 3rd edition are done, but there are some new ones in the upcoming 4th edition, as described in the aima-pseudocode project. Make sure the code follows the pseudocode well, and also shows good style. Also, provide examples of usage, documentation, and thorough test cases. Skills: Python programming, documentation. Possible mentors: Pierre de Lacaze

(4) Example Notebooks

Using Jupyter/IPython or similar mechanisms, develop example worked projects that demonstrate the use of the algorithms from (2) and (3) above to solve interesting problems. Examples could include game playing, natural language processing, machine learning, and other topics, depending on your interest. Skills: Python programming, writing clearly. Possible mentors: Pierre de Lacaze

(5) Container Notebooks

Continuing the theme from (4) above, but demonstrating how to load an existing third-party open source framework, such as TensorFlow, Theano, Caffe, Keras, Torch, Stanford CoreNLP, NLTK, Sci-kit Learn, or Spark. Create a container (Docker or Kubernetes) that has all the dependencies, and a notebook and documentation that shows how to use it to solve an interesting real-world problem or set of problems. Skills: familiarity with containers, attention to detail, good at explanations. Possible mentors: Peter Norvig

(6) Javascript Gridworld

We have code for agents learning, searching, and acting in a grid layout. We need better visualizations of that it Javascript. Make it possible for students to examine existing problems and see what is going on through a simulation of the world, and visualization of various key metrics. Make it easy to define a new world, or to define a new agent function and run it within the world. Skills: User interface design, Javascript programming. Possible mentors: Sam Goto

GSoC Application Process

If you'd like to help, you can apply to GSoC.

See: