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

Trend · papers per month

4693139185 · Jun 202019922001200920172026
48 results for auxiliary component

New method extracts factors of variation from data without much supervision.

problem Disentangling complex sensory inputs into simple factors of variation without much supervision.
method Develops a new approach for disentanglement under structural assumptions, reducing the need for auxiliary information.
result Disentanglement is possible even when auxiliary information does not ensure conditional independence, with less auxiliary information required.

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.

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.

Paper extends ICA to ISA with auxiliary variables for better speech representation learning.

problem Learning unsupervised speech representations with independent subspaces.
method Theoretical framework of nonlinear ISA with auxiliary variables.
result Proposes an algorithm to learn speech representations with independent subspaces.

Learning a model of perceptual similarity from a collection of objects is a fundamental task in machine learning underlying numerous applications. A common way to learn such a model is from relative comparisons in the form of triplets: responses to queries of the form "Is object a more similar to b than it is to c?". I…

2015-11-06abs ↗pdf ↗

The computation of the sparse principal component of a matrix is equivalent to the identification of its principal submatrix with the largest maximum eigenvalue. Finding this optimal submatrix is what renders the problem NP{\mathcal{NP}}-hard. In this work, we prove that, if the matrix is positive semidefinite and its …

2013-12-20abs ↗pdf ↗

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 λI(Y)λ_I(Y) conjecturally equals Casson-Walker invariant for rational homology spheres.

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 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.

Paper establishes identifiability conditions for a model with two latent vectors and auxiliary data.

problem Identifying conditions for a statistical model with two latent vectors and auxiliary data.
method Proposes a statistical model with two latent vectors and auxiliary data, establishing various identifiability conditions.
result Identifiability conditions reveal a dimensionality relation and link model indeterminacies to maximum link weights.

New method disentangles latent variables in nonstationary data.

problem Disentangling latent variables in nonstationary sequential data.
method NCTRL framework exploiting Markov assumption and temporal structure.
result Independent latent components can be recovered from nonlinear mixture without auxiliary variables.

Dimension reduction of multivariate data supervised by auxiliary information is considered. A series of basis for dimension reduction is obtained as minimizers of a novel criterion. The proposed method is akin to continuum regression, and the resulting basis is called continuum directions. With a presence of binary sup…

2016-06-20abs ↗pdf ↗

Adversarial domain-invariant training (ADIT) proves to be effective in suppressing the effects of domain variability in acoustic modeling and has led to improved performance in automatic speech recognition (ASR). In ADIT, an auxiliary domain classifier takes in equally-weighted deep features from a deep neural network …

2019-04-28abs ↗pdf ↗

We propose two related unsupervised clustering algorithms which, for input, take data assumed to be sampled from a uniform distribution supported on a metric space XX, and output a clustering of the data based on the selection of a topological model for the connected components of XX. Both algorithms work by selectin…

2015-06-08abs ↗pdf ↗

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 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.

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.

We investigate metric learning in the context of dynamic time warping (DTW), the by far most popular dissimilarity measure used for the comparison and analysis of motion capture data. While metric learning enables a problem-adapted representation of data, the majority of methods has been proposed for vectorial data onl…

2016-10-17abs ↗pdf ↗

We prove that the modular operad of diffeomorphism classes of Riemann surfaces with both `open' and `closed' boundary components, in the sense of string field theory, is the modular completion of its genus 0 part quotiented by the Cardy condition. We also provide a finitary presentation of a version of this modular two…

2016-11-26abs ↗pdf ↗

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 ↗

A new model integrates covariates with grade of membership analysis for better latent structure recovery.

problem Improving latent structure recovery in multivariate categorical data analysis.
method Covariate-assisted grade of membership model exploiting shared low-rank simplex geometry.
result Auxiliary covariates can provably improve latent structure recovery, leading to faster convergence rates.

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.

This paper reviews nonlinear ICA for disentangled representations in unsupervised learning.

problem Finding useful disentangled representations in unsupervised deep learning.
method Review of nonlinear ICA theory and algorithms for disentanglement.
result Nonlinear ICA can be shown to estimate useful disentangled representations.

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 ↗

Collaborative filtering (CF) is a successful approach commonly used by many recommender systems. Conventional CF-based methods use the ratings given to items by users as the sole source of information for learning to make recommendation. However, the ratings are often very sparse in many applications, causing CF-based …

2014-09-10abs ↗pdf ↗

Nonparametric mixture models based on the Dirichlet process are an elegant alternative to finite models when the number of underlying components is unknown, but inference in such models can be slow. Existing attempts to parallelize inference in such models have relied on introducing approximations, which can lead to in…

2012-11-29abs ↗pdf ↗