27
\$\begingroup\$

Inverse transform sampling is a method to generate random values that follow an arbitrary distribution. For some reason this method was never implemented in any popular scientific libraries. And as I often need to use it, instead of calculating it by hands every time, I decided to implement the function doing it for me.

What I want reviewed:

  • Am I reinventing the wheel? I searched thoroughly but couldn't find anything similar.
  • Is this a correct approach for this problem? I've seen the following code on SO: link. There the PDF is approximated by a discrete distribution. Maybe, that way is better. I don't know.
  • There are so many issues within that my function looks like a bunch of patches and workarounds in order to make it work. Maybe there are more elegant and correct ways to deal with those drawbacks.
  • Missed cases for inputs. There are an infinite number of PDFs. I could miss some.
  • Type hints. Did I write them correctly? With the types of objects are quite confusing.
  • Code style.

Code:
inverse_transform.py

import operator
from typing import Iterator

import numpy as np
import sympy as sym
from scipy.special import lambertw
from sympy.functions.elementary.piecewise import ExprCondPair


def sample(pdf: sym.Function,
           *,
           size: int) -> np.array:
    """
    Generates random values following the given distribution
    :param pdf: input Probability Density Function (PDF)
    :param size: number of generated values
    """
    if not isinstance(pdf, sym.Piecewise):
        raise ValueError("PDF must be constructed by sympy.Piecewise")

    pdf_functions = map(operator.attrgetter('func'),
                        pdf.atoms(sym.Function))
    if sym.re in pdf_functions:
        error_message = ("Using sympy.Abs or sympy.re is not supported "
                         "due to not implemented computing of their integrals "
                         "within SymPy. Split the relevant expression.")
        raise NotImplementedError(error_message)

    # The following is used in order to prevent an error
    # when using PDF in a form of, for example, x**-2.5.
    # For more details see:
    # https://stackoverflow.com/questions/50543587/integrating-piecewise-with-irrational-exponent-gives-error
    pdf = sym.nsimplify(pdf)

    x = pdf.free_symbols.pop()
    y = sym.Dummy('y')

    cdf = sym.integrate(pdf, (x, -sym.oo, y))
    # The following is used in order to prevent
    # long erroneous polynomials
    # when calculating PDF in a form of, for example,  x**-2.5
    # Beware that this will add too much precision. Bug.
    # Issue submitted: https://github.com/sympy/sympy/issues/14787
    cdf = cdf.evalf()

    eq = sym.Eq(x, cdf)

    # TODO: Use solveset when it will be able to deal with LambertW
    # With default rational == True, there will be an error
    # as 'solve' doesn't play along with Piecewise.
    # Related issue: https://github.com/sympy/sympy/issues/12024
    inverse_solutions = sym.solve(eq, y, rational=False)
    # Sometimes, especially for exponents,
    # there are garbage solutions with imaginary parts:
    # https://github.com/sympy/sympy/issues/9973
    inverse_solutions = filter(is_real, inverse_solutions)

    # As, for some reason, 'solve' returns a list of Piecewise's,
    # it's necessary to collect them back together.
    # Related issue: https://github.com/sympy/sympy/issues/14733
    inverse_cdf = recreate_piecewise(inverse_solutions)
    # If inverse CDF will contain LambertW function,
    # we must change its branch. For more details, see:
    # https://stackoverflow.com/questions/49817984/sympy-solve-doesnt-give-one-of-the-solutions-with-lambertw
    functions = map(operator.attrgetter('func'),
                    inverse_cdf.atoms(sym.Function))
    if sym.LambertW in functions:
        inverse_cdf = replace_lambertw_branch(inverse_cdf)
        # This is to prevent LambertW giving ComplexWarning after lambdifying
        inverse_cdf = sym.re(inverse_cdf)

    max_value = cdf.args[-1][0]

    # Warnings can happen with exponents in PDF:
    # https://github.com/sympy/sympy/issues/14789
    lambda_function = sym.lambdify(args=x,
                                   expr=inverse_cdf,
                                   modules=[{'LambertW': lambertw}, 'numpy'])
    return lambda_function(np.random.uniform(high=max_value,
                                             size=size))


