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

Trend · papers per month

78156233311 · Jun 202019922001200920172026
48 results for Auxiliary Loss

AuxiLearn combines auxiliary tasks into a single loss function.

problem Improving neural network performance on a main task using auxiliary tasks.
method Implicit differentiation to learn a network that combines auxiliary tasks into a single coherent objective function.
result AuxiLearn consistently outperforms competing methods in various tasks and domains.

Improves deep learning models by blending gradients from training loss and auxiliary objective.

problem Minimizing a single training loss while encouraging desirable model properties.
method Solves a bilevel optimization problem by combining training loss gradients and orthogonal projections of auxiliary gradients.
result Bloop method leads to better performance than other gradient surgery methods without EMA.

One approach to deal with the statistical inefficiency of neural networks is to rely on auxiliary losses that help to build useful representations. However, it is not always trivial to know if an auxiliary task will be helpful for the main task and when it could start hurting. We propose to use the cosine similarity be…

2018-12-05abs ↗pdf ↗

Improved motion prediction for self-driving cars using trajectory sets and auxiliary losses.

problem Accurately predicting future vehicle motion for self-driving cars.
method Classification over trajectory sets with an auxiliary loss for off-road predictions and spatial-temporal relationships.
result Significant improvement in motion prediction performance on small datasets using map information.

Learning with auxiliary tasks can improve the ability of a primary task to generalise. However, this comes at the cost of manually labelling auxiliary data. We propose a new method which automatically learns appropriate labels for an auxiliary task, such that any supervised learning task can be improved without requiri…

2019-01-25abs ↗pdf ↗

HydaLearn dynamically adjusts task weights for better MTL performance.

problem Constant loss weights in MTL lead to poor results due to drifting relevance and varying mini-batch composition.
method HydaLearn uses mini-batch gradients to dynamically adjust task weights.
result HydaLearn improves performance on synthetic and real-world data.

Despite recent advances in training recurrent neural networks (RNNs), capturing long-term dependencies in sequences remains a fundamental challenge. Most approaches use backpropagation through time (BPTT), which is difficult to scale to very long sequences. This paper proposes a simple method that improves the ability …

2018-03-01abs ↗pdf ↗

Malware detection is a popular application of Machine Learning for Information Security (ML-Sec), in which an ML classifier is trained to predict whether a given file is malware or benignware. Parameters of this classifier are typically optimized such that outputs from the model over a set of input samples most closely…

2019-03-13abs ↗pdf ↗

We propose self-teaching networks to improve the generalization capacity of deep neural networks. The idea is to generate soft supervision labels using the output layer for training the lower layers of the network. During the network training, we seek an auxiliary loss that drives the lower layer to mimic the behavior …

2019-09-09abs ↗pdf ↗

Aux-NAS uses auxiliary labels to improve primary task performance without extra inference cost.

problem Improving primary task performance using auxiliary labels without increasing inference cost.
method Architecture-based approach with a flexible asymmetric structure for primary and auxiliary tasks, using Neural Architecture Search (NAS) to evolve networks with only primary-to-auxiliary connections.
result Achieves improved performance on multiple tasks without increasing inference cost.

Study optimal consumption for loss-averse agents considering past spending peaks.

problem Optimal consumption for loss-averse agents with reference to past spending maximum.
method Adopted S-shaped utility, concave envelope, HJB variational inequality, dual transform, and smooth-fit conditions.
result Obtained piecewise closed-form solutions for optimal consumption and investment control.

REGAIN learns optimal auxiliary directions for forecast reconciliation.

problem Forecast reconciliation from fixed systems; identifying useful auxiliary directions.
method REGAIN learns normalized auxiliary directions, forecasts induced series, and selects directions by loss reduction.
result Gain-selected auxiliary directions improve forecast quality, especially for residual uncertainty.

This work addresses encoding biases in neural networks by tailoring models with unsupervised losses.

problem Improving neural network representations and reducing the generalization gap.
method Inspired by transductive learning, the authors propose tailoring and meta-tailoring to optimize unsupervised losses during prediction time.
result Models trained with tailoring and meta-tailoring perform better on the task objective after adapting to unsupervised losses.

Conditional generative models enjoy remarkable progress over the past few years. One of the popular conditional models is Auxiliary Classifier GAN (AC-GAN), which generates highly discriminative images by extending the loss function of GAN with an auxiliary classifier. However, the diversity of the generated samples by…

2019-07-05abs ↗pdf ↗

Trans-Ising combines auxiliary datasets to estimate high-dimensional Ising models.

problem Limited target sample sizes and difficulty in using auxiliary binary datasets of unknown relevance.
method Trans-Ising uses a loss-based source screening rule and a two-stage estimation procedure.
result Trans-Ising achieves lower estimation errors than target-only estimation and naive data pooling.

A method corrects bias in estimating a high-dimensional classification rule using auxiliary outcomes.

problem Bias in estimating a high-dimensional classification rule using only one outcome.
method Robust transfer learning approach combining MTL and calibration steps.
result Final estimator achieves lower error than using only the target outcome.

TILT improves target domain performance by penalizing an auxiliary component on unlabeled target inputs.

problem Improving performance on target domain under covariate shift.
method TILT uses a novel objective function to decompose the source predictor and penalize an auxiliary component on unlabeled target inputs.
result TILT improves target domain performance over source-only training and other baselines.

We propose gradient adversarial training, an auxiliary deep learning framework applicable to different machine learning problems. In gradient adversarial training, we leverage a prior belief that in many contexts, simultaneous gradient updates should be statistically indistinguishable from each other. We enforce this c…

