Automatic Differentiation
 
Loading...
Searching...
No Matches
pareto_type_2_cdf.hpp
Go to the documentation of this file.
1#ifndef STAN_MATH_PRIM_PROB_PARETO_TYPE_2_CDF_HPP
2#define STAN_MATH_PRIM_PROB_PARETO_TYPE_2_CDF_HPP
3
16#include <cmath>
17
18namespace stan {
19namespace math {
20
21template <typename T_y, typename T_loc, typename T_scale, typename T_shape,
23 T_y, T_loc, T_scale, T_shape>* = nullptr>
25 const T_y& y, const T_loc& mu, const T_scale& lambda,
26 const T_shape& alpha) {
28 using T_y_ref = ref_type_if_not_constant_t<T_y>;
29 using T_mu_ref = ref_type_if_not_constant_t<T_loc>;
30 using T_lambda_ref = ref_type_if_not_constant_t<T_scale>;
31 using T_alpha_ref = ref_type_if_not_constant_t<T_shape>;
32 using std::pow;
33 static constexpr const char* function = "pareto_type_2_cdf";
34 check_consistent_sizes(function, "Random variable", y, "Location parameter",
35 mu, "Scale parameter", lambda, "Shape parameter",
36 alpha);
37
38 if (size_zero(y, mu, lambda, alpha)) {
39 return 1.0;
40 }
41
42 T_y_ref y_ref = y;
43 T_mu_ref mu_ref = mu;
44 T_lambda_ref lambda_ref = lambda;
45 T_alpha_ref alpha_ref = alpha;
46
47 decltype(auto) y_val = to_ref(as_value_column_array_or_scalar(y_ref));
48 decltype(auto) mu_val = to_ref(as_value_column_array_or_scalar(mu_ref));
49 decltype(auto) lambda_val
51 decltype(auto) alpha_val = to_ref(as_value_column_array_or_scalar(alpha_ref));
52
53 check_nonnegative(function, "Random variable", y_val);
54 check_positive_finite(function, "Scale parameter", lambda_val);
55 check_positive_finite(function, "Shape parameter", alpha_val);
56 check_greater_or_equal(function, "Random variable", y_val, mu_val);
57
58 const auto& summed = to_ref_if<is_any_autodiff_v<T_y, T_loc, T_scale>>(
59 lambda_val + y_val - mu_val);
60 const auto& temp = to_ref_if<is_autodiff_v<T_shape>>(summed / lambda_val);
61 const auto& p1_pow_alpha
62 = to_ref_if<is_any_autodiff_v<T_y, T_loc, T_scale, T_shape>>(
63 pow(temp, -alpha_val));
64 T_partials_return P = prod(1.0 - p1_pow_alpha);
65
66 auto ops_partials
67 = make_partials_propagator(y_ref, mu_ref, lambda_ref, alpha_ref);
68
69 if constexpr (is_any_autodiff_v<T_y, T_loc, T_scale, T_shape>) {
70 const auto& P_div_Pn = to_ref_if<(
71 is_any_autodiff_v<T_y, T_loc, T_scale> && is_autodiff_v<T_shape>)>(
72 P / (1.0 - p1_pow_alpha));
73 if constexpr (is_any_autodiff_v<T_y, T_loc, T_scale>) {
74 auto grad_1_2 = to_ref_if<
76 T_loc> + is_autodiff_v<T_scale> + is_autodiff_v<T_y> >= 2>(
77 p1_pow_alpha / summed * alpha_val * P_div_Pn);
78 if constexpr (is_autodiff_v<T_loc>) {
79 partials<1>(ops_partials) = -grad_1_2;
80 }
81 if constexpr (is_autodiff_v<T_scale>) {
82 edge<2>(ops_partials).partials_
83 = (mu_val - y_val) / lambda_val * grad_1_2;
84 }
85 if constexpr (is_autodiff_v<T_y>) {
86 partials<0>(ops_partials) = std::move(grad_1_2);
87 }
88 }
89 if constexpr (is_autodiff_v<T_shape>) {
90 partials<3>(ops_partials) = log(temp) * p1_pow_alpha * P_div_Pn;
91 }
92 }
93 return ops_partials.build(P);
94}
95
96} // namespace math
97} // namespace stan
98#endif
require_all_not_t< is_nonscalar_prim_or_rev_kernel_expression< std::decay_t< Types > >... > require_all_not_nonscalar_prim_or_rev_kernel_expression_t
Require none of the types satisfy is_nonscalar_prim_or_rev_kernel_expression.
return_type_t< T_y_cl, T_loc_cl, T_scale_cl, T_shape_cl > pareto_type_2_cdf(const T_y_cl &y, const T_loc_cl &mu, const T_scale_cl &lambda, const T_shape_cl &alpha)
Returns the pareto type 2 cumulative density function.
typename return_type< Ts... >::type return_type_t
Convenience type for the return type of the specified template parameters.
void check_nonnegative(const char *function, const char *name, const T_y &y)
Check if y is non-negative.
bool size_zero(const T &x)
Returns 1 if input is of length 0, returns 0 otherwise.
Definition size_zero.hpp:19
value_type_t< T > prod(const T &m)
Calculates product of given kernel generator expression elements.
Definition prod.hpp:21
T to_ref_if(T &&a)
No-op that should be optimized away.
Definition to_ref.hpp:45
auto pow(const T1 &x1, const T2 &x2)
Definition pow.hpp:32
fvar< T > log(const fvar< T > &x)
Definition log.hpp:18
void check_greater_or_equal(const char *function, const char *name, const T_y &y, const T_low &low, Idxs... idxs)
Throw an exception if y is not greater or equal than low.
auto as_value_column_array_or_scalar(T &&a)
Extract the value from an object and for eigen vectors and std::vectors convert to an eigen column ar...
void check_consistent_sizes(const char *)
Trivial no input case, this function is a no-op.
ref_type_t< T && > to_ref(T &&a)
This evaluates expensive Eigen expressions.
Definition to_ref.hpp:18
auto make_partials_propagator(Ops &&... ops)
Construct an partials_propagator.
void check_positive_finite(const char *function, const char *name, const T_y &y)
Check if y is positive and finite.
typename ref_type_if< is_autodiff_v< T >, T >::type ref_type_if_not_constant_t
Definition ref_type.hpp:63
constexpr bool is_autodiff_v
typename partials_return_type< Args... >::type partials_return_t
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...