numpy.logaddexp2() function is used to calculate Logarithm of the sum of exponentiations of the inputs in base-2.
This function is useful in machine learning when the calculated probabilities of events may be so small as to exceed the range of normal floating point numbers. In such cases, the base-2 logarithm of the calculated probability can be used instead. This function allows adding probabilities stored in such a fashion. It Calculates
log2(2**x1 + 2**x2).
Syntax : numpy.logaddexp2(arr1, arr2, /, out=None, *, where=True, casting=’same_kind’, order=’K’, dtype=None, ufunc ‘logaddexp’)
arr1 : [array_like] Input array.
arr2 : [array_like] Input array.
out : [ndarray, optional] A location into which the result is stored.
-> If provided, it must have a shape that the inputs broadcast to.
-> If not provided or None, a freshly-allocated array is returned.
where : [array_like, optional] True value means to calculate the universal functions(ufunc) at that position, False value means to leave the value in the output alone.
**kwargs : allows you to pass keyword variable length of argument to a function. It is used when we want to handle named argument in a function.
Return : [ndarray or scalar] It returns Base-2 logarithm of 2**x1 + 2**x2. This is a scalar if both arr1 and arr2 are scalars.
Code #1 :
Input number1 : 2 Input number2 : 3 Output number : 3.58496250072
Code #2 :
Input array1 : [2, 3, 8] Input array2 : [1, 2, 3] Output array : [ 2.5849625 3.5849625 8.04439412]
- Important differences between Python 2.x and Python 3.x with examples
- Python | Set 4 (Dictionary, Keywords in Python)
- Python | Sort Python Dictionaries by Key or Value
- abs() in Python
- Python | a += b is not always a = a + b
- gcd() in Python
- pow() in Python
- SHA in Python
- zip() in Python
- SQL using Python | Set 1
- Any & All in Python
- chr() in Python
- try and except in Python
- Python Set | pop()
- max() and min() in Python
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.