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,742 papers · 148 categories

Trend · papers per month

123247370493 · May 202619922001200920172026
48 results for language conditioning

This paper proposes a new method to connect language and physical actions in reinforcement learning.

problem Connecting linguistic representations to the physical world in embodied agents.
method Language-conditioned goal generators to decouple sensorimotor learning from language acquisition.
result Agents can demonstrate a diversity of behaviors for any given instruction.

Generates biomedical abstracts from titles, years, and keywords.

problem Difficulties in understanding biomedical research papers due to specialized language.
method Conditional transformer-based language model with metadata conditioning.
result Generated abstracts are more relevant and non-trivial than GPT-2.

New approach decouples skill learning and language grounding for autonomous agents.

problem Autonomous acquisition of skills without external instructions and feedback.
method Language-Goal-Behavior (LGB) architecture with semantic representation.
result Decouples skill learning and language grounding, enabling diversity and strategy switching.

Large language models can't efficiently reason conditionally in a distribution-free setting.

problem Impossibility of conditional PAC-efficient reasoning in large language models.
method Proof of impossibility in a distribution-free setting for non-atomic input spaces.
result Any algorithm achieving conditional PAC efficiency must defer to the expert model with high probability.

The paper distinguishes between conditional and marginal processes in language models and discusses conditions for usefulness.

problem The conditional nature of language models trained on observed sequences and the need for marginal text-only processes.
method Distinguishing between full conditional language process, marginal text-only process, and model-induced distribution; analyzing assumptions of stationarity and ergodicity.
result The marginal text-only law is useful only when the observed prefix is an approximately sufficient statistic for the latent circumstances relevant to continuation.

Learned feature representations and sub-phoneme posteriors from Deep Neural Networks (DNNs) have been used separately to produce significant performance gains for speaker and language recognition tasks. In this work we show how these gains are possible using a single DNN for both speaker and language recognition. The u…

2015-04-03abs ↗pdf ↗

The semantic map calibrates uncertainty from language model probabilities.

problem Uncertainty in language model probabilities for professional decisions.
method Prespecified semantic map linking probabilities of verbal responses to probabilities of declared states.
result Language-derived probabilities outperform printed numerical probabilities and recover valid uncertainty coverage.

MGLM models all possible language channel factorizations for improved multilingual generation.

problem Generating multilingual text with flexibility and quality.
method Generative joint distribution model over language channels, marginalizing all possible factorizations.
result MGLM outperforms traditional models in multilingual generation tasks.

SLM models code syntax as trees to generate any programming language code.

problem Generating any piece of code in a given language without restrictions.
method Structural language modeling (SLM) decomposes code into ASTs and estimates probabilities over nodes.
result SLM model generates arbitrary code in any language, outperforming previous methods.

Paper studies model stealing for low-rank language models.

problem Model stealing threatens proprietary models' security and data privacy.
method Theoretical study of model stealing for Hidden Markov Models (HMMs) and low-rank language models using the conditional query model.
result Efficient algorithm for learning any low-rank distribution in the conditional query model.

Generative Adversarial Networks (GANs) have gathered a lot of attention from the computer vision community, yielding impressive results for image generation. Advances in the adversarial generation of natural language from noise however are not commensurate with the progress made in generating images, and still lag far …

2017-05-31abs ↗pdf ↗

HIGhER uses language to generate new instructions for better learning from mistakes.

problem Improving instruction following in reinforcement learning environments.
method Hindsight Generation for Experience Replay (HIGhER) that learns from mistakes and relabels episodes.
result HIGhER enhances instruction following in reinforcement learning environments.

Gaussian processes are conditioned on various types of data.

problem Exact inference in Gaussian processes is limited to linear-Gaussian settings.
method Established an equivalence between GPs and linear diffusion models, allowing for approximate inference in non-linear settings.
result A general-purpose GP inference scheme that handles various conditioning statements, including non-linear physics and natural language.

Language models are at the heart of numerous works, notably in the text mining and information retrieval communities. These statistical models aim at extracting word distributions, from simple unigram models to recurrent approaches with latent variables that capture subtle dependencies in texts. However, those models a…

2019-09-11abs ↗pdf ↗

Model detects depression from transcribed interviews using affective language.

problem Detecting depression from transcribed clinical interviews.
method Hierarchical Attention Network with affective conditioning.
result Model achieves state-of-the-art F1 scores in depression detection.

This paper investigates how large language models achieve neural collapse, a phenomenon linked to generalization.

problem Neural collapse in large language models under imbalanced and token-rich conditions.
method Empirical investigation of scaling and regularization effects on CLMs' progression towards neural collapse.
result Neural collapse properties develop with scale and regularization, linked to generalization in language modeling.

