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

3569104138 · May 202619922001200920172026
48 results for crossing resolutions

This paper improves image super-resolution by integrating cross-scale non-local attention.

problem Improving image super-resolution by leveraging long-range and cross-scale feature correlations.
method Proposes a Cross-Scale Non-Local (CS-NL) attention module integrated into a recurrent neural network.
result Significantly improved performance on SISR benchmarks.

Classical knots in R3\mathbb{R}^3 can be represented by diagrams in the plane. These diagrams are formed by curves with a finite number of transverse crossings, where each crossing is decorated to indicate which strand of the knot passes over at that point. A pseudodiagram is a knot diagram that may be missing crossing…

2012-10-25abs ↗pdf ↗

Paper constructs a HOMFLYPT-type invariant for pseudo links.

problem Inability to construct polynomial invariants for pseudo links using Hecke algebra techniques.
method Using a resolution homomorphism and pseudo Hecke algebra of type \(A\), the paper constructs a HOMFLYPT-type invariant for oriented pseudo links.
result The constructed invariant satisfies a natural pseudo skein relation and admits a state-sum formulation.

We review the decomposition method of stock return cross-correlations, presented previously for studying the dependence of the correlation coefficient on the resolution of data (Epps effect). Through a toy model of random walk/Brownian motion and memoryless renewal process (i.e. Poisson point process) of observation ti…

2007-04-28abs ↗pdf ↗

Given a crossing in a planar diagram of a link in the three-sphere, we show that the knot Floer homologies of the link and its two resolutions at that crossing are related by an exact triangle. As a consequence, we deduce that for any quasi-alternating knot, the total rank of its knot Floer homology is equal to the det…

2006-09-19abs ↗pdf ↗

Constructing brane quantization for AnA_n-resolutions using SYZ mirror symmetry.

problem Quantizing branes on singular fibers using SYZ mirror symmetry.
method Constructing coisotropic A-branes and their mirrors via fiberwise geometric quantization.
result Establishing a mirror isomorphism between endomorphism algebras.

New method resolves causal heterogeneity by defining a resolution profile.

problem Causal subgroup analyses often oversimplify heterogeneity into a small number of groups.
method Introduces a resolution profile as a functional of the causal feature law, using Bayesian-bootstrap inference.
result Shows that the resolution profile is a continuous path with discontinuities at knots, providing integer-valued subgroup numbers.

This is a survey paper. We explain the known constructions for two geometrically different classes of examples of compact Riemannian 7-manifolds with holonomy G2. One method uses resolutions of singularities of appropriately chosen 7-dimensional orbifolds, with the help of asymptotically locally Euclidean spaces. Anoth…

2019-09-25abs ↗pdf ↗

For the purpose of elucidating the correlation among currencies, we analyze daily and high-resolution data of foreign exchange rates. There is strong correlation for pairs of currencies of geographically near countries. We show that there is a time delay of order less than a minute between two currency markets having a…

2003-03-17abs ↗pdf ↗

STanHop predicts multivariate time series with memory-enhanced capabilities.

problem Predicting multivariate time series with memory-enhanced capabilities.
method Sparse Tandem Hopfield Network (STanHop) with two external memory modules.
result STanHop outperforms dense Hopfield models in memory retrieval error.

We analyse the dependence of stock return cross-correlations on the sampling frequency of the data known as the Epps effect: For high resolution data the cross-correlations are significantly smaller than their asymptotic value as observed on daily data. The former description implies that changing trading frequency sho…

2007-04-09abs ↗pdf ↗

The paper defines new homotopy relations on knot projections and classifies certain knot types.

problem Defining and classifying knot homotopy relations.
method Introducing cross chord numbers and using them to define strong and weak (1, 3) homotopies.
result Complete classification of knot projections with trivializing number two.

Image super-resolution (SR) is an underdetermined inverse problem, where a large number of plausible high-resolution images can explain the same downsampled image. Most current single image SR methods use empirical risk minimisation, often with a pixel-wise mean squared error (MSE) loss. However, the outputs from such …

2016-10-14abs ↗pdf ↗

Paper speeds up visualization of uncertain data.

problem High computational cost in reconstructing data uncertainties.
method Subdivide data spatially, adaptively reconstructing only necessary values, using GPR kernel and saved data observations to estimate upper bounds for level-crossing probabilities.
result Accurate estimation of value occurrence probabilities with low computation cost.

Paper evaluates deadline-ILS on insider trading contracts, finding it distinguishes signals from noise.

problem Deadlines in insider trading contracts and information leakage detection.
method Empirical evaluation using FFIC dataset, hazard-rate estimation, cross-market wallet analysis.
result Deadline-ILS distinguishes signal from proxy artefact, with a significant shift in magnitude.

