NZNingshan Zhang

Ningshan Zhang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Ningshan Zhang has a total of 15 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Joint latent class trees: A tree-based approach to modeling time-to-event and longitudinal data

    by Ningshan Zhang, Jeffrey S Simonoff

    In this paper, we propose a semiparametric, tree-based joint latent class model for the joint behavior of longitudinal and time-to-event data. Existing joint latent class approaches are parametric and can suffer from high computational cost. The most common parametric approach, the joint latent class model, further restricts analysis to using time-invariant covariates in modeling survival risks and latent class memberships. The proposed tree method (joint latent class tree) is fast to fit, and permits time-varying covariates in all of its modeling components. We demonstrate the prognostic value of using time-varying covariates, and therefore the advantage of joint latent class tree over joint latent class model on simulated data. We apply joint latent class tree to a well-known data set (the PAQUID data set) and confirm its superior prediction performance and orders-of-magnitude speedup over joint latent class model.


  • Open Access

    A Discriminative Technique for Multiple-Source Adaptation

    by Corinna Cortes, Mehryar Mohri, Ananda Theertha Suresh, Ningshan Zhang

    We present a new discriminative technique for the multiple-source adaptation, MSA, problem. Unlike previous work, which relies on density estimation for each source domain, our solution only requires conditional probabilities that can easily be accurately estimated from unlabeled data from the source domains. We give a detailed analysis of our new technique, including general guarantees based on R\'enyi divergences, and learning bounds when conditional Maxent is used for estimating conditional probabilities for a point to belong to a source domain. We show that these guarantees compare favorably to those that can be derived for the generative solution, using kernel density estimation. Our experiments with real-world applications further demonstrate that our new discriminative MSA algorithm outperforms the previous generative solution as well as other domain adaptation baselines.

  • Open Access

    Adaptive Region-Based Active Learning

    by Corinna Cortes, Giulia DeSalvo, Claudio Gentile, Mehryar Mohri, Ningshan Zhang

    We present a new active learning algorithm that adaptively partitions the input space into a finite number of regions, and subsequently seeks a distinct predictor for each region, both phases actively requesting labels. We prove theoretical guarantees for both the generalization error and the label complexity of our algorithm, and analyze the number of regions defined by the algorithm under some mild assumptions. We also report the results of an extensive suite of experiments on several real-world datasets demonstrating substantial empirical benefits over existing single-region and non-adaptive region-based active learning baselines.

  • Open Access

    Learning GANs and Ensembles Using Discrepancy

    by Ben Adlam, Corinna Cortes, Mehryar Mohri, Ningshan Zhang

    Generative adversarial networks (GANs) generate data based on minimizing a divergence between two distributions. The choice of that divergence is therefore critical. We argue that the divergence must take into account the hypothesis set and the loss function used in a subsequent learning task, where the data generated by a GAN serves for training. Taking that structural information into account is also important to derive generalization guarantees. Thus, we propose to use the discrepancy measure, which was originally introduced for the closely related problem of domain adaptation and which precisely takes into account the hypothesis set and the loss function. We show that discrepancy admits favorable properties for training GANs and prove explicit generalization guarantees. We present efficient algorithms using discrepancy for two tasks: training a GAN directly, namely DGAN, and mixing previously trained generative models, namely EDGAN. Our experiments on toy examples and several benchmark datasets show that DGAN is competitive with other GANs and that EDGAN outperforms existing GAN ensembles, such as AdaGAN.

  • Open Access

    Fitting a deeply-nested hierarchical model to a large book review dataset using a moment-based estimator

    by Ningshan Zhang, Kyle Schmaus, Patrick O. Perry

    We consider a particular instance of a common problem in recommender systems: using a database of book reviews to inform user-targeted recommendations. In our dataset, books are categorized into genres and sub-genres. To exploit this nested taxonomy, we use a hierarchical model that enables information pooling across across similar items at many levels within the genre hierarchy. The main challenge in deploying this model is computational: the data sizes are large, and fitting the model at scale using off-the-shelf maximum likelihood procedures is prohibitive. To get around this computational bottleneck, we extend a moment-based fitting procedure proposed for fitting single-level hierarchical models to the general case of arbitrarily deep hierarchies. This extension is an order of magnetite faster than standard maximum likelihood procedures. The fitting method can be deployed beyond recommender systems to general contexts with deeply-nested hierarchical generalized linear mixed models.

  • Open Access

    Algorithms and Theory for Multiple-Source Adaptation

    by Judy Hoffman, Mehryar Mohri, Ningshan Zhang

    This work includes a number of novel contributions for the multiple-source adaptation problem. We present new normalized solutions with strong theoretical guarantees for the cross-entropy loss and other similar losses. We also provide new guarantees that hold in the case where the conditional probabilities for the source domains are distinct. Moreover, we give new algorithms for determining the distribution-weighted combination solution for the cross-entropy loss and other losses. We report the results of a series of experiments with real-world datasets. We find that our algorithm outperforms competing approaches by producing a single robust model that performs well on any target mixture distribution. Altogether, our theory, algorithms, and empirical results provide a full solution for the multiple-source adaptation problem with very practical benefits.