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

178356533711 · Jun 202019922001200920172026
48 results for task invariance

New approach combines invariance and information bottleneck for OOD generalization.

problem OOD generalization failures in classification tasks.
method Revisit linear regression tasks, prove information bottleneck constraint necessary, propose combined approach.
result Combined invariance and information bottleneck approach improves OOD generalization.

Method learns representations invariant to task-irrelevant details in reinforcement learning tasks.

problem Learning representations that are invariant to task-irrelevant details in reinforcement learning.
method Uses bisimulation metrics to learn robust latent representations that encode only task-relevant information.
result Demonstrates SOTA performance in modified visual MuJoCo tasks and a first-person driving task.

STAR improves equivariant and invariant representation learning by routing projection heads.

problem Redundant feature learning in equivariant and invariant representation learning.
method Soft Task-Aware Routing (STAR) for projection heads specialization.
result Lower canonical correlations between invariant and equivariant embeddings.

Performance of neural networks can be significantly improved by encoding known invariance for particular tasks. Many image classification tasks, such as those related to cellular imaging, exhibit invariance to rotation. We present a novel scheme using the magnitude response of the 2D-discrete-Fourier transform (2D-DFT)…

2018-05-31abs ↗pdf ↗

New method learns time-invariant rewards from demonstrations.

problem Learning robust rewards for tasks with varying execution times.
method Model-based inverse reinforcement learning with time-invariant costs.
result Approach enables learning from misaligned demonstrations and generalizes spatially.

Data representations that contain all the information about target variables but are invariant to nuisance factors benefit supervised learning algorithms by preventing them from learning associations between these factors and the targets, thus reducing overfitting. We present a novel unsupervised invariance induction f…

2018-09-26abs ↗pdf ↗

Despite their impressive performance, deep neural networks exhibit striking failures on out-of-distribution inputs. One core idea of adversarial example research is to reveal neural network errors under such distribution shifts. We decompose these errors into two complementary sources: sensitivity and invariance. We sh…

2018-11-01abs ↗pdf ↗

Improves contrastive learning invariance with novel training objectives and feature averaging.

problem Contrastive learning's implicit invariance is insufficient for robust performance.
method Introduces a novel training objective and feature averaging approach to enforce invariance.
result Improved performance and robustness to transformations on downstream tasks.

Anti-transfer learning prevents misleading representations for speech tasks.

problem Misleading representations learned from orthogonal tasks in speech processing.
method Penalizes similarity between activations of a network and another trained on an orthogonal task.
result Improves classification accuracy and invariance to the orthogonal task.

We focus on two supervised visual reasoning tasks whose labels encode a semantic relational rule between two or more objects in an image: the MNIST Parity task and the colorized Pentomino task. The objects in the images undergo random translation, scaling, rotation and coloring transformations. Thus these tasks involve…

2018-06-18abs ↗pdf ↗

Deep networks learn hierarchical data by invariant representations.

problem How many examples are needed for deep networks to learn hierarchical data?
method Random Hierarchy Model: synthetic tasks inspired by language and images hierarchy.
result Deep networks learn by invariant representations and require a detectable number of correlations between low-level features and classes.

Word embeddings are commonly obtained as optimizers of a criterion function ff of a text corpus, but assessed on word-task performance using a different evaluation function gg of the test data. We contend that a possible source of disparity in performance on tasks is the incompatibility between classes of transformat…

2019-11-06abs ↗pdf ↗

Representations of data that are invariant to changes in specified factors are useful for a wide range of problems: removing potential biases in prediction problems, controlling the effects of covariates, and disentangling meaningful factors of variation. Unfortunately, learning representations that exhibit invariance …

2018-05-24abs ↗pdf ↗

PeL separates sensory interface optimization from decision learning.

problem Optimizing sensory interfaces without task-specific information.
method Formal separation of perception and decision learning, using metrics for stability, informativeness, and geometry.
result Updates preserving invariants are orthogonal to decision gradients.

Novel framework improves graph learning for out-of-distribution generalization.

problem Graph out-of-distribution generalization challenges in neural networks.
method Invariant Graph Learning based on Information bottleneck theory (InfoIGL).
result Achieves state-of-the-art performance in graph classification tasks under OOD generalization.

MetaPhysiCa tackles robust physics-informed machine learning for OOD tasks.

problem Designing robust PIML methods for OOD forecasting tasks in physics.
method Meta-learning procedure for causal structure discovery including invariant risk minimization.
result Significantly outperforms existing PIML and deep learning methods in OOD tasks.

The paper explores how equivariant models' biases affect latent representations for better performance.

problem The impact of inductive biases on latent representations in equivariant models.
method Demonstrates the importance of accounting for inductive biases in latent representations of equivariant models.
result Effective invariant projections can be used to retain information in latent representations, improving downstream tasks.

CNNs require fewer samples than LCNs and FCNs for image-based tasks due to locality and weight sharing.

problem Quantifying statistical benefits of locality and weight sharing in CNNs over LCNs and FCNs.
method Dynamic Signal Distribution (DSD) task and information theoretic tools.
result CNNs require fewer samples than LCNs and FCNs for image-based tasks.

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.

