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

1122 · Apr 202019922001200920182026
17 results for fluency

Level assessment for foreign language students is necessary for putting them in the right level group, furthermore, interviewing students is a very time-consuming task, so we propose to automate the evaluation of speaker fluency level by implementing machine learning techniques. This work presents an audio processing s…

2018-08-31abs ↗pdf ↗

ContextBench benchmarks methods for generating linguistically fluent inputs that activate specific latent features in language models.

problem Identifying inputs that trigger specific behaviours or latent features in language models.
method Context modification and benchmarking methods like Evolutionary Prompt Optimisation (EPO) with LLM-assistance and diffusion model inpainting.
result Enhanced methods achieve state-of-the-art performance in balancing elicitation effectiveness and fluency.

Researchers analyze the structure of token spaces in large language models.

problem Understanding the geometric and topological structure of token spaces in large language models.
method Developed estimators for the dimension and Ricci scalar curvature of the token subspace and applied them to three large language models.
result The token subspace is not a manifold but a stratified manifold with significantly negative Ricci curvature.

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.

SLED improves factuality in LLMs without external knowledge.

problem Unreliable or factually incorrect outputs from large language models.
method Contrasts final layer logits with early layers' logits, uses approximate gradient to refine outputs.
result Consistently improves factual accuracy over existing methods.

Improved text generation with constraints using discrete auto-regressive biasing.

problem Balancing fluency and constraint satisfaction in LLM outputs.
method Discrete Auto-regressive Biasing, leveraging gradients in discrete text space.
result Significantly improved constraint satisfaction with comparable fluency.

Study improves summarization reliability in risky scenarios.

problem Reliability of automatic summarization in high-risk contexts.
method Conditional generation with Bayesian inference and entropy regularization.
result Significant improvement in robustness and reliability of summarization.

PolyBench benchmarks LLMs on real market data, revealing significant performance gaps.

problem Benchmarking LLMs for real-world event prediction from live market signals.
method Multimodal benchmark derived from Polymarket, evaluating 7 LLMs under identical market states.
result Only two models achieve positive financial returns, highlighting the gap between fluency and probabilistic reasoning.

Transforms web content for better visibility in AI-driven search engines.

problem Disruption of traditional SEO by generative AI search engines.
method Fine-tunes a BART-base transformer on synthetically generated training data.
result Significant improvements in ROUGE-L and BLEU scores, and substantial visibility gains in generative search responses.

Few summaries enable automatic summarization of product reviews.

problem Lack of large labeled datasets for training supervised models in opinion summarization.
method Conditional Transformer model trained to generate summaries given other reviews, fine-tuned to predict summary properties.
result Few summaries (5-10) are sufficient to generate fluent, informative, and sentiment-preserving summaries.

KATA improves associative recall by optimizing feature maps derived from nonnegative attention weights.

problem Linear attention's poor performance on associative recall tasks.
method Formulates attention recall as a spherical-packing problem and introduces Kernelized Linear Attention Activations (KATA).
result KATA features offer a favorable capacity-interference tradeoff, enabling efficient associative recall.