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.

169,051 papers · 148 categories

Trend · papers per month

15304459 · Jun 202019922001200920182026
48 results for Keyword Queries

A model learns to translate natural language queries for search systems.

problem Understanding user queries for search-oriented conversational systems.
method Reinforcement learning framework for translating NL expressions to queries.
result Effectiveness of the model on TREC datasets.

Study compares methods for improving document retrieval accuracy.

problem Improving document retrieval accuracy from large corpora.
method Comparison of query expansion, topic models, and active learning.
result Active learning outperforms keyword lists in most settings.

Sequence learning improves query expansion in information retrieval.

problem Improving query expansion in information retrieval systems.
method Used sequence to sequence algorithms to extract keywords from sentence embeddings and trained a neural network on open datasets.
result Sequence to sequence models can capture complex query expansion relations in word embeddings.

Early stopping methods reduce unnecessary reasoning steps in LLMs by monitoring uncertainty signals.

problem LLMs sometimes generate unnecessary reasoning steps, especially under uncertainty.
method Statistically principled early stopping methods that monitor uncertainty signals during generation.
result Uncertainty-aware early stopping improves efficiency and reliability in LLM reasoning, especially in math reasoning.

A dynamic keyword selection model for topic modeling of tweets.

problem Adjusting keywords dynamically to mimic past topics with novelty.
method Generative process selects keywords and documents, trained with variational lower bound and stochastic gradient optimization.
result Keyword-based topic model outperforms a sophisticated baseline model by 67%.

Improved CSKS with limited data using novel loss functions and transfer learning.

problem Spotting keywords in continuous speech with limited training data.
method Combination of Prototypical networks' loss and metric loss with transfer learning.
result Improves F1 score by over 10%

This paper improves keyword recommendation for sponsored search using deep reinforcement learning.

problem Selecting keywords from given candidates considering internal and external competitions.
method Solves the combinatorial optimization problem of keyword recommendations with a modified pointer network structure trained in a deep reinforcement learning framework.
result Remarkable improvements in performance observed both offline and online.

Channel pruning and weight binarization improve keyword spotting accuracy.

problem Improving accuracy of keyword spotting in neural networks.
method Group-wise splitting method using group Lasso penalty for channel sparsity, combined with 1-bit weight precision.
result Achieved over 50% channel sparsity with minimal accuracy loss.

Synthetic speech data improves keyword spotting models with fewer real examples.

problem Training models for recognizing spoken keywords with limited real data.
method Used a pre-trained speech embedding model to extract features for training a small keyword spotting model.
result A model trained on synthetic speech data can detect 10 keywords with the same accuracy as a model trained on over 500 real examples.

Loihi neuromorphic chip outperforms conventional hardware in keyword spotting efficiency.

problem Benchmarking keyword spotting efficiency on neuromorphic hardware.
method Comparative analysis of a two-layer neural network trained to recognize a single phrase on Intel's Loihi neuromorphic chip and conventional hardware devices.
result Loihi outperforms conventional hardware on energy cost per inference for this keyword spotting application.

Efficient keyword spotting model using dilated convolutions and gating.

problem Keyword spotting in resource-constrained environments.
method End-to-end temporal modeling with dilated convolutions, gated activations, and residual connections.
result Our model outperforms LSTM-based keyword spotting with a significant decrease in false rejection rate.

Improved ASR-free keyword spotting in under-resourced languages.

problem Dynamic time warping for keyword spotting in languages with limited resources.
method Multilingual bottleneck extractor and correspondence autoencoder integration.
result More than 11% absolute improvement in ROC AUC over MFCCs.

A new multi-layer attention mechanism improves speech keyword recognition accuracy.

problem Inaccurate attention weights in LSTM networks for speech keyword recognition.
method Introducing information from layers prior to feature extraction into attention weights calculations.
result The proposed multi-layer attention mechanism leads to more accurate attention weights and improved keyword spotting performance.

SANAS adapts neural network architecture in real-time for efficient keyword spotting.

problem Efficiently identifying keywords in real-time audio streams with minimal computational cost.
method Stochastic Adaptive Neural Architecture Search (SANAS) that dynamically adjusts network size based on task difficulty.
result SANAS achieves high keyword recognition accuracy with significantly reduced computational cost.

Proposes new methods for interpreting document classification models.

problem Interpretation fragility of attention-based neural networks.
method Corpus-level and concept-based explanation methods using attention weights.
result Extracts semantically meaningful keywords and concepts for model predictions.

AR CI framework handles complex confounders and sequential actions.

problem Low-dimensional confounders and singleton actions in causal inference.
method Sequencification to transform data into sequences, enabling CI with complex confounders and sequential actions.
result AR model can estimate multiple causal quantities using a single model, simplifying inference and improving outcome prediction.

In this paper, computer-based techniques for stylistic analysis of paintings are applied to the five panels of the 14th century Peruzzi Altarpiece by Giotto di Bondone. Features are extracted by combining a dual-tree complex wavelet transform with a hidden Markov tree (HMT) model. Hierarchical clustering is used to ide…

2014-01-26abs ↗pdf ↗

System tackles indeterminacies in automated audio captioning.

problem Word selection and sentence length indeterminacies in automated audio captioning.
method Solves caption generation and sub-indeterminacy problems through multi-task learning to estimate keywords and sentence length.
result Model achieved 20.7 SPIDEr score, significantly outperforming baseline.

Study improves keyword forecasting in earnings-call prediction markets.

problem Accurately predicting future keyword mentions in earnings calls.
method Experiments on earnings-call mention markets, varying context and market probability, introducing MCP.
result Mixture of market probability and MCP yields the best forecasts.

CGMH uses Metropolis-Hastings sampling to generate sentences with complex constraints.

problem Generating sentences with specific constraints while maintaining fluency and naturalness.
method CGMH employs Metropolis-Hastings sampling for constrained sentence generation.
result CGMH outperforms previous methods in various constrained sentence generation tasks.

Paper optimizes KWS models using NAS and quantization for limited resources.

problem Developing efficient keyword spotting models in resource-constrained environments.
method Neural Architecture Search (NAS) for model structure optimization and quantization of weights and activations.
result Achieved high accuracy (95.55%) with minimal parameters and operations using NAS and quantization.

SpeakerStew verifies 46 languages with reduced training and inference costs.

problem Speaker verification for 46 languages with smart speaker interactions.
method Pooling multilingual data, triage between text-dependent and text-independent models.
result Training on multiple languages generalizes well and reduces computational requirements.