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

86173259345 · Jun 202019922001200920172026
48 results for subtle representation

Researchers provide a simple topological method for Burau representations of loop braid groups.

problem Constructing Burau representations of loop braid groups.
method Simple topological construction of the Burau representations.
result One of the representations is more subtle and topologically natural but not easily combinatorially obvious.

MSA compares neural representations' intrinsic geometry for better understanding.

problem Existing similarity measures fail to capture subtle distinctions between neural network solutions.
method Metric similarity analysis (MSA) using Riemannian geometry.
result MSA can disentangle features of neural computations and compare nonlinear dynamics.

In the artificial intelligence field, learning often corresponds to changing the parameters of a parameterized function. A learning rule is an algorithm or mathematical expression that specifies precisely how the parameters should be changed. When creating an artificial intelligence system, we must make two decisions: …

2017-06-09abs ↗pdf ↗

Language models are at the heart of numerous works, notably in the text mining and information retrieval communities. These statistical models aim at extracting word distributions, from simple unigram models to recurrent approaches with latent variables that capture subtle dependencies in texts. However, those models a…

2019-09-11abs ↗pdf ↗

A new model improves CT image quality from low-dose scans.

problem Improving CT image quality from low-dose scans.
method Multi-layer Residual Sparsifying Transform (MRST) learning model for low-dose CT reconstruction.
result The MRST model outperforms conventional methods in maintaining subtle details.

The subtle interplay between local and global charges for topological semimetals exactly parallels that for singular vector fields. Part of this story is the relationship between cohomological semimetal invariants, Euler structures, and ambiguities in the torsion of manifolds. Dually, a topological semimetal can be rep…

2016-11-28abs ↗pdf ↗

Paper proves inequality for capillary hypersurfaces in a wedge.

problem Proving a best version of Heintze-Karcher inequality for capillary hypersurfaces.
method Utilized Heintze-Karcher method and modified parallel hypersurfaces.
result Classified capillary constant mean curvature hypersurfaces hitting the edge in a wedge.

Medical researchers are coming to appreciate that many diseases are in fact complex, heterogeneous syndromes composed of subpopulations that express different variants of a related complication. Time series data extracted from individual electronic health records (EHR) offer an exciting new way to study subtle differen…

2016-06-29abs ↗pdf ↗

New method enforces encoder sparsity in HPF for more interpretable feature selection.

problem Lack of encoder sparsity in HPF leads to lack of column-clustering property.
method Enforces encoder sparsity using a generalized additive model (GAM).
result Gains ability to perform feature selection and relates each representation to original features.

P-OCS detects OOD samples in a low-dimensional subspace, outperforming existing methods.

problem Efficient OOD detection for deep learning models in open-world environments.
method P-OCS operates in the orthogonal complement of the principal subspace, applying a single projected perturbation.
result P-OCS achieves state-of-the-art OOD detection with negligible computational cost and without requiring model retraining.

Distance metric learning (DML) approaches learn a transformation to a representation space where distance is in correspondence with a predefined notion of similarity. While such models offer a number of compelling benefits, it has been difficult for these to compete with modern classification algorithms in performance …

2015-11-18abs ↗pdf ↗

Knotted trivalent graphs (KTGs) form a rich algebra with a few simple operations: connected sum, unzip, and bubbling. With these operations, KTGs are generated by the unknotted tetrahedron and Moebius strips. Many previously known representations of knots, including knot diagrams and non-associative tangles, can be tur…

2003-11-25abs ↗pdf ↗

Objective: The aim of this study is to develop an automated classification algorithm for polysomnography (PSG) recordings to detect non-apneic and non-hypopneic arousals. Our particular focus is on detecting the respiratory effort-related arousals (RERAs) which are very subtle respiratory events that do not meet the cr…

2019-09-06abs ↗pdf ↗

We propose a generative model for adversarial attack. The model generates subtle but predictive patterns from the input. To perform an attack, it replaces the patterns of the input with those generated based on examples from some other class. We demonstrate our model by attacking CNN on MNIST.

2019-11-25abs ↗pdf ↗

In Theorem 1.2 of the paper math.GT/0002110 the author claimed to have proved that all transversal knots whose topological knot type is that of an iterated torus knot (we call them cable knots) are transversally simple. That theorem is false, and the Erratum math.GT/0610565 identifies the gap. The purpose of this paper…

2006-10-18abs ↗pdf ↗

In this paper, we consider orthogonal Ricci curvature RicRic^{\perp} for Kähler manifolds, which is a curvature condition closely related to Ricci curvature and holomorphic sectional curvature. We prove comparison theorems and a vanishing theorem related to these curvature conditions, and construct various examples to i…

2018-02-23abs ↗pdf ↗

It is known that the number of biquandle colorings of a long virtual knot diagram, with a fixed color of the initial arc, is a knot invariant. In this paper we describe a more subtle invariant: a family of biquandle endomorphisms obtained from the set of colorings and longitudinal information.

2007-09-16abs ↗pdf ↗

Backdoors can be implanted in neural models of source code, and we detect and remove them.

problem Vulnerability of neural models to backdoors in source code.
method Defined and implemented various backdoor classes, adapted robust statistics algorithms, and detected poisoned data through spectral signatures.
result Demonstrated the ease of injecting and removing backdoors in neural models of source code.

Lorentzian versions of classical Riemannian volume comparison theorems by Gunther, Bishop and Bishop-Gromov, are stated for suitable natural subsets of general semi-Riemannian manifolds. The problem is more subtle in the Bishop-Gromov case, which is extensively discussed. For the general semi-Riemannian case, a local v…

1998-11-27abs ↗pdf ↗

This work improves independence tests for high-dimensional data.

problem Detecting subtle dependencies between high-dimensional random variables with complex distributions.
method Develops two approaches to learn powerful independence tests using variational mutual information and HSIC.
result Optimized HSIC tests generally outperform other approaches on detecting structured dependence.

We examine homogeneous metrics on spheres and determine which ones have positive sectional curvature. The answer is subtle and surprisingly difficult to prove. In some cases we also determine their pinching constants. This completes the classification of all homogeneous metrics with positive curvature (apart from one s…

2007-07-20abs ↗pdf ↗

The paper characterizes equivariant immersions in hyperbolic space.

problem Characterizing equivariant immersions in hyperbolic space.
method Analyzes the Gauss map of equivariant immersions in hyperbolic space.
result Provides two characterizations of equivariant immersions: one in terms of the Maslov class and another for compact MM in terms of Hamiltonian symplectomorphisms.

Study on kinetic Langevin diffusions and their couplings, showing subtle TV bounds and new non-Markovian couplings.

problem Understanding and quantifying the TV distance between solutions of kinetic Langevin diffusions with different initial values.
method Established new non-Markovian couplings for kinetic Langevin diffusions, derived from optimal coalescence trajectories, and analyzed their TV bounds.
result No Markovian coupling can capture the asymptotic decay rate of the TV distance between solutions of kinetic Langevin diffusions with different initial values.

Improved singular value approximation for convolutional layers.

problem Improving accuracy of singular value approximation for linear convolutional layers.
method Developed a new spectral density matrix method for singular value approximation with improved accuracy and reduced computational complexity.
result Obtained moderate improvement in singular value distribution compared to circular approximation.

A new test evaluates risk estimation accuracy using probability integral transform.

problem Measuring the accuracy of financial market risk estimations.
method Probability Integral Transform (PIT) of ex post realized returns against ex ante probability distributions.
result The new test shows the importance of capturing the dynamic of financial markets.