We present a unified invariance framework for supervised neural networks that can induce independence to nuisance factors of data without using any nuisance annotations, but can additionally use labeled information about biasing factors to force their removal from the latent embedding for making fair predictions. Invar…

2019-05-07abs ↗pdf ↗

SAM improves deep learning tasks by promoting balancedness, reducing outlier impact.

problem Improving generalization in deep learning tasks, especially with scale-invariant problems.
method Introduces balancedness as a new concept to depict global behaviors of SAM, focusing on the difference between squared norms of two variables.
result SAM promotes balancedness and is data-responsive, outperforming SGD in outlier scenarios.

ReCoRe learns invariant features for world navigation using contrastive learning and regularizers.

problem Limited sample efficiency and overfitting to training scenarios in RL for visual navigation.
method Contrastive unsupervised learning and intervention-invariant regularizer.
result Significantly improves sample efficiency and generalization in out-of-distribution point navigation tasks.

This work characterizes reward function partial identifiability and its impact on policy optimization.

problem Reward function partial identifiability in complex tasks.
method Formal characterisation of partial identifiability using various reward learning data sources.
result Unified framework for comparing data sources and downstream tasks by their invariances.

A framework isolates and learns approximately shared features for better domain adaptation.

problem Reducing performance degradation in unseen domains using machine learning models.
method Statistical framework distinguishing feature utilities based on correlation variance across domains. Learning approximately shared features from source tasks and fine-tuning on target tasks.
result Improved population risk compared to previous results on both source and target tasks, resolving the paradox of feature selection.

New method uses cycle consistency to enforce invariance in latent space.

problem Learning meaningful and independent factors of variation in datasets.
method Two separate latent subspaces, cycle consistency constraints, deep information bottleneck.
result Identifies more meaningful factors leading to sparser and interpretable models.

While recent progress has spawned very powerful machine learning systems, those agents remain extremely specialized and fail to transfer the knowledge they gain to similar yet unseen tasks. In this paper, we study a simple reinforcement learning problem and focus on learning policies that encode the proper invariances …

2018-09-07abs ↗pdf ↗

We propose a novel approach to achieving invariance for deep neural networks in the form of inducing amnesia to unwanted factors of data through a new adversarial forgetting mechanism. We show that the forgetting mechanism serves as an information-bottleneck, which is manipulated by the adversarial training to learn in…

2019-11-11abs ↗pdf ↗

A new IL framework estimates invariant predictors with single domain data.

problem Deep networks inherit spurious correlations and fail on unseen domains.
method Assumes multiple labeled domains for higher-level tasks, uses single domain for target task, employs cross-validation for hyperparameter selection.
result Empirically demonstrates effectiveness and correctness of hyperparameter selection.

Methods of transfer learning try to combine knowledge from several related tasks (or domains) to improve performance on a test task. Inspired by causal methodology, we relax the usual covariate shift assumption and assume that it holds true for a subset of predictor variables: the conditional distribution of the target…

2015-07-19abs ↗pdf ↗

New method disentangles style features from data augmentations.

problem Difficulty in deducing which data attributes are 'style' and should be discarded.
method Structured data augmentation with multiple style embedding spaces, maximizing joint entropy.
result Empirically demonstrates benefits on synthetic and real-world data.

New MCMC method improves sampling efficiency across diverse structural models.

problem Low sampling efficiency in generic MCMC methods for specific problems.
method Adaptive Principal-Component (PC) Meta-learning Stochastic Gradient Hamiltonian Monte Carlo (APM-SGHMC) algorithm.
result Universal samplers achieve zero-shot generalization across structurally distinct models.

Proposes a method to predict responses from covariates over time.

problem Predicting responses from covariates with changing conditional distributions over time.
method Invariant Subspace Decomposition (ISD) framework that splits the conditional distribution into time-invariant and time-dependent components.
result The decomposition can be used for zero-shot and time-adaptation prediction tasks.

Generative adversarial networks (GANs) are a powerful framework for generative tasks. However, they are difficult to train and tend to miss modes of the true data generation process. Although GANs can learn a rich representation of the covered modes of the data in their latent space, the framework misses an inverse map…

2017-11-23abs ↗pdf ↗

An important goal in visual recognition is to devise image representations that are invariant to particular transformations. In this paper, we address this goal with a new type of convolutional neural network (CNN) whose invariance is encoded by a reproducing kernel. Unlike traditional approaches where neural networks …

2014-06-12abs ↗pdf ↗

Counterfactual data augmentations may not ensure OOD robustness if performed by a context-guessing machine.

problem Deep learning models lack out-of-distribution robustness due to reliance on spurious features.
method Theoretical analysis and demonstration of counterfactual data augmentations performed by a context-guessing machine.
result Counterfactual data augmentations by a context-guessing machine do not lead to robust OOD classifiers.

Invariances to translation, rotation and other spatial transformations are a hallmark of the laws of motion, and have widespread use in the natural sciences to reduce the dimensionality of systems of equations. In supervised learning, such as in image classification tasks, rotation, translation and scale invariances ar…

2019-10-01abs ↗pdf ↗