Inference-aware meta-alignment of LLMs reduces computational cost.
problem Aligning LLMs to diverse human preferences is challenging due to conflicting criteria.
method IAMA trains a base model to be aligned to multiple tasks via different inference-time alignment algorithms, using non-linear GRPO for optimization.
result IAMA enables effective alignment of LLMs to multiple criteria with limited computational budget.
The paper optimizes LLM inference systems through queueing theory.
problem Efficient LLM inference for AI agents under various routing topologies.
method Developed a fluid-limit framework for multi-class batched processing networks under K-FCFS scheduling.
result Proved that work-conserving scheduling algorithms maximize throughput for LLM inference.
New attack reveals memorization patterns in pre-trained LLMs.
problem Determining if a data point was part of a pre-trained LLM's training set.
method Adapts MIA statistical tests to LLM's perplexity dynamics of subsequences.
result Significantly outperforms prior approaches in membership inference attacks.
Benchmark assesses LLMs' causal inference skills, revealing significant limitations.
problem Lack of rigorous evaluation of LLMs' causal inference capabilities.
method CausalPitfalls benchmark with structured challenges and grading rubrics.
result Significant limitations in current LLMs' statistical causal inference.
This paper integrates LLMs into SCD to improve causal inference accuracy.
problem Challenges in acquiring domain expert knowledge for causal models.
method Statistical causal prompting (SCP) for LLMs and prior knowledge augmentation for SCD.
result LLM-KBCI and SCD augmented with LLM-KBCI approach ground truths more closely.
MACI improves LLM factuality inference with higher retention and lower time cost.
problem Ensuring factuality in LLM responses for high-stakes domains.
method Reformulated conformal inference in a multiplicative filtering setting, leveraging ensembles for more accurate factuality scores and group-conditional calibration.
result MACI achieves higher retention and lower time cost compared to baselines, preserving validity through group-conditional calibration.
VERA uses variational inference to jailbreak LLMs without manual optimization.
problem Lack of principled objective for gradient-based optimization in jailbreaking LLMs.
method VERA casts black-box jailbreak prompting as a variational inference problem, training a small attacker LLM to approximate the target LLM's posterior over adversarial prompts.
result VERA achieves strong performance across various target LLMs, demonstrating the value of probabilistic inference for adversarial prompt generation.
Unified framework to bridge human and LLM judgments.
problem Systematic discrepancies between human and LLM evaluations.
method Latent human preference score and linear transformations of covariates.
result Higher agreement with human ratings and exposure of systematic gaps.
BC-LLM uses LLMs to find concepts without predefined sets, improving interpretability and performance.
problem Finding a balance between interpretability and accuracy in concept extraction models.
method Bayesian approach with LLMs as both concept extractor and prior.
result BC-LLM outperforms interpretable and black-box models across various datasets.
LLMs encode latent topic distributions, suggesting Bayesian inference.
problem Capturing topic structure from large language models.
method Connecting LLM optimization to implicit Bayesian inference and de Finetti's theorem.
result LLMs recover latent topic distributions, matching LDA-generated topics.
Hybrid LLM generates synthetic data preserving causal parameters.
problem Synthetic data fails to accurately estimate causal effects.
method Combines model-based covariate synthesis with separately learned propensity and outcome models.
result Hybrid framework ensures causal structure in synthetic data.
Bayesian approach quantifies uncertainty in LLM-based systems.
problem Uncertainty quantification in LLM-based systems, especially for high-stakes applications.
method Interpreting prompts as parameters in a Bayesian model, using MHLP for inference.
result Improvements in predictive accuracy and uncertainty quantification on various benchmarks.
Diffusion LLMs can efficiently generate harmful prompts for adversarial testing.
problem Generating harmful prompts for adversarial testing is resource-intensive and costly.
method Transformed adversarial prompt optimization into an efficient inference task using pretrained Diffusion LLMs.
result Only a few conditional samples are required to generate harmful prompts with high reward.
TIM framework uses LLMs and domain experts to infer DeFi user transaction intents.
problem Challenges in understanding user intent in DeFi transactions due to complex interactions and opaque logs.
method TIM framework leverages a DeFi intent taxonomy, multi-agent LLM system, and a Meta-Level Planner.
result TIM significantly outperforms existing methods in inferring user transaction intents.
The paper optimizes LLM accuracy by stopping early based on consistent answers.
problem Improving LLM accuracy in math and reasoning problems.
method Bayesian stopping policy to save on sampling costs, tracking only the L-1 most frequent answer counts.
result The L=3 stopping policy is sufficient for asymptotic optimality and significantly reduces inference costs.
Framework controls uncertainty in LLMs without labels or probabilities.
problem Managing uncertainty in black-box LLMs without token-level probability or true labels.
method Integrates generative models, UCP, and conformal alignment to control uncertainty.
result Achieves close-to-nominal coverage and tighter thresholds than split UCP.
LLMs are compared to Markov chains for natural language processing.
problem Theoretical analysis of LLMs' generalization capabilities.
method Equivalence between LLMs and Markov chains, studying multi-step inference.
result Derives generalization bounds for LLMs, capturing their behavior in practice.
New analysis shows LLMs don't follow Bayesian inference in ICL.
problem Does in-context learning in LLMs follow Bayesian inference?
method Analyzes ICL through the martingale property, a requirement for Bayesian inference.
result Violations of the martingale property show LLMs don't follow Bayesian inference.
New method calibrates LLMs for safety-critical tasks with scalable Bayesian inference.
problem Overconfidence in LLMs after fine-tuning for specific tasks.
method Orthogonalized Low-Rank Adapters (PoLAR) with variational Bayesian inference.
result Scalable and well-calibrated uncertainty estimation for LLMs.
Best-of-∞ improves LLM performance by efficiently allocating inference-time computation.
problem Achieving optimal performance in test-time LLM ensembling with infinite budget.
method Adaptive generation scheme and weighted ensembles of LLMs, formulated as mixed-integer linear program.
result Optimal ensemble weighting improves performance over individual models.
Train a lightweight carry-on model on existing LLMs for faster customization.
problem Customizing large language models for specific tasks is computationally expensive.
method Train an additional branch of transformer blocks on the final-layer embedding of pretrained LLMs, then merge them with a carry-on module.
result Training a 100M carry-on layer requires less than 1GB GPU memory, making it scalable and affordable.
Paper proposes using online text data to predict CPI with LLMs.
problem Forecasting Consumer Price Index (CPI) using low-frequency survey-based data.
method Develops an LLM-based approach combining online text time series with monthly CPI data.
result Establishes the asymptotic properties and provides prediction intervals for CPI forecasts.
Improved unlearning in LLMs using contrastive decoding.
problem Removing specific information from LLMs while preserving overall performance.
method Inference-time unlearning algorithm using contrastive decoding with two auxiliary models.
result Notable gains in forget quality and retained performance compared to prior approaches.
Classifier detects LLM-generated text with guarantees.
problem Detecting fake LLM-generated text to prevent misuse.
method Trained classifier without auxiliary info, distinguishing human and LLM text.
result Achieves higher accuracy than existing detectors with type-I error control.
Novel approach trains LLMs for inductive reasoning using probabilistic programs.
problem Training LLMs for inductive reasoning with sparse, ambiguous data.
method Program-based Posterior Training (PPT) using probabilistic inference.
result Significant improvement in estimation accuracy and alignment with human judgments.
Paper uses LLMs for financial forecasting, overcoming sequence reasoning and multi-modal challenges.
problem Challenges in financial time series forecasting, especially cross-sequence reasoning and multi-modal signals.
method Combines LLMs with financial data and news, using zero-shot/few-shot inference and instruction-based fine-tuning.
result LLMs can offer explainable financial forecasts, leveraging cross-sequence reasoning and multi-modal information.
LIDS assesses LLM summaries with interpretable key words.
problem Challenges in evaluating the quality of LLM summaries.
method BERT-SVD-based direction metric and SOFARI for key word extraction.
result LIDS provides interpretable key words for layered themes.
Meta-Router optimizes LLM selection using gold-standard and preference-based data.
problem Training a high-quality LLM router with combined data sources is challenging due to bias and scarcity.
method Developed an integrative causal router training framework to correct bias and improve routing accuracy.
result Our approach delivers more accurate routing and improves the trade-off between cost and quality.
ReD improves LLM inference efficiency at fixed budget, reducing attempts and cost.
problem Improving LLM inference efficiency at a fixed budget.
method Reset-and-Discard (ReD) query method.
result ReD increases coverage@cost for a given budget, reducing attempts and cost.
Study evaluates how much knowledge LLMs have by comparing their prediction accuracy to flexible models.
problem Evaluating the predictive power of LLMs without access to their training data.
method Equivalent sample size measure, comparing LLM's prediction error to flexible models trained on varying amounts of domain-specific data.
result LLMs encode varying amounts of predictive information across different economic variables.
We show LLMs can be locally linear, enabling better control of activations.
problem Suboptimal control of LLM activations during generation.
method Model LLM inference as a linear dynamical system, compute feedback controllers using Jacobians, and adapt classical control theory.
result Robust, fine-grained control of LLM activations across models and tasks.
BED-LLM uses Bayesian experimental design to improve LLMs' information gathering.
problem Improving LLMs' ability to gather information adaptively.
method Iteratively choosing questions to maximize expected information gain using a probabilistic model.
result BED-LLM achieves substantial performance gains compared to other adaptive design strategies.
A new, low-cost method speeds up membership inference attacks on large language models.
problem Membership inference attacks on large language models.
method An ensemble of small quantile regression models to determine model training set membership.
result Comparable or improved accuracy with significantly reduced computational cost.
LLmFPCA-detect detects anomalies in sparse longitudinal text data using LLMs and mFPCA.
problem Challenges in detecting patterns and anomalies in sparse longitudinal textual data.
method Pairs LLM-based text embeddings with mFPCA to detect clusters and anomalies.
result LLmFPCA-detect outperforms state-of-the-art baselines on Amazon and Wikipedia datasets.
FAQ efficiently evaluates LLMs with statistical guarantees using adaptive query selection.
problem Efficiently evaluating many LLMs on a large suite of benchmarks is expensive.
method FAQ uses Bayesian factor models, adaptive sampling, and proactive active inference to select queries.
result FAQ delivers up to 5x effective sample size gains over baselines, matching CI width with fewer queries.
Study proposes a multi-agent framework to mitigate bias in sentiment analysis.
problem Bias in sentiment analysis models.
method Integrates multiple LLMs, incorporates dialogue sessions, and uses probabilistic prediction.
result KCS+IBC reduces entropy and increases variance, suggesting improved balance between aggregation and diversity.
ABC improves uncertainty quantification in LLMs for clinical diagnostics.
problem Overconfident and poorly calibrated estimates of LLMs in clinical domains.
method Approximate Bayesian Computation (ABC) for likelihood-free inference.
result Improves accuracy by up to 46.9%, reduces Brier scores by 74.4%, and enhances calibration.
Method tackles uncertainty in reward models for LLMs from heterogeneous human feedback.
problem Uncertainty in reward models for LLMs from heterogeneous human feedback.
method Heterogeneous preference framework and alternating gradient descent algorithm.
result Established theoretical guarantees for estimator convergence and asymptotic distribution.
MultiwayPAM clusters LLM-as-a-Judge scores to reveal evaluator bias.
problem Revealing bias in LLM evaluations of text quality.
method Tensor clustering with MultiwayPAM method.
result Medoids reveal cluster membership of questions, answerers, and evaluators.
New framework reduces LLM complexity by directly finetuning in Boolean domain.
problem Reducing the complexity of large language models (LLMs) while maintaining performance.
method Proposes a novel framework using multi-kernel Boolean parameters for direct finetuning in the Boolean domain.
result Significantly reduces complexity during both finetuning and inference, outperforming recent techniques.
New method ensures consistent inference across different tensor parallel sizes for large language models.
problem Non-deterministic inference in large language models due to inconsistent reduction orders across GPUs.
method Tree-Based Invariant Kernels (TBIK) that align intra- and inter-GPU reduction orders through a unified hierarchical binary tree structure.
result Bit-wise identical results across different tensor parallel sizes for RL training.
Framework identifies causal factors of climate change using correlations and machine learning.
problem Understanding socioeconomic factors influencing carbon emissions and climate change.
method Three-step framework: correlation analysis, causal discovery, LLM interpretations.
result Adaptable solutions for data-driven policy-making and strategic decision-making.
This paper compares self-reflection and budget tuning for LLMs, revealing domain-specific performance gains.
problem Improving inference-time performance of LLMs without retraining, balancing quality, cost, and latency.
method Systematic comparison of self-reflection and budget tuning across mathematical reasoning and translation tasks, evaluating various LLMs and model families.
result Substantial domain-dependent variation in self-reflection effectiveness, with up to 220% performance gains in mathematical reasoning.
This paper uses LLMs and cycle consistency for better machine translation evaluation.
problem Evaluating translation quality and LLM capabilities without ground truth.
method Generate translation candidates, back-translate, and evaluate cycle consistency.
result Larger LLMs or more inference passes improve cycle consistency.
Unified framework for certifying LLM reliability without extra supervision.
problem Improving reliability of large language models without additional supervision.
method Unified framework using majority voting and Martingale Majority Certificate (MMC).
result Certifiable inference in LLMs with statistical guarantees and adaptive stopping rules.
SIREN protocol corrects optimistic winner's scores in LLM evaluation.
problem Optimistic winner's scores in LLM evaluation due to adaptive benchmarking.
method SIREN protocol that freezes post-search shortlist, separates selection and evaluation, and uses bootstrap for uncertainty quantification.
result SIREN provides valid confidence intervals for procedure-performance curves and deployment conclusions.
Look-Ahead-Bench evaluates financial LLMs for lookahead bias, revealing significant differences in model performance.
problem Measuring and mitigating lookahead bias in financial LLMs.
method Standardized benchmark evaluating model behavior in practical financial scenarios, analyzing performance decay across market regimes.
result Standard LLMs exhibit significant lookahead bias, while Pitinf models show improved generalization and reasoning abilities.
SLIP secures LLMs on edge devices by splitting computation and protecting sensitive parts.
problem Protecting LLMs on edge devices from theft and unauthorized use.
method SLIP uses matrix decomposition to split model computation between secure and vulnerable resources, ensuring zero accuracy degradation and minimal latency.
result SLIP is the first practical, secure hybrid protocol for protecting LLMs on edge devices.