mirror of
https://gitlab.com/libeigen/eigen.git
synced 2024-12-21 07:19:46 +08:00
Merged in rmlarsen/eigen2 (pull request PR-466)
Move sigmoid functor to core and rename it to 'logistic'.
This commit is contained in:
commit
3ec60215df
@ -66,6 +66,7 @@ namespace Eigen
|
|||||||
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(sinh,scalar_sinh_op,hyperbolic sine,\sa ArrayBase::sinh)
|
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(sinh,scalar_sinh_op,hyperbolic sine,\sa ArrayBase::sinh)
|
||||||
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(cosh,scalar_cosh_op,hyperbolic cosine,\sa ArrayBase::cosh)
|
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(cosh,scalar_cosh_op,hyperbolic cosine,\sa ArrayBase::cosh)
|
||||||
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(tanh,scalar_tanh_op,hyperbolic tangent,\sa ArrayBase::tanh)
|
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(tanh,scalar_tanh_op,hyperbolic tangent,\sa ArrayBase::tanh)
|
||||||
|
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(logistic,scalar_logistic_op,logistic function,\sa ArrayBase::logistic)
|
||||||
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(lgamma,scalar_lgamma_op,natural logarithm of the gamma function,\sa ArrayBase::lgamma)
|
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(lgamma,scalar_lgamma_op,natural logarithm of the gamma function,\sa ArrayBase::lgamma)
|
||||||
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(digamma,scalar_digamma_op,derivative of lgamma,\sa ArrayBase::digamma)
|
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(digamma,scalar_digamma_op,derivative of lgamma,\sa ArrayBase::digamma)
|
||||||
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(erf,scalar_erf_op,error function,\sa ArrayBase::erf)
|
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(erf,scalar_erf_op,error function,\sa ArrayBase::erf)
|
||||||
@ -89,7 +90,7 @@ namespace Eigen
|
|||||||
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(isinf,scalar_isinf_op,infinite value test,\sa Eigen::isnan DOXCOMMA Eigen::isfinite DOXCOMMA ArrayBase::isinf)
|
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(isinf,scalar_isinf_op,infinite value test,\sa Eigen::isnan DOXCOMMA Eigen::isfinite DOXCOMMA ArrayBase::isinf)
|
||||||
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(isfinite,scalar_isfinite_op,finite value test,\sa Eigen::isinf DOXCOMMA Eigen::isnan DOXCOMMA ArrayBase::isfinite)
|
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(isfinite,scalar_isfinite_op,finite value test,\sa Eigen::isinf DOXCOMMA Eigen::isnan DOXCOMMA ArrayBase::isfinite)
|
||||||
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(sign,scalar_sign_op,sign (or 0),\sa ArrayBase::sign)
|
EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(sign,scalar_sign_op,sign (or 0),\sa ArrayBase::sign)
|
||||||
|
|
||||||
/** \returns an expression of the coefficient-wise power of \a x to the given constant \a exponent.
|
/** \returns an expression of the coefficient-wise power of \a x to the given constant \a exponent.
|
||||||
*
|
*
|
||||||
* \tparam ScalarExponent is the scalar type of \a exponent. It must be compatible with the scalar type of the given expression (\c Derived::Scalar).
|
* \tparam ScalarExponent is the scalar type of \a exponent. It must be compatible with the scalar type of the given expression (\c Derived::Scalar).
|
||||||
@ -124,21 +125,21 @@ namespace Eigen
|
|||||||
*
|
*
|
||||||
* Example: \include Cwise_array_power_array.cpp
|
* Example: \include Cwise_array_power_array.cpp
|
||||||
* Output: \verbinclude Cwise_array_power_array.out
|
* Output: \verbinclude Cwise_array_power_array.out
|
||||||
*
|
*
|
||||||
* \sa ArrayBase::pow()
|
* \sa ArrayBase::pow()
|
||||||
*
|
*
|
||||||
* \relates ArrayBase
|
* \relates ArrayBase
|
||||||
*/
|
*/
|
||||||
template<typename Derived,typename ExponentDerived>
|
template<typename Derived,typename ExponentDerived>
|
||||||
inline const Eigen::CwiseBinaryOp<Eigen::internal::scalar_pow_op<typename Derived::Scalar, typename ExponentDerived::Scalar>, const Derived, const ExponentDerived>
|
inline const Eigen::CwiseBinaryOp<Eigen::internal::scalar_pow_op<typename Derived::Scalar, typename ExponentDerived::Scalar>, const Derived, const ExponentDerived>
|
||||||
pow(const Eigen::ArrayBase<Derived>& x, const Eigen::ArrayBase<ExponentDerived>& exponents)
|
pow(const Eigen::ArrayBase<Derived>& x, const Eigen::ArrayBase<ExponentDerived>& exponents)
|
||||||
{
|
{
|
||||||
return Eigen::CwiseBinaryOp<Eigen::internal::scalar_pow_op<typename Derived::Scalar, typename ExponentDerived::Scalar>, const Derived, const ExponentDerived>(
|
return Eigen::CwiseBinaryOp<Eigen::internal::scalar_pow_op<typename Derived::Scalar, typename ExponentDerived::Scalar>, const Derived, const ExponentDerived>(
|
||||||
x.derived(),
|
x.derived(),
|
||||||
exponents.derived()
|
exponents.derived()
|
||||||
);
|
);
|
||||||
}
|
}
|
||||||
|
|
||||||
/** \returns an expression of the coefficient-wise power of the scalar \a x to the given array of \a exponents.
|
/** \returns an expression of the coefficient-wise power of the scalar \a x to the given array of \a exponents.
|
||||||
*
|
*
|
||||||
* This function computes the coefficient-wise power between a scalar and an array of exponents.
|
* This function computes the coefficient-wise power between a scalar and an array of exponents.
|
||||||
@ -147,7 +148,7 @@ namespace Eigen
|
|||||||
*
|
*
|
||||||
* Example: \include Cwise_scalar_power_array.cpp
|
* Example: \include Cwise_scalar_power_array.cpp
|
||||||
* Output: \verbinclude Cwise_scalar_power_array.out
|
* Output: \verbinclude Cwise_scalar_power_array.out
|
||||||
*
|
*
|
||||||
* \sa ArrayBase::pow()
|
* \sa ArrayBase::pow()
|
||||||
*
|
*
|
||||||
* \relates ArrayBase
|
* \relates ArrayBase
|
||||||
|
@ -701,7 +701,7 @@ template<typename Scalar> struct scalar_isnan_op {
|
|||||||
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE result_type operator() (const Scalar& a) const {
|
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE result_type operator() (const Scalar& a) const {
|
||||||
#if defined(__SYCL_DEVICE_ONLY__)
|
#if defined(__SYCL_DEVICE_ONLY__)
|
||||||
return numext::isnan(a);
|
return numext::isnan(a);
|
||||||
#else
|
#else
|
||||||
return (numext::isnan)(a);
|
return (numext::isnan)(a);
|
||||||
#endif
|
#endif
|
||||||
}
|
}
|
||||||
@ -815,7 +815,7 @@ struct scalar_sign_op<Scalar,true> {
|
|||||||
template<typename Scalar>
|
template<typename Scalar>
|
||||||
struct functor_traits<scalar_sign_op<Scalar> >
|
struct functor_traits<scalar_sign_op<Scalar> >
|
||||||
{ enum {
|
{ enum {
|
||||||
Cost =
|
Cost =
|
||||||
NumTraits<Scalar>::IsComplex
|
NumTraits<Scalar>::IsComplex
|
||||||
? ( 8*NumTraits<Scalar>::MulCost ) // roughly
|
? ( 8*NumTraits<Scalar>::MulCost ) // roughly
|
||||||
: ( 3*NumTraits<Scalar>::AddCost),
|
: ( 3*NumTraits<Scalar>::AddCost),
|
||||||
@ -823,6 +823,34 @@ struct functor_traits<scalar_sign_op<Scalar> >
|
|||||||
};
|
};
|
||||||
};
|
};
|
||||||
|
|
||||||
|
/** \internal
|
||||||
|
* \brief Template functor to compute the logistic function of a scalar
|
||||||
|
* \sa class CwiseUnaryOp, ArrayBase::logistic()
|
||||||
|
*/
|
||||||
|
template <typename T>
|
||||||
|
struct scalar_logistic_op {
|
||||||
|
EIGEN_EMPTY_STRUCT_CTOR(scalar_logistic_op)
|
||||||
|
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE T operator()(const T& x) const {
|
||||||
|
const T one = T(1);
|
||||||
|
return one / (one + numext::exp(-x));
|
||||||
|
}
|
||||||
|
|
||||||
|
template <typename Packet> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE
|
||||||
|
Packet packetOp(const Packet& x) const {
|
||||||
|
const Packet one = pset1<Packet>(T(1));
|
||||||
|
return pdiv(one, padd(one, pexp(pnegate(x))));
|
||||||
|
}
|
||||||
|
};
|
||||||
|
template <typename T>
|
||||||
|
struct functor_traits<scalar_logistic_op<T> > {
|
||||||
|
enum {
|
||||||
|
Cost = NumTraits<T>::AddCost * 2 + NumTraits<T>::MulCost * 6,
|
||||||
|
PacketAccess = packet_traits<T>::HasAdd && packet_traits<T>::HasDiv &&
|
||||||
|
packet_traits<T>::HasNegate && packet_traits<T>::HasExp
|
||||||
|
};
|
||||||
|
};
|
||||||
|
|
||||||
|
|
||||||
} // end namespace internal
|
} // end namespace internal
|
||||||
|
|
||||||
} // end namespace Eigen
|
} // end namespace Eigen
|
||||||
|
@ -21,6 +21,7 @@ typedef CwiseUnaryOp<internal::scalar_acos_op<Scalar>, const Derived> AcosReturn
|
|||||||
typedef CwiseUnaryOp<internal::scalar_asin_op<Scalar>, const Derived> AsinReturnType;
|
typedef CwiseUnaryOp<internal::scalar_asin_op<Scalar>, const Derived> AsinReturnType;
|
||||||
typedef CwiseUnaryOp<internal::scalar_atan_op<Scalar>, const Derived> AtanReturnType;
|
typedef CwiseUnaryOp<internal::scalar_atan_op<Scalar>, const Derived> AtanReturnType;
|
||||||
typedef CwiseUnaryOp<internal::scalar_tanh_op<Scalar>, const Derived> TanhReturnType;
|
typedef CwiseUnaryOp<internal::scalar_tanh_op<Scalar>, const Derived> TanhReturnType;
|
||||||
|
typedef CwiseUnaryOp<internal::scalar_logistic_op<Scalar>, const Derived> LogisticReturnType;
|
||||||
typedef CwiseUnaryOp<internal::scalar_sinh_op<Scalar>, const Derived> SinhReturnType;
|
typedef CwiseUnaryOp<internal::scalar_sinh_op<Scalar>, const Derived> SinhReturnType;
|
||||||
typedef CwiseUnaryOp<internal::scalar_cosh_op<Scalar>, const Derived> CoshReturnType;
|
typedef CwiseUnaryOp<internal::scalar_cosh_op<Scalar>, const Derived> CoshReturnType;
|
||||||
typedef CwiseUnaryOp<internal::scalar_square_op<Scalar>, const Derived> SquareReturnType;
|
typedef CwiseUnaryOp<internal::scalar_square_op<Scalar>, const Derived> SquareReturnType;
|
||||||
@ -335,6 +336,15 @@ cosh() const
|
|||||||
return CoshReturnType(derived());
|
return CoshReturnType(derived());
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/** \returns an expression of the coefficient-wise logistic of *this.
|
||||||
|
*/
|
||||||
|
EIGEN_DEVICE_FUNC
|
||||||
|
inline const LogisticReturnType
|
||||||
|
logistic() const
|
||||||
|
{
|
||||||
|
return LogisticReturnType(derived());
|
||||||
|
}
|
||||||
|
|
||||||
/** \returns an expression of the coefficient-wise inverse of *this.
|
/** \returns an expression of the coefficient-wise inverse of *this.
|
||||||
*
|
*
|
||||||
* Example: \include Cwise_inverse.cpp
|
* Example: \include Cwise_inverse.cpp
|
||||||
|
@ -231,6 +231,7 @@ template<typename ArrayType> void array_real(const ArrayType& m)
|
|||||||
VERIFY_IS_APPROX(m1.sinh(), sinh(m1));
|
VERIFY_IS_APPROX(m1.sinh(), sinh(m1));
|
||||||
VERIFY_IS_APPROX(m1.cosh(), cosh(m1));
|
VERIFY_IS_APPROX(m1.cosh(), cosh(m1));
|
||||||
VERIFY_IS_APPROX(m1.tanh(), tanh(m1));
|
VERIFY_IS_APPROX(m1.tanh(), tanh(m1));
|
||||||
|
VERIFY_IS_APPROX(m1.logistic(), logistic(m1));
|
||||||
|
|
||||||
VERIFY_IS_APPROX(m1.arg(), arg(m1));
|
VERIFY_IS_APPROX(m1.arg(), arg(m1));
|
||||||
VERIFY_IS_APPROX(m1.round(), round(m1));
|
VERIFY_IS_APPROX(m1.round(), round(m1));
|
||||||
@ -266,6 +267,7 @@ template<typename ArrayType> void array_real(const ArrayType& m)
|
|||||||
VERIFY_IS_APPROX(sinh(m1), 0.5*(exp(m1)-exp(-m1)));
|
VERIFY_IS_APPROX(sinh(m1), 0.5*(exp(m1)-exp(-m1)));
|
||||||
VERIFY_IS_APPROX(cosh(m1), 0.5*(exp(m1)+exp(-m1)));
|
VERIFY_IS_APPROX(cosh(m1), 0.5*(exp(m1)+exp(-m1)));
|
||||||
VERIFY_IS_APPROX(tanh(m1), (0.5*(exp(m1)-exp(-m1)))/(0.5*(exp(m1)+exp(-m1))));
|
VERIFY_IS_APPROX(tanh(m1), (0.5*(exp(m1)-exp(-m1)))/(0.5*(exp(m1)+exp(-m1))));
|
||||||
|
VERIFY_IS_APPROX(logistic(m1), (1.0/(1.0+exp(-m1))));
|
||||||
VERIFY_IS_APPROX(arg(m1), ((m1<0).template cast<Scalar>())*std::acos(-1.0));
|
VERIFY_IS_APPROX(arg(m1), ((m1<0).template cast<Scalar>())*std::acos(-1.0));
|
||||||
VERIFY((round(m1) <= ceil(m1) && round(m1) >= floor(m1)).all());
|
VERIFY((round(m1) <= ceil(m1) && round(m1) >= floor(m1)).all());
|
||||||
VERIFY((Eigen::isnan)((m1*0.0)/0.0).all());
|
VERIFY((Eigen::isnan)((m1*0.0)/0.0).all());
|
||||||
@ -345,6 +347,7 @@ template<typename ArrayType> void array_complex(const ArrayType& m)
|
|||||||
VERIFY_IS_APPROX(m1.sinh(), sinh(m1));
|
VERIFY_IS_APPROX(m1.sinh(), sinh(m1));
|
||||||
VERIFY_IS_APPROX(m1.cosh(), cosh(m1));
|
VERIFY_IS_APPROX(m1.cosh(), cosh(m1));
|
||||||
VERIFY_IS_APPROX(m1.tanh(), tanh(m1));
|
VERIFY_IS_APPROX(m1.tanh(), tanh(m1));
|
||||||
|
VERIFY_IS_APPROX(m1.logistic(), logistic(m1));
|
||||||
VERIFY_IS_APPROX(m1.arg(), arg(m1));
|
VERIFY_IS_APPROX(m1.arg(), arg(m1));
|
||||||
VERIFY((m1.isNaN() == (Eigen::isnan)(m1)).all());
|
VERIFY((m1.isNaN() == (Eigen::isnan)(m1)).all());
|
||||||
VERIFY((m1.isInf() == (Eigen::isinf)(m1)).all());
|
VERIFY((m1.isInf() == (Eigen::isinf)(m1)).all());
|
||||||
@ -368,6 +371,7 @@ template<typename ArrayType> void array_complex(const ArrayType& m)
|
|||||||
VERIFY_IS_APPROX(sinh(m1), 0.5*(exp(m1)-exp(-m1)));
|
VERIFY_IS_APPROX(sinh(m1), 0.5*(exp(m1)-exp(-m1)));
|
||||||
VERIFY_IS_APPROX(cosh(m1), 0.5*(exp(m1)+exp(-m1)));
|
VERIFY_IS_APPROX(cosh(m1), 0.5*(exp(m1)+exp(-m1)));
|
||||||
VERIFY_IS_APPROX(tanh(m1), (0.5*(exp(m1)-exp(-m1)))/(0.5*(exp(m1)+exp(-m1))));
|
VERIFY_IS_APPROX(tanh(m1), (0.5*(exp(m1)-exp(-m1)))/(0.5*(exp(m1)+exp(-m1))));
|
||||||
|
VERIFY_IS_APPROX(logistic(m1), (1.0/(1.0 + exp(-m1))));
|
||||||
|
|
||||||
for (Index i = 0; i < m.rows(); ++i)
|
for (Index i = 0; i < m.rows(); ++i)
|
||||||
for (Index j = 0; j < m.cols(); ++j)
|
for (Index j = 0; j < m.cols(); ++j)
|
||||||
|
@ -200,9 +200,9 @@ class TensorBase<Derived, ReadOnlyAccessors>
|
|||||||
}
|
}
|
||||||
|
|
||||||
EIGEN_DEVICE_FUNC
|
EIGEN_DEVICE_FUNC
|
||||||
EIGEN_STRONG_INLINE const TensorCwiseUnaryOp<internal::scalar_sigmoid_op<Scalar>, const Derived>
|
EIGEN_STRONG_INLINE const TensorCwiseUnaryOp<internal::scalar_logistic_op<Scalar>, const Derived>
|
||||||
sigmoid() const {
|
sigmoid() const {
|
||||||
return unaryExpr(internal::scalar_sigmoid_op<Scalar>());
|
return unaryExpr(internal::scalar_logistic_op<Scalar>());
|
||||||
}
|
}
|
||||||
|
|
||||||
EIGEN_DEVICE_FUNC
|
EIGEN_DEVICE_FUNC
|
||||||
|
@ -54,36 +54,6 @@ struct functor_traits<scalar_fmod_op<Scalar> > {
|
|||||||
PacketAccess = false };
|
PacketAccess = false };
|
||||||
};
|
};
|
||||||
|
|
||||||
|
|
||||||
/** \internal
|
|
||||||
* \brief Template functor to compute the sigmoid of a scalar
|
|
||||||
* \sa class CwiseUnaryOp, ArrayBase::sigmoid()
|
|
||||||
*/
|
|
||||||
template <typename T>
|
|
||||||
struct scalar_sigmoid_op {
|
|
||||||
EIGEN_EMPTY_STRUCT_CTOR(scalar_sigmoid_op)
|
|
||||||
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE T operator()(const T& x) const {
|
|
||||||
const T one = T(1);
|
|
||||||
return one / (one + numext::exp(-x));
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename Packet> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE
|
|
||||||
Packet packetOp(const Packet& x) const {
|
|
||||||
const Packet one = pset1<Packet>(T(1));
|
|
||||||
return pdiv(one, padd(one, pexp(pnegate(x))));
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
template <typename T>
|
|
||||||
struct functor_traits<scalar_sigmoid_op<T> > {
|
|
||||||
enum {
|
|
||||||
Cost = NumTraits<T>::AddCost * 2 + NumTraits<T>::MulCost * 6,
|
|
||||||
PacketAccess = packet_traits<T>::HasAdd && packet_traits<T>::HasDiv &&
|
|
||||||
packet_traits<T>::HasNegate && packet_traits<T>::HasExp
|
|
||||||
};
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
template<typename Reducer, typename Device>
|
template<typename Reducer, typename Device>
|
||||||
struct reducer_traits {
|
struct reducer_traits {
|
||||||
enum {
|
enum {
|
||||||
|
Loading…
Reference in New Issue
Block a user