Stan Math Library  2.12.0
reverse mode automatic differentiation
binomial_log.hpp
Go to the documentation of this file.
1 #ifndef STAN_MATH_PRIM_SCAL_PROB_BINOMIAL_LOG_HPP
2 #define STAN_MATH_PRIM_SCAL_PROB_BINOMIAL_LOG_HPP
3 
24 #include <boost/random/binomial_distribution.hpp>
25 #include <boost/random/variate_generator.hpp>
26 
27 namespace stan {
28  namespace math {
29 
30  // Binomial(n|N, theta) [N >= 0; 0 <= n <= N; 0 <= theta <= 1]
31  template <bool propto,
32  typename T_n,
33  typename T_N,
34  typename T_prob>
35  typename return_type<T_prob>::type
36  binomial_log(const T_n& n,
37  const T_N& N,
38  const T_prob& theta) {
40  T_partials_return;
41 
42  static const char* function("binomial_log");
43 
44  if (!(stan::length(n)
45  && stan::length(N)
46  && stan::length(theta)))
47  return 0.0;
48 
49  T_partials_return logp = 0;
50  check_bounded(function, "Successes variable", n, 0, N);
51  check_nonnegative(function, "Population size parameter", N);
52  check_finite(function, "Probability parameter", theta);
53  check_bounded(function, "Probability parameter", theta, 0.0, 1.0);
54  check_consistent_sizes(function,
55  "Successes variable", n,
56  "Population size parameter", N,
57  "Probability parameter", theta);
58 
60  return 0.0;
61 
62  VectorView<const T_n> n_vec(n);
63  VectorView<const T_N> N_vec(N);
64  VectorView<const T_prob> theta_vec(theta);
65  size_t size = max_size(n, N, theta);
66 
67  OperandsAndPartials<T_prob> operands_and_partials(theta);
68 
70  for (size_t i = 0; i < size; ++i)
71  logp += binomial_coefficient_log(N_vec[i], n_vec[i]);
72  }
73 
75  for (size_t i = 0; i < length(theta); ++i)
76  log1m_theta[i] = log1m(value_of(theta_vec[i]));
77 
78  for (size_t i = 0; i < size; ++i)
79  logp += multiply_log(n_vec[i], value_of(theta_vec[i]))
80  + (N_vec[i] - n_vec[i]) * log1m_theta[i];
81 
82  if (length(theta) == 1) {
83  T_partials_return temp1 = 0;
84  T_partials_return temp2 = 0;
85  for (size_t i = 0; i < size; ++i) {
86  temp1 += n_vec[i];
87  temp2 += N_vec[i] - n_vec[i];
88  }
90  operands_and_partials.d_x1[0]
91  += temp1 / value_of(theta_vec[0])
92  - temp2 / (1.0 - value_of(theta_vec[0]));
93  }
94  } else {
96  for (size_t i = 0; i < size; ++i)
97  operands_and_partials.d_x1[i]
98  += n_vec[i] / value_of(theta_vec[i])
99  - (N_vec[i] - n_vec[i]) / (1.0 - value_of(theta_vec[i]));
100  }
101  }
102 
103  return operands_and_partials.value(logp);
104  }
105 
106  template <typename T_n,
107  typename T_N,
108  typename T_prob>
109  inline
111  binomial_log(const T_n& n,
112  const T_N& N,
113  const T_prob& theta) {
114  return binomial_log<false>(n, N, theta);
115  }
116 
117  }
118 }
119 #endif
fvar< T > binomial_coefficient_log(const fvar< T > &x1, const fvar< T > &x2)
T value_of(const fvar< T > &v)
Return the value of the specified variable.
Definition: value_of.hpp:16
T_return_type value(double value)
Returns a T_return_type with the value specified with the partial derivatves.
size_t length(const std::vector< T > &x)
Definition: length.hpp:10
bool check_bounded(const char *function, const char *name, const T_y &y, const T_low &low, const T_high &high)
Return true if the value is between the low and high values, inclusively.
return_type< T_prob >::type binomial_log(const T_n &n, const T_N &N, const T_prob &theta)
Template metaprogram to calculate whether a summand needs to be included in a proportional (log) prob...
boost::math::tools::promote_args< typename scalar_type< T1 >::type, typename scalar_type< T2 >::type, typename scalar_type< T3 >::type, typename scalar_type< T4 >::type, typename scalar_type< T5 >::type, typename scalar_type< T6 >::type >::type type
Definition: return_type.hpp:27
Metaprogram to determine if a type has a base scalar type that can be assigned to type double...
This class builds partial derivatives with respect to a set of operands.
size_t max_size(const T1 &x1, const T2 &x2)
Definition: max_size.hpp:9
bool check_finite(const char *function, const char *name, const T_y &y)
Return true if y is finite.
fvar< T > multiply_log(const fvar< T > &x1, const fvar< T > &x2)
VectorBuilder allocates type T1 values to be used as intermediate values.
int size(const std::vector< T > &x)
Return the size of the specified standard vector.
Definition: size.hpp:17
bool check_consistent_sizes(const char *function, const char *name1, const T1 &x1, const char *name2, const T2 &x2)
Return true if the dimension of x1 is consistent with x2.
bool check_nonnegative(const char *function, const char *name, const T_y &y)
Return true if y is non-negative.
VectorView is a template expression that is constructed with a container or scalar, which it then allows to be used as an array using operator[].
Definition: VectorView.hpp:48
boost::math::tools::promote_args< typename partials_type< typename scalar_type< T1 >::type >::type, typename partials_type< typename scalar_type< T2 >::type >::type, typename partials_type< typename scalar_type< T3 >::type >::type, typename partials_type< typename scalar_type< T4 >::type >::type, typename partials_type< typename scalar_type< T5 >::type >::type, typename partials_type< typename scalar_type< T6 >::type >::type >::type type
fvar< T > log1m(const fvar< T > &x)
Definition: log1m.hpp:15
VectorView< T_return_type, false, true > d_x1

     [ Stan Home Page ] © 2011–2016, Stan Development Team.