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

Trend · papers per month

295887116 · Jun 202019922001200920172026
48 results for auxiliary ads

New HMC method uses asymmetrical momentum distributions and improves performance.

problem Rigorous convergence guarantees for HMC with Gaussian momentum distributions.
method New convergence analysis for HMC with general asymmetrical momentum distributions, proposing AD-HMC.
result AD-HMC exhibits geometric convergence in Wasserstein distance under certain conditions.

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.

Variational autoencoders learn unsupervised data representations, but these models frequently converge to minima that fail to preserve meaningful semantic information. For example, variational autoencoders with autoregressive decoders often collapse into autodecoders, where they learn to ignore the encoder input. In th…

2019-05-17abs ↗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.

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 ↗

Model infers mineral locations from geospatial data, improving predictions with auxiliary data.

problem Challenges in characterizing hidden mineral deposits underground.
method Generative modeling approach using masked and infilled geospatial maps.
result Models achieve Dice coefficients of 0.31 and recalls of 0.22 at 1×1 mi² resolution.

Improves disease progression prediction using auxiliary surrogate labels and health markers.

problem Challenges in predicting disease progression due to unknown true disease states.
method Integrates hidden Markov model with time-varying discriminative classification model.
result Significant improvement in distinguishing LBD from AD using objective markers.

Effective multilingual search with instance-based transfer learning.

problem Search in multilingual setting, especially next-sentence prediction and inverse cloze.
method Instance-based transfer learning, analyzing vocabulary overlaps and transitive overlaps.
result Positive transfer on all 35 target languages and two tasks, even with no vocabulary overlap.

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.

Aux-Net model handles dynamic systems with inconsistent inputs.

problem Inconsistent or unreliable input data in real-world scenarios.
method Aux-Net uses a weighted ensemble of classifiers and online gradient descent.
result Aux-Net provides scalable and agile online learning for dynamic systems.

We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every face of a planar embedding of the graph in order to capture the effect of unary potentials. A ground state of the resulting approximation can…

2011-04-06abs ↗pdf ↗

Deep neural network learns portfolio construction and volatility forecasting.

problem Diversified risk-adjusted time-series momentum portfolios need robust volatility estimation.
method Multi-Task Learning in a deep neural network architecture.
result Deep learning approach outperforms existing TSMOM strategies.

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.

Many efforts have been devoted to training generative latent variable models with autoregressive decoders, such as recurrent neural networks (RNN). Stochastic recurrent models have been successful in capturing the variability observed in natural sequential data such as speech. We unify successful ideas from recently pr…

2017-11-15abs ↗pdf ↗

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.

These notes are based on lectures given at the Clay School on Geometry and String Theory, Isaac Newton Institute, Cambridge, 25 March - 19 April 2002. They attempt to provide an elementary and somewhat self contained discussion of the construction of supergravity solutions describing branes wrapping calibrated cycles, …

2003-05-09abs ↗pdf ↗

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.

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.

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 ↗

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.

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.

The paper extends Merton's problem by adding benchmark tracking, finding optimal strategies.

problem Maximizing consumption utility with a trade-off against benchmark performance.
method Developed a convex duality theorem and derived optimal strategies for specific cases.
result Found optimal portfolio and consumption strategies for CRRA utility and geometric Brownian motion benchmarks.

Study compares deep feature methods for anomaly detection in limited data scenarios.

problem Handling limited data in industrial inspection applications.
method Three approaches (KNN, Mahalanobis, PaDiM) using pre-trained deep features with data augmentation.
result Data augmentation significantly improves performance in small data regimes.

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.

Multi-task learning (MTL) has achieved success over a wide range of problems, where the goal is to improve the performance of a primary task using a set of relevant auxiliary tasks. However, when the usefulness of the auxiliary tasks w.r.t. the primary task is not known a priori, the success of MTL models depends on th…

2019-04-08abs ↗pdf ↗

Bayesian optimization with binary auxiliary info for faster target function optimization.

problem Optimizing target functions with expensive binary auxiliary information.
method Mixed-type Gaussian process (MOGP) and information-based acquisition functions (MT-ES, MT-PES).
result Efficient approximation of mixed-type predictive ES via random features.

ScoreFusion fuses multiple diffusion models to enhance generative modeling of a target population.

problem Enhancing generative modeling of a target population with limited data.
method ScoreFusion uses KL barycenters of auxiliary populations and recasts the learning problem as score matching in denoising diffusion.
result ScoreFusion achieves a dimension-free sample complexity bound in total variation distance.

Efficiently preserves old class knowledge in memory-limited settings.

problem Catastrophic forgetting in class-incremental learning.
method Memory-efficient exemplar preserving scheme and domain-compatible feature extractors.
result Low-fidelity exemplar samples can replace high-fidelity ones with less memory cost.

Proposes a method to improve graph neural networks on heterogeneous graphs using meta-paths.

problem Improving graph neural networks on heterogeneous graphs with auxiliary tasks.
method Self-supervised auxiliary learning with meta-paths for heterogeneous graphs.
result Consistently improves link prediction and node classification on heterogeneous graphs.

NeurT-FDR controls FDR by incorporating auxiliary covariates in deep learning.

problem Controlling FDR in complex large-scale problems with indirect relations among covariates.
method NeurT-FDR uses a deep Black-Box framework that parametrizes test-level covariates as a neural network and adjusts auxiliary covariates through a regression framework.
result NeurT-FDR makes substantially more discoveries in real datasets compared to competitive baselines.

We introduce a new family of MCMC samplers that combine auxiliary variables, Gibbs sampling and Taylor expansions of the target density. Our approach permits the marginalisation over the auxiliary variables yielding marginal samplers, or the augmentation of the auxiliary variables, yielding auxiliary samplers. The well…

2016-10-30abs ↗pdf ↗