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

4.2%8.3%12.5%16.7% · Apr 199519922001200920172026
48 results for descriptiveness

This paper studies fixed sets in ribbon complexes using descriptive proximity spaces.

problem Understanding fixed sets in ribbon complexes within descriptive proximity spaces.
method Introduces descriptive fixed sets and their properties in ribbon complexes, using descriptive proximally continuous maps.
result Establishes that proximal descriptive conjugacy preserves fixed sets in ribbon complexes.

Support Vector Data Description (SVDD) is a popular outlier detection technique which constructs a flexible description of the input data. SVDD computation time is high for large training datasets which limits its use in big-data process-monitoring applications. We propose a new iterative sampling-based method for SVDD…

2016-06-16abs ↗pdf ↗

Unique surgery descriptions found for knots in 3-manifolds.

problem Characterizing and understanding unique surgery descriptions for knots in 3-manifolds.
method Analyzing infinitely many surgeries along knots and hyperbolic L-space knots, proving unique descriptions.
result Infinitely many surgeries along knots have unique descriptions, generalizing the concept of characterizing slopes.

This article introduces descriptive cellular homology on cell complexes, which is an extension of J.H.C. Whitehead's CW topology. A main result is that a descriptive cellular complex is a topology on fibres in a fibre bundle. An application of two forms of cellular homology is given in terms of the persistence of shape…

2018-01-05abs ↗pdf ↗

New description of (1,1)(1,1) L-space knots leads to non-left-orderable surgeries.

problem Characterizing and understanding (1,1)(1,1) L-space knots.
method Analyzing coherent reduced (1,1)(1,1)-diagrams to describe (1,1)(1,1) L-space knots and proving non-left-orderable fundamental groups.
result Any L-space obtained by Dehn surgery on a (1,1)(1,1)-knot in S3S^3 has a non-left-orderable fundamental group.

The Goresky-Hingston coproduct was first introduced by D. Sullivan and later extended by M. Goresky and N. Hingston. In this article we give a Morse theoretic description of the coproduct. Using the description we prove homotopy invariance property of the coproduct. We describe a connection between our Morse theoretic …

2017-11-19abs ↗pdf ↗

The study quantifies the information needed for causal queries at different levels of Pearl's hierarchy.

problem How much additional information is needed for interventional and counterfactual queries compared to observational queries?
method Formalized via query-class description length, using Kolmogorov complexity of answer oracles induced by SCMs.
result Binary acyclic SCMs show a quadratic gap between observational and interventional descriptions, and a logarithmic gap between interventional and counterfactual descriptions.

Using the Huynh and Le quantum determinant description of the colored Jones polynomial, we construct a new combinatorial description of the colored Jones polynomial in terms of walks along a braid. We then use this description to show that for a knot which is the closure of a positive braid, the first N coefficients of…

2011-01-20abs ↗pdf ↗

We give combinatorial descriptions of the Heegaard Floer homology groups for arbitrary three-manifolds (with coefficients in Z/2). The descriptions are based on presenting the three-manifold as an integer surgery on a link in the three-sphere, and then using a grid diagram for the link. We also give combinatorial descr…

2009-10-01abs ↗pdf ↗

We give a geometric description of the Poisson boundaries of certain extensions of free and hyperbolic groups. In particular, we get a full description of the Poisson boundaries of free-by-cyclic groups. We rely upon the description of Poisson boundaries by means of a topological compactification as developed by Kaiman…

2009-11-03abs ↗pdf ↗

We provide a very brief review of the description of colored invariants for the Hopf link in terms of characters, which need to be taken at a peculiar deformation of the topological locus, depending on one of the two representations associated with the two components of the link. Most important, we extend the descripti…

2018-04-26abs ↗pdf ↗

Paper introduces Ddim, a new measure of model complexity, for MDL-based learning and change detection.

problem Characterizing the complexity of probabilistic models for efficient learning and change detection.
method Introduces descriptive dimension (Ddim) as a measure of model complexity. Derives convergence rates and error probabilities for MDL-based learning and change detection.
result Ddim characterizes the performance of MDL-based learning and change detection.

DRAGON improves learning for rare classes in unbalanced datasets using class descriptions.

problem Learning rare classes in unbalanced datasets with deep models.
method DRAGON is a late-fusion architecture that corrects bias towards frequent classes and fuses class-descriptions to improve tail-class accuracy.
result DRAGON outperforms state-of-the-art models on new benchmarks for long-tail learning with class descriptors.

Most existing text-to-image synthesis tasks are static single-turn generation, based on pre-defined textual descriptions of images. To explore more practical and interactive real-life applications, we introduce a new task - Interactive Image Editing, where users can guide an agent to edit images via multi-turn textual …

2018-12-20abs ↗pdf ↗

Recent progress in using recurrent neural networks (RNNs) for image description has motivated the exploration of their application for video description. However, while images are static, working with videos requires modeling their dynamic temporal structure and then properly integrating that information into a natural…

2015-02-27abs ↗pdf ↗

A toric arrangement is a finite set of hypersurfaces in a complex torus, every hypersurface being the kernel of a character. In the present paper we build a CW-complex homotopy equivalent to the arrangement complement, with a combinatorial description similar to that of the well-known Salvetti complex. If the toric arr…

2010-09-19abs ↗pdf ↗

In this paper we give a complete description of the set of discrete faithful representations SH(M) uniformizing a compact, orientable, hyperbolizable 3-manifold M with incompressible boundary, equipped with the strong topology, with the description given in term of the end invariants of the quotient manifolds. As part …

2010-03-09abs ↗pdf ↗

A new multiagent model of the stock market is formulated that contains four states in which the agents may be located. Next, the model is reformulated in the language of the functional integral containing fluctuations of prices and quantities of cash flows. It is shown that in the functional integral of that type descr…

2013-10-31abs ↗pdf ↗

The paper examines circle graphs of Gauss diagrams and finds counterexamples to previous descriptions.

problem Problems with previous descriptions of realizable Gauss diagrams.
method Experimental checking and formulation of new descriptions of realizable circle graphs.
result New descriptions of realizable circle graphs and an algorithm for checking realizability.

Study shows LLC correlates with neural network compressibility.

problem Evaluating limits of neural network compression.
method Extended minimum description length principle using singular learning theory.
result Complexity estimates based on LLC are linearly correlated with compressibility.

In (Phys. Rev. D 62, 081501, 2000) we proposed a unified approach to description of continuous and discrete spacetime based on nonassociative geometry and described nonassociative smooth and discrete de Sitter models. In our paper we give the description of nonassociative Friedmann-Robertson-Walker spacetime.

2004-06-24abs ↗pdf ↗

New method improves bivariate causal discovery by accurately estimating cause variable complexity.

problem Improper estimation of cause variable complexity in current MDL-based methods.
method Rate-distortion MDL (RDMDL) using information dimension for cause variable complexity estimation.
result RDMDL achieves competitive performance on Tübingen dataset.