arXiv research

Templates are branched 2-manifolds with semi-flows used to model `chaotic' hyperbolic invariant sets of flows on 3-manifolds. Knotted orbits on a template correspond to those in the original flow. Birman and Williams conjectured that for any given template the number of prime factors of the knots realized would be boun…

METRO predicts reactions using minimal templates, reducing computational overhead and achieving state-of-the-art results.

Hopfield networks improve reaction template prediction for few/zero-shot scenarios.

New method to classify simple Smale flows on $S^3$.

We describe the Williams zeta functions and the twist zeta functions of sub-Lorenz templates generated by renormalizable Lorenz maps, in terms of the corresponding zeta-functions of the sub-Lorenz templates generated by the renormalized map and by the map that determines the renormalization type.

Dasgupta and Shulman showed that a two-round variant of the EM algorithm can learn mixture of Gaussian distributions with near optimal precision with high probability if the Gaussian distributions are well separated and if the dimension is sufficiently high. In this paper, we generalize their theory to learning mixture…

Graph clustering method uses templates to match vertices and outperforms classical methods.

A flexible machine learning model infers the morphology of the Galactic Center Excess.

The fact that the modular template coincides with the Lorenz template, discovered by Ghys, implies modular knots have very peculiar properties. We obtain a generalization of these results to other Hecke triangle groups. In this context, the geodesic flow can never be seen as a flow on a subset of $S^3$, and one is led …

Designs a Cellular Automata rule for forming touching loop patterns.

GPCDL uses Gaussian Processes to learn smooth templates from data.

SrvfNet aligns multiple functional data to templates without supervision.

The nonnegative matrix factorization is a widely used, flexible matrix decomposition, finding applications in biology, image and signal processing and information retrieval, among other areas. Here we present a related matrix factorization. A multi-objective optimization problem finds conical combinations of templates …

G2Gs transforms target molecules into reactants without templates, improving accuracy.

Cellular Electron CryoTomography (CECT) is a 3D imaging technique that captures information about the structure and spatial organization of macromolecular complexes within single cells, in near-native state and at sub-molecular resolution. Although template matching is often used to locate macromolecules in a CECT imag…

Method finds multiple noisy graph templates in large graphs.

Study shows how transformers classify symbols without naming them, proving a margin-versus-collision criterion.

Robust visual tracking for long video sequences is a research area that has many important applications. The main challenges include how the target image can be modeled and how this model can be updated. In this paper, we model the target using a covariance descriptor, as this descriptor is robust to problems such as p…

We construct a template with two ribbons that describes the topology of all periodic orbits of the geodesic flow on the unit tangent bundle to any sphere with three cone points with hyperbolic metric. The construction relies on the existence of a particular coding with two letters for the geodesics on these orbifolds.

A new protocol corrects confounding effects to measure alignment-induced activation shifts accurately.

Feature extraction from persistence diagrams, as a tool to enrich machine learning techniques, has received increasing attention in recent years. In this paper we explore an adaptive methodology to localize features in persistent diagrams, which are then used in learning tasks. Specifically, we investigate three algori…

Framework uses expert intervention to solve long-horizon reinforcement learning tasks.

We use tools from geometric statistics to analyze the usual estimation procedure of a template shape. This applies to shapes from landmarks, curves, surfaces, images etc. We demonstrate the asymptotic bias of the template shape estimation using the stratified geometry of the shape space. We give a Taylor expansion of t…

In this paper, we address the problem of data reconstruction from privacy-protected templates, based on recent concept of sparse ternary coding with ambiguization (STCA). The STCA is a generalization of randomization techniques which includes random projections, lossy quantization, and addition of ambiguization noise t…

Paper simplifies link classification in 3-sphere using braids and templates.

Choose any oriented link type X and closed braid representatives X[+], X[-] of X, where X[-] has minimal braid index among all closed braid representatives of X. The main result of this paper is a `Markov theorem without stabilization'. It asserts that there is a complexity function and a finite set of `templates' such…

Music that is generated by recurrent neural networks often lacks a sense of direction and coherence. We therefore propose a two-stage LSTM-based model for lead sheet generation, in which the harmonic and rhythmic templates of the song are produced first, after which, in a second stage, a sequence of melody notes is gen…

