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,695 papers · 148 categories

Trend · papers per month

5.0%10.0%15.0%20.0% · Aug 199419922001200920172026
48 results for Word Substitutions

SAFER method certifies robustness to word substitutions without model structure.

problem Certified robustness against synonymous word substitutions in NLP models.
method Randomized smoothing with stochastic ensemble of randomized inputs.
result Significantly outperforms state-of-the-art methods for certified robustness.

The goal of homomorphic encryption is to encrypt data such that another party can operate on it without being explicitly exposed to the content of the original data. We introduce an idea for a privacy-preserving transformation on natural language data, inspired by homomorphic encryption. Our primary tool is {\em obfusc…

2019-04-21abs ↗pdf ↗

Defect of knot polynomials remains invariant under certain braid substitutions.

problem Invariance of knot polynomial defects under specific transformations.
method Investigation of defect invariants under antiparallel and parallel braid substitutions.
result Defect remains unchanged under antiparallel braid substitutions and changes by half the added length under parallel braid substitutions.

The paper introduces a method to improve adversarial robustness in neural networks using randomized perturbations.

problem Deep neural networks are sensitive to small perturbations on correctly classified examples, leading to erroneous predictions.
method The approach uses randomized perturbations to optimize the worst case loss function over all possible substitutions of training examples, ensuring that substitution likelihood is weighted by the proximity to the original word.
result The method achieves performance gains and differentially-private model training, improving robustness against adversarial attacks.

We construct new families of non-hyperelliptic Lefschetz fibrations by applying the daisy substitutions to the families of words (c1c2c2g1c2gc2g+12c2gc2g1c2c1)2=1(c_1c_2 \cdots c_{2g-1}c_{2g}{c_{2g+1}}^2c_{2g}c_{2g-1} \cdots c_2c_1)^2 = 1, (c1c2c2gc2g+1)2g+2=1(c_1c_2 \cdots c_{2g}c_{2g+1})^{2g+2} = 1, and (c1c2c2g1c2g)2(2g+1)=1(c_1c_2 \cdots c_{2g-1}c_{2g})^{2(2g+1)} = 1 in the mapping …

2014-05-26abs ↗pdf ↗

The paper uses geometry to assess how hard examples are for NLP models.

problem Challenges in NLP datasets and classifiers, especially with shallow features.
method Information geometry to quantify example difficulty, exploring BERT, CNN, and fasttext.
result Deep learning models are vulnerable to word substitutions in difficult examples.

Model learns image-word associations from captions using contrastive learning.

problem Phrase grounding, associating image regions to caption words.
method Optimizing word-region attention to maximize mutual information, using language model guided word substitutions for negatives.
result Model achieves 76.7% accuracy on Flickr30K Entities benchmark, a 5.7% gain from weak supervision.

The paper assesses text classification robustness through maximal safe radius computation.

problem Vulnerability of neural network models to small input modifications.
method Maximal safe radius computation, Monte Carlo Tree Search, syntactic filtering, linear bounding techniques.
result Approximation methods for computing upper and lower bounds of maximal safe radius.

We combine concepts from random matrix theory and free probability together with ideas from the theory of commutator length in groups and maps from surfaces, and establish new connections between the two. More particularly, we study measures induced by free words on the unitary groups U(n)U(n). Every word ww in the free…

2015-09-24abs ↗pdf ↗

Most of the parameters in large vocabulary models are used in embedding layer to map categorical features to vectors and in softmax layer for classification weights. This is a bottle-neck in memory constraint on-device training applications like federated learning and on-device inference applications like automatic spe…

2018-11-20abs ↗pdf ↗

We define 2-dimensional topological substitutions. A tiling of the Euclidean plane, or of the hyperbolic plane, is substitutive if the underlying 2-complex can be obtained by iteration of a 2-dimensional topological substitution. We prove that there is no primitive substitutive tiling of the hyperbolic plane $\mathbb{H…

2011-01-20abs ↗pdf ↗

The definition of deposit substitutes in Philippine tax law fails to consider the maturity of a debt instrument. This makes it possible for long-term bonds to be considered as deposit substitutes if they meet the 20-lender rule, taxable at 20% final tax. However, long-term debt instruments cannot realistically function…

2017-12-28abs ↗pdf ↗

This research converts visual information into audio for users to perceive.

problem Brevity in conveying visual information through spoken language.
method Pretrained image embedding network, GAN for metric space mapping, human subject testing.
result Users can accurately classify audio sonifications of faces.

The study proves a theorem about subword complexity for free group automorphisms.

problem Analyzing subword complexity for attracting fixed points of automorphisms of free groups.
method Combinatorial arguments and train tracks.
result Subword complexity of attracting fixed points is equivalent to n, n log log n, n log n, or n^2.

Geometric theory explains substitutability in market outcomes based on production constraints.

problem Understanding substitutability in markets with structured feasible products.
method Modeling the set of feasible products as a compact Riemannian manifold to study intrinsic geometry and its effects on substitutability.
result Intrinsic geometry of the feasible set governs substitutability and market outcomes, with curvature controlling technological substitution elasticity.

We study the sample-based k-median clustering objective under a sequential setting without substitutions. In this setting, an i.i.d. sequence of examples is observed. An example can be selected as a center only immediately after it is observed, and it cannot be substituted later. The goal is to select a set of centers …

2019-05-30abs ↗pdf ↗

PASS protects private attributes by stochastically substituting data.

problem Protecting private attributes in ML services while maintaining data utility.
method PASS uses stochastic data substitution with a novel loss function derived from information theory.
result PASS effectively protects private attributes across various datasets.

This paper explores how the generalization of substitute classifiers affects the success of black-box adversarial attacks.

problem Understanding the factors driving the transferability of black-box adversarial examples.
method Max-min adversarial example game framework and theoretical generalization bounds.
result Substitute NN with better generalization behavior results in more transferable adversarial examples.

Network models assume unrealistic idiosyncratic risk, which can be mitigated by allowing for correlated shocks.

problem Network models assume idiosyncratic risk, which can be unrealistic and lead to incorrect predictions.
method Proposed a production-based asset pricing model to account for substitutability between trade partners and correlation in supply and demand shocks.
result Assets positively exposed to average propagation of upstream and downstream shocks earn lower average risk premia.

Develops methods to improve demand counterfactuals from imperfect proxies.

problem Imperfect proxies in demand models lead to biased counterfactuals and invalid inference.
method Practical toolkit for market-level and individual data, requiring minimal computation.
result Improves substitution prediction and counterfactual performance.

The "color" in the colored Jones polynomial is an integer parameter. In this paper, a periodic pattern of the values of the colored Jones polynomial at the second and the third roots of unity is found. If we substitute -1 to the colored Jones polynomial, the value is alternately 1 or the determinant of the given link. …

2016-06-01abs ↗pdf ↗

This work addresses time inconsistency in risk measures and develops a dynamic programming principle for risk minimization problems.

problem Time inconsistency in optimized certainty equivalents (OCEs) risk measures.
method Enlargement of state space to achieve a substitute for time consistency, derivation of dynamic programming principle.
result Characterization of the value function via viscosity solutions of Hamilton--Jacobi--Bellman--Issacs equations.

Deep neural network (DNN) as a popular machine learning model is found to be vulnerable to adversarial attack. This attack constructs adversarial examples by adding small perturbations to the raw input, while appearing unmodified to human eyes but will be misclassified by a well-trained classifier. In this paper, we fo…

2018-09-13abs ↗pdf ↗

This work bounds classification error in machine learning for low Bayes error conditions.

problem Understanding the error mismatch between Bayes error and model-based classification error.
method Applying classification error bounds to study the relationship with Kullback-Leibler divergence and proposing a linear approximation for low Bayes error conditions.
result A linear approximation of the classification error bound for low Bayes error conditions is proposed.

The paper studies symplectic operations on Stein fillings of Brieskorn singularities.

problem Symplectic operations on Stein fillings of Brieskorn singularities.
method Two interpretations: symplectic sum and monodromy substitution in a Lefschetz fibration.
result Generalized chain surgeries and their applications in symplectic geometry.

Is the elasticity of intertemporal substitution (EIS) more or less than one? This question can be answered by confronting theoretical results of asset pricing models with investor behaviour during episodes of stock market panic. If we consider these episodes as periods of high risk aversion, then lower asset prices are…

2015-05-27abs ↗pdf ↗

We introduce several new families of relations in the mapping class groups of planar surfaces, each equating two products of right-handed Dehn twists. The interest of these relations lies in their geometric interpretation in terms of rational blowdowns of 4-manifolds, specifically via monodromy substitution in Lefschet…

2010-04-21abs ↗pdf ↗

Optimizes capital structure for life insurance companies with surplus participation.

problem Determining the optimal participation rate in life insurance contracts.
method Adapted Leland's dynamic capital structure model to life insurance context.
result Optimal participation rate is highly sensitive to contract duration and tax rate.

Separable Non-negative Matrix Factorization (SNMF) is an important method for topic modeling, where "separable" assumes every topic contains at least one anchor word, defined as a word that has non-zero probability only on that topic. SNMF focuses on the word co-occurrence patterns to reveal topics by two steps: anchor…

2019-05-10abs ↗pdf ↗

Most existing word embedding approaches do not distinguish the same words in different contexts, therefore ignoring their contextual meanings. As a result, the learned embeddings of these words are usually a mixture of multiple meanings. In this paper, we acknowledge multiple identities of the same word in different co…

2016-11-29abs ↗pdf ↗

We begin the systematic study of knot polynomials for the twist satellites of a knot, when its strand is substituted by a 2-strand twist knot. This is a generalization of cabling (torus satellites), when the substitute of the strand was a torus knot. We describe a general decomposition of satellite's colored HOMFLY in …

2018-01-08abs ↗pdf ↗

There are certain families of words and word sequences (words in the generators of a two-generator group) that arise frequently in the Teichm{ü}ller theory of hyperbolic three-manifolds and Kleinian and Fuchsian groups and in the discreteness problem for two generator matrix groups. We survey some of the families of su…

2007-01-20abs ↗pdf ↗