Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#257979] of David B. Dunson


Papers Published

  1. Xue, Y; Dunson, D; Carin, L, The matrix stick-breaking process for flexible multi-task learning, Acm International Conference Proceeding Series, vol. 227 (August, 2007), pp. 1063-1070, ACM Press [doi]
    (last updated on 2019/05/27)

    In multi-task learning our goal is to design regression or classification models for each of the tasks and appropriately share information between tasks. A Dirichlet process (DP) prior can be used to encourage task clustering. However, the DP prior does not allow local clustering of tasks with respect to a subset of the feature vector without making independence assumptions. Motivated by this problem, we develop a new multitask-learning prior, termed the matrix stick-breaking process (MSBP), which encourages cross-task sharing of data. However, the MSBP allows separate clustering and borrowing of information for the different feature components. This is important when tasks are more closely related for certain features than for others. Bayesian inference proceeds by a Gibbs sampling algorithm and the approach is illustrated using a simulated example and a multi-national application.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320