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

2515037541,005 · Jun 202019922001200920172026
48 results for bases description

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 ↗

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.

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 ↗

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 ↗

Incorrect parity-based descriptions of realizable Gauss diagrams found, but bipartite graphs provide a valid approach.

problem Incorrect descriptions of realizable Gauss diagrams using parity conditions.
method Used bipartite graphs to describe realizable Gauss diagrams.
result Realizable Gauss diagrams can be accurately described using bipartite graphs.

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 2008-2009, F. Costa and C. Herdeiro proposed a new gravito-electromagnetic analogy, based on tidal tensors. We show that connections on the tangent bundle of the space-time manifold can help not only in finding a covnenient geometrization of their ideas, but also a common mathematical description of the main equatio…

2011-11-06abs ↗pdf ↗

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.

App classification is useful in a number of applications such as adding apps to an app store or building a user model based on the installed apps. Presently there are a number of existing methods to classify apps based on a given taxonomy on the basis of their text metadata. However, text based methods for app classifi…

2019-12-16abs ↗pdf ↗

Using intersection and self-intersection of loops, Turaev introduced in the seventies two fundamental operations on the algebra Q[π]\mathbb{Q}[π] of the fundamental group ππ of a surface with boundary. The first operation is binary and measures the intersection of two oriented based curves on the surface, while the seco…

2015-11-12abs ↗pdf ↗

The Bochner tensor is the Kähler analogue of the conformal Weyl tensor. In this article, we derive local (i.e., in a neighbourhood of almost every point) normal forms for a (pseudo-)Kähler manifold with vanishing Bochner tensor. The description is pined down to a new class of symmetric spaces which we describe in terms…

2017-09-26abs ↗pdf ↗

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 ↗

We develop an approach to Khovanov homology of knots via gauge theory (previous physics-based approches involved other descriptions of the relevant spaces of BPS states). The starting point is a system of D3-branes ending on an NS5-brane with a nonzero theta-angle. On the one hand, this system can be related to a Chern…

2011-01-17abs ↗pdf ↗

This paper proposes a system-agnostic policy for dynamic scheduling.

problem Dynamic scheduling in changing systems is challenging due to system-specific optimal policies.
method Descriptive policy that learns a system-agnostic scheduling principle.
result System-agnostic meta-learning enables adaptation to unseen system characteristics.

A Python tool generates synthetic data for cluster analysis from high-level descriptions.

problem Creating synthetic data for cluster analysis is laborious and requires detailed geometric parameters.
method Proposes natural language-based synthetic data generation and implements it in a Python package.
result Makes it easy to set up interpretable and reproducible benchmarks for cluster analysis.

We introduce a new dataset of 293,008 high definition (1360 x 1360 pixels) fashion images paired with item descriptions provided by professional stylists. Each item is photographed from a variety of angles. We provide baseline results on 1) high-resolution image generation, and 2) image generation conditioned on the gi…

2018-06-21abs ↗pdf ↗

Paper uses BERT to assess P2P borrowers' credit risk from loan descriptions.

problem Information asymmetry in P2P lending due to lack of borrower data.
method Fine-tunes BERT on Lending Club dataset to generate risk scores from loan descriptions.
result BERT-generated risk scores improve XGBoost classifier's performance in loan granting.

Generates garden paintings from text descriptions using deep learning.

problem Lack of firsthand material for traditional Chinese garden reconstruction.
method Deep learning model trained on text and paintings of Ming Dynasty gardens.
result Model generates garden paintings in Ming Dynasty style based on textual descriptions.

Lie n-algebroids and Lie infinity algebroids are usually thought of exclusively in supergeometric or algebraic terms. In this work, we apply the higher derived brackets construction to obtain a geometric description of Lie n-algebroids by means of brackets and anchors. Moreover, we provide a geometric description of mo…

2012-07-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.

Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a convex polytope. Typically we are only interested in a small subset of these vertices, thus opening the way for substantial optimization. Here we give an…

2008-08-29abs ↗pdf ↗

APD method decomposes neural network parameters into simple, faithful components.

problem Understanding the internal mechanisms learned by neural networks.
method Attribution-based Parameter Decomposition (APD) method.
result Demonstrated effectiveness in recovering features, separating computations, and identifying representations.