ncreasing_bounded_bijective_search(
    f, x, *args, a=0., b=1., eps=1e-3, **kwargs
):
    &#34;&#34;&#34;Use bounded bijective search to solve x = f(u) for u.&#34;&#34;&#34;
    
    assert a &lt; b
    a, b = torch.ones_like(x) * float(a), torch.ones_like(x) * float(b)

    diff = eps * 2
    while diff &gt; eps:
        u = (a + b) / 2.
        fu = f(u, *args, **kwargs)

        lt = fu &lt; x
        a = torch.where(lt, u, a)
        b = torch.where(lt, b, u)

        diff = (fu - x).abs().mean()

    