Intended to create standard human-in-the-loop validity tests for typical automated content analysis such as topic modeling and dictionary-based methods. This package offers a standard workflow with functions to prepare, administer and evaluate a human-in-the-loop validity test. This package provides functions for validating topic models using word intrusion, topic intrusion (Chang et al. 2009,  <https://papers.nips.cc/paper/3700-reading-tea-leaves-how-humans-interpret-topic-models>) and word set intrusion (Ying et al. 2021) <doi:10.1017/pan.2021.33> tests. This package also provides functions for generating gold-standard data which are useful for validating dictionary-based methods. The default settings of all generated tests match those suggested in Chang et al. (2009) and Song et al. (2020) <doi:10.1080/10584609.2020.1723752>.

Provides the class unions that must be
  preloaded in order for the basic tools in the OOMPA (Object-Oriented 
  Microarray and Proteomics Analysis) project to be defined and loaded.
  It also includes vectorized operations for row-by-row means,
  variances, and t-tests. Finally, it provides new color schemes.
  Details on the packages in the OOMPA project can be found at
  <http://oompa.r-forge.r-project.org/>.

This is a data-only package to provide example data for
  other packages that are part of the "Object-Oriented Microrray and
  Proteomics Analysis" suite of packages. These are described in more
  detail at the package URL.

Helper functions for coding object-oriented programming with
    a focus on R6. Includes functions for assertions and testing, looping,
    and re-usable design patterns including Abstract and Decorator
    classes.

Implementation of optimistic optimization methods for global optimization of deterministic or stochastic functions. The algorithms feature guarantees of the convergence to a global optimum. They require minimal assumptions on the (only local) smoothness, where the smoothness parameter does not need to be known. They are expected to be useful for the most difficult functions when we have no information on smoothness and the gradients are unknown or do not exist. Due to the weak assumptions, however, they can be mostly effective only in small dimensions, for example, for hyperparameter tuning.