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

Trend · papers per month

130259389518 · Jun 202019922001200920172026
48 results for information 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.

Proposes IIB for domain generalization, overcoming failure modes of IRM.

problem Domain generalization with nonlinear classifiers and pseudo-invariant features.
method Invariant Information Bottleneck (IIB) using mutual information and variational formulation.
result Significantly outperforms IRM on synthetic datasets and real-world benchmarks.

Discuss knots in SgimesS1S_{g} imes S^{1}, introducing rotating information and invariants.

problem Understanding knots in SgimesS1S_{g} imes S^{1} and their invariants.
method Introduce diagrams, moves, and rotating information to construct invariants.
result Construct invariants using the rotating information of knots in SgimesS1S_{g} imes S^{1}.

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.

Paper introduces a new invariant for virtual knotoids and proves it's a Vassiliev invariant of order one.

problem Tackles the problem of understanding invariants for virtual knotoids.
method Uses a 0-smoothing invariant constructed from local modifications at classical crossings.
result Demonstrates that the 0-smoothing invariant provides less information than the gluing invariant.

Bayesian Hierarchical Invariant Prediction refines ICP for better scalability and prior integration.

problem Improving computational scalability and invariance testing for causal inference.
method Bayesian Hierarchical structure to test invariance under heterogeneous data.
result Demonstrated improved scalability and potential as an alternative to ICP.

The paper analyzes the tradeoffs between accuracy and invariance in learning representations.

problem Achieving both accuracy and invariance in machine learning models.
method Information theoretic analysis of classification and regression settings.
result Characterization of the accuracy and invariance achievable by any representation of the data.

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.

Using established principles from Statistics and Information Theory, we show that invariance to nuisance factors in a deep neural network is equivalent to information minimality of the learned representation, and that stacking layers and injecting noise during training naturally bias the network towards learning invari…

2017-06-05abs ↗pdf ↗

We find the maximum mutual information for neural networks and its key determinants.

problem Understanding the maximum mutual information in neural architectures.
method Derived closed-form expression for maximum mutual information across neural network families.
result Maximum mutual information stems from a generalized formula and is influenced by network width and statistical invariances.

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 ↗

This paper studies moduli spaces of statistical structures on Lie groups.

problem Understanding statistical structures on Lie groups.
method Introduced and studied moduli spaces for left-invariant statistical structures on Lie groups.
result Moduli spaces of left-invariant Riemannian metrics are singletons for certain Lie groups.

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.

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 ↗

Given any oriented link diagram, two types of new knot invariants are constructed. They satisfy some generalized skein relations. The coefficients of each invariant is from a commutative ring. Homomorphisms and representations of those rings define new link invariants. For example, the HOMFLYPT polynomial with three va…

2010-04-13abs ↗pdf ↗

GALA framework learns invariant graph representations via environment augmentation with minimal assumptions.

problem Learning invariant graph representations from different environments without additional assumptions.
method Developed GALA framework with minimal assumptions of variation sufficiency and consistency. Uses an assistant model to differentiate graph environment changes.
result Extracting maximally invariant subgraphs to proxy predictions identifies underlying invariant subgraphs for successful out-of-distribution generalization.

It is known that the number of biquandle colorings of a long virtual knot diagram, with a fixed color of the initial arc, is a knot invariant. In this paper we describe a more subtle invariant: a family of biquandle endomorphisms obtained from the set of colorings and longitudinal information.

2007-09-16abs ↗pdf ↗

We extend the Yang-Baxter cocycle invariants for virtual knots by augmenting Yang-Baxter 2-cocycles with cocycles from a cohomology theory associated to a virtual biquandle structure. These invariants coincide with the classical Yang-Baxter cocycle invariants for classical knots but provide extra information about virt…

2007-08-31abs ↗pdf ↗

In the 1950's Milnor defined a family of higher order invariants generalizing the linking number. Even the first of these new invariants, the triple linking number, has received and fruitful study since its inception. In the case that LL has vanishing pairwise linking numbers, this triple linking number gives an integ…

