paper-with-me

Papers

When Losses Align: Gradient-Based Composite Loss Weighting for Efficient Pretraining

2026-05-08 · Ivan Karpukhin, Andrey Savchenko arxiv

Modern deep models are often pretrained on large-scale data with missing labels using composite objectives, where the relative weights of multiple loss terms act as hyperparameters. Tuning these weights with random search or Bayesian optimization is computationally expensive, as it requires many independent training runs. To address this, we propose a gradient-based bilevel method that learns pretraining loss weights online by aligning the composite pretraining gradient with a downstream objective. By exploiting the structure of the loss, the method avoids the multiple backward passes typically required by truncated backpropagation through the full model, reducing the overhead of hyperparameter tuning to approximately 30% above a single training run. We evaluate the approach on event-sequence modeling and self-supervised computer vision, where it matches or improves upon carefully tuned baselines while substantially reducing the cost of hyperparameter tuning compared to random or Bayesian search.

📄 PDF Abstract BibTeX arXiv:2605.07756

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Composite Multiclass Losses

2011-12-01 · NeurIPS 2011 12 · Elodie Vernet, Mark D. Reid, Robert C. Williamson

We consider loss functions for multiclass prediction problems. We show when a multiclass loss can be expressed as a ``proper composite loss'', which is the composition of a proper loss and a link function. We exte…

General ClassificationSensitivity

Distributed Online Non-convex Optimization with Composite Regret

2022-09-21 · Zhanhong Jiang, Aditya Balu, Xian Yeow Lee, Young M. Lee 외

Regret has been widely adopted as the metric of choice for evaluating the performance of online optimization algorithms for distributed, multi-agent systems. However, data/model variations associated with agents can sign…

Achieving Linear Speedup for Composite Federated Learning

2026-02-03 · Kun Huang, Shi Pu, Karl Henrik Johansson arxiv

This paper proposes FedNMap, a normal map-based method for composite federated learning, where the objective consists of a smooth loss and a possibly nonsmooth regularizer. FedNMap leverages a normal map-based update sch…

Federated Learning

Gradient Aligned Attacks via a Few Queries

2022-05-19 · Xiangyuan Yang, Jie Lin, HANLIN ZHANG, Xinyu Yang 외

Black-box query attacks, which rely only on the output of the victim model, have proven to be effective in attacking deep learning models. However, existing black-box query attacks show low performance in a novel scenari…

Exp-Concavity of Proper Composite Losses

2018-05-20 · Parameswaran Kamalaruban, Robert C. Williamson, Xinhua Zhang

The goal of online prediction with expert advice is to find a decision strategy which will perform almost as well as the best expert in a given pool of experts, on any sequence of outcomes. This problem has been widely s…

Computational Efficiency