Related papers: Algorithms for Skein Manipulation in a Genus-2 Han…
The problem of computing optimal orthogonal approximation to a given matrix has attracted growing interest in machine learning. Notable applications include the recent Muon optimizer or Riemannian optimization on the Stiefel manifold. Among…
Sorting input objects is an important step in many machine learning pipelines. However, the sorting operator is non-differentiable with respect to its inputs, which prohibits end-to-end gradient-based optimization. In this work, we propose…
We present an adaptive refinement algorithm for T-splines on unstructured 2D meshes. While for structured 2D meshes, one can refine elements alternatingly in horizontal and vertical direction, such an approach cannot be generalized directly…
In this paper, we propose a class of super-schemes for efficiently solving nonlinear unconstrained optimization problems. The proposed approach introduces two novel choices of step-size parameters, leading to efficient descent directions…
The Kauffman bracket skein modules, S(M,A), have been calculated for A=+1,-1, for all 3-manifolds M by relating them to the SL(2,C)-character varieties. We extend this description to the case when A is a 4-th root of 1 and M is either a…
We propose an algorithm for the computational homogenization of locally periodic hyperelastic structures undergoing large deformations due to external quasi-static loading. The algorithm performs clustering of macroscopic deformations into…
Computing polynomial invariants for knots and links using braid representations relies heavily on finding the trace of Hecke algebra elements. There is no easy method known for computing the trace and hence it becomes difficult to compute…
Mixed integer set representations, and specifically hybrid zonotopes, have enabled new techniques for reachability and verification of nonlinear and hybrid systems. Mixed-integer sets which have the property that their convex relaxation is…
We propose a new algorithm to solve optimization problems of the form $\min f(X)$ for a smooth function $f$ under the constraints that $X$ is positive semidefinite and the diagonal blocks of $X$ are small identity matrices. Such problems…
Trigonometric polynomials are widely used for the approximation of a smooth function $f$ from a set of nonuniformly spaced samples $\{f(x_j)\}_{j=0}^{N-1}$. If the samples are perturbed by noise, controlling the smoothness of the…
Stochastic Gradient (SG) Markov Chain Monte Carlo algorithms (MCMC) are popular algorithms for Bayesian sampling in the presence of large datasets. However, they come with little theoretical guarantees and assessing their empirical…
The cycling operation is a special kind of conjugation that can be applied to elements in Artin's braid groups, in order to reduce their length. It is a key ingredient of the usual solutions to the conjugacy problem in braid groups. In…
Large scale optimization problems are ubiquitous in machine learning and data analysis and there is a plethora of algorithms for solving such problems. Many of these algorithms employ sub-sampling, as a way to either speed up the…
The interplay between advances in stochastic and deterministic algorithms has recently led to development of interesting new selected configuration interaction (SCI) methods for solving the many body Schr\"{o}dinger equation. The…
We devise and evaluate numerically a Hybrid High-Order (HHO) method for finite plasticity within a logarithmic strain framework. The HHO method uses as discrete unknowns piecewise polynomials of order $k\ge1$ on the mesh skeleton, together…
With increasing applications of 3D hand pose estimation in various human-computer interaction applications, convolution neural networks (CNNs) based estimation models have been actively explored. However, the existing models require complex…
We develop skein theory for 3-manifolds in the presence of codimension-one defects, focusing especially on defects arising from parabolic induction/restriction for quantum groups. We use these defects as a model for the quantum decorated…
The 2-bridge knots are a family of knots with bridge number 2. In this paper, we compute the Kauffman polynomials of 2-bridge knots using the Kauffman skein theory and linear algebra techniques. Our calculation can be easily carried out…
Tendon-driven snake-like arms have been used to create highly dexterous continuum robots so that they can bend around anatomical obstacles to access clinical targets. In this paper, we propose a design algorithm for developing…
Geometry- and appearance-controlled full-body human image generation is an interesting but challenging task. Existing solutions are either unconditional or dependent on coarse conditions (e.g., pose, text), thus lacking explicit geometry…