arXiv research

Spider category comparison proves equivalence to Sikora's quotient category.

We show that the $A_2$ clasps in the Karoubi envelope of $A_2$ spider satisfy the recursive formula of the two-variable Chebyshev polynomials of the second kind associated with a root system of type $A_2$. The $A_2$ spider is a diagrammatic description of the representation category for $U_q(\mathfrak{sl}_3)$ and the $…

We define and study the category of symmetric $\mathfrak{sl}_2$-webs. This category is a combinatorial description of the category of all finite dimensional quantum $\mathfrak{sl}_2$-modules. Explicitly, we show that (the additive closure of) the symmetric $\mathfrak{sl}_2$-spider is (braided monoidally) equivalent to …

We study natural bases for two constructions of the irreducible representation of the symmetric group corresponding to $[n,n,n]$: the {\em reduced web} basis associated to Kuperberg's combinatorial description of the spider category; and the {\em left cell basis} for the left cell construction of Kazhdan and Lusztig. I…

Decentralized optimization algorithms have attracted intensive interests recently, as it has a balanced communication pattern, especially when solving large-scale machine learning problems. Stochastic Path Integrated Differential Estimator Stochastic First-Order method (SPIDER-SFO) nearly achieves the algorithmic lower…

Tripod spiders' energy control analyzed for Hooke and Coulomb potentials.

In this paper, we propose a new technique named \textit{Stochastic Path-Integrated Differential EstimatoR} (SPIDER), which can be used to track many deterministic quantities of interest with significantly reduced computational cost. We apply SPIDER to two tasks, namely the stochastic first-order and zeroth-order method…

The sl_3 spider is a diagrammatic category used to study the representation theory of the quantum group U_q(sl_3). The morphisms in this category are generated by a basis of non-elliptic webs. Khovanov- Kuperberg observed that non-elliptic webs are indexed by semistandard Young tableaux. They establish this bijection v…

Paper proposes a faster SPIDER-EM variant for large-scale nonconvex optimization.

Study bounds variance modulation function for K-spider distributions.

Study spider mechanism configuration spaces using squared distance function.

The topology of $SU(3)$-representation varieties of the fundamental groups of planar webs so that the meridians are sent to matrices with trace equal to $-1$ are explored, and compared to data coming from spider evaluation of the webs. Corresponding to an evaluation of a web as a spider is a rooted tree. We associate t…

A faster ADMM method for nonconvex optimization with improved complexity.

Spider GAN accelerates GAN training with a new approach.

Two types of zeroth-order stochastic algorithms have recently been designed for nonconvex optimization respectively based on the first-order techniques SVRG and SARAH/SPIDER. This paper addresses several important issues that are still open in these methods. First, all existing SVRG-type zeroth-order algorithms suffer …

Given a point (the "spider") on a rectangular box, we would like to find the minimal distance along the surface to its opposite point (the "fly" - the reflection of the spider across the center of the box). Without loss of generality, we can assume that the box has dimensions $1\times a\times b$ with the spider on one …

SARAH and SPIDER are two recently developed stochastic variance-reduced algorithms, and SPIDER has been shown to achieve a near-optimal first-order oracle complexity in smooth nonconvex optimization. However, SPIDER uses an accuracy-dependent stepsize that slows down the convergence in practice, and cannot handle objec…

A new EM algorithm improves inference from large datasets.

Self-Organizing Maps (SOM) are popular unsupervised artificial neural network used to reduce dimensions and visualize data. Visual interpretation from Self-Organizing Maps (SOM) has been limited due to grid approach of data representation, which makes inter-scenario analysis impossible. The paper proposes a new way to …

Improved optimization technique reduces training complexity for non-convex problems.

Paper develops momentum schemes with variance reduction for non-convex composition optimization.

Improved variance reduction for Riemannian non-convex optimization with adaptive batch size.

Regarding the Specht modules associated to the two-row partition $(n,n)$, we provide a combinatorial path model to study the transitioning matrix from the tableau basis to the $A_1$-web basis (i.e. cup diagrams), and prove that the entries in this matrix are positive in the upper-triangular portion with respect to a ce…

SPIDER uses deep neural networks for streaming tensor factorization.