The prediction of organic reaction outcomes is a fundamental problem in computational chemistry. Since a reaction may involve hundreds of atoms, fully exploring the space of possible transformations is intractable. The current solution utilizes reaction templates to limit the space, but it suffers from coverage and eff…

The persistence diagram is an increasingly useful tool from Topological Data Analysis, but its use alongside typical machine learning techniques requires mathematical finesse. The most success to date has come from methods that map persistence diagrams into vector spaces, in a way which maximizes the structure preserve…

Cutting and pasting image segments feels intuitive: the choice of source templates gives artists flexibility in recombining existing source material. Formally, this process takes an image set as input and outputs a collage of the set elements. Such selection from sets of source templates does not fit easily in classica…

Proposes adaptive ridge regression for functional linear models with piecewise shapes.

The paper has been withdrawn by the author, due to a critical error stemming from the defined template.

We propose a new randomized coordinate descent method for a convex optimization template with broad applications. Our analysis relies on a novel combination of four ideas applied to the primal-dual gap function: smoothing, acceleration, homotopy, and coordinate descent with non-uniform sampling. As a result, our method…

This paper provides a generic framework of component analysis (CA) methods introducing a new expression for scatter matrices and Gram matrices, called Generalized Pairwise Expression (GPE). This expression is quite compact but highly powerful: The framework includes not only (1) the standard CA methods but also (2) sev…

This paper investigates how transformers can learn to generalize to unseen examples in context.

Improved binning technique boosts nUV measure performance.

Building models, or maps, of robot environments is a highly active research area; however, most existing techniques construct unstructured maps and assume static environments. In this paper, we present an algorithm for learning object models of non-stationary objects found in office-type environments. Our algorithm exp…

Transferring knowledge among various environments is important to efficiently learn multiple tasks online. Most existing methods directly use the previously learned models or previously learned optimal policies to learn new tasks. However, these methods may be inefficient when the underlying models or optimal policies …

Spatial understanding is a fundamental problem with wide-reaching real-world applications. The representation of spatial knowledge is often modeled with spatial templates, i.e., regions of acceptability of two objects under an explicit spatial relationship (e.g., "on", "below", etc.). In contrast with prior work that r…

Recent advances in visual tracking are based on siamese feature extractors and template matching. For this category of trackers, latest research focuses on better feature embeddings and similarity measures. In this work, we focus on building holistic object representations for tracking. We propose a framework that is d…

Many spectral unmixing methods rely on the non-negative decomposition of spectral data onto a dictionary of spectral templates. In particular, state-of-the-art music transcription systems decompose the spectrogram of the input signal onto a dictionary of representative note spectra. The typical measures of fit used to …

Early last century witnessed both the complete classification of 2-dimensional manifolds and a proof that classification of 4-dimensional manifolds is undecidable, setting up 3-dimensional manifolds as a central battleground of topology to this day. A rather important subset of the 3-manifolds has turned out to be the …

Binarization is an attractive strategy for implementing lightweight Deep Convolutional Neural Networks (CNNs). Despite the unquestionable savings offered, memory footprint above all, it may induce an excessive accuracy loss that prevents a widespread use. This work elaborates on this aspect introducing TentacleNet, a n…

In this paper, we first discuss the regular level set of a nonsingular Smale flow (NSF) on a 3-manifold. The main result about this topic is that a 3-manifold $M$ admits an NSF flow which has a regular level set homeomorphic to $(n+1)T^{2}$ $(n\in \mathbb{Z}, n\geq 0)$ if and only if $M=M'\sharp n S^{1}\times S^{2}$. T…

We introduce a new stochastic smoothing perspective to study adversarial contextual bandit problems. We propose a general algorithm template that represents random perturbation based algorithms and identify several perturbation distributions that lead to strong regret bounds. Using the idea of smoothness, we provide an…

Particle picking is currently a critical step in the cryo-EM single particle reconstruction pipeline. Despite extensive work on this problem, for many data sets it is still challenging, especially for low SNR micrographs. We present the KLT (Karhunen Loeve Transform) picker, which is fully automatic and requires as an …

We introduce an architecture based on deep hierarchical decompositions to learn effective representations of large graphs. Our framework extends classic R-decompositions used in kernel methods, enabling nested part-of-part relations. Unlike recursive neural networks, which unroll a template on input graphs directly, we…

The paper studies knots in modular flows using self-covers.