Improved code translation by preserving structure with composed fine-tuning.
problem Improving code translation accuracy with unlabeled code outputs.
method Pre-trained denoiser to capture output structure, composed fine-tuning to fine-tune predictor.
result Composed fine-tuning significantly improves generalization over standard fine-tuning.
ECN framework improves training on noisy structured labels.
problem Structured errors in fine-grained annotations lead to biased models.
method Error-Correcting Networks (ECN) framework.
result ECN improves fine-grained annotation prediction.
Stable cylinders found in hyperbolic groups and curve graphs.
problem Torsionfree hyperbolic groups and curve graphs of surfaces have globally stable cylinders.
method Generalised Sageev's construction to improve fine properties of hyperbolic spaces.
result Proved curve graphs of surfaces admit equivariant quasi-isometric embeddings in finite products of quasitrees.
Two retraining techniques outperform fine-tuning in neural network pruning.
problem Improving accuracy and compression in neural network pruning.
method Weight rewinding and learning rate rewinding compared to fine-tuning.
result Rewinding techniques outperform fine-tuning in accuracy and compression.
Considering event structure information has proven helpful in text-based stock movement prediction. However, existing works mainly adopt the coarse-grained events, which loses the specific semantic information of diverse event types. In this work, we propose to incorporate the fine-grained events in stock movement pred…
New method fine-tunes discrete diffusion models for RLHF tasks.
problem Fine-tuning discrete diffusion models with policy gradient methods is challenging.
method Proposed SEPO algorithm for efficient fine-tuning over non-differentiable rewards.
result Numerical experiments show scalability and efficiency of SEPO.
Many practical techniques for probabilistic inference require a sequence of distributions that interpolate between a tractable distribution and an intractable distribution of interest. Usually, the sequences used are simple, e.g., based on geometric averages between distributions. When models are expressed as probabili…
Fine-grained gap-dependent regret bounds for reinforcement learning.
problem Achieving optimal regret bounds for reinforcement learning with suboptimality gaps.
method Developed novel analytical frameworks and refined algorithms for UCB-based and non-UCB-based reinforcement learning.
result Established the first fine-grained gap-dependent regret bounds for both UCB-based and non-UCB-based algorithms.
Residual Prior Diffusion integrates coarse latent priors with diffusion models for better generative tasks.
problem Diffusion models struggle with representing both large-scale and fine-scale details in data distributions.
method Two-stage framework: first a coarse prior model captures large-scale structure, then a diffusion model represents the residual.
result RPD accurately captures fine-scale details while preserving large-scale structure, outperforming standard diffusion models.
Fine-grained pretraining improves neural network's ability to learn rare features.
problem Improving generalization in deep learning models.
method Introducing a hierarchical multi-view structure to confine input data distribution.
result Fine-grained pretraining leads to better accuracy on hard downstream test samples.
Paper proposes CLAIR for efficient LLM fine-tuning across clients.
problem Fine-tuning large language models (LLMs) efficiently and collaboratively.
method Federated LoRA fine-tuning with Collaborative Low-rank Alignment and Identifiable Recovery (CLAIR).
result CLAIR achieves better performance and contamination detection compared to local fine-tuning.
Fine-tuning improves meta-learning by leveraging shared representations.
problem Meta-learning's challenge in rapidly learning new tasks.
method Theoretical framework and risk bounds on gradient descent fine-tuning.
result Fine-tuning-based methods can provably leverage shared structure.
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 ubiquitous deployment of monitoring devices in urban flow monitoring systems induces a significant cost for maintenance and operation. A technique is required to reduce the number of deployed devices, while preventing the degeneration of data accuracy and granularity. In this paper, we present an approach for infer…
SIMPGEN improves SWOT SSH data interpretation by removing noise and preserving fine-scale features.
problem Noisy data and limited fine-scale observations in oceanic processes.
method Simulation-Informed Metric and Prior for Generative Ensemble Networks (SIMPGEN) combining real SWOT observations with simulated reference data.
result SIMPGEN effectively removes noise, preserving fine-scale features better than existing neural methods.
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.
Research reveals deep networks often learn low-rank structures, leading to more efficient training and fine-tuning.
problem Efficient training and deployment of large-scale deep learning models.
method Complementary theoretical perspectives on low-rank structures during training and convergence, and practical applications of LoRA and masked training.
result Understanding and exploiting low-rank structures can improve efficiency and effectiveness of training and fine-tuning.
Study on singularities in area-minimizing currents, proving unique tangent cones and rectifiability.
problem Understanding singularities in area-minimizing currents.
method Fine excess decay theorems and almost monotonicity of a frequency function.
result Unique tangent cones and countably (m−2)-rectifiable singular set. New method approximates controllability of large networks from coarse summaries.
problem Controlling large-scale linear dynamical systems with incomplete network information.
method Algorithm using stochastic block model to estimate controllability from coarse summaries.
result Average controllability of fine-scale system can be well approximated by coarse-scale system.
The complex, time-dependent statistical structures observed in the Dow Jones Industrial Average on a typical trading day are modeled with Lorentzian functions. The resonant-like structures are characterized by the values of the basic ratio: the average lifetime of the individual states associated with a given structura…
A flow from hypersymplectic to hyperkähler structures is described.
problem Flowing from hypersymplectic to hyperkähler structures on 4-manifolds.
method Positive triples, G2-Laplacian coflow, hypersymplectic flow. result The G2-Laplacian coflow descends to the hypersymplectic flow. A new method optimizes diffusion models for fine-tuning tasks efficiently.
problem Optimizing diffusion models for downstream tasks using nested bilevel structures.
method Formalizes the challenge as a generative bilevel optimization problem and introduces a first-order bilevel framework.
result Our method outperforms existing fine-tuning and hyperparameter search baselines.
Bayesian Power Steering fine-tunes large diffusion models for domain adaptation.
problem Fine-tuning pre-trained diffusion models for tasks in a smaller probability space.
method Bayesian framework with a novel network structure (Bayesian Power Steering).
result Bayesian Power Steering achieves an FID score of 10.49 on the COCO17 dataset.
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 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.
LOFT separates subspace rotation and transformation for orthogonal fine-tuning.
problem Conflating subspace rotation and transformation in orthogonal fine-tuning.
method LOFT explicitly separates subspace rotation and transformation, using task-aware support selection.
result LOFT recovers principal-subspace orthogonal adaptation and improves efficiency-performance trade-off.
New findings on representation changes in transfer learning.
problem Understanding representation changes in transfer learning.
method Analysis of pre-trained and fine-tuned representations in transfer learning.
result Representation changes mainly occur in the head, but early layers are also important for cross-domain adaptation.
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.
The paper uses RL to verify hypotheses, overcoming existing limitations.
problem Verifying hypotheses using reinforcement learning.
method Formulated hypothesis verification as an RL problem, exploiting hypothesis structure.
result RL agents can successfully verify hypotheses, even those not factorizable.
This paper proposes a hierarchical, fine-grained and interpretable latent variable model for prosody based on the Tacotron 2 text-to-speech model. It achieves multi-resolution modeling of prosody by conditioning finer level representations on coarser level ones. Additionally, it imposes hierarchical conditioning across…
New measure FTC quantifies how much a ReLU network can fine-tune.
problem Analyzing memorization capacity in fine-tuned neural networks.
method Defined Fine-Tuning Capacity (FTC) for additive fine-tuning of ReLU networks.
result Upper and lower bounds on FTC for 2 and 3-layer ReLU networks.
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.
Company2Vec creates embeddings from company websites for fine-grained business analytics.
problem Lack of fine-grained company labels for analytics.
method Word2Vec and dimensionality reduction on company website data.
result Semantic company embeddings for various applications.
The paper describes a fine representation of the Ricci tensor and Hessian on RCD spaces.
problem Understanding the structure of the Ricci tensor and Hessians on RCD spaces.
method Polar decomposition of the Ricci tensor and Hessians, providing regularity results.
result The Ricci tensor and Hessians on RCD spaces can be represented by a polar decomposition, revealing their regularity.
A multilevel optimization method for constrained problems.
problem Regularized constrained linear inverse problems with box constraints.
method Geometric multilevel optimization with varying discretization levels.
result Preserves feasibility of updates while speeding up computations.
Improves drug properties using a novel LLM and reinforcement learning.
problem Optimizing drug properties while retaining chemical stability.
method Structured Policy Optimization (SPO) for fine-tuning a large language model.
result Enhanced drug properties across multiple target objectives.
In this work, we focus on fine-tuning an OpenAI GPT-2 pre-trained model for generating patent claims. GPT-2 has demonstrated impressive efficacy of pre-trained language models on various tasks, particularly coherent text generation. Patent claim language itself has rarely been explored in the past and poses a unique ch…
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.
Understanding the power of depth in feed-forward neural networks is an ongoing challenge in the field of deep learning theory. While current works account for the importance of depth for the expressive power of neural-networks, it remains an open question whether these benefits are exploited during a gradient-based opt…
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.
Fine-tuning from pre-trained ImageNet models has become the de-facto standard for various computer vision tasks. Current practices for fine-tuning typically involve selecting an ad-hoc choice of hyperparameters and keeping them fixed to values normally used for training from scratch. This paper re-examines several comm…
The R-function theory of Thomas is used to model neutron inelastic scattering and the fine, intermediate, and gross structure observed in the Dow Jones Industrial Average on a typical trading day.
TensorGuide improves LoRA efficiency and expressivity through joint tensor-train optimization.
problem Limited expressivity and generalization of standard LoRA.
method TensorGuide uses a unified tensor-train structure with controlled Gaussian noise to generate correlated low-rank matrices.
result TensorGuide achieves superior accuracy and scalability with fewer parameters compared to standard LoRA and TT-LoRA.
New findings on hyperbolicity of fine curve graphs and their subgraphs.
problem Investigating hyperbolicity of fine curve graphs and their subgraphs.
method Analyzing large subgraphs of fine curve graphs and computing distances in specific cases.
result Large subgraphs of fine curve graphs contain flats of every finite dimension, indicating they are not hyperbolic.
Behavior Transfer improves reinforcement learning by leveraging pre-trained policies.
problem Efficient transfer of knowledge in reinforcement learning.
method Behavior Transfer (BT) that uses pre-trained policies for exploration.
result BT combined with pre-training leads to better solutions than without pre-training.
We introduce a hierarchical architecture for video understanding that exploits the structure of real world actions by capturing targets at different levels of granularity. We design the model such that it first learns simpler coarse-grained tasks, and then moves on to learn more fine-grained targets. The model is train…
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.
Homotopy types of curve and arc complexes are studied.
problem Understanding the homotopy types of curve and arc complexes.
method Proving homotopy equivalence and contractibility of complexes.
result Fine curve complex is homotopy equivalent to curve complex, fine arc complex is contractible.