Arrow Research search

Author name cluster

Ru He

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

4 papers
2 author rows

Possible papers

4

AAAI Conference 2022 Conference Paper

SAS: Self-Augmentation Strategy for Language Model Pre-training

  • Yifei Xu
  • Jingqiao Zhang
  • Ru He
  • Liangzhu Ge
  • Chao Yang
  • Cheng Yang
  • Ying Nian Wu

The core of self-supervised learning for pre-training language models includes pre-training task design as well as appropriate data augmentation. Most data augmentations in language model pre-training are context-independent. A seminal contextualized augmentation was recently proposed in ELECTRA and achieved state-of-the-art performance by introducing an auxiliary generation network (generator) to produce contextualized data augmentation for the training of a main discrimination network (discriminator). This design, however, introduces extra computation cost of the generator and a need to adjust the relative capability between the generator and the discriminator. In this paper, we propose a self-augmentation strategy (SAS) where a single network is utilized for both regular pre-training and contextualized data augmentation for the training in later epochs. Essentially, this strategy eliminates a separate generator and uses the single network to jointly conduct two pre-training tasks with MLM (Masked Language Modeling) and RTD (Replaced Token Detection) heads. It avoids the challenge to search for an appropriate size of the generator, which is critical to the performance as evidenced in ELECTRA and its subsequent variant models. In addition, SAS is a general strategy that can be seamlessly combined with many new techniques emerging recently or in the future, such as the disentangled attention mechanism from DeBERTa. Our experiments show that SAS outperforms ELECTRA and other state-of-the-art models in the GLUE tasks with similar or less computation cost.

JMLR Journal 2016 Journal Article

Structure Learning in Bayesian Networks of a Moderate Size by Efficient Sampling

  • Ru He
  • Jin Tian
  • Huaiqing Wu

We study the Bayesian model averaging approach to learning Bayesian network structures (DAGs) from data. We develop new algorithms including the first algorithm that is able to efficiently sample DAGs of a moderate size (with up to about 25 variables) according to the exact structure posterior. The DAG samples can then be used to construct estimators for the posterior of any feature. We theoretically prove good properties of our estimators and empirically show that our estimators considerably outperform the estimators from the previous state- of-the-art methods. [abs] [ pdf ][ bib ] [ appendix ] &copy JMLR 2016. ( edit, beta )

UAI Conference 2010 Conference Paper

Bayesian Model Averaging Using the k-best Bayesian Network Structures

  • Jin Tian 0001
  • Ru He
  • Lavanya Ram

We study the problem of learning Bayesian network structures from data. We develop an algorithm for finding the k-best Bayesian network structures. We propose to compute the posterior probabilities of hypotheses of interest by Bayesian model averaging over the k-best Bayesian networks. We present empirical results on structural discovery over several real and synthetic data sets and show that the method outperforms the model selection method and the stateof-the-art MCMC methods.

UAI Conference 2009 Conference Paper

Computing Posterior Probabilities of Structural Features in Bayesian Networks

  • Jin Tian 0001
  • Ru He

ables, represented by the edges in the network structure [Heckerman et al. , 1999]. We study the problem of learning Bayesian network structures from data. Koivisto and Sood (2004) and Koivisto (2006) presented algorithms that can compute the exact marginal posterior probability of a subnetwork, e. g. , a single edge, in O(n2n ) time and the posterior probabilities for all n(n − 1) potential edges in O(n2n ) total time, assuming that the number of parents per node or the indegree is bounded by a constant. One main drawback of their algorithms is the requirement of a special structure prior that is non uniform and does not respect Markov equivalence. In this paper, we develop an algorithm that can compute the exact posterior probability of a subnetwork in O(3n ) time and the posterior probabilities for all n(n − 1) potential edges in O(n3n ) total time. Our algorithm also assumes a bounded indegree but allows general structure priors. We demonstrate the applicability of the algorithm on several data sets with up to 20 variables. The number of possible network structures is superexponential O(n! 2n(n−1)/2 ) in the number of variables n. For example, there are about 104 directed acyclic graphs (DAGs) on 5 nodes, and 1018 DAGs on 10 nodes. As a result, it is impractical to sum over all possible structures unless for very small networks (less than 8 variables). One solution is to compute approximate posterior probabilities. Madigan and York (1995) used Markov chain Monte Carlo (MCMC) algorithm in the space of network structures. Friedman and Koller (2003) developed a MCMC procedure in the space of node orderings which was shown to be more efficient than MCMC in the space of DAGs. One problem to the MCMC approach is that there is no guarantee on the quality of the approximation in finite runs.

v2026.09.13