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

491317 · Jul 202019922001200920172026
48 results for tagged triangulation

The braid group of a complex reflection group is shown to be an index d subgroup.

problem Understanding the structure of braid groups associated with complex reflection groups.
method Presented a compatible presentation for the braid group of the orbifold quotient and a tagged triangulation of the disk.
result The braid group of the complex reflection group G(d,d,n)G(d,d,n) is an index dd subgroup of the braid group of the orbifold quotient.

We establish basic properties of cluster algebras associated with oriented bordered surfaces with marked points. In particular, we show that the underlying cluster complex of such a cluster algebra does not depend on the choice of coefficients, describe this complex explicitly in terms of "tagged triangulations" of the…

2006-08-15abs ↗pdf ↗

Network embedding is a method to learn low-dimensional representation vectors for nodes in complex networks. In real networks, nodes may have multiple tags but existing methods ignore the abundant semantic and hierarchical information of tags. This information is useful to many network applications and usually very sta…

2019-04-19abs ↗pdf ↗

Proves conjecture linking cluster algebras and skein algebras for surfaces with punctures.

problem Cluster and skein algebras on surfaces with punctures.
method Geometric and algebraic methods, including decorated Teichmüller spaces and skein algebras.
result Cluster and skein algebras coincide for surfaces with at least 2 punctures.

Paper proposes set-valued prediction for historical POS tagging.

problem Difficult POS tagging in historical corpora due to lack of native speakers and sparse data.
method Set-valued prediction approach to allow uncertainty in tagging.
result Set-valued prediction improves POS tagging precision and robustness.

The paper extends influence functions to sequence tagging tasks for better model interpretability.

problem Lack of interpretability methods for sequence tagging models.
method Define and compute influence of training instance segments on test segment predictions.
result The segment influence method tracks with true influence and identifies annotation errors.

To date, there have been massive Semi-Structured Documents (SSDs) during the evolution of the Internet. These SSDs contain both unstructured features (e.g., plain text) and metadata (e.g., tags). Most previous works focused on modeling the unstructured text, and recently, some other methods have been proposed to model …

2015-07-30abs ↗pdf ↗

We study the cluster categories arising from marked surfaces (with punctures and non-empty boundaries). By constructing skewed-gentle algebras, we show that there is a bijection between tagged curves and string objects. Applications include interpreting dimensions of Ext1\operatorname{Ext}^1 as intersection numbers of ta…

2013-10-31abs ↗pdf ↗

MuLan links music audio to natural language tags.

problem Traditional music tagging systems use rigid attributes; MuLan aims to link audio directly to natural language.
method Joint audio-text embedding model trained on 44 million music recordings and text annotations.
result MuLan's embeddings enable zero-shot functionalities and transfer learning.

Identifying the flavour of neutral BB mesons production is one of the most important components needed in the study of time-dependent CPCP violation. The harsh environment of the Large Hadron Collider makes it particularly hard to succeed in this task. We present an inclusive flavour-tagging algorithm as an upgrade of…

2017-05-24abs ↗pdf ↗

We leverage automatic differentiation (AD) and probabilistic programming to develop an end-to-end optimization algorithm for batch triangulation of a large number of unknown objects. Given noisy detections extracted from noisily geo-located street level imagery without depth information, we jointly estimate the number …

2018-11-21abs ↗pdf ↗

This paper introduces Task 2 of the DCASE2019 Challenge, titled "Audio tagging with noisy labels and minimal supervision". This task was hosted on the Kaggle platform as "Freesound Audio Tagging 2019". The task evaluates systems for multi-label audio tagging using a large set of noisy-labeled data, and a much smaller s…

2019-06-07abs ↗pdf ↗

Feature learning and deep learning have drawn great attention in recent years as a way of transforming input data into more effective representations using learning algorithms. Such interest has grown in the area of music information retrieval (MIR) as well, particularly in music audio classification tasks such as auto…

2015-08-20abs ↗pdf ↗

Mutation graph of support τ-tilting modules over skew-gentle algebras is connected.

problem Understanding the structure of support τ-tilting modules over skew-gentle algebras.
method Introducing mutation of maximal rigid objects and using exchange triangles to define mutations of support τ-tilting modules.
result The mutation graph of support τ-tilting modules over a skew-gentle algebra is connected.

Recent studies have shown that neural models can achieve high performance on several sequence labelling/tagging problems without the explicit use of linguistic features such as part-of-speech (POS) tags. These models are trained only using the character-level and the word embedding vectors as inputs. Others have shown …

2019-09-29abs ↗pdf ↗

Twitmo analyzes geo-tagged Twitter data for topic modeling and visualization.

problem Analyzing public discourse on Twitter for various topics, parties, or individuals.
method Collects and preprocesses geo-tagged Tweets, applies LDA, CTM, STM, and visualizes results.
result Automatic pooling of Tweets into pseudo-documents improves topic coherence.

Enhances multi-tag classification using low-dimensional vector representations and virtual data.

problem Improving the performance of multi-tag classifiers.
method Embedding raw data into a low-dimensional feature space, then generating virtual data from linear operations on these vectors, to train multi-tag classifiers.
result Significant improvement in F1 scores (up to 224%) compared to training directly with raw data.

Tight triangulated manifolds are generalisations of neighborly triangulations of closed surfaces and are interesting objects in Combinatorial Topology. Tight triangulated manifolds are conjectured to be minimal. Except few, all the known tight triangulated manifolds are stacked. It is known that locally stacked tight t…

2015-06-01abs ↗pdf ↗

Efficient triangulations help in understanding 3-manifold boundaries.

problem Understanding boundary slopes in 3-manifolds.
method Introducing and studying boundary-efficient triangulations and inflating ideal triangulations.
result There are only finitely many boundary slopes for incompressible and \(\partial\)-incompressible surfaces in compact 3-manifolds.

We empirically investigate the (negative) expected accuracy as an alternative loss function to cross entropy (negative log likelihood) for classification tasks. Coupled with softmax activation, it has small derivatives over most of its domain, and is therefore hard to optimize. A modified, leaky version is evaluated on…

2019-05-01abs ↗pdf ↗

Generative Adversarial Nets [8] were recently introduced as a novel way to train generative models. In this work we introduce the conditional version of generative adversarial nets, which can be constructed by simply feeding the data, y, we wish to condition on to both the generator and discriminator. We show that this…

2014-11-06abs ↗pdf ↗

We give a geometric realization, the tagged rotation, of the AR-translation on the generalized cluster category associated to a surface S\mathbf{S} with marked points and non-empty boundary, which generalizes Brüstle-Zhang's result for the puncture free case. As an application, we show that the intersection of the shi…

2012-11-30abs ↗pdf ↗