2018-06-21abs ↗pdf ↗

Study improves interpretability in generative models by disentangling latent variables in scientific datasets.

problem Extracting generative factors from complex, high-dimensional datasets in unsupervised or semi-supervised settings.
method Introducing Aux-VAE, a novel architecture within the VAE framework, which disentangles latent variables by guiding them with auxiliary variables.
result Aux-VAE achieves disentanglement with minimal modifications to the standard VAE loss function, validated on multiple datasets.

VAV method optimizes learning rate for faster, stable SGD convergence.

problem Optimizing learning rate for efficient and stable machine learning models.
method Energy-based self-adaptive learning rate with auxiliary variable rr.
result VAV method achieves faster convergence and superior stability with larger learning rates.

Many popular first-order optimization methods (e.g., Momentum, AdaGrad, Adam) accelerate the convergence rate of deep learning models. However, these algorithms require auxiliary parameters, which cost additional memory proportional to the number of parameters in the model. The problem is becoming more severe as deep l…

2019-02-01abs ↗pdf ↗

DHEN improves CVR prediction for ads with multitask learning and auxiliary loss.

problem Predicting conversion rates in ad-recommendation systems.
method DHEN integrates multiple feature-crossing modules and uses a multitask learning framework, ablation studies, and self-supervised auxiliary loss.
result DHEN achieves state-of-the-art performance in CVR prediction.

Accurately annotating large scale dataset is notoriously expensive both in time and in money. Although acquiring low-quality-annotated dataset can be much cheaper, it often badly damages the performance of trained models when using such dataset without particular treatment. Various methods have been proposed for learni…

2019-09-08abs ↗pdf ↗

Sampling a fraction of pairs can match full evaluation in machine learning losses.

problem High computational cost of full pairwise loss evaluation.
method Survey sampling techniques targeting informative pairs.
result Performance close to full pairwise evaluation achieved with frugal sampling.

In supervised binary hashing, one wants to learn a function that maps a high-dimensional feature vector to a vector of binary codes, for application to fast image retrieval. This typically results in a difficult optimization problem, nonconvex and nonsmooth, because of the discrete variables involved. Much work has sim…

2015-01-21abs ↗pdf ↗

Logsy detects anomalies in logs using a novel classification-based approach.

problem Anomaly detection in unstructured logs is challenging due to limited model generalization.
method Logsy learns log representations by distinguishing normal and anomaly logs using a classification-based approach with an attention-based encoder and hyperspherical loss function.
result Logsy improves anomaly detection performance by 0.25 in F1 score compared to previous methods.

SXL embeds spatial autocorrelation into neural networks for better geographic data learning.

problem Difficulties in learning spatial effects for neural networks in geographic data.
method SXL uses auxiliary tasks and autoregressive embeddings to learn spatial autocorrelation.
result SXL improves neural network training in unsupervised and supervised learning tasks.

Zero-shot contrastive loss improves text-guided image style transfer without extra training.

problem Stochastic nature of diffusion models leads to trade-offs between style transformation and content preservation.
method Proposes a zero-shot contrastive loss for diffusion models that doesn't require additional fine-tuning or auxiliary networks.
result Method outperforms existing methods while preserving content and requiring no additional training.

Model predicts operational risk using HMMs with economic covariates.

problem Predicting operational risk losses with time-dependent structures and economic covariates.
method Hidden Markov Models extended to multivariate observations with an auxiliary economic variable.
result Calibration results show relevance of including economic covariates.

New method uses correlated auxiliary feedback to reduce regret in parameterized bandits.

problem Reducing regret in parameterized bandits with correlated auxiliary feedback.
method Develops a reward estimator using auxiliary feedback with tight confidence bounds.
result Shows significant reduction in regret compared to standard methods.

In-N-Out improves model robustness to out-of-distribution data.

problem Learning robust models with few in-distribution labeled examples.
method Pre-training with auxiliary information and self-training with pseudolabels.
result In-N-Out outperforms auxiliary inputs or outputs alone on both in-distribution and OOD error.

We present a technique to improve the transferability of deep representations learned on small labeled datasets by introducing self-supervised tasks as auxiliary loss functions. While recent approaches for self-supervised learning have shown the benefits of training on large unlabeled datasets, we find improvements in …

2019-06-17abs ↗pdf ↗

Researchers identify valid auxiliary functions for extreme value distributions and their max-domains of attraction.

problem Characterize valid auxiliary functions for extreme value distributions and their max-domains of attraction.
method Introduced 'universal' auxiliary functions valid for both VR and vMR representations, identified sets of valid auxiliary functions, and proposed a method for finding appropriate auxiliary functions.
result Characterized valid auxiliary functions for both VR and vMR representations for the entire MDA distribution families.

We study the problem of learning representations with controllable connectivity properties. This is beneficial in situations when the imposed structure can be leveraged upstream. In particular, we control the connectivity of an autoencoder's latent space via a novel type of loss, operating on information from persisten…

2019-06-21abs ↗pdf ↗

The paper improves high-dimensional linear regression prediction and estimation using auxiliary samples.

problem Estimating and predicting high-dimensional linear regression models with auxiliary samples.
method Proposes Trans-Lasso for data-driven transfer learning, establishing optimality for prediction and estimation.
result Knowledge from auxiliary samples can improve learning performance in target problems.

MFAI uses gradient boosted trees to leverage auxiliary info for scalable Bayesian matrix factorization.

problem Matrix factorization struggles with poor data quality, especially high sparsity and low SNR.
method Integrates gradient boosted trees into probabilistic matrix factorization framework.
result MFAI effectively leverages auxiliary information, improving model performance.