Boosts GNN performance on molecular graphs.
problem Current GNNs struggle with training set and scalability.
method Proposes an auxiliary module to enhance GNNs.
result Improves GNN performance on molecular datasets.
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “Auxiliary Module”
A framework for using auxiliary data to improve few-shot learning.
problem Few-shot learning with scarce labeled examples and abundant auxiliary data.
method Automatic pseudo-shot selection and masking module to adjust auxiliary features.
result Masking module improves accuracy by 4.68 and 6.03 percentage points.
Framework uses physics knowledge to improve spatiotemporal prediction with limited data.
problem Challenges in modeling physical systems with limited real-world data.
method Physics-aware meta-learning with auxiliary tasks, incorporating PDE-independent spatial and temporal modules.
result Framework outperforms in spatiotemporal prediction tasks with limited data.
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.
Optimal dividend strategy found for risk models with regime switching.
problem Optimal dividend strategy for spectrally negative Markov additive models with regime switching.
method Introduced an auxiliary problem and transformed the original problem into a local optimization problem.
result The refraction-reflection strategy with regime-modulated thresholds is optimal.
CATS enhances MTSF by generating ATS from OTS to improve forecasting accuracy.
problem Recent deep learning models often outperform multivariate ones in MTSF.
method CATS constructs ATS from OTS using a 2D temporal-contextual attention mechanism.
result CATS achieves state-of-the-art performance with reduced complexity.
New framework IIA identifies innovations in general nonlinear vector autoregressive processes.
problem Limited generality of NVAR models due to additive innovation assumption.
method Independent Innovation Analysis (IIA) framework, assuming mutual independence and modulation by an auxiliary variable.
result Guarantees identifiability of innovations with arbitrary nonlinearities, up to permutation and component-wise invertible nonlinearities.
The present paper contains a systematic study of the structure of metric Lie algebras, i.e., finite-dimensional real Lie algebras equipped with a non-degenerate invariant symmetric bilinear form. We show that any metric Lie algebra without simple ideals has the structure of a so called balanced quadratic extension of a…
A new training method speeds up ResNet training by 3x with minimal accuracy loss.
problem Training ResNets is slow due to dependencies between modules.
method Serial-parallel hybrid training strategy with data augmentation and downsampling.
result Significant speedup over traditional methods with comparable accuracy.
PSTN improves traffic condition forecasting with deep neural networks.
problem Challenges in accurately forecasting traffic conditions due to complex spatiotemporal correlations.
method Proposes PSTN with three modules: graph convolutional network, temporal convolutional network, and gated recurrent unit framework.
result Significantly outperforms state-of-the-art benchmarks in short-term traffic conditions forecasting.
The paper reviews identifiability in linear and nonlinear models, from Gaussian to non-Gaussian.
problem Identifiability issues in latent-variable and structural-equation models, especially in nonlinear cases.
method Review of identifiability theory for linear and nonlinear models, including factor analysis and structural equation models.
result Even nonparametric nonlinear models can be estimated with additional assumptions.
New instanton invariants for rational homology spheres defined and shown to be functorial.
problem Defining and proving invariance of instanton homology groups for rational homology spheres.
method Novel suspended flow category technique to handle obstructed cobordisms and prove wall-crossing formula.
result Instanton invariant conjecturally equals Casson-Walker invariant for rational homology spheres.
WeSinger improves singing voice synthesis with data augmentation and specialized modules.
problem Improving the accuracy and naturalness of synthesized singing voices.
method Developed a multi-singer Chinese neural singing voice synthesis system with deep bi-directional LSTM, Transformer, LPCNet, and data augmentation.
result WeSinger achieves state-of-the-art performance on the Opencpop corpus.
Optimizes forecast accuracy and diversity using multi-task deep learning.
problem Forecasting combinations of time series data.
method Multi-task deep learning architecture that selects and combines forecasting models.
result Enhances point forecast accuracy compared to state-of-the-art methods.
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.
New method learns auxiliary labels automatically for improved generalisation.
problem Improving generalisation in supervised learning without additional data.
method Trains two neural networks: label-generation and multi-task networks.
result MAXL outperforms single-task learning on 7 image datasets.
Survey of various non-classical knot theories from geometric and algebraic perspectives.
problem Various modifications to classical knot theory.
method Comparative geometric and algebraic analysis of non-classical knot theories.
result Distinct topological and combinatorial features in generalized knot theories.
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.
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.
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.
NFM models time-series data directly in the Fourier domain, achieving state-of-the-art performance.
problem Traditional time-series analysis focuses on the time domain, limiting flexibility.
method NFM models time-series data in the Fourier domain, using frequency extrapolation and interpolation.
result NFM achieves state-of-the-art performance on various time-series tasks.
Proposes a criterion for selecting relevant auxiliary variables in incomplete data analysis.
problem Selecting useful auxiliary variables for incomplete data analysis.
method Formulates model selection problem, proposes an information criterion based on Kullback-Leibler divergence.
result Proposed information criterion is an asymptotically unbiased estimator of Kullback-Leibler divergence.
Auxiliary Tuning adapts pre-trained models for novel tasks efficiently.
problem Adapting pre-trained models for new tasks efficiently.
method Supplementing pre-trained model with an auxiliary model that shifts output distribution.
result Achieved similar results to training from scratch with fewer resources.
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.
Refining Coarse-grained Spatial Data using Auxiliary Spatial Data Sets with Various Granularitiesstat.ML
Model refines coarse spatial data using diverse auxiliary data sets.
problem Tackles the challenge of refining coarse spatial data with varying auxiliary data granularities.
method Proposes a probabilistic model using Gaussian processes to hierarchically incorporate auxiliary data sets of various granularities.
result Can effectively refine coarse-grained spatial data using auxiliary data sets of different granularities.
Method reweights auxiliary tasks to reduce data need for main task.
problem Limited labeled data for supervised learning.
method Formulates weighted likelihood function as surrogate prior, minimizing divergence to true prior.
result Effective use of limited labeled data with auxiliary tasks, improving performance.
LargeMvC-Net improves scalability of multi-view clustering.
problem Scalability issues in multi-view clustering.
method Deep unfolding of multi-view clustering into a network architecture with three modules.
result LargeMvC-Net consistently outperforms state-of-the-art methods in scalability and effectiveness.
This paper reviews dMTL and methods for selecting auxiliary tasks.
problem Improving model performance for multiple tasks.
method Review of dMTL approaches and methods for selecting auxiliary tasks.
result Methods for selecting auxiliary tasks can improve dMTL performance.
Adapts auxiliary losses using gradient similarity to improve neural network performance.
problem Statistical inefficiency in neural networks and difficulty in selecting helpful auxiliary tasks.
method Uses cosine similarity between gradients of tasks to adaptively weight auxiliary losses.
result Guaranteed convergence to critical points of the main task and practical usefulness across domains.
AutoSeM automatically selects and balances auxiliary tasks in MTL.
problem Choosing and balancing auxiliary tasks in MTL.
method AutoSeM uses a Beta-Bernoulli multi-armed bandit with Thompson Sampling for task selection and a Gaussian Process for learning the mixing ratio.
result AutoSeM achieves significant performance boosts on GLUE language understanding tasks.
Enhances OOD detection using latent diffusion for more robust and efficient training.
problem Improving reliability of machine learning models in real-world scenarios.
method Proposes Outlier-Aware Learning (OAL) framework that generates synthetic OOD data in latent space and uses MICL and KD modules.
result Demonstrates superior performance on benchmark datasets.
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.
Paper presents a world model that learns invariant causal features using contrastive unsupervised learning.
problem Learning invariant causal features in unsupervised settings.
method Contrastive unsupervised learning with intervention invariant auxiliary task.
result Significantly outperforms state-of-the-art methods on out-of-distribution point navigation tasks.
Bochner's Identity on Graphsmath.DG
Proves Bochner's identity on graphs using a new auxiliary graph.
problem Extending Bochner's identity to graph theory.
method Introduces a complete tangent graph to prove the identity.
result Validates Bochner's identity on graphs.
Quo Vadis team improves Traffic4cast competition with a seasonal bias model.
problem Improving performance of traffic flow prediction models.
method Temporal regression module with spatio-temporal biases.
result Mean squared error of 9.47×10⁻³ on test data.
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.
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…
Proposes a new learning framework for scalable image classification.
problem Scalability issues in CNN-based image classifiers for large number of classes.
method Combines hierarchical classification and auxiliary learning to address scalability issues.
result Reduces classification errors by up to 3.56% on CIFAR-10 dataset.
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.
Deep generative models parameterized by neural networks have recently achieved state-of-the-art performance in unsupervised and semi-supervised learning. We extend deep generative models with auxiliary variables which improves the variational approximation. The auxiliary variables leave the generative model unchanged b…
Unlearning Works Better Than You Think: Local Reinforcement-Based Selection of Auxiliary Objectivescs.NE
LRSAO uses RL to dynamically select and unlearn auxiliary objectives for EA optimization.
problem Optimizing complex landscapes with evolutionary algorithms.
method Local Reinforcement Learning (RL) to dynamically select and unlearn auxiliary objectives.
result Improved optimization complexity from to .
We propose a technique for increasing the efficiency of gradient-based inference and learning in Bayesian networks with multiple layers of continuous latent vari- ables. We show that, in many cases, it is possible to express such models in an auxiliary form, where continuous latent variables are conditionally determini…
Enhances machine learning with background knowledge through feature generation.
problem Machine learning struggles with small datasets.
method Generates features from auxiliary datasets not similar to the original task.
result Significant improvement in various learning tasks.
This work prevents variational autoencoders from collapsing by adding an auxiliary decoder.
problem Variational autoencoders can collapse into autodecoders, losing semantic information.
method Adding an auxiliary decoder to regularize the latent space.
result Auxiliary decoders increase semantic information in the latent space and reconstructions.