Indexed text attachment
verify-topology-learning.py
Source for Algebraic and Differential Topology in Machine Learning and AI: Obstructions, Invariants, and Counts
View paper · Download original file
Lines 781–880 of 1604. Source text is displayed literally.
781 782sec('1. Obstructions')783okbu = True784for _ in range(200):785 e = trig_poly()786 g = lambda t: e(t) - e(t + PI)787 t0 = bisect(g, 0.0, PI)788 okbu = okbu and abs(e(t0) - e(t0 + PI)) < 1e-9789check('O1 Borsuk-Ulam on the circle: every continuous code e: S^1 -> R identifies some pair of antipodal points', okbu, '200 random trigonometric encoders; collision found by bisection each time')790 791 792def cubic_odd():793 lin = [[random.gauss(0, 1) for _ in range(3)] for _ in range(2)]794 cub = [[random.gauss(0, 1) for _ in range(10)] for _ in range(2)]795 mons = [(3, 0, 0), (0, 3, 0), (0, 0, 3), (2, 1, 0), (2, 0, 1), (1, 2, 0), (0, 2, 1), (1, 0, 2), (0, 1, 2), (1, 1, 1)]796 def g(u, v):797 x = (math.sin(u) * math.cos(v), math.sin(u) * math.sin(v), math.cos(u))798 return [sum(l * a for l, a in zip(lin[i], x)) + sum(c * x[0] ** m[0] * x[1] ** m[1] * x[2] ** m[2] for c, m in zip(cub[i], mons)) for i in range(2)]799 return g800 801 802def find_zero_sphere(g):803 grid = []804 for i in range(1, 36):805 for j in range(72):806 u, v = PI * i / 36, 2 * PI * j / 72807 grid.append((vnorm(g(u, v)), u, v))808 grid.sort()809 best = 1.0810 for _, u, v in grid[:25]:811 for _ in range(80):812 f0 = g(u, v)813 h = 1e-6814 fu = [(a - b) / (2 * h) for a, b in zip(g(u + h, v), g(u - h, v))]815 fv = [(a - b) / (2 * h) for a, b in zip(g(u, v + h), g(u, v - h))]816 det = fu[0] * fv[1] - fu[1] * fv[0]817 if abs(det) < 1e-14:818 break819 du = (f0[0] * fv[1] - f0[1] * fv[0]) / det820 dv = (fu[0] * f0[1] - fu[1] * f0[0]) / det821 step = max(abs(du), abs(dv))822 sc = min(1.0, 0.2 / step) if step > 0 else 1.0823 u, v = u - sc * du, v - sc * dv824 best = min(best, vnorm(g(u, v)))825 if best < 1e-11:826 break827 return best828 829 830res2 = [find_zero_sphere(cubic_odd()) for _ in range(40)]831check('O2 Borsuk-Ulam on the sphere: every continuous code e: S^2 -> R^2 identifies a pair of antipodal points', max(res2) < 1e-9,832 '40 random cubic encoders; largest residual |e(x) - e(-x)| at the point found %.1e' % max(res2))833 834 835def bottleneck_radius(e, M=3000, bins=100):836 ts = [2 * PI * i / M for i in range(M)]837 cs = [e(t) for t in ts]838 lo, hi = min(cs), max(cs)839 groups = {}840 for t, c in zip(ts, cs):841 groups.setdefault(min(bins - 1, int((c - lo) / (hi - lo) * bins)), []).append(t)842 best = 0.0843 for b, g in groups.items():844 g = sorted(g)845 gap = max([g[i + 1] - g[i] for i in range(len(g) - 1)] + [g[0] + 2 * PI - g[-1]])846 arc = 2 * PI - gap847 best = max(best, 1.0 if arc >= PI else math.sin(arc / 2))848 return best849 850 851rad = [bottleneck_radius(trig_poly()) for _ in range(100)]852tight = max(abs(math.sin(2 * PI * i / 1000)) for i in range(1000))853check('O3 a one-dimensional bottleneck for the unit circle has worst-case reconstruction error at least 1, and the code cos(theta) attains 1',854 min(rad) > 0.995 and close(tight, 1.0, 1e-9), 'smallest radius of a fibre of the code over 100 random encoders: %.4f; error of the projection code: %.4f' % (min(rad), tight))855 856 857def qmul(a, b):858 return (a[0] * b[0] - a[1] * b[1] - a[2] * b[2] - a[3] * b[3], a[0] * b[1] + a[1] * b[0] + a[2] * b[3] - a[3] * b[2],859 a[0] * b[2] - a[1] * b[3] + a[2] * b[0] + a[3] * b[1], a[0] * b[3] + a[1] * b[2] - a[2] * b[1] + a[3] * b[0])860 861 862def qrotf(q):863 w, x, y, z = q864 return [[1 - 2 * (y * y + z * z), 2 * (x * y - w * z), 2 * (x * z + w * y)],865 [2 * (x * y + w * z), 1 - 2 * (x * x + z * z), 2 * (y * z - w * x)],866 [2 * (x * z - w * y), 2 * (y * z + w * x), 1 - 2 * (x * x + y * y)]]867 868 869def axis_q(u, th):870 n = vnorm(u)871 return (math.cos(th / 2),) + tuple(math.sin(th / 2) * a / n for a in u)872 873 874def canon(q):875 s = 1 if (q[0] > 1e-12 or (abs(q[0]) <= 1e-12 and next((a for a in q[1:] if abs(a) > 1e-12), 1) > 0)) else -1876 return tuple(s * a for a in q)877 878 879def euler(R):880 return (math.atan2(R[1][0], R[0][0]), math.asin(max(-1.0, min(1.0, -R[2][0]))), math.atan2(R[2][1], R[2][2]))