arXiv research

New algorithm improves privacy in high-dimensional machine learning models.

New method calculates number of components in twisted torus links.

Study finds central points of double heptagon surface are not connection points.

The study shows conditions for elliptic surfaces without 1-handles.

The paper classifies groups containing incommensurable lattices in Baumslag-Solitar complexes.

We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic curves in terms of a cylindrical algebraic decomposition of the plane. Compared to …

New method detects projective equivalences and symmetries in rational 3D curves.

Paper shows how to twist knots to make them trivial or non-trivial.

A point in the $(N,q)$-torus knot in $\mathbb{R}^3$ goes $q$ times along a vertical circle while this circle rotates $N$ times around the vertical axis. In the Lissajous-toric knot $K(N,q,p)$, the point goes along a vertical Lissajous curve (parametrized by $t\mapsto(\sin(qt+φ),\cos(pt+ψ)))$ while this curve rotates $N…

Let N be a closed, connected, smooth 4-manifold with H_1(N;Z)=0. Our main result is the following classification of the set E^7(N) of smooth embeddings N->R^7 up to smooth isotopy. Haefliger proved that the set E^7(S^4) with the connected sum operation is a group isomorphic to Z_{12}. This group acts on E^7(N) by embed…

We reprove and extend a result of David Krebes (J. Knot Theory Ramif. 8 (1999), 321-352) giving an obstruction to embedding a tangle T into a link L. Closing the tangle up in the two obvious ways gives rise to two links, the numerator and denominator links n(T) and d(T). Applying a homological argument to the 2-fold br…

EAGC boosts GCD by regulating gradient entanglement, improving known and novel category separability.

Two finite Alexander quandles with the same number of elements are isomorphic iff their Z[t,t^-1]-submodules Im(1-t) are isomorphic as modules. This yields specific conditions on when Alexander quandles of the form Z_n[t,t^-1]/(t-a) where gcd(n,a)=1 (called linear quandles) are isomorphic, as well as specific condition…

Proves mapping class group generated by two torsion elements for certain surfaces.

We give a formula of the connected component decomposition of the Alexander quandle: $\mathbb{Z}[t^{\pm1}]/(f_1(t),\ldots, f_k(t))=\bigsqcup^{a-1}_{i=0}\mathrm{Orb}(i)$, where $a=\gcd (f_1(1),\ldots, f_k(1))$. We show that the connected component $\mathrm{Orb}(i)$ is isomorphic to $\mathbb{Z}[t^{\pm1}]/J$ with an expli…

Let $Λ$ be a collection of partitions of a positive integer $d$ of the form $(a_1,\cdots, a_p),\,(b_1,\cdots, b_q),\,(m_1+1,1,\cdots,1),\cdots, (m_l+1,1,\cdots,1),$ where $(m_1,\cdots, m_l)$ is a partition of $p+q-2>0$. We prove that there exists a rational function on the Riemann sphere $\overline{\mathbb{C}}$ with …

We prove that if the order of the first homology of the 2-fold branched cover of a knot K in the 3-sphere is given by pm where p is a prime congruent to 3 mod 4 and gcd(p,m) =1, then K is of infinite order in the knot concordance group. This provides an obstruction to classical knots being of order 4. In particular, th…

We present a novel certified and complete algorithm to compute arrangements of real planar algebraic curves. It provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic curves in terms of a cylindrical algebraic decomposition. From a high-level perspective, the…

Extensive research has recently shown that recurrent neural language models are able to process a wide range of grammatical phenomena. How these models are able to perform these remarkable feats so well, however, is still an open question. To gain more insight into what information LSTMs base their decisions on, we pro…

We construct modular categories from Hecke algebras at roots of unity. For a special choice of the framing parameter, we recover the Reshetikhin-Turaev invariants of closed 3-manifolds constructed from the quantum groups U_q sl(N) by Reshetikhin-Turaev and Turaev-Wenzl, and from skein theory by Yokota. We then discuss …

Symmetric function $L_{M,N}$ lifts torus link homology.

Characterizes character varieties of generalized torus knot groups.