In this paper, we propose a distributed algorithm for stochastic smooth, non-convex optimization. We assume a worker-server architecture where $N$ nodes, each having $n$ (potentially infinite) number of samples, collaborate with the help of a central server to perform the optimization task. The global objective is to m…

We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie algebra of rank at most 2, gives rise to a confluent system of reduction rules of…

Let G be a simple algebraic group. Labelled trivalent graphs called webs can be used to product invariants in tensor products of minuscule representations. For each web, we construct a configuration space of points in the affine Grassmannian. Via the geometric Satake correspondence, we relate these configuration spaces…

Zeroth-order (a.k.a, derivative-free) methods are a class of effective optimization methods for solving complex machine learning problems, where gradients of the objective functions are not available or computationally prohibitive. Recently, although many zeroth-order methods have been developed, these approaches still…

System tackles indeterminacies in automated audio captioning.

New method samples manifolds efficiently using Dirichlet distribution.

When translating natural language questions into SQL queries to answer questions from a database, we would like our methods to generalize to domains and database schemas outside of the training set. To handle complex questions and database schemas with a neural encoder-decoder paradigm, it is critical to properly encod…

Studies amenable category's monotonicity and its relation to topological complexity.

To each oriented surface S, we associate a differential graded category Ko(S). The homotopy category Ho(Ko(S)) is a triangulated category which satisfies properties akin to those of the contact categories studied by K. Honda. These categories are also related to the algebraic contact categories of Y. Tian and to the bo…

We reconsider the su(3) link homology theory defined by Khovanov in math.QA/0304375 and generalized by Mackaay and Vaz in math.GT/0603307. With some slight modifications, we describe the theory as a map from the planar algebra of tangles to a planar algebra of (complexes of) `cobordisms with seams' (actually, a `canopo…

Formulates a new connection between topological and geometric categories.

We continue the program of structural differential geometry that begins with the notion of a tangent category, an axiomatization of structural aspects of the tangent functor on the category of smooth manifolds. In classical geometry, having an affine structure on a manifold is equivalent to having a flat torsion-free c…

Variance-reduced algorithms, although achieve great theoretical performance, can run slowly in practice due to the periodic gradient estimation with a large batch of data. Batch-size adaptation thus arises as a promising approach to accelerate such algorithms. However, existing schemes either apply prescribed batch-siz…

We introduce semisimple 2-categories, fusion 2-categories, and spherical fusion 2-categories. For each spherical fusion 2-category, we construct a state-sum invariant of oriented singular piecewise-linear 4-manifolds.

The paper defines new TQFTs from non-semisimple categories and proves spherical categories are chromatic.

We generalize the notion of monetary value measures developed with category theory in [Adachi, 2014] by extending their base category from the category \c{hi} to the category of probability spaces Prob introduced in [Adachi and Ryu, 2016].

ETQFTs created from non-semisimple modular categories.

Studies modules over a category of Jacobi diagrams in handlebodies.

We compare various different definitions of "the category of smooth objects". The definitions compared are due to Chen, Frölicher, Sikorski, Smith, and Souriau. The method of comparison is to construct functors between the categories that enable us to see how the categories relate to each other. This produces a diagram…

We define a symmetric monoidal (4,3)-category with duals whose objects are certain enriched multi-fusion categories. For every modular tensor category $\mathcal{C}$, there is a self enriched multi-fusion category $\mathfrak{C}$ giving rise to an object of this symmetric monoidal (4,3)-category. We conjecture that the e…

We show that once-extended anomalous 3-dimensional topological quantum field theories valued in the 2-category of k-linear categories are in canonical bijection with modular tensor categories equipped with a square root of the global dimension in each factor.

This is the second in a series of papers intended to set up a framework to study categories of modules in the context of non-commutative geometries. In \cite{mem} we introduced the basic DG category $\Pc_{\A^\bullet}$, the perfect category of $\A^\bullet$, which corresponded to the category of coherent sheaves on a com…

New 4-manifold invariant defined from trisection diagrams.

We study the transverse Lusternik-Schnirelmann category of a Riemannian foliation on a compact manifold. We obtain a necessary and sufficient condition when the transverse LS category is finite. We also introduce a variation on the concept of transverse LS category, the essential transverse category, and show that this…