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

Trend · papers per month

81161242322 · Jun 202019922001200920172026
48 results for supervised fine tuning

Big models pretrain and fine-tune for semi-supervised learning on ImageNet.

problem Learning from few labeled examples with a large amount of unlabeled data.
method Unsupervised pretraining of a big ResNet model followed by supervised fine-tuning and distillation.
result 73.9% ImageNet top-1 accuracy with just 1% of labels (\le13 labeled images per class).

Two methods for model adaptation compared; fine-tuning outperforms Best-of-N in realizable settings.

problem Comparing methods for adapting large language models to new tasks.
method Supervised fine-tuning vs. Best-of-N approach.
result Supervised fine-tuning outperforms Best-of-N in realizable settings.

FisherSFT selects informative examples to fine-tune LLMs efficiently.

problem Adapting large language models to new domains efficiently.
method Selects examples maximizing information gain using Hessian of log-likelihood.
result Empirically demonstrates improved performance with reduced computational cost.

Framework fine-tunes foundation models with semi-supervised learning for downstream tasks and latent spaces.

problem Training foundation models with limited labelled data.
method Mutual information decomposition for downstream and latent spaces, semi-supervised fine-tuning.
result Significant improvements in classification tasks under low-labelled conditions.

Paper fine-tunes LLMs using user edits, unifying preference, supervision, and reward feedback.

problem Adapting LLMs to user preferences and feedback types.
method Derives bounds for learning algorithms from user edits, proposes an ensembling procedure.
result Ensembling procedure outperforms individual feedback methods and robustly adapts to different user-edit distributions.

Fine-tuning large language models requires minimal data, making them efficient.

problem Achieving state-of-the-art performance with large language models.
method Using BERT as an example, fine-tuning only the most critical layers of the pre-trained model.
result Fine-tuned models are close in parameter space to the pre-trained model, with many good solutions found in sparsified versions.

Paper fine-tunes a simulation-driven estimator to reduce out-of-distribution errors.

problem Out-of-distribution errors in simulation-driven parameter estimators.
method Fine-tuning a Two-Stage estimator to improve accuracy for true parameters outside the sampled range.
result The fine-tuning approach reduces out-of-distribution errors and improves accuracy.

SelMix fine-tunes pre-trained models to optimize non-decomposable objectives.

problem Optimizing non-decomposable performance measures for practical applications.
method Selective mixup fine-tuning of pre-trained models.
result SelMix significantly improves performance for various non-decomposable objectives.

This paper simplifies fine-tuning for small LLMs, reducing barriers for developers.

problem Limited resources for fine-tuning large language models (LLMs) by individual developers and small organizations.
method Instruction-tuning datasets, small-sized LLMs (3B to 7B parameters), various training configurations and strategies.
result Improved model performance on benchmarks with specific training configurations, and insights into early termination and hyperparameter simplifications.

Interactive machine learning with weak supervision and pre-trained embeddings.

problem Training machine learning models with limited labeled data.
method Use pre-trained embeddings to define a distance function and extend source votes to nearby points.
result Significantly outperforms traditional weakly-supervised and fully-supervised methods.

Deep Convolutional features extracted from a comprehensive labeled dataset, contain substantial representations which could be effectively used in a new domain. Despite the fact that generic features achieved good results in many visual tasks, fine-tuning is required for pretrained deep CNN models to be more effective …

2018-05-02abs ↗pdf ↗

GRASP removes spurious correlations in fine-tuned models, improving task performance and reducing bias.

problem Fine-tuned models can latch onto spurious correlations, leading to bias and reduced generalization.
method GRASP identifies and removes spurious correlations from model weights without removing latent factors.
result GRASP significantly reduces bias and improves task performance in various fine-tuning tasks.

New method uses limited labeled data and multiple starts to adapt models across domains.

problem Accurate predictions in target domain with few labeled data.
method Fine-tuning from multiple adaptive starts, extending UDA methods.
result Minimax-optimal target performance with limited labeled target data.

Paper presents a method for efficient robot adaptation using fine-tuning.

problem Continuous adaptation of robot learning systems in real-world scenarios.
method Fine-tuning previously learned policies using off-policy reinforcement learning.
result Fine-tuning leads to substantial performance gains and adaptation to new conditions.

New framework improves LLM performance by avoiding forgetting during sequential training stages.

