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

9.8%19.5%29.3%39.1% · May 201919922001200920172026
48 results for neural network fine-tuning

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.

The paper develops a theory linking pretraining and fine-tuning in neural networks.

problem Understanding how initialization choices impact feature learning and generalization in neural networks.
method Analytical theory of diagonal linear networks, deriving generalization error as a function of initialization parameters and task statistics.
result Different initialization choices place networks into four fine-tuning regimes with varying abilities to support feature learning and generalization.

The paper introduces a Hessian-based method to improve generalization in fine-tuned deep neural networks.

problem Improving generalization in fine-tuned deep neural networks, especially in noisy conditions.
method PAC-Bayesian analysis to identify a Hessian-based distance measure, proving generalization bounds, and developing an algorithm with a generalization error guarantee.
result Hessian-based distance measure correlates well with observed generalization gaps and can match the scale of these gaps in practice.

Transfer learning boosts chemically accurate neural network potentials for organic molecules.

problem Developing accurate interatomic potentials from ab-initio data.
method Discriminative fine-tuning of pre-trained neural networks.
result Fine-tuning with energy labels alone can achieve accurate atomic forces.

A new method constrains deep networks during fine-tuning to improve generalization.

problem Improving generalization of fine-tuned deep networks.
method A neural network generalisation bound based on distance from initial weights constrains the hypothesis class to a small sphere.
result Empirical evaluation shows superior generalization performance compared to existing methods.

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.

Self-supervised fine-tuning corrects SR CNNs for unseen models and artifacts.

problem SR CNNs' lack of robustness to unseen image formation models and generation of artifacts.
method Iterative fine-tuning using a data fidelity loss at test time.
result Successfully corrects SR solutions for unseen models and GAN artifacts.

Alternative neural network training using monotone variational inequality.

problem Training neural networks efficiently and with guarantees.
method Using monotone variational inequality to solve non-convex problems efficiently.
result Our approach leads to fast convergence and competitive performance compared to traditional methods.

SMART-FAN-Lasso fine-tunes neural networks for high-dimensional nonparametric regression.

problem Fine-tuning neural networks for high-dimensional nonparametric regression with variable selection.
method Source-model-augmented residual tuning (SMART) framework for neural Lasso.
result SMART-FAN-Lasso achieves statistical acceleration over single-task learning under precise conditions.

Fine-tuning normalization layers can reconstruct smaller networks.

problem Understanding the expressive power of fine-tuning normalization layers.
method Random ReLU networks and sparsified networks were fine-tuned to reconstruct target networks.
result Fine-tuning normalization layers can reconstruct networks that are O(extwidth)O(\sqrt{ ext{width}}) times smaller.

Feature representations from pre-trained deep neural networks have been known to exhibit excellent generalization and utility across a variety of related tasks. Fine-tuning is by far the simplest and most widely used approach that seeks to exploit and adapt these feature representations to novel tasks with limited data…

2017-10-06abs ↗pdf ↗

Transfer learning, which allows a source task to affect the inductive bias of the target task, is widely used in computer vision. The typical way of conducting transfer learning with deep neural networks is to fine-tune a model pre-trained on the source task using data from the target task. In this paper, we propose an…

2018-11-21abs ↗pdf ↗

The paper proposes DEA to make graph neural networks fairer in link prediction.

problem Graph neural networks can unfairly prioritize certain social groups in link prediction.
method Drop Edges and Adapt (DEA) fine-tuning strategy with covariance constraints.
result DEA improves fairness and accuracy in link prediction tasks.

POET enables large neural network training on tiny devices with reduced energy.

problem Training large neural networks on memory-limited edge devices.
method Jointly optimizes rematerialization and paging for memory reduction, formulating an MILP for energy-efficient training.
result POET trains ResNet-18 and BERT within Cortex-M memory constraints, outperforming current methods in energy efficiency.

Improved drug-protein interaction prediction using FTL method.

problem Predicting drug-protein interactions from noisy data with uncertain labels.
method Filtered Transfer Learning (FTL) method that fine-tunes a deep neural network across multiple tiers of data confidence.
result FTL method outperforms deep neural networks trained on single confidence ranges.

Linearized neural networks provide a fast and interpretable way to adapt models to new settings.

problem Difficulty in understanding and adapting inductive biases of trained neural networks.
method Linearization of neural networks and embedding these biases into Gaussian processes through a kernel designed from the Jacobian.
result Domain adaptation becomes interpretable posterior inference with analytic and scalable computational speed-ups.