def is_real(expression: sym.Expr) -> bool:
    """Checks if expression doesn't contain imaginary part with sympy.I"""
    return sym.I not in expression.atoms()


def recreate_piecewise(functions: Iterator[ExprCondPair]) -> sym.Piecewise:
    """
    Collects Piecewise from list of unsorted Piecewise's,
    ignoring parts with NaNs.
    Solution for the issue: https://github.com/sympy/sympy/issues/14733
    See also question on SO:
    https://stackoverflow.com/questions/50428912/how-to-get-sorted-exprcondpairs-in-a-piecewise-function-that-was-obtained-from
    """
    def remove_nans(expression_condition: ExprCondPair) -> ExprCondPair:
        return expression_condition.args[0]

    def right_hand_number(solution: ExprCondPair) -> sym.S:
        return solution[1].args[1]

    solutions = sorted(map(remove_nans, functions),
                       key=right_hand_number)
    return sym.Piecewise(*solutions)


def to_lower_lambertw_branch(*args) -> sym.Function:
    """
    Wraps the first argument from a given list of arguments
    as a lower branch of LambertW function.
    :return: lower LambertW branch
    """
    return sym.LambertW(args[0], -1)


def replace_lambertw_branch(expression: sym.Expr) -> sym.Expr:
    """
    Replaces upper branch of LambertW function with the lower one.
    For details of the bug see:
    https://stackoverflow.com/questions/49817984/sympy-solve-doesnt-give-one-of-the-solutions-with-lambertw
    Solution is based on the 2nd example from:
    http://docs.sympy.org/latest/modules/core.html?highlight=replace#sympy.core.basic.Basic.replace
    :return: expression with replaced LambertW branch by a lower one
    """
    return expression.replace(sym.LambertW,
                              to_lower_lambertw_branch)

Examples of usage:
I will plot results in order to give a better idea:

import matplotlib.pyplot as plt
import sympy as sym

import inverse_transform

x = sym.Symbol('x')
f = sym.Piecewise((0, x < 0.),
                  (1, x <= 1.),
                  (0, True))
plt.hist(inverse_transform.sample(f, size=10**6),
         bins=100)
plt.show()

enter image description here

f = sym.Piecewise((0, x < 4.3),
                  (1, x < 12.9),
                  (5, x <= 13.5),
                  (0, True))
plt.hist(inverse_transform.sample(f, size=10**6),
         bins=100)
plt.show()

enter image description here

shift = 1.5
f = sym.Piecewise((0., x <= shift),
                  ((x - shift) * sym.exp(-(x - shift)), x <= 13.5),
                  (0., True))
plt.hist(inverse_transform.sample(f, size=10**6),
         bins=100)
plt.show()

enter image description here

f = sym.Piecewise((0, x < 6.5),
                  (97.25 / (25 + x**2) , x < 10.5),
                  (0, True))
plt.hist(inverse_transform.sample(f, size=10**6),
         bins=100)
plt.show()

enter image description here

f = sym.Piecewise((0, x < 0.4),
                  (x ** -2.35, x < 50),
                  (0, True))
plt.hist(inverse_transform.sample(f, size=10**6),
         bins=100)
plt.show()

enter image description here

f = sym.Piecewise((0, x < 6.5),
                  (sym.exp(-x/3.5) , x < 10.5),
                  (0, True))
plt.hist(inverse_transform.sample(f, size=10**6),
         bins=100)
plt.show()

enter image description here

f = sym.Piecewise((0, x < -2),
                  (sym.exp(x/0.25) , x < 0),
                  (sym.exp(-x/0.25) , x < 2),
                  (0, True))
plt.hist(inverse_transform.sample(f, size=10**6),
         bins=100)
plt.show()

enter image description here

