Research
On-device research index

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.

168,742 papers · 148 categories

Trend · papers per month

2356 · May 201919922001200920172026
48 results for Insertion

ID-ExpO fine-tunes neural networks for more faithful explanations.

problem Improving the faithfulness of explanations for complex machine learning models.
method Differentiable insertion/deletion metric-aware regularizers for optimization.
result Fine-tuned predictors produce 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…

2018-01-12abs ↗pdf ↗

New framework for consistent submodular maximization with insertions and deletions.

problem Maintaining near-optimal solutions in a dynamic setting with insertions and deletions.
method Developed a general framework for fully dynamic submodular maximization, instantiated for cardinality and rank-k matroid constraints.
result First constant-factor approximations with sublinear consistency for both cardinality and rank-k matroid constraints.

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, …

2019-10-19abs ↗pdf ↗

The paper compares inserting and stretching points for grid refinement near critical points.

problem Decreased accuracy of finite difference methods near discontinuities.
method Comparison of inserting and stretching points for grid refinement near critical points.
result Proposes a new fast and simple stretching function.

Shared Keyboard design improves phase I clinical trials by borrowing information across doses.

problem Interim decisions based on current dose data may overlook signals from neighboring doses.
method Bayesian model-assisted design using Beta kernel process with kernel-weighted pseudo-counts.
result Significant improvements in identifying maximum tolerated dose and safety.

IFH models graph generation with adjustable sequentiality.

problem Designing flexible graph generation models between one-shot and sequential approaches.
method Based on DDPM, IFH uses a node removal process to generate graphs with adjustable sequentiality.
result IFH models improve graph generation quality and efficiency compared to current methods.

Study curvature and torsion from cross-ratios in discrete curves.

problem Define curvature and torsion for discrete curves using cross-ratios.
method Use Möbius invariant point-insertion-rule to construct circles and express torsion using cross-ratio.
result Discrete curvature and torsion defined using cross-ratios converge to smooth curvature and torsion as sampling density increases.

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…

2018-06-04abs ↗pdf ↗

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…

2018-07-17abs ↗pdf ↗

Inserts proximal mapping into deep networks for better regularization.

problem Effective regularization of deep learning models to handle adversarial perturbations and correlations between modalities.
method Proposes a new layer that directly produces regularized hidden layer outputs using proximal mapping.
result Outperforms state-of-the-art methods in robust temporal learning and multiview modeling.

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.

2013-01-27abs ↗pdf ↗

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…

2018-11-03abs ↗pdf ↗

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…

2019-06-04abs ↗pdf ↗

New approach shows backdoor attacks are indistinguishable from natural data features.

problem Defending against backdoor attacks in machine learning models.
method Developed a new primitive for detecting backdoor attacks based on the assumption that they correspond to the strongest feature in the training data.
result Backdoor attacks are indistinguishable from natural data features, making traditional detection methods ineffective.

Deep Partition Aggregation defends against poisoning attacks with provable certificates.

problem Adversarial poisoning attacks corrupt classifier test-time behavior.
method Deep Partition Aggregation (DPA) is an ensemble method using hash partitions and base models trained on these partitions.
result DPA can certify >= 50% of test images against over 500 poison image insertions on MNIST, and nine insertions on CIFAR-10.

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…

2019-11-01abs ↗pdf ↗

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…

2018-06-06abs ↗pdf ↗

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 l1,...lLl_1,...l_L at specific locations and cla…

2012-04-26abs ↗pdf ↗

Paper defends LSTM-based text classification models from backdoor attacks.

problem Backdoor attacks in LSTM models cause misclassification of spam or malicious speech.
method Backdoor Keyword Identification (BKI) to identify and exclude poisoned samples.
result BKI method effectively mitigates backdoor attacks in various text classification datasets.

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…

2012-06-07abs ↗pdf ↗

Two price regimes identified in limit order books: close and far from quotes.

problem Understanding the distribution and behavior of limit orders in limit order books.
method Analysis of limit order book data in dimensions of price, time, lifetime, and volume.
result Identification of two distinct regimes in the limit order book: close and far from quotes.

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…

1999-03-25abs ↗pdf ↗

We consider the kk-means clustering problem in the dynamic streaming setting, where points from a discrete Euclidean space {1,2,,Δ}d\{1, 2, \ldots, Δ\}^d 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…

2018-02-01abs ↗pdf ↗

The paper explores symmetry in solutions of semilinear PDEs on Riemannian domains.

problem Symmetry phenomena in solutions of semilinear PDEs on Riemannian domains.
method General framework for formulating the symmetry problem; evidence from stable solutions; consideration of manifolds with density.
result Evidence that the framework is natural, with results for stable solutions.

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 ww-variables. In this paper, we consider the case when pinched octahedra appear as a b…

2017-02-25abs ↗pdf ↗