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

93185278370 · Jun 202019922001200920172026
48 results for adaptive tag collection

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.

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 ↗

Language-based methods improve human similarity approximations without requiring many human judgments.

problem Approximating human similarity judgments using pre-trained deep neural networks (DNNs) is challenging and expensive.
method Developed language-based methods to approximate human similarity judgments, validated with adaptive tag collection pipeline.
result Language-based methods significantly improve performance over DNN-based methods with fewer human judgments.

Part-of-speech (POS) tagging is a fundamental component for performing natural language tasks such as parsing, information extraction, and question answering. When POS taggers are trained in one domain and applied in significantly different domains, their performance can degrade dramatically. We present a methodology f…

2014-10-31abs ↗pdf ↗

The high-order relations between the content in social media sharing platforms are frequently modeled by a hypergraph. Either hypergraph Laplacian matrix or the adjacency matrix is a big matrix. Randomized algorithms are used for low-rank factorizations in order to approximately decompose and eventually invert such big…

2019-08-22abs ↗pdf ↗

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 ↗

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 ↗

We derive a class of macroscopic differential equations that describe collective adaptation, starting from a discrete-time stochastic microscopic model. The behavior of each agent is a dynamic balance between adaptation that locally achieves the best action and memory loss that leads to randomized behavior. We show tha…

2004-08-20abs ↗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 ↗

Adapting policy learning for data collected from evolving systems.

problem Challenges in learning optimal policies from adaptively collected data.
method Proposes an algorithm based on generalized augmented inverse propensity weighted (AIPW) estimators to control worst-case estimation variance.
result Achieves minimax rate optimal regret guarantees even with diminishing exploration.

ManifoldMind uses adaptive-curvature probabilistic spheres for trustworthy recommendations in semantic hierarchies.

problem Sparse and abstract recommendation domains where users explore diverse conceptual paths.
method Adaptive-curvature probabilistic spheres, soft multi-hop inference, and curvature-aware semantic kernel.
result Superior NDCG, calibration, and diversity compared to baselines on public benchmarks.

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 ↗

We address challenges in estimating parameters from adaptively collected data.

problem Estimating parameters from data collected adaptively leads to non-normal asymptotic distributions.
method We develop semi-parametric estimators that account for adaptivity in data collection.
result Our estimators are asymptotically normal under certain conditions.

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.

CUDC collects diverse data for offline RL by predicting future states.

problem Challenges in collecting task-agnostic data for offline RL.
method Adaptive temporal distances for curiosity-driven data collection.
result CUDC outperforms existing unsupervised methods in offline RL tasks.

New guarantees for ERM with adaptively collected data.

problem Failure of ERM guarantees with adaptively collected data.
method Importance sampling weighted ERM algorithm with maximal inequality.
result First generalization guarantees and fast convergence rates for adaptively collected data.