OT domain adaptation improves aphasia detection across languages.

problem Detecting aphasia in low-resource languages with limited data.
method Utilized OT domain adaptation to map linguistic features across multiple languages.
result OT domain adaptation significantly improved F1 scores for French and Mandarin aphasia detection.

The study examines how language models learn to represent the world, identifying conditions for ecological veridicality.

problem Understanding when language models learn to represent the world accurately and how this learning process can fail.
method Analyzes the Bayes-optimal next-token cross-entropy decomposition and the role of training ecology in shaping model representations.
result The minimum-complexity zero-excess solution is the quotient partition by training equivalence, and this solution is not preserved in in-context learning or per-task adaptation.

A new sampler for FLMs improves token-level decoding controls.

problem Sampling from FLMs using standard methods collapses marginals and produces invalid sequences.
method Samples clean one-hot endpoints from FLM token marginals and uses Ornstein-Uhlenbeck bridges conditioned on these endpoints.
result The method preserves token-wise posterior-predictive marginals and improves quality-diversity tradeoff.

Language models predict inorganic synthesis conditions and temperatures.

problem Limited data and heuristic approaches constrain inorganic synthesis planning.
method Language models without fine-tuning predict precursor conditions and temperatures.
result Language models achieve high accuracy in predicting synthesis conditions and temperatures.

Enhanced conformal methods improve validity of LLM outputs.

problem Lack of conditional validity and high false rejection rates in LLM validity guarantees.
method Adaptive conditional conformal procedure and improved scoring function differentiation.
result Demonstrated improved validity and utility on real datasets.

Paper estimates AI hallucinations in conditional generation tasks.

problem Estimating the frequency of AI-generated incorrect responses.
method Developed a method to estimate hallucination probability from generated responses and log probabilities.
result Method accurately estimates hallucination rate in natural language and synthetic tasks.

The study analyzes numerical stability in large language models using mixed-precision arithmetic.

problem Numerical stability of large language models using low-precision arithmetic.
method Developed a mixed-precision analysis of transformer inference, deriving bounds for condition numbers and forward error.
result Established that numerical stability is determined by the interplay between weight magnitude and the growth of the residual stream.

Reduces gender bias in patient notes while maintaining medical classification accuracy.

problem Bias in natural language processing of patient notes.
method Identifying and removing gendered language using BERT-based classifiers, then augmenting data to maintain performance.
result Minimal degradation in health condition classification tasks with data augmentation.

It is time-consuming and error-prone to implement inference procedures for each new probabilistic model. Probabilistic programming addresses this problem by allowing a user to specify the model and having a compiler automatically generate an inference procedure for it. For this approach to be practical, it is important…

2013-12-12abs ↗pdf ↗

In this work we present a technique to use natural language to help reinforcement learning generalize to unseen environments. This technique uses neural machine translation, specifically the use of encoder-decoder networks, to learn associations between natural language behavior descriptions and state-action informatio…

2017-07-26abs ↗pdf ↗

Enhances reward specification in RL with a novel language-based approach.

problem Reward specification in RL can lead to unintended, potentially harmful behaviours.
method Developed a novel class of language-based Reward Machines using RML's built-in memory.
result Can specify non-regular, non-Markovian reward functions for complex tasks.

This work offers a broad perspective on probabilistic modeling and inference in light of recent advances in probabilistic programming, in which models are formally expressed in Turing-complete programming languages. We consider a typical workflow and how probabilistic programming languages can help to automate this wor…

2018-10-02abs ↗pdf ↗

A method for disentangling text representations without supervision.

problem Challenges in learning disentangled representations of natural language.
method Information-theoretic guidance to induce independent style and content embeddings.
result High quality disentangled representations in terms of content and style preservation.

Study on generating and identifying languages privately, showing privacy imposes costs and creates barriers.

problem Generating and identifying languages privately in the limit model.
method Introduced a continual release model under differential privacy constraints, proving both positive and negative results.
result Privacy imposes quantitative and qualitative costs, and creates fundamental barriers for identification.

Language models allocate information storage, not collapsing into uniform representations.

problem Incomplete neural collapse in language model representations.
method Analyzing variance and information sharing across 14 models, proving an information floor.
result Within-class variance is allocated information storage, not collapsed into uniform representations.

We introduce a new sampling method for large language models that balances diversity and parallelism.

problem Balancing diversity and parallelism in decoding for large language models.
method Arithmetic sampling framework compatible with various sampling variations.
result Improves estimation of expected BLEU score reward and reduces the gap with beam search.