2019-01-16abs ↗pdf ↗

In [14], the second named author constructed the bracket invariant [.] of virtual knots valued in pictures (linear combinations of virtual knot diagrams with some crossing information omitted), such that for many diagrams K, the following formula holds: [K]=K', where K' is the underlying graph of the diagram, i.e., the…

2017-01-21abs ↗pdf ↗

This paper introduces two virtual knot theory ``analogues'' of a well-known family of invariants for knots in thickened surfaces: the Grishanov-Vassiliev finite-type invariants of order two. The first, called the three loop isotopy invariant, is an invariant of virtual knots while the second, called the three loop fram…

2013-09-11abs ↗pdf ↗

We incorporate quandle cocycle information into the quandle coloring quivers we defined in arXiv:1807.10465 to define weighted directed graph-valued invariants of oriented links we call \textit{quandle cocycle quivers}. This construction turns the quandle cocycle invariant into a small category, yielding a categorifica…

2019-04-19abs ↗pdf ↗

Whatever information a deep neural network has gleaned from training data is encoded in its weights. How this information affects the response of the network to future data remains largely an open question. Indeed, even defining and measuring information entails some subtleties, since a trained network is a determinist…

2019-05-29abs ↗pdf ↗

Study of Bauer-Furuta invariants under Lie group actions and Galois coverings.

problem Investigating invariants of 4-manifolds under group actions and Galois coverings.
method Functorial approach to equivariant invariants and study in Galois covering situations.
result Ordinary invariants of quotients are determined by equivariant invariants of the covering manifold.

Physics-informed neural networks improve by measuring effective dimensionality of constraints.

problem Task interference in physics-informed neural networks due to shared parameter space.
method Introduce effective dimensionality (deffd_{eff}) as an operator invariant to quantify constraints.
result Effective dimensionality measures unconstrained parameter directions, independent of network architecture.

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.

We give inequalities for the Manolescu invariants α,β,γα,β,γ under the connected sum operation. We compute the Manolescu invariants of connected sums of some Seifert fiber spaces. Using these same invariants, we provide a proof of Furuta's Theorem, the existence of a Z\mathbb{Z}^\infty subgroup of the homology cobordism …

2015-10-05abs ↗pdf ↗

New framework explains data augmentation's role in machine learning.

problem Understanding how data augmentation affects generalization and invariance learning.
method Information-theoretic framework based on mutual information bounds and orbit-averaged loss functions.
result Derives a new generalization bound decomposing the generalization gap into three interpretable terms.

A one-to-one correspondence is drawn between law invariant risk measures and divergences, which we define as functionals of pairs of probability measures on arbitrary standard Borel spaces satisfying a few natural properties. Divergences include many classical information divergence measures, such as relative entropy a…

2015-10-23abs ↗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 ↗

The correlation functions of supersymmetric gauge theories on a four-manifold X can sometimes be expressed in terms of topological invariants of X. We show how the existence of superconformal fixed points in the gauge theory can provide nontrivial information about four-manifold topology. In particular, in the example …

1998-12-07abs ↗pdf ↗

In this thesis we deal with spectral invariants for polygons and closed orbisurfaces of constant Gaussian curvature. In each case our method is to study the heat kernel and the asymptotic expansion of the heat trace. First, we investigate hyperbolic polygons, i.e. relatively compact domains in the hyperbolic plane with…

2017-11-09abs ↗pdf ↗

We develop an entropic framework to model the dynamics of stocks and European Options. Entropic inference is an inductive inference framework equipped with proper tools to handle situations where incomplete information is available. The objective of the paper is to lay down an alternative framework for modeling dynamic…

2019-08-18abs ↗pdf ↗

A method to approximate causal models using information theory.

problem Inferring causal direction and effect between discrete variables.
method Embedding distributions into a higher dimensional space and solving a linear optimization problem.
result Information-theoretic approximation (IACM) can be used for causal discovery in bivariate, discrete cases.