|
| 1 | +#include <stan/math/prim.hpp> |
| 2 | +#include <gtest/gtest.h> |
| 3 | +#include <boost/random/mersenne_twister.hpp> |
| 4 | +#include <boost/math/distributions.hpp> |
| 5 | +#include <limits> |
| 6 | +#include <vector> |
| 7 | + |
| 8 | +using Eigen::Dynamic; |
| 9 | +using Eigen::Matrix; |
| 10 | + |
| 11 | +TEST(ProbDistributionsMultinomialLogit, RNGSize) { |
| 12 | + boost::random::mt19937 rng; |
| 13 | + Matrix<double, Dynamic, 1> beta(5); |
| 14 | + beta << log(0.3), log(0.1), log(0.2), log(0.2), log(0.2); |
| 15 | + std::vector<int> sample = stan::math::multinomial_logit_rng(beta, 10, rng); |
| 16 | + EXPECT_EQ(5U, sample.size()); |
| 17 | +} |
| 18 | + |
| 19 | +TEST(ProbDistributionsMultinomialLogit, MultinomialLogit) { |
| 20 | + std::vector<int> ns; |
| 21 | + ns.push_back(1); |
| 22 | + ns.push_back(2); |
| 23 | + ns.push_back(3); |
| 24 | + Matrix<double, Dynamic, 1> beta(3, 1); |
| 25 | + beta << log(0.2), log(0.3), log(0.5); |
| 26 | + EXPECT_FLOAT_EQ(-2.002481, stan::math::multinomial_logit_log(ns, beta)); |
| 27 | +} |
| 28 | +TEST(ProbDistributionsMultinomialLogit, Propto) { |
| 29 | + std::vector<int> ns; |
| 30 | + ns.push_back(1); |
| 31 | + ns.push_back(2); |
| 32 | + ns.push_back(3); |
| 33 | + Matrix<double, Dynamic, 1> beta(3, 1); |
| 34 | + beta << log(0.2), log(0.3), log(0.5); |
| 35 | + EXPECT_FLOAT_EQ(0.0, stan::math::multinomial_logit_log<true>(ns, beta)); |
| 36 | +} |
| 37 | + |
| 38 | +using stan::math::multinomial_logit_log; |
| 39 | + |
| 40 | +TEST(ProbDistributionsMultinomialLogit, error) { |
| 41 | + double nan = std::numeric_limits<double>::quiet_NaN(); |
| 42 | + double inf = std::numeric_limits<double>::infinity(); |
| 43 | + |
| 44 | + std::vector<int> ns; |
| 45 | + ns.push_back(1); |
| 46 | + ns.push_back(2); |
| 47 | + ns.push_back(3); |
| 48 | + Matrix<double, Dynamic, 1> beta(3, 1); |
| 49 | + beta << log(0.2), log(0.3), log(0.5); |
| 50 | + |
| 51 | + EXPECT_NO_THROW(multinomial_logit_log(ns, beta)); |
| 52 | + |
| 53 | + ns[1] = 0; |
| 54 | + EXPECT_NO_THROW(multinomial_logit_log(ns, beta)); |
| 55 | + ns[1] = -1; |
| 56 | + EXPECT_THROW(multinomial_logit_log(ns, beta), std::domain_error); |
| 57 | + ns[1] = 1; |
| 58 | + |
| 59 | + beta(0) = nan; |
| 60 | + EXPECT_THROW(multinomial_logit_log(ns, beta), std::domain_error); |
| 61 | + beta(0) = inf; |
| 62 | + EXPECT_THROW(multinomial_logit_log(ns, beta), std::domain_error); |
| 63 | + beta(0) = -inf; |
| 64 | + EXPECT_THROW(multinomial_logit_log(ns, beta), std::domain_error); |
| 65 | + |
| 66 | + beta(0) = 0.2; |
| 67 | + beta(1) = 0.3; |
| 68 | + beta(2) = 0.5; |
| 69 | + |
| 70 | + ns.resize(2); |
| 71 | + EXPECT_THROW(multinomial_logit_log(ns, beta), std::invalid_argument); |
| 72 | +} |
| 73 | + |
| 74 | +TEST(ProbDistributionsMultinomialLogit, zeros) { |
| 75 | + double result; |
| 76 | + std::vector<int> ns; |
| 77 | + ns.push_back(0); |
| 78 | + ns.push_back(1); |
| 79 | + ns.push_back(2); |
| 80 | + Matrix<double, Dynamic, 1> beta(3, 1); |
| 81 | + beta << log(0.2), log(0.3), log(0.5); |
| 82 | + |
| 83 | + result = multinomial_logit_log(ns, beta); |
| 84 | + EXPECT_FALSE(std::isnan(result)); |
| 85 | + |
| 86 | + std::vector<int> ns2; |
| 87 | + ns2.push_back(0); |
| 88 | + ns2.push_back(0); |
| 89 | + ns2.push_back(0); |
| 90 | + |
| 91 | + double result2 = multinomial_logit_log(ns2, beta); |
| 92 | + EXPECT_FLOAT_EQ(0.0, result2); |
| 93 | +} |
| 94 | + |
| 95 | +TEST(ProbDistributionsMultinomialLogit, chiSquareGoodnessFitTest) { |
| 96 | + boost::random::mt19937 rng; |
| 97 | + int M = 10; |
| 98 | + int trials = 1000; |
| 99 | + int N = M * trials; |
| 100 | + |
| 101 | + int K = 3; |
| 102 | + Matrix<double, Dynamic, 1> beta(K); |
| 103 | + beta << -1, 1, -10; |
| 104 | + Eigen::VectorXd theta = stan::math::softmax(beta); |
| 105 | + boost::math::chi_squared mydist(K - 1); |
| 106 | + |
| 107 | + double expect[K]; |
| 108 | + for (int i = 0; i < K; ++i) |
| 109 | + expect[i] = N * theta(i); |
| 110 | + |
| 111 | + int bin[K]; |
| 112 | + for (int i = 0; i < K; ++i) |
| 113 | + bin[i] = 0; |
| 114 | + |
| 115 | + for (int count = 0; count < M; ++count) { |
| 116 | + std::vector<int> a = stan::math::multinomial_logit_rng(beta, trials, rng); |
| 117 | + for (int i = 0; i < K; ++i) |
| 118 | + bin[i] += a[i]; |
| 119 | + } |
| 120 | + |
| 121 | + double chi = 0; |
| 122 | + for (int j = 0; j < K; j++) |
| 123 | + chi += ((bin[j] - expect[j]) * (bin[j] - expect[j])) / expect[j]; |
| 124 | + |
| 125 | + EXPECT_TRUE(chi < quantile(complement(mydist, 1e-6))); |
| 126 | +} |
0 commit comments