\$\endgroup\$
4
  • 1
    \$\begingroup\$ This is a nice code, have you done any performance tests comparing it with the answers here stackoverflow.com/q/21100716/1391441? Also, if sympy causes so many issues (does is still?), couldn't it be replaced by some other package or vanilla Python? \$\endgroup\$
    – Gabriel
    Sep 15, 2019 at 13:38
  • 1
    \$\begingroup\$ Thanks! I haven't performed any performance tests as I was very much satisfied with how fast my code ran. About SymPy, from all the described bugs in the code I know only about one that was fixed, no idea about others but looks like nothing has changed. As my approach uses symbolic math, then, I'm afraid, there are no other similar libraries for Python. Maybe some other languages have better functionality for this task like MATLAB, Mathematica or R, and we could call them from Python? Worth investigating I think. \$\endgroup\$
    – Georgy
    Sep 15, 2019 at 14:57
  • 1
    \$\begingroup\$ On the reinventing the wheel part, if I understand you correctly, scipy's scipy.stats.rv_continuous can be used to setup continuous probability density functions. You can then use random_state to get a sample from that density function. There is also a discrete variant of this class in scipy.stats. \$\endgroup\$
    – agtoever
    Jun 20, 2020 at 12:18
  • \$\begingroup\$ @agtoever This looks interesting! I shall investigate it more when I have more free time on my hands. Thank you for sharing! \$\endgroup\$
    – Georgy
    Jun 20, 2020 at 18:16

2 Answers 2

2
\$\begingroup\$
  1. If you do not need custom piecewise probabilities (which look very strange to me) and instead want to use one of the many SciPy distributions, you can use their predefined percent point functions (which are inverse CDFs). Only if you actually need to create a new distribution, you might find my next observations useful. Also, as agtoever mentioned, you might want to take advantage of rv_continuous in scipy.
  2. Using SymPy is a two-edged sword. Defining and computing CDFs and inverse samples symbolically might be exact, but it may cost more in terms of syntax or CPU time. Still, the CDF is costly to compute numerically also, so your approach might be right for such piecewise functions.
  3. For each call of sample, the CDF should not be recalculated. You should split the computation of the CDF from a PDF into a different function (and have def sample(cdf: [...]). In general, my advice is the same as uncle Bob's, namely, to have functions as short as you can make them. (for instance, you could also extract lines from if not isinstance(pdf, sym.Piecewise): to raise NotImplementedError(error_message) in a method which could be called validate.
  4. After extracting the CDF and/or the validation methods, they become testable, and you might want to add tests for them. Perhaps you can also extract and test the pointwise solution of the inverse. Sadly, testing the random sampling itself might be impossible (would fail randomly).
  5. I am not very skilled in optimization, but looking at another solution, it seems to me you've got the right idea in deriving the CDF from the given PDF, then solve the pointwise inverse. The other solution finds the CDF numerically, and has the option of approximating the CDF using Chebyshev polynomials for performance reasons.

While I can't find more significant problems with the solution, I can't be sure it's correct either (you can never be with software in general). But tests might increase one's confidence in the code.

\$\endgroup\$
3
  • \$\begingroup\$ Thank you for your contribution! Lots of useful information here. I can't promise to look closely at some of the provided links in the nearest future but I'm sure this answer will be helpful for future visitors. \$\endgroup\$
    – Georgy
    Aug 28, 2020 at 15:04
  • \$\begingroup\$ Thanks for your feedback :) To be honest, I wasn't expecting such a late answer (9+ years) to help you personally, but others. As a curiosity, did you need the piecewise probabilities? \$\endgroup\$
    – danuker
    Aug 28, 2020 at 17:45
  • \$\begingroup\$ It's actually only 2+ years old but yes, I've been working with completely different topics lately. My research work back then was related to galactic populations of white dwarfs, and these piecewise probabilities were coming from some of the distributions of their ages and velocities. Unfortunately, I can't recall what the reasons were behind them being piecewise and if it was avoidable. \$\endgroup\$
    – Georgy
    Aug 28, 2020 at 20:43
0
\$\begingroup\$

Given that there hasn't been an answer on this question for almost 2 years, I thought I'd throw my 2c in and add something.

Am I reinventing the wheel? I searched thoroughly but couldn't find anything similar