Quasi-alternating links are a natural generalization of alternating links. In this paper, we show that quasi-alternating links are "homologically thin" for both Khovanov homology and knot Floer homology. In particular, their bigraded homology groups are determined by the signature of the link, together with the Euler c…

2007-08-23abs ↗pdf ↗

Study on cryptocurrency market correlations at various time scales.

problem Understanding the hierarchical structure of cryptocurrency market dynamics.
method Analysis of MST and TMFG for 25 liquid cryptocurrencies at different time horizons.
result Cryptocurrency market correlations decrease with finer time scales and show a growing hierarchical structure with coarser scales.

In our previous work we have shown that resistive cross point devices, so called Resistive Processing Unit (RPU) devices, can provide significant power and speed benefits when training deep fully connected networks as well as convolutional neural networks. In this work, we further extend the RPU concept for training re…

2018-06-01abs ↗pdf ↗

SR-NAM maps low-res images to multiple high-res images realistically.

problem Mapping low-resolution images to multiple high-resolution images realistically.
method SR-NAM using Non-Adversarial Mapping (NAM) technique and a degradation model.
result Realistic degradation and down-sampling of high-resolution images.

Background: Three-dimensional, whole heart, balanced steady state free precession (WH-bSSFP) sequences provide delineation of intra-cardiac and vascular anatomy. However, they have long acquisition times. Here, we propose significant speed ups using a deep learning single volume super resolution reconstruction, to reco…

2019-12-22abs ↗pdf ↗

This study prioritizes temporal resolution over spatial in energy systems models due to higher influence.

problem The impact of spatial and temporal resolution on energy system models.
method Global sensitivity analysis to compare structural aspects, spatial, and temporal resolution.
result Temporal resolution has a higher influence on all results parameters compared to spatial resolution.

Few-shot learning is the process of learning novel classes using only a few examples and it remains a challenging task in machine learning. Many sophisticated few-shot learning algorithms have been proposed based on the notion that networks can easily overfit to novel examples if they are simply fine-tuned using only a…

2019-10-01abs ↗pdf ↗

Deep learning improves 3D microscopy resolution without matched target images.

problem Anisotropic resolution in volumetric fluorescence microscopy.
method Cycle-consistent generative adversarial network trained on unpaired 2D images.
result Enhanced axial resolution and restored details between imaging planes.

There are 2^n possible resolutions of a smooth pseudodiagram with n precrossings. If we consider piecewise-linear (PL) pseudodiagrams and resolutions that themselves are PL, certain resolutions of the pseudodiagram may not exist in three-space. We investigate this situation and its impact on the weighted resolution set…

2013-08-30abs ↗pdf ↗

Recently M. Kreck introduced a class of stratified spaces called p-stratifolds [M. Kreck, Stratifolds, Preprint]. He defined and investigated resolutions of p-stratifolds analogously to resolutions of algebraic varieties. In this note we study a very special case of resolutions, so called optimal resolutions, for p-str…

2003-11-18abs ↗pdf ↗

A resolution of the St. Petersburg paradox is presented. In contrast to the standard resolution, utility is not required. Instead, the time-average performance of the lottery is computed. The final result can be phrased mathematically identically to Daniel Bernoulli's resolution, which uses logarithmic utility, but is …

2010-11-19abs ↗pdf ↗

The `Folk Theorem' that a smooth action by a compact Lie group can be (canonically) resolved, by iterated blow up, to have unique isotropy type is proved in the context of manifolds with corners. This procedure is shown to capture the simultaneous resolution of all isotropy types in a `resolution tower' which projects …

2009-07-20abs ↗pdf ↗

WrapNet optimizes inference for low-resolution neural networks by using 8-bit additions.

problem Reducing multiplication complexity in low-resolution neural networks.
method Adapting neural networks to use low-resolution (8-bit) additions in accumulators, with a cyclic activation layer and overflow penalty regularizer.
result Achieves comparable classification accuracy to 32-bit counterparts using low-resolution additions.

A refined form of the `Folk Theorem' that a smooth action by a compact Lie group can be (canonically) resolved, by iterated blow up, to have unique isotropy type was established by the authors in the context of manifolds with corners; the canonical construction induces fibrations on the boundary faces of the resolution…

2010-12-28abs ↗pdf ↗

Previous transfer learning methods based on deep network assume the knowledge should be transferred between the same hidden layers of the source domain and the target domains. This assumption doesn't always hold true, especially when the data from the two domains are heterogeneous with different resolutions. In such ca…

2018-09-23abs ↗pdf ↗