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

Trend · papers per month

4182122163 · Jun 202019922001200920172026
48 results for substitution matrix

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.

We show that the Lawrence--Krammer representation is unitary. We explicitly present the non-singular matrix representing the sesquilinear pairing invariant under the action. We show that reversing the orientation of a braid is equivalent to the transposition of its Lawrence--Krammer matrix followed by a certain conjuga…

2002-02-21abs ↗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 ↗

A new method for hierarchical clustering is presented. It combines treelets, a particular multiscale decomposition of data, with a projection on a reproducing kernel Hilbert space. The proposed approach, called kernel treelets (KT), effectively substitutes the correlation coefficient matrix used in treelets with a symm…

2018-12-12abs ↗pdf ↗

We elaborate on the recent observation that evolution for twist knots simplifies when described in terms of triangular evolution matrix B{\cal B}, not just its eigenvalues ΛΛ, and provide a universal formula for B{\cal B}, applicable to arbitrary rectangular representation R=[rs]R=[r^s]. This expression is in terms of s…

2019-02-11abs ↗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 ↗

The topological entropy of a braid is the infimum of the entropies of all homeomorphisms of the disc which have a finite invariant set represented by the braid. When the isotopy class represented by the braid is pseudo-Anosov or is reducible with a pseudo-Anosov component, this entropy is positive. Fried and Kolev prov…

2006-12-22abs ↗pdf ↗

We express the colored Jones polynomial as the inverse of the quantum determinant of a matrix with entries in the qq-Weyl algebra of qq-operators, evaluated at the trivial function (plus simple substitutions). The Kashaev invariant is proved to be equal to another special evaluation of the determinant. We also discus…

2005-03-15abs ↗pdf ↗

New method removes contrastive loss by adding a prediction head, revealing learning mechanisms.

problem Understanding why neural networks learn competitive representations despite trivial optima.
method Empirical and theoretical analysis of a trainable, identity-initialized prediction head.
result The trainable prediction head enables learning all features, preventing dimensional collapse.

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.

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.

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 ↗

In this paper, we propose a second order optimization method to learn models where both the dimensionality of the parameter space and the number of training samples is high. In our method, we construct on each iteration a Krylov subspace formed by the gradient and an approximation to the Hessian matrix, and then use a …

2011-11-18abs ↗pdf ↗

In this paper, we propose a speed-up approach for subclass discriminant analysis and formulate a novel efficient multi-view solution to it. The speed-up approach is developed based on graph embedding and spectral regression approaches that involve eigendecomposition of the corresponding Laplacian matrix and regression …

2019-05-02abs ↗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.

Natural gradient descent is an optimization method traditionally motivated from the perspective of information geometry, and works well for many applications as an alternative to stochastic gradient descent. In this paper we critically analyze this method and its properties, and show how it can be viewed as a type of 2…

2014-12-03abs ↗pdf ↗

A novel algorithm converges for solving a specific matrix decomposition problem.

problem Nonlinear matrix decomposition with ReLU function for sparse data.
method Introduced a reparametrization of the Latent-RMD model and developed eBCD for convergence proof.
result eBCD converges and outperforms state-of-the-art methods on various data sets.

Matrix rank minimization problem is in general NP-hard. The nuclear norm is used to substitute the rank function in many recent studies. Nevertheless, the nuclear norm approximation adds all singular values together and the approximation error may depend heavily on the magnitudes of singular values. This might restrict…

2015-10-30abs ↗pdf ↗

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.

The paper investigates polynomial alternatives to softmax in transformer models.

problem The effectiveness of softmax attention in transformers is questioned.
method The authors explore polynomial activations as alternatives to softmax, focusing on their ability to regularize the attention matrix.
result Certain polynomials can serve as effective substitutes for softmax in transformer applications, achieving strong performance.

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.

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 ↗

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 ↗

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 ↗

We propose a procedure for assigning a relevance measure to each explanatory variable in a complex predictive model. We assume that we have a training set to fit the model and a test set to check the out of sample performance. First, the individual relevance of each variable is computed by comparing the predictions in …

2019-12-13abs ↗pdf ↗

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.

We claim that HOMFLY polynomials for virtual knots, defined with the help of the matrix-model recursion relations, contain more parameters, than just the usual qq and A=qNA = q^N. These parameters preserve topological invariance and do not show up in the case of ordinary (non-virtual) knots and links. They are most conv…

2015-11-25abs ↗pdf ↗

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 ↗