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

232464696928 · Jun 202019922001200920172026
48 results for neural tuning curves

Improved neural population modeling using shared features and ensemble detection.

problem Missing shared coding properties in neural latent variable models.
method Feature sharing across tuning curves and soft clustering of neurons.
result More interpretable and better-performing neural population models.

New model predicts neural network performance from early training epochs, incorporating architecture impact.

problem Predicting neural network performance from early training epochs, neglecting architecture impact.
method Architecture-aware graph ordinary differential equation model.
result Model outperforms state-of-the-art methods for MLP and CNN learning curves.

New metric captures individual neuron tuning across neural networks.

problem Need a metric that respects individual neuron tuning across different neural networks.
method Derived a 'soft' permutation-based metric using optimal transport theory.
result Metric avoids counter-intuitive outcomes and captures geometric insights.

Confidence bands for tuning curves improve hyperparameter comparison in NLP.

problem Ambiguity in comparing hyperparameter tuning methods.
method Constructs exact, simultaneous, and distribution-free confidence bands for tuning curves.
result Confidence bands provide a robust basis for comparing methods rigorously.

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.

HAMLET optimizes algorithm selection for machine learning tasks.

problem Limited time budgets and computational resources make traditional bandit approaches ineffective for automated algorithm selection.
method HAMLET incorporates learning curve extrapolation and time-awareness to select machine learning algorithms.
result HAMLET variants outperform other bandit-based strategies in experiments with recorded hyperparameter tuning traces.

LoRA-Curve connects independent LoRA optima through continuous low-loss valleys, improving Bayesian model averaging.

problem Challenges in estimating epistemic uncertainty in LoRA-based Bayesian inference.
method Introduces LoRA-Curve, a segmented Bézier curve parameterization in the LoRA space, with free and anchored configurations.
result Empirically shows that connecting independent LoRA optima through continuous low-loss valleys improves mutual information of the predictive distribution.

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.

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.

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.

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.

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.

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.

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 ↗

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.

Learning shrinks hard tail, improving inference performance.

problem Improving inference performance in neural networks.
method Latent Instance Difficulty (LID) model analyzing fine-tuning of neural networks.
result Training-dependent inference scaling, with βexteffβ_ ext{eff} growing with sample size before saturating.

Echo State Networks (ESNs) are recurrent neural networks that only train their output layer, thereby precluding the need to backpropagate gradients through time, which leads to significant computational gains. Nevertheless, a common issue in ESNs is determining its hyperparameters, which are crucial in instantiating a …

2019-03-12abs ↗pdf ↗

Proposes a learning rate method for shallow nets based on gradient Lipschitz constant.

problem Finding optimal learning rates for shallow neural networks.
method Associates learning rate with gradient Lipschitz constant and proposes a search algorithm.
result The proposed method significantly outperforms existing tuning methods.

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.

Automates fitting semiconductor device models using approximate Bayesian computation.

problem Manual tuning of parameters for fitting TFT models to experimental data is inefficient and prone to errors.
method Approximate Bayesian Computation (aBc) for generating posterior distributions of estimated parameters.
result The proposed method accurately predicts model parameters from mobility curves using gradient boosted trees.

New benchmark protocol evaluates neural network optimizers for efficiency and data shift sensitivity.

problem Benchmarking neural network optimizers with hyperparameter complexity and data shift sensitivity.
method Proposed a new evaluation protocol combining end-to-end and data-addition training efficiency, using bandit hyperparameter tuning and human study validation.
result No clear winner across all tasks, highlighting the complexity of optimizer performance.

Study of closed real plane curves with hyperelliptic genus three solutions.

problem Analyzing real plane curves with specific curvature equations.
method Examined real plane curves associated with the focusing gauged modified KdV equation of genus three.
result Showed closed real plane curves beyond Euler's figure-eight elastica.

Paper proves multiplicative weight updates can train neural networks without learning rate tuning.

problem Vanishing and exploding gradients in gradient descent for compositional functions.
method Proves descent lemma for compositional functions using multiplicative weight updates and derives Madam optimizer.
result Madam optimizer trains state-of-the-art neural networks without learning rate tuning.

Paper fine-tunes LLaMA-3-8B for financial NER using instruction and LoRA.

problem LLMs struggle with financial NER, especially differentiating entities and amounts.
method Instruction fine-tuning combined with LoRA for parameter-efficient learning.
result Micro-F1 score of 0.894 on financial NER tasks, outperforming other models.

Theoretical framework explains why few epochs are enough for LLM fine-tuning.

problem Understanding why few epochs are sufficient for LLM fine-tuning.
method Combining early stopping theory with attention-based Neural Tangent Kernel (NTK) for LLMs.
result Formalizes convergence rate of attention-based fine-tuning with respect to sample size.

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 networks achieve linear separability through progressive folding of data in higher dimensions.

problem How feed-forward networks achieve linear separability for classification tasks.
method Progressive folding of the data manifold in unoccupied higher dimensions.
result The folding operation allows efficient solutions by providing access to arbitrary regions in the distribution.

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.

In this paper, we consider the discrete deformation of the discrete space curves with constant torsion described by the discrete mKdV or the discrete sine-Gordon equations, and show that it is formulated as the torsion-preserving equidistant deformation on the osculating plane which satisfies the isoperimetric conditio…

2013-11-18abs ↗pdf ↗

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.

We formalize AURC and develop estimators for SC systems.

problem Evaluation of SC systems' performance.
method Formal statistical formulation, Monte Carlo methods, plug-in estimators.
result Plug-in estimators are consistent, with low bias and bounded MSE.

Improved hypernetwork for efficient neural network hyperparameter tuning.

problem Efficiently optimizing hyperparameters in neural networks.
method Proposed ΔΔ-STN architecture focusing on accurate best-response Jacobian approximation.
result Significantly improved hyperparameter tuning accuracy and stability.