Students that work with me should have knowledge of:

- linear algebra (e.g., eigenvalues, Hessian, gradients.)
- discrete math (e.g., graphs, proof by contradiction, proof by induction.)
- theory of algorithms (e.g., computational complexity.)
- experience in proving theorems (by already submitted or accepted papers) is highly encouraged, although not required.
- good programming experience (e.g., C++ or Matlab.)

- avid readers of the literature (e.g., UAI, ICML, AISTATS, NIPS, JMLR.)
- self-motivated, committed, hard working individuals.

- Learning the Structure and Parameters of Large-Population Graphical Games from Behavioral Data (See for instance Theorem 12.)
- On the Statistical Efficiency of L
_{1,p}Multi-Task Learning of Gaussian Graphical Models (See for instance Theorem 1.) - The above and all my papers can be found at my webpage. You will also see which topics I have lately focused on.

Best regards,

Jean Honorio