Transformer improves sequence generation with insertion and deletion phases.
arXiv research
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.
Trend · papers per month
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…
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, …
The paper compares inserting and stretching points for grid refinement near critical points.
Shared Keyboard design improves phase I clinical trials by borrowing information across doses.
New formulas for feature importance tests in regression models.
IFH models graph generation with adjustable sequentiality.
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…
Study curvature and torsion from cross-ratios in discrete curves.
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…
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.
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 …
Inserting label noise can improve model accuracy and fairness.
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.
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…
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…
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…
Research characterizes critical points of scalar curvature functionals.
New approach shows backdoor attacks are indistinguishable from natural data features.
Deep Partition Aggregation defends against poisoning attacks with provable certificates.
The present work has as principal objective analyze the evolution of the process of privatization, mergers and acquisitions of the big companies in the country in the last decades, to understand the conductive threads that formed the structural changes of the economy, in order world oligopólicas to insert it to the glo…
Proof of Knot Entropy Conjecture for tube lattice polygons.
A new method evolves point clouds using B-splines for smooth surfaces.
LGES speeds up causal discovery while maintaining accuracy.
Design of printed circuit board (PCB) stack-up requires the consideration of characteristic impedance, insertion loss and crosstalk. As there are many parameters in a PCB stack-up design, the optimization of these parameters needs to be efficient and accurate. A less optimal stack-up would lead to expensive PCB materia…
If a contact form on a (2n+1)-dimensional closed contact manifold admits closed Reeb orbits, then its systolic ration is defined to be the quotient of (n+1)th power of the shortest period of Reeb orbits by the contact volume. We prove that every co-orientable contact structure on any closed contact manifold admits a co…
Improved language models with talking-heads attention.
This paper is about interpolating minimal surfaces between two real analytic curves, a and b, each of which are simple real analytic curves, using the Björling-Schwarz formula in the domain where it is valid, changing the normal distributions on inital curves. We insert curves at specific locations and cla…
Paper defends LSTM-based text classification models from backdoor attacks.
We consider hyperbolic 3-manifolds with either non-empty compact geodesic boundary, or some toric cusps, or both. For any such M we analyze what portion of the volume of M can be recovered by inserting in M boundary collars and cusp neighbourhoods with disjoint embedded interiors. Our main result is that this portion c…
Two price regimes identified in limit order books: close and far from quotes.
Holographic principle matches deformed Liouville theory action.
New proof for stable reduction theorem using Kähler-Einstein metrics.
Some of the most important classes of surfaces in projective 3-space are reviewed: these are isothermally asymptotic surfaces, projectively applicable surfaces, surfaces of Jonas, projectively minimal surfaces, etc. It is demonstrated that the corresponding projective "Gauss-Codazzi" equations reduce to integrable syst…
We consider the -means clustering problem in the dynamic streaming setting, where points from a discrete Euclidean space can be dynamically inserted to or deleted from the dataset. For this problem, we provide a one-pass coreset construction algorithm using space $\tilde{O}(k\cdot \mathrm{pol…
The paper explores symmetry in solutions of semilinear PDEs on Riemannian domains.
New method improves graph representations against adversarial attacks.
This essay, an excerpt of the author's Ph.D. in Philosophy of mathematics (2012) thought of as being a companion to recent discoveries of new explicit Cartan geometry curvatures, analyzes how Gauss, after having devised the isometrically invariant character of curvature, struggled with elimination computations in order…
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…
New algorithm for maximizing submodular functions in real-time data changes.
Deep learning architectures (DLA) have shown impressive performance in computer vision, natural language processing and so on. Many DLA make use of cloud computing to achieve classification due to the high computation and memory requirements. Privacy and latency concerns resulting from cloud computing has inspired the …