Lectures: Thursday, 4:30-7:10pm, Innovation Hall, room 336
Some of the lectures will be based on the instructor's notes posted on this website. Some lectures will be accompanied only by notes written on the board.
If you send email to the instructor, please put "CSI 972" or "STAT 972" in the subject line.
This course is part of a two-course sequence. The general description of the two courses is available at mason.gmu.edu/~jgentle/csi9723/
The prerequisites for this course include a course in mathematical statistics at the advanced calculus level, for example, at George Mason, CSI 672 / STAT 652, "Statistical Inference".
This course is primarily on the theory of estimation. It begins with a brief discussion of probability theory, and then covers fundamentals of statistical inference. The principles of estimation are then explored systematically, beginning with a general formulation of statistical decision theory and optimal decision rules. Minimum variance unbiased estimation is covered in detail. Topics include sufficiency and completeness of statistics, Fisher information, bounds on variances, consistency and other asymptotic properties. Other topics and approaches in parametric estimation are covered in detail.
The text is Jun Shao (2003), Mathematical Statistics,
second edition, Springer.
Be sure to get the corrections at the author's website
A useful supplement is Jun Shao (2005), Mathematical Statistics: Exercises and Solutions, Springer. My assigned "exercises for practice and discussion" are all solved (or at least partially solved) in this book.
I will also use my Companion notes.
I plan to cover the material through Chapter 4 in the Companion during the fall semester for 972.
I plan to cover the remainder in 973.
See also the references listed in the general description.
One learns mathematical theory primarily by individual work; that is, by supplying the successive steps in solving a problem or proving a theorem. Some mathematical theory is learned and reinforced by passive activities such as reading or listening to lectures and discussions, and the assigned readings and weekly lectures are meant to serve this purpose. The reading assignments listed in the schedule below should be carried out with a pencil and paper in hand. The readings should be iterated as necessary to achieve a complete understanding of the material.
Student work in the course (and the relative weighting of this work in the overall grade) will consist of
Each homework will be graded based on 100 points, and 5 points will be deducted for each day that the homework is late. The homework assignments are long, so they should be begun long before they are due. Start each problem on a new sheet of paper and label it clearly. The problems do not need to be worked sequentially (some are much harder than others); when you are stuck on one problem, go on to the next one.
Each student enrolled in this course must assume the responsibilities of an active participant in GMU's scholarly community in which everyone's academic work and behavior are held to the highest standards of honesty. The GMU policy on academic conduct will be followed in this course.
Students are free to discuss the homework with each other or anyone else, and are free to use any reference sources. Explicit copying should not be done.
Students are not to communicate concerning exams with each other or with any person other than the instructor. On take-home exams, any passive reference is permissible (that is, the student cannot ask someone for information, but the student may use any existing information from whatever source).
For in-class exams, one sheet of notes will be allowed.
An approximate schedule is shown below. As the semester progresses,
more details will be provided, and there may be some slight adjustments.
Notes are posted in a password-protected directory.
Students are expected to read the relevant material in the text prior to each class (after the first one).
Students are strongly encouraged to solve the "exercises for practice and discussion", especially those marked with an asterisk.