Stan Math Library  2.15.0
reverse mode automatic differentiation
neg_binomial_lccdf.hpp
Go to the documentation of this file.
1 #ifndef STAN_MATH_PRIM_SCAL_PROB_NEG_BINOMIAL_LCCDF_HPP
2 #define STAN_MATH_PRIM_SCAL_PROB_NEG_BINOMIAL_LCCDF_HPP
3 
22 #include <boost/math/special_functions/digamma.hpp>
23 #include <boost/random/negative_binomial_distribution.hpp>
24 #include <boost/random/variate_generator.hpp>
25 #include <cmath>
26 #include <limits>
27 
28 namespace stan {
29  namespace math {
30 
31  template <typename T_n, typename T_shape,
32  typename T_inv_scale>
34  neg_binomial_lccdf(const T_n& n, const T_shape& alpha,
35  const T_inv_scale& beta) {
36  static const char* function("neg_binomial_lccdf");
37  typedef typename stan::partials_return_type<T_n, T_shape,
38  T_inv_scale>::type
39  T_partials_return;
40 
41  if (!(stan::length(n) && stan::length(alpha) && stan::length(beta)))
42  return 0.0;
43 
44  T_partials_return P(0.0);
45 
46  check_positive_finite(function, "Shape parameter", alpha);
47  check_positive_finite(function, "Inverse scale parameter", beta);
48  check_consistent_sizes(function,
49  "Failures variable", n,
50  "Shape parameter", alpha,
51  "Inverse scale parameter", beta);
52 
54  scalar_seq_view<const T_shape> alpha_vec(alpha);
56  size_t size = max_size(n, alpha, beta);
57 
58  using std::exp;
59  using std::pow;
60  using std::log;
61  using std::exp;
62 
64  operands_and_partials(alpha, beta);
65 
66  // Explicit return for extreme values
67  // The gradients are technically ill-defined, but treated as zero
68  for (size_t i = 0; i < stan::length(n); i++) {
69  if (value_of(n_vec[i]) < 0)
70  return operands_and_partials.value(0.0);
71  }
72 
74  T_partials_return, T_shape>
75  digammaN_vec(stan::length(alpha));
77  T_partials_return, T_shape>
78  digammaAlpha_vec(stan::length(alpha));
80  T_partials_return, T_shape>
81  digammaSum_vec(stan::length(alpha));
82 
84  for (size_t i = 0; i < stan::length(alpha); i++) {
85  const T_partials_return n_dbl = value_of(n_vec[i]);
86  const T_partials_return alpha_dbl = value_of(alpha_vec[i]);
87 
88  digammaN_vec[i] = digamma(n_dbl + 1);
89  digammaAlpha_vec[i] = digamma(alpha_dbl);
90  digammaSum_vec[i] = digamma(n_dbl + alpha_dbl + 1);
91  }
92  }
93 
94  for (size_t i = 0; i < size; i++) {
95  // Explicit results for extreme values
96  // The gradients are technically ill-defined, but treated as zero
97  if (value_of(n_vec[i]) == std::numeric_limits<int>::max())
98  return operands_and_partials.value(negative_infinity());
99 
100  const T_partials_return n_dbl = value_of(n_vec[i]);
101  const T_partials_return alpha_dbl = value_of(alpha_vec[i]);
102  const T_partials_return beta_dbl = value_of(beta_vec[i]);
103  const T_partials_return p_dbl = beta_dbl / (1.0 + beta_dbl);
104  const T_partials_return d_dbl = 1.0 / ( (1.0 + beta_dbl)
105  * (1.0 + beta_dbl) );
106  const T_partials_return Pi = 1.0 - inc_beta(alpha_dbl, n_dbl + 1.0,
107  p_dbl);
108  const T_partials_return beta_func = exp(lbeta(n_dbl + 1, alpha_dbl));
109 
110  P += log(Pi);
111 
113  T_partials_return g1 = 0;
114  T_partials_return g2 = 0;
115 
116  grad_reg_inc_beta(g1, g2, alpha_dbl,
117  n_dbl + 1, p_dbl,
118  digammaAlpha_vec[i],
119  digammaN_vec[i],
120  digammaSum_vec[i],
121  beta_func);
122  operands_and_partials.d_x1[i] -= g1 / Pi;
123  }
125  operands_and_partials.d_x2[i] -= d_dbl * pow(1-p_dbl, n_dbl)
126  * pow(p_dbl, alpha_dbl-1) / beta_func / Pi;
127  }
128 
129  return operands_and_partials.value(P);
130  }
131 
132  }
133 }
134 #endif
VectorView< T_return_type, false, true > d_x2
T value_of(const fvar< T > &v)
Return the value of the specified variable.
Definition: value_of.hpp:16
fvar< T > lbeta(const fvar< T > &x1, const fvar< T > &x2)
Definition: lbeta.hpp:15
fvar< T > log(const fvar< T > &x)
Definition: log.hpp:14
T_return_type value(double value)
Returns a T_return_type with the value specified with the partial derivatves.
scalar_seq_view provides a uniform sequence-like wrapper around either a scalar or a sequence of scal...
size_t length(const std::vector< T > &x)
Definition: length.hpp:10
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...
fvar< T > inc_beta(const fvar< T > &a, const fvar< T > &b, const fvar< T > &x)
Definition: inc_beta.hpp:19
return_type< T_shape, T_inv_scale >::type neg_binomial_lccdf(const T_n &n, const T_shape &alpha, const T_inv_scale &beta)
void check_positive_finite(const char *function, const char *name, const T_y &y)
Check if y is positive and finite.
void grad_reg_inc_beta(T &g1, T &g2, const T &a, const T &b, const T &z, const T &digammaA, const T &digammaB, const T &digammaSum, const T &betaAB)
Computes the gradients of the regularized incomplete beta function.
fvar< T > exp(const fvar< T > &x)
Definition: exp.hpp:10
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
int max(const std::vector< int > &x)
Returns the maximum coefficient in the specified column vector.
Definition: max.hpp:22
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
fvar< T > pow(const fvar< T > &x1, const fvar< T > &x2)
Definition: pow.hpp:17
void check_consistent_sizes(const char *function, const char *name1, const T1 &x1, const char *name2, const T2 &x2)
Check if the dimension of x1 is consistent with x2.
VectorView< T_return_type, false, true > d_x1
double negative_infinity()
Return negative infinity.
Definition: constants.hpp:130
fvar< T > digamma(const fvar< T > &x)
Return the derivative of the log gamma function at the specified argument.
Definition: digamma.hpp:22

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