Is this a correct approach for this problem?

I think these questions would be better asked on Stack Overflow/Math than Code Review. Validating proofs are more their areas, we're more about fixing your code problems (which is probably why this question hasn't had an answer yet has over 3K views and almost 2 years?).

Looking at your code, it seems fine, however there are some things I'd point out (in sample)-

   if not isinstance(pdf, sym.Piecewise):
        raise ValueError("PDF must be constructed by sympy.Piecewise")

If you raise this error - does sympy catch it and deal with it? Or does it just die? If it does not catch it properly, it would be a better approach for you to just print the message and return None. That's a more standard pattern IMO. Again for the raise NotImplementedError(error_message) - if you reach an impassible spot in your code - there's no point raising a message unless it is handled above it. Just log/print the error (no point continuing, right?) and end the program.

Regarding the functions replace_lambertw_branch and to_lower_lambertw_branch - they are only used once. I understand the need to introduce clarity but don't create a whole function with all the scaffolding when it's only used once (and is a single line). It's unnecessary code and forces readers of your code to jump around trying to figure out what is going on.

I could also say the same for the inner functions of remove_nans and right_hand_number, even though they're closer, it still requires the code reader to stop the flow and go looking elsewhere for what is happening. They too are only used once - there's no need to create a whole scaffold when a lambda will do.

Adding further comment - if users/readers of the code are unclear what the lambdas do, you can improve the naming of the variables in the lambda to make it clear, or add in a comment above the lambda to explain "the why" - but these should be kept to an absolute minimum.

Continuing the point about comments - they're scattered everywhere throughout the code. This is bad for two reasons. One - it interrupts the comprehension of the code flow - and comments lie. If they're all very important - they should be moved into a separate document, explaining your approach, and the reasons why you did what you did in the way you did it.

Those sorts of "the why" comments don't belong in code - because the minute the code changes for whatever reason - the comment then lies about the code - and it will confuse everyone who looks at your code. Rarely, you have well-meaning coders that attempt to fix the code to match the comment (rare, but I have seen that).

Otherwise, the rest of the code seems fine. Perhaps others can add to what I've written. I hope this helps in some small way.

\$\endgroup\$
4
  • \$\begingroup\$ Thank you for the review! It's been a long time since I used this code, so I don't remember all the details. I don't remember exactly why I raised ValueError instead of letting SymPy raise it instead, but, I guess, it's because the error message from SymPy was some kind of gibberish that wouldn't help the user to fix the problem. Returning None, printing a message instead of raising an error, and, optionally, ending the program immediately, is something that I disagree with. It's a design choice in the end, but I'd personally stick to raising exceptions because... \$\endgroup\$
    – Georgy
    May 11, 2020 at 12:20
  • \$\begingroup\$ ...1) exception messages go to stderr unlike the printed message, 2) None is meaningless for my function, the user always excepts an array of values unless something goes wrong; 3) ending the program should be done on the highest level, I can imagine my function be embedded in some code where it's only one of several options of generating values following the given distribution; if my method fails, the high-level program could fallback to, for example, some Monte Carlo values generator instead, calling sys.exit() would complicate things in this matter... \$\endgroup\$
    – Georgy
    May 11, 2020 at 12:21
  • \$\begingroup\$ ...Though, now that I look again at my code, I see that NotImplementedError could be avoided if I wrote some helper function to expand an expression with sympy.Abs. Speaking about the helper functions, I agree, some of them are unnecessary. The expression with is_real could be rewritten with a generator expression, and the replace_lambertw_branch could be removed completely... \$\endgroup\$
    – Georgy
    May 11, 2020 at 12:21
  • \$\begingroup\$ ... I also remember thinking about the comments, normally I'm all against them in the code, but in this case, I thought their presence in the code is justified since it's not clear at all why corresponding lines of code are necessary. I could also move the comments elsewhere as you proposed, but I think for me it would be easier to edit the comments directly in the code. \$\endgroup\$
    – Georgy
    May 11, 2020 at 12:23

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Not the answer you're looking for? Browse other questions tagged or ask your own question.