problem Forgetting during sequential training stages of LLMs.
method Proposes a joint post-training framework with theoretical convergence guarantees.
result Empirically outperforms sequential post-training framework by up to 23%.

Generative Adapter adapts LMs with a single forward pass, reducing inference overhead.

problem Efficient adaptation of large language models for new contexts.
method Generative Adapter directly maps new contexts to low-rank LM adapters via self-supervised learning.
result Significant reduction in inference overhead with no need for fine-tuning.

Transformers learn sparse Boolean functions through RL and SFT, revealing distinct learning behaviors.

problem Learning sparse Boolean functions with Transformers.
method Reinforcement Learning (RL) with process rewards and Supervised Fine-Tuning (SFT).
result RL learns the whole CoT chain simultaneously, while SFT learns step by step.

New approach uses inverse reinforcement learning to improve language model training.

problem Training large language models using imitation learning methods.
method Developed a new method of inverse reinforcement learning to optimize sequences directly.
result IRL-based fine-tuning leads to better performance and diversity in language generation.

Fine-tuning LLMs with observational data can lead to spurious correlations, but DeconfoundLM can mitigate this.

problem Aligning LLMs with human preferences and business objectives using observational data.
method DeconfoundLM, a method that removes confounders from reward signals.
result DeconfoundLM improves recovery of causal relationships and mitigates spurious correlations.

This paper tackles few-shot classification by improving GAN-based data augmentation.

problem Improving few-shot classification performance using GANs with limited data.
method Fine-tuning GANs for few-shot classification, addressing training and evaluation challenges.
result Semi-supervised fine-tuning is a more effective approach for few-shot classification with limited data.

We propose a new image denoising algorithm, dubbed as Fully Convolutional Adaptive Image DEnoiser (FC-AIDE), that can learn from an offline supervised training set with a fully convolutional neural network as well as adaptively fine-tune the supervised model for each given noisy image. We significantly extend the frame…

2018-07-19abs ↗pdf ↗

New framework analyzes LLM personalization trade-offs under congestion.

problem Tension between personalization and resource sharing in LLMs.
method Developed a statistical-economic framework to model user incentives.
result Congestion can flip rankings of SFT and ICL, and offers both methods never hurt profits.

This paper improves anomaly detection in lane rendering images for safer navigation.

problem Anomalies in lane rendering images can mislead drivers, posing safety risks.
method Proposes a four-phase pipeline using Transformer models, self-supervised pre-training, and fine-tuning.
result The pipeline enhances detection accuracy and reduces training time.

LoRA fine-tuning explained with gradient dynamics for low-rank perturbations.

problem Understanding why gradient descent converges to useful low-rank perturbations in LoRA fine-tuning.
method Generalized student-teacher setting with i.i.d. samples and online gradient descent.
result Gradient descent converges to the teacher model in dkO(1)dk^{O(1)} iterations under certain conditions.

New method quantifies uncertainty in fine-tuned LLMs using LoRA ensembles.

problem Uncertainty in fine-tuned LLMs and how to trust their predictions.
method Posterior approximations using low-rank adaptation ensembles.
result Unexpected retention of acquired knowledge during fine-tuning in overfitting regime.

BERT fine-tuning is unstable due to optimization issues, not forgetting or dataset size.

problem Stability of fine-tuning BERT-based models across different random seeds.
method Analysis of BERT, RoBERTa, and ALBERT fine-tuned on GLUE datasets, identifying optimization difficulties as the cause of instability.
result Fine-tuning instability is due to optimization difficulties leading to vanishing gradients, not forgetting or dataset size.

New mechanism protects neural network weights from privacy attacks during self-supervised learning.

problem Privacy risks during fine-tuning stage of self-supervised learning.
method Proposes a novel differential privacy mechanism using additive logistic noise.
result Reduces membership inference attack accuracy to 50% while maintaining below 5% performance loss.

New method reduces fine-tuning cost for reused models.

problem Repeating fine-tuning costs with outdated foundation models.
method Portable Reward Tuning (PRT) trains a reward model to maximize the same loss function as fine-tuning.
result PRT achieves comparable accuracy to inference-time tuning with less inference cost.

Study shows how a strong model can learn a task's feature while retaining other capabilities.

problem How to align superhuman AI systems using weak-to-strong generalization.
method Two-layer neural networks, reward-model learning, multi-step SGD, feature learning.
result The strong model efficiently learns task features while retaining general capabilities.