Robust machine learning algorithms for text analysis
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7307472 (Why is no real title available?)
- scientific article; zbMATH DE number 3246773 (Why is no real title available?)
- (Machine) learning parameter regions
- 10.1162/jmlr.2003.3.4-5.993
- A correlated topic model of science
- A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics
- A robust Bayesian interpretation of likelihood regions
- A sampling algorithm to compute the set of feasible solutions for nonnegative matrix factorization with an arbitrary rank
- An Empirical Model of R&D Procurement Contests: An Analysis of the DOD SBIR Program
- Approximate models and robust decisions
- Bayesian and frequentist inference in partially identified models
- Computing a nonnegative matrix factorization -- provably
- Covariances, robustness, and variational Bayes
- Doeblin and Modern Probability
- Hierarchical Dirichlet Processes
- Identification in Parametric Models
- Latent Dirichlet Analysis of Categorical Survey Responses
- On convergence of posterior distributions
- Robust Bayesian analysis: sensitivity to the prior
- Robust Bayesian inference for set-identified models
- Robust machine learning algorithms for text analysis
- The Identification of Structural Characteristics
- Transparency and deliberation within the FOMC: a computational linguistics approach
- Using SVD for Topic Modeling
- What are the limits of posterior distributions arising from nonidentified models, and why should we care?
This page was built for publication: Robust machine learning algorithms for text analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646164)
