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

Trend · papers per month

116233349465 · Jun 202019922001200920172026
48 results for tuning techniques

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.

Fine-tuning neural networks to guarantee performance on specific examples can also introduce incorrect inputs.

problem Ensuring reliable performance of neural networks on specific examples.
method Using SMT solvers to fine-tune ReLU neural networks to guarantee outcomes on a finite set of particular examples.
result Fine-tuning can introduce incorrect inputs that trigger unexpected performance.

Broad adoption of machine learning techniques has increased privacy concerns for models trained on sensitive data such as medical records. Existing techniques for training differentially private (DP) models give rigorous privacy guarantees, but applying these techniques to neural networks can severely degrade model per…

2019-10-02abs ↗pdf ↗

In this short paper we investigate whether meta-learning techniques can be used to more effectively tune the hyperparameters of machine learning models using successive halving (SH). We propose a novel variant of the SH algorithm (MeSH), that uses meta-regressors to determine which candidate configurations should be el…

2019-09-16abs ↗pdf ↗

Study shows effectiveness of offline RL in online RL tasks.

problem Improving online RL efficiency using offline RL data.
method Formalized framework for incorporating offline RL as online RL subroutines, introducing techniques to enhance effectiveness.
result Effectiveness of the framework depends on task nature, techniques greatly enhance effectiveness, and existing methods are ineffective.

Mango automates hyperparameter tuning for large-scale ML training.

problem Manual hyperparameter tuning is tedious and inefficient for large-scale machine learning.
method Parallel hyperparameter tuning with intelligent search strategies and flexible abstractions.
result Mango achieves comparable performance to Hyperopt while supporting distributed computing.

We introduce a technique that can automatically tune the parameters of a rule-based computer vision system comprised of thresholds, combinational logic, and time constants. This lets us retain the flexibility and perspicacity of a conventionally structured system while allowing us to perform approximate gradient descen…

2018-08-01abs ↗pdf ↗

Penalized (or regularized) regression, as represented by Lasso and its variants, has become a standard technique for analyzing high-dimensional data when the number of variables substantially exceeds the sample size. The performance of penalized regression relies crucially on the choice of the tuning parameter, which d…

2019-08-10abs ↗pdf ↗

XGBoost is a scalable ensemble technique based on gradient boosting that has demonstrated to be a reliable and efficient machine learning challenge solver. This work proposes a practical analysis of how this novel technique works in terms of training speed, generalization performance and parameter setup. In addition, a…

2019-11-05abs ↗pdf ↗

A new robust prefix-tuning framework improves model robustness against adversarial attacks.

problem Lack of robustness in prefix-tuning for adversarial attacks.
method Leveraging layerwise activations of pretrained models for additional prefix finetuning during the test phase.
result Framework substantially improves robustness over strong baselines while maintaining comparable accuracy on clean texts.

SymNoise improves language model fine-tuning by 6.7% over NEFTune, using symmetric noise.

problem Improving performance of language models through noise-based fine-tuning.
method Introducing SymNoise, a new fine-tuning method using symmetric noise in embeddings.
result SymNoise increases model performance by 69.04% on AlpacaEval compared to NEFTune's 64.69%.

When applying Machine Learning techniques to problems, one must select model parameters to ensure that the system converges but also does not become stuck at the objective function's local minimum. Tuning these parameters becomes a non-trivial task for large models and it is not always apparent if the user has found th…

2017-09-22abs ↗pdf ↗

Simple attack bypasses state-of-the-art DNN watermarking.

problem Protecting DNN models from watermark removal attacks.
method Combining imperceptible pattern embedding and spatial-level transformations for a simple yet effective watermark removal.
result Our attack bypasses state-of-the-art watermarking solutions with high success rates.

Model-agnostic meta-learning (MAML) is a meta-learning technique to train a model on a multitude of learning tasks in a way that primes the model for few-shot learning of new tasks. The MAML algorithm performs well on few-shot learning problems in classification, regression, and fine-tuning of policy gradients in reinf…

2019-05-17abs ↗pdf ↗

New methods reduce private federated learning communication automatically.

problem Reducing communication in private federated learning.
method Automatic compression rate adjustment based on training error, using secure aggregation and differential privacy.
result Provable instance-optimal for mean estimation, achieving favorable compression rates.

LORENZA improves LLM fine-tuning efficiency and generalization.

problem Improving robustness and generalization of LLMs under hardware constraints.
method AdaZo-SAM and LORENZA, combining Adam and SAM with zeroth-order estimation and randomized SVD.
result LORENZA achieves better generalization and reduced memory consumption compared to existing methods.

Transformers learn functionals from distributions without losing information.

problem Lack of rigorous mathematical theory supporting Transformer performance.
method Proposed a Transformer learning framework, attention operator, and distribution regression.
result Transformers can compress distributions into function representations without loss of information.

UBM transfers bias mitigation from upstream to downstream tasks efficiently.

problem Bias in fine-tuned language models across various tasks.
method Apply bias mitigation to an upstream model, then fine-tune a downstream model on this mitigated model.
result UBM effects transfer to new downstream tasks, creating less biased models.

Optimizes sparse fine-tuning for privacy in neural networks.

problem Performance gap between DP-SGD and non-private fine-tuning.
method Optimization-based approach using private gradient information for selecting trainable weights.
result Our selection method leads to better prediction accuracy compared to existing approaches.

Proposes a gradient-based bilevel optimization method for efficient hyperparameter tuning.

problem Efficiently tuning hyperparameters in machine learning models.
method Gradient-based bilevel optimization approach.
result The proposed method is multiple times faster than existing techniques.

Inductive transfer learning has greatly impacted computer vision, but existing approaches in NLP still require task-specific modifications and training from scratch. We propose Universal Language Model Fine-tuning (ULMFiT), an effective transfer learning method that can be applied to any task in NLP, and introduce tech…

2018-01-18abs ↗pdf ↗

We solve ElasticNet regularization tuning across multiple instances with provable guarantees.

problem Tuning ElasticNet regularization coefficients across multiple problem instances.
method Characterized ElasticNet loss as a piecewise-rational function, derived structural complexity bounds, and showed generalization and online learning guarantees.
result First general learning-theoretic guarantees for ElasticNet tuning without strong data distribution assumptions.

A new policy switching technique improves offline RL performance.

problem Challenges in adapting off-policy algorithms to different datasets and tasks.
method Combines off-policy RL and BC, using epistemic uncertainty for policy switching.
result Outperforms individual algorithms and state-of-the-art methods on benchmarks.

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.

Generative adversarial networks (GANs) have shown outstanding performance on a wide range of problems in computer vision, graphics, and machine learning, but often require numerous training data and heavy computational resources. To tackle this issue, several methods introduce a transfer learning technique in GAN train…

2020-02-25abs ↗pdf ↗

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.

New algorithms learn latent variable models without tuning, outperforming existing methods.

problem Learning latent variable models without manual tuning.
method Two particle-based algorithms using free energy minimization and coin betting.
result Learning algorithms are entirely tuning-free and competitive with existing methods.

We introduce the State Classification Problem (SCP) for hybrid systems, and present Neural State Classification (NSC) as an efficient solution technique. SCP generalizes the model checking problem as it entails classifying each state ss of a hybrid automaton as either positive or negative, depending on whether or not …

2018-07-26abs ↗pdf ↗

2D Total Variation Denoising (TVD) is a widely used technique for image denoising. It is also an important nonparametric regression method for estimating functions with heterogenous smoothness. Recent results have shown the TVD estimator to be nearly minimax rate optimal for the class of functions with bounded variatio…

2019-02-04abs ↗pdf ↗