This paper calculates interaction strength for translation surfaces with multiple singularities.

Let $n, k \geq 3$. In this paper, we analyse the quotient group $B\_n/Γ\_k(P\_n)$ of the Artin braid group $B\_n$ by the subgroup $Γ\_k(P\_n)$ belonging to the lower central series of the Artin pure braid group $P\_n$. We prove that it is an almost-crystallographic group. We then focus more specifically on the case $k=…

Let $S_g$ be a closed orientable surface of genus $g \geq 2$ and $C$ a simple closed nonseparating curve in $F$. Let $t_C$ denote a left handed Dehn twist about $C$. A \textit{fractional power} of $t_C$ of \textit{exponent} $\fraction{\ell}{n}$ is an $h \in \Mod(S_g)$ such that $h^n = t_C^{\ell}$. Unlike a root of a $t…

Geometric aspects of the filtration on classical links by k-quasi-isotopy are discussed, including the effect of Whitehead doubling, relations with Smythe's n-splitting and Kobayashi's k-contractibility. One observation is: ω-quasi-isotopy is equivalent to PL isotopy for links in a homotopy 3-sphere (resp. contractible…

The paper studies representations of braid groups via curves and finds conditions for their Zariski closure and arithmeticity.

Transfer learning improves loan recovery rate forecasting under data scarcity.

Examines algorithmic modeling across three cultures.

Playing repeated matrix games (RMG) while maximizing the cumulative returns is a basic method to evaluate multi-agent learning (MAL) algorithms. Previous work has shown that $UCB$, $M3$, $S$ or $Exp3$ algorithms have good behaviours on average in RMG. Besides, hedging algorithms have been shown to be effective on predi…

Meta-algorithm selection aims to choose the best algorithm selector for a given problem instance.

Proposes CLRS benchmark to evaluate algorithmic reasoning.

Combines multiple bandit algorithms to create a nearly optimal single algorithm.

We propose accelerated randomized coordinate descent algorithms for stochastic optimization and online learning. Our algorithms have significantly less per-iteration complexity than the known accelerated gradient algorithms. The proposed algorithms for online learning have better regret performance than the known rando…

The exchange algorithm is studied for its convergence and asymptotic variance.

Bayesian networks (BN) are used in a big range of applications but they have one issue concerning parameter learning. In real application, training data are always incomplete or some nodes are hidden. To deal with this problem many learning parameter algorithms are suggested foreground EM, Gibbs sampling and RBE algori…

No algorithm outperforms uniform sampling in A/B testing.

Improves algorithm selection for thousands of candidates using dyadic features.

This review article surveys data augmentation MCMC algorithms.

Bayesian learning rule unifies and generalizes various machine learning algorithms.

Algorithm design is a laborious process and often requires many iterations of ideation and validation. In this paper, we explore automating algorithm design and present a method to learn an optimization algorithm, which we believe to be the first method that can automatically discover a better algorithm. We approach th…

This review summarizes five Lasso optimization algorithms.

Neural networks mimic algorithms to solve complex problems.

Paper proposes a reinforcement learning framework for efficient hyper-parameter tuning of stochastic optimization algorithms.

In this paper, we propose a convergent parallel best-response algorithm with the exact line search for the nondifferentiable nonconvex sparsity-regularized rank minimization problem. On the one hand, it exhibits a faster convergence than subgradient algorithms and block coordinate descent algorithms. On the other hand,…

Approximate probabilistic inference algorithms are central to many fields. Examples include sequential Monte Carlo inference in robotics, variational inference in machine learning, and Markov chain Monte Carlo inference in statistics. A key problem faced by practitioners is measuring the accuracy of an approximate infe…

New algorithms reduce bilevel optimization complexity to ε^(-1.5).

The inverse-free extreme learning machine (ELM) algorithm proposed in [4] was based on an inverse-free algorithm to compute the regularized pseudo-inverse, which was deduced from an inverse-free recursive algorithm to update the inverse of a Hermitian matrix. Before that recursive algorithm was applied in [4], its impr…