New method adapts neural networks without losing prior knowledge.

problem Understanding and enabling flexible adaptation of neural networks.
method Differential geometry framework, functionally invariant paths (FIP).
result Achieves comparable state-of-the-art performance on continual learning and sparsification tasks.

New theory predicts deep neural networks can operate in an extended critical regime without fine-tuning.

problem Understanding the dynamics and computational principles of deep neural networks.
method Combining theories of heavy-tailed random matrices and non-equilibrium statistical physics.
result Deep neural networks can operate in an extended critical regime without fine-tuning parameters.

The condition number predicts efficient information encoding in neural units, aiding model fine-tuning.

problem Efficient information encoding in neural units for various tasks and input modalities.
method Linking the condition number to the log-volume scaling factor and entropy of the output distribution.
result High condition number indicates efficient encoding, reducing overall information transfer.

Optimizes pruning masks for neural networks using probabilistic fine-tuning and PAC-Bayes bounds.

problem Improving neural network performance through adaptive pruning of weights.
method Optimizes stochastic pruning masks by minimizing expected loss, considering data-adaptive regularization and feature alignment.
result Probabilistic fine-tuning leads to improved test error over baseline methods in neural networks.

In this paper, we present a novel approach for fine-tuning a decoder-side neural network in the context of image compression, such that the weight-updates are better compressible. At encoder side, we fine-tune a pre-trained artifact removal network on target data by using a compression objective applied on the weight-u…

2019-05-10abs ↗pdf ↗

Paper proposes neural networks for automatically naming assembly functions.

problem Automatically assigning names to assembly code functions.
method Formal definition of problem, baseline models (Seq2Seq, Transformer), fine-tuning neural networks.
result Neural networks can effectively predict function names in binaries, even outperforming state-of-the-art.

BayesAdapter turns pre-trained NNs into reliable BNNs with minimal overhead.

problem Scalability, accessibility, and reliability of Bayesian neural networks.
method Bayesian fine-tuning of pre-trained deterministic NNs to variational BNNs.
result BayesAdapter produces more reliable posteriors with less training overhead.

Fine-tunes GNNs by preserving generative patterns to improve transferability.

problem Vanilla fine-tuning fails due to structural divergence between pre-training and downstream graphs.
method G-Tuning, which reconstructs the generative patterns of the downstream graph using graphon bases.
result G-Tuning achieves an average improvement of 0.5% and 2.6% on in-domain and out-of-domain transfer learning experiments.

Deep neural networks have achieved impressive performance in many applications but their large number of parameters lead to significant computational and storage overheads. Several recent works attempt to mitigate these overheads by designing compact networks using pruning of connections. However, we observe that most …

2019-06-14abs ↗pdf ↗

Transformers fine-tuned on synthetic data boost tabular data classification performance.

problem Improving tabular data classification accuracy.
method Fine-tuning ICL-transformers on synthetic datasets with complex decision boundaries.
result Fine-tuned ICL-transformers outperform regular neural networks on real-world datasets.

New method removes specific training data influence from neural networks.

problem Removing specific training data influence from neural networks for privacy and regulatory reasons.
method Noisy fine-tuning on retain data to ensure provable unlearning guarantees without restrictive assumptions.
result Achieves formal unlearning guarantees and performs effectively in practice.

Unsupervised pre-training improves model generalization, but lacks theoretical understanding.

problem Lack of theoretical understanding of unsupervised pre-training's impact on model generalization.
method Introduces a novel theoretical framework to analyze and enhance generalization.
result Enhances understanding of unsupervised pre-training and fine-tuning, proposing a new regularization method.

The low-rank tensor approximation is very promising for the compression of deep neural networks. We propose a new simple and efficient iterative approach, which alternates low-rank factorization with a smart rank selection and fine-tuning. We demonstrate the efficiency of our method comparing to non-iterative ones. Our…

2019-03-24abs ↗pdf ↗

A new method for efficient neural network fine-tuning using queryable low-rank update atoms.

problem Rigidity of static low-rank adaptation methods when input and depth-wise computation vary.
method A shared queryable memory of low-rank update atoms, allowing dynamic and context-sensitive adaptation.
result Improves final test performance and training stability compared to standard low-rank adaptation.

New method improves reliability of depth estimation models.

problem Uncertainty quantification in large-scale vision models.
method Parameter-efficient Bayesian neural networks with PEFT methods.
result Combining PEFT methods with Bayesian inference enhances predictive performance.