A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
A new method evolves point clouds using B-splines for smooth surfaces.
The notion of a pseudoknot is defined as an equivalence class of knot diagrams that may be missing some crossing information. We provide here a topological invariant schema for pseudoknots and their relatives, 4-valent rigid vertex spatial graphs and singular knots, that is obtained by replacing unknown crossings or ve…
Proof of Knot Entropy Conjecture for tube lattice polygons.
Shared Keyboard design improves phase I clinical trials by borrowing information across doses.
We prove that the property of admitting no cosmetic crossing changes is preserved under the operation of forming certain satellites of winding number zero. We also define strongly cosmetic crossing changes and we discuss their behavior under the operation of inserting full twists in the strings of closed braids.
Transformer improves sequence generation with insertion and deletion phases.
A knot complement admits a pseudo-hyperbolic structure by solving Thurston's gluing equations for an octahedral decomposition. It is known that a solution to these equations can be described in terms of region variables, also called -variables. In this paper, we consider the case when pinched octahedra appear as a b…
This paper starts a systematic description of colored knot polynomials, beginning from the first non-(anti)symmetric representation R=[2,1]. The project involves several steps: (i) parametrization of big families of knots a la arXiv:1506.00339, (ii) evaluating Racah/mixing matrices for various numbers of strands in var…
Researchers create functors to match colored homologies of knots and links.
We present the Insertion Transformer, an iterative, partially autoregressive model for sequence generation based on insertion operations. Unlike typical autoregressive models which rely on a fixed, often left-to-right ordering of the output, our approach accommodates arbitrary orderings by allowing for tokens to be ins…
We proved by computer enumeration that the Jones polynomial distinguishes the unknot for knots up to 22 crossings. Following an approach of Yamada, we generated knot diagrams by inserting algebraic tangles into Conway polyhedra, computed their Jones polynomials by a divide-and-conquer method, and tested those with triv…
Large-scale graph data in real-world applications is often not static but dynamic, i. e., new nodes and edges appear over time. Current graph convolution approaches are promising, especially, when all the graph's nodes and edges are available during training. When unseen nodes and edges are inserted after training, it …
ID-ExpO fine-tunes neural networks for more faithful explanations.
In this work we explore the use of metric index structures, which accelerate nearest neighbor queries, in the scenario where we need to interleave insertions and queries during deployment. This use-case is inspired by a real-life need in malware analysis triage, and is surprisingly understudied. Existing literature ten…
New framework for consistent submodular maximization with insertions and deletions.
New attacks improve privacy audits by analyzing model updates.
While neural sequence generation models achieve initial success for many NLP applications, the canonical decoding procedure with left-to-right generation order (i.e., autoregressive) in one-pass can not reflect the true nature of human revising a sentence to obtain a refined result. In this work, we propose XL-Editor, …
We present KERMIT, a simple insertion-based approach to generative modeling for sequences and sequence pairs. KERMIT models the joint distribution and its decompositions (i.e., marginals and conditionals) using a single neural network and, unlike much prior work, does not rely on a prespecified factorization of the dat…
The paper compares inserting and stretching points for grid refinement near critical points.
Two price regimes identified in limit order books: close and far from quotes.
agtboost speeds up gradient tree boosting with automatic complexity adjustment.
New formulas for feature importance tests in regression models.
IFH models graph generation with adjustable sequentiality.
The meridian maps of the full Homfly skein of the annulus are linear endomorphisms induced by the insertion of a meridian loop, with either orientation, around a diagram in the annulus. The eigenvalues of the meridian maps are known to be distinct, and are indexed by pairs of partitions of integers p and n into k and k…
A well-known problem in data science and machine learning is {\em linear regression}, which is recently extended to dynamic graphs. Existing exact algorithms for updating the solution of dynamic graph regression require at least a linear time (in terms of : the size of the graph). However, this time complexity might…
We exhibit an algorithm to determine the bridge number of a hyperbolic knot in the 3-sphere. The proof uses adaptations of almost normal surface theory for compact surfaces with boundary in ideally triangulated knot exteriors.
WrapNet optimizes inference for low-resolution neural networks by using 8-bit additions.
Study curvature and torsion from cross-ratios in discrete curves.
Using the covering involution on the double branched cover of the three-sphere branched along a knot, and adapting ideas of Hendricks-Manolescu and Hendricks-Hom-Lidman, we define new knot invariants and apply them to deduce novel linear independence results in the smooth concordance group of knots.
We introduce backdrop, a flexible and simple-to-implement method, intuitively described as dropout acting only along the backpropagation pipeline. Backdrop is implemented via one or more masking layers which are inserted at specific points along the network. Each backdrop masking layer acts as the identity in the forwa…
While machine learning (ML) models are being increasingly trusted to make decisions in different and varying areas, the safety of systems using such models has become an increasing concern. In particular, ML models are often trained on data from potentially untrustworthy sources, providing adversaries with the opportun…
We design and study a Contextual Memory Tree (CMT), a learning memory controller that inserts new memories into an experience store of unbounded size. It is designed to efficiently query for memories from that store, supporting logarithmic time insertion and retrieval operations. Hence CMT can be integrated into existi…
For the purposes of this paper, Dehn surgery along a curve K in a 3-manifold M with slope r is `exceptional' if the resulting 3-manifold M_K(r) is reducible or a solid torus, or the core of the surgery solid torus has finite order in the fundamental group of M_K(r). We show that, providing the exterior of K is irreduci…
We give a proof of Ilmanen's lemma, which asserts that between a locally semi-convex and a locally semi-concave function it is possible to find a C function.
Inserts proximal mapping into deep networks for better regularization.
Ozsvath and Szabo proved that knot Floer homology determines the genera of knots in S^3. We will generalize this deep result to links in homology 3-spheres, by adapting their method. Our proof relies on a result of Gabai and some constructions related to foliations. We also interpret a theorem of Kauffman in the world …
Detects backdoors in outsourced models by replicating training steps across multiple servers.
Study counts geodesic surfaces in knot complements, finding unique ones for small knots.
A new knot selection method for GAMs reduces model complexity.
Study extends contact cosmetic surgeries to non-trivial Legendrian knots in L-spaces.
In this survey paper we present the --moves between braids and how they can adapt and serve for establishing and proving braid equivalence theorems for various diagrammatic settings, such as for classical knots, for knots in knot complements, in c.c.o. 3--manifolds and in handlebodies, as well as for virtual knots, …
Computes knot filtered ECH for torus knots on tight 3-sphere.
Inserting label noise can improve model accuracy and fairness.
The paper tackles machine unlearning by designing efficient algorithms for adaptive query classes.
We address the issue of knots selection for Gaussian predictive process methodology. Predictive process approximation provides an effective solution to the cubic order computational complexity of Gaussian process models. This approximation crucially depends on a set of points, called knots, at which the original proces…
This paper presents an efficient algorithm for evolving point cloud data on smooth manifolds using B-Splines.
This is an English translation of the following paper, published several years ago: Nikonorov Yu.G. On the geodesic diameter of surfaces with involutive isometry (Russian), Tr. Rubtsovsk. Ind. Inst., 2001, V. 9, 62-65, Zbl. 1015.53041. All inserted footnotes provide additional information related to the mentioned probl…
Study shows that splitting links requires an arbitrarily large number of extra crossings.