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

4028051,2071,609 · Jun 202019922001200920172026
48 results for Lagrange Large Language Models

GOPO optimizes large models in Hilbert space, avoiding Kullback-Leibler's curvature.

problem Optimizing large language models with Kullback-Leibler divergence's curvature issues.
method GOPO uses Hilbert space L2(pi_k) with orthogonality constraints and a work-dissipation functional.
result GOPO achieves competitive generalization with stable gradient dynamics and entropy preservation.

Paper studies critical points of curvature energies in 4D.

problem Critical points of conformally invariant extrinsic energies on 4-manifolds.
method Converted Euler-Lagrange equations to a system with favourable structures using invariances and Noether's theorem.
result Generalized Tristan Rivière's work on Willmore energy to 4D.

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.

Large language models predict human sensory judgments across multiple modalities.

problem Determining the extent of perceptual information in language.
method State-of-the-art large language models were used to predict sensory judgments across six psychophysical datasets.
result Large language models can predict human sensory judgments across multiple modalities with significant correlation to human data.

Recently, pre-trained language representation flourishes as the mainstay of the natural language understanding community, e.g., BERT. These pre-trained language representations can create state-of-the-art results on a wide range of downstream tasks. Along with continuous significant performance improvement, the size an…

2019-09-27abs ↗pdf ↗

Large language models have recently achieved state of the art performance across a wide variety of natural language tasks. Meanwhile, the size of these models and their latency have significantly increased, which makes their usage costly, and raises an interesting question: do language models need to be large? We study…

2019-10-10abs ↗pdf ↗

Chronologically consistent models maintain accuracy with time-restricted data.

problem Training data introduces lookahead bias and training leakage in large language models.
method ChronoBERT and ChronoGPT trained with only available data at each time point.
result Models achieve strong performance and competitive with larger models, mitigating lookahead bias.

DS-CP improves reliability of uncertainty quantification for large language models under domain shift.

problem Overconfident and factually incorrect outputs (hallucinations) from large language models.
method Adapts conformal prediction to large language models under domain shift by reweighting calibration samples.
result DS-CP delivers more reliable coverage than standard conformal prediction, especially under substantial distribution shifts.

LLMs translate natural language trading intents into correct option strategies using a domain-specific language.

problem Challenges in translating natural language trading intents into correct option strategies due to the complexity of option chain data.
method Introduce Option Query Language (OQL) as a domain-specific intermediate representation to abstract option markets into high-level primitives under grammatical rules. Use LLMs as semantic parsers and validate queries by an engine.
result Significantly improves execution accuracy and logical consistency over direct baselines.

This work uses conformal prediction to quantify uncertainty in large language models for multiple-choice questions.

problem Ensuring robustness and reliability of large language models in high-stakes applications.
method Conformal prediction applied to multi-choice question answering.
result Uncertainty estimates from conformal prediction are closely related to prediction accuracy.

Schwarzian derivative connects to Euler-Lagrange equations in variational calculus.

problem Understanding the relationship between the Schwarzian derivative and variational equations.
method Analyzing the Schwarzian derivative as a first integral and Euler-Lagrange operator for specific variations.
result The Schwarzian derivative is both a first integral and the Euler-Lagrange operator for a certain class of variations.

Optimus pre-trains sentences in a latent space for various NLP tasks.

problem Training large-scale language models for diverse NLP tasks.
method Pre-trained Variational Autoencoder (VAE) on large text corpus, fine-tuned for various tasks.
result Optimus achieves state-of-the-art on VAE language modeling benchmarks.

The goal of this paper is to encode equivalently the fractional Lagrange dynamics as a nonholonomic almost Kahler geometry. We use the fractional Caputo derivative generalized for nontrivial nonlinear connections (N-connections) originally introduced in Finsler geometry, with further developments in Lagrange and Hamilt…

2010-06-29abs ↗pdf ↗

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.

This work explains how linear representations in large language models arise from training objectives and gradient descent.

problem Understanding the origins of linear representations in large language models.
method A latent variable model to abstract and formalize concept dynamics, combined with analysis of the softmax cross-entropy objective and gradient descent.
result Linear representations emerge when learning from data matching the latent variable model, and this simple structure suffices to yield linear representations.

Graph signal processing detects hallucinations in large language models.

problem Detecting factual reasoning from hallucinations in large language models.
method Modeling transformer layers as dynamic graphs, using spectral analysis to define diagnostics.
result Spectral signatures can distinguish different types of hallucinations and achieve high accuracy.

Study Federated RL with diverse constraints, proposing new optimization methods.

problem Solving reinforcement learning with multiple constraints in federated learning.
method Federated primal-dual policy optimization methods based on policy gradient methods.
result FedNPG achieves global convergence with an ildeO(1/T) ilde{O}(1/\sqrt{T}) rate.

For a system of second order differential equations we determine a nonlinear connection that is compatible with a given generalized Lagrange metric. Using this nonlinear connection, we can find the whole family of metric nonlinear connections that can be associated with a system of SODE and a generalized Lagrange struc…

2004-12-06abs ↗pdf ↗

This paper benchmarks FinGPT for financial datasets using open-source large language models.

problem Challenges in integrating GPT-based models with financial datasets.
method Instruction Tuning paradigm for open-source large language models adapted for financial contexts.
result Demonstrates the effectiveness and adaptability of FinGPT in financial tasks.

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.

In this paper are studied the harmonic maps between two generalized Lagrange spaces. At the same time, it is proved that the solutions of C2C^2 class of certain ODEs or PDEs are harmonic maps between certain convenient generalized Lagrange spaces.

2000-09-14abs ↗pdf ↗

This work investigates uncertainty quantification for black-box large language models in natural language generation.

problem Lack of trustworthiness in responses generated by black-box large language models.
method Differentiated uncertainty vs confidence, proposed and compared several confidence/uncertainty measures, applied to selective NLG.
result A simple measure for semantic dispersion can predict the quality of LLM responses.

Discrete Lagrange problems solved with Lie group constraints.

problem Solving discrete Lagrange problems with Lie group constraints.
method Proving critical sections are solutions of unconstrained variational problems, applying Noether theory and multisymplectic forms.
result Critical sections of discrete Lagrange problems are solutions of unconstrained variational problems.

Develops a statistical framework to measure uncertainty in model rankings based on human preferences.

problem Uncertainty in model rankings based on human preferences due to mismatch between human and model preferences.
method Statistical framework using pairwise comparisons by humans and models to provide rank-sets for each model.
result Rank-sets constructed using only pairwise comparisons by strong models often do not cover the true ranking of human preferences.

Variational calculus on a vector bundle E equipped with a structure of a general algebroid is developed, together with the corresponding analogs of Euler-Lagrange equations. Constrained systems are introduced in the variational and in the geometrical setting. The constrained Euler-Lagrange equations are derived for ana…

2007-12-17abs ↗pdf ↗

ScheduleFree+ improves large language model training without schedules or learning rates.

problem Scaling up Schedule-Free Learning to large language models.
method Learning-rate-free and schedule-free method for training large language models.
result ScheduleFree+ outperforms SOTA schedules by 31% at 1000 tokens per parameter.

Efficient exploration improves large language model performance with fewer queries.

problem Improving large language model performance with fewer human feedback queries.
method Sequentially generates queries, fits a reward model to feedback, uses double Thompson sampling with epistemic neural network uncertainty.
result Efficient exploration enables high performance with far fewer queries.