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

109218326435 · Jun 202019922001200920172026
48 results for sufficient representation

MSRL learns a representation maximizing mutual info with response variables.

problem Learning sufficient representations for complex, multi-dimensional data.
method Variational mutual information, deep neural networks, generalized Dudley's inequality.
result MSRL achieves consistent and accurate representation learning.

Study shows how information loss and operation loss are related in feature representations.

problem Understanding the relationship between information loss and operation loss in feature representations.
method Analyzes the interplay between weak information loss and operation loss in continuous representations.
result Specific forms of vanishing information loss imply vanishing MPE loss in classification.

Unified framework for fair representation learning in machine learning.

problem Ensuring fairness in machine learning models, especially when biased data representations lead to unfair predictions.
method Integrates nonlinear sufficient dimension reduction with deep learning to construct fair and informative representations, introducing a penalty term to enforce conditional independence between sensitive attributes and learned representations.
result Achieves a superior balance between fairness and utility, significantly outperforming state-of-the-art baselines on various data structures.

Study on how optimal representations emerge during deep learning training, focusing on the role of implicit regularization.

problem Understanding how optimal representations for tasks are learned during training.
method Investigates the role of implicit regularization in learning minimal sufficient representations, analyzing changes in representation content during training.
result Semantically meaningful but ultimately irrelevant information is encoded in early transient dynamics of training, which is later discarded.

Enhances source domain knowledge with target data for transfer learning.

problem Limited data in target domains and rigid model assumptions in transfer learning.
method Transfer learning through Enhanced Sufficient Representation (TESR).
result TESR enhances source domain knowledge with target data, improving transfer learning performance.

TCRI improves domain generalization by enforcing conditional independence constraints.

problem Limitations of existing domain generalization methods due to incomplete constraints.
method TCRI implements regularizers motivated by conditional independence constraints.
result TCRI achieves cross-domain stability and outperforms baselines in worst-domain accuracy.

Unpaired multi-domain causal representation learning is possible with sufficient conditions.

problem Learning shared causal representation from unpaired data across domains.
method Identify sufficient conditions for joint distribution and shared causal graph recovery.
result Practical method to recover shared latent causal graph from marginal distributions.

Many learning algorithms require categorical data to be transformed into real vectors before it can be used as input. Often, categorical variables are encoded as one-hot (or dummy) vectors. However, this mode of representation can be wasteful since it adds many low-signal regressors, especially when the number of uniqu…

2019-08-26abs ↗pdf ↗

Study feature representations induced by dependence between variables.

problem Learning feature representations from dependent random variables.
method Characterized sufficient and necessary conditions for dependence-induced representations, and provided a family of loss functions.
result Features learned from the family of loss functions can be expressed as the composition of a loss-dependent function and the maximal correlation function.

The paper explores symmetric representations of links and conditions for amphichirality.

problem Investigating symmetric representations of links and conditions for amphichirality.
method Using antipodally self-dual and antipodally symmetric maps, the authors provide sufficient combinatorial conditions for amphichirality.
result A link is amphichiral if its self-dual pairing is not one of 6 specific ones.

New statistical theory explains contrastive learning effectiveness.

problem Understanding why contrastive learning works well for representation extraction.
method Developed a new theoretical framework based on approximate sufficient statistics.
result Near-sufficient encoders derived from contrastive learning can be adapted for downstream tasks.

Proposes a deep learning method for effective data representation.

problem Constructing effective data representations for prediction.
method A deep dimension reduction approach to learning representations with sufficiency, low dimensionality, and disentanglement.
result The proposed deep nonparametric representation is consistent and performs better than existing methods.

New method learns useful disentangled representations from weakly labeled data.

problem Learning useful representations from weakly labeled data.
method Model pairs of non-i.i.d. images, learn disentangled representations without requiring annotation.
result Learn disentangled representations reliably from pairs of images without requiring group, individual factor, or number of changed factors annotation.

In this paper we establish necessary and sufficient conditions for the limit set of a projective Anosov representation to be a differentiable submanifold of projective space with Holder continuous derivatives. We also calculate the optimal value of the Holder constant in terms of the eigenvalue data of the Anosov repre…

2019-03-26abs ↗pdf ↗

We consider a general regularised interpolation problem for learning a parameter vector from data. The well known representer theorem says that under certain conditions on the regulariser there exists a solution in the linear span of the data points. This is at the core of kernel methods in machine learning as it makes…

2018-09-26abs ↗pdf ↗

A method identifies domain-general features using causal graph constraints and regularization.

problem Identifying domain-general features without prior knowledge of spurious features.
method Proposes a novel regularization framework based on causal graph constraints.
result Demonstrates effectiveness in both synthetic and real-world data, outperforming state-of-the-art methods.

The paper shows that certain learned representations are identifiable in function space.

problem Identifiability of learned representations in deep neural networks.
method Using recent advances in nonlinear ICA, the paper shows that a large family of discriminative models are identifiable in function space, up to a linear indeterminacy.
result Many models for representation learning are identifiable in function space, including text, images, and audio.

In this paper, we give a necessarly and sufficient condition for orbits of linear isotropy representations of Riemannian symmetric spaces are biharmonic submanifolds in hyperspheres in Euclidean spaces. In particular, we obtain examples of biharmonic submanifolds in hyperspheres whose co-dimension is greater than one.

2017-04-25abs ↗pdf ↗

Develops new methods for isospectral orbifolds and regulator quotients.

problem Isospectral orbifolds and regulator quotients in Vignéras constructions.
method New sufficient criteria for isospectrality and regulator quotients, linking torsion homology and Galois representations.
result Produces small exotic isospectral orbifolds and sufficient criteria for regulator quotients.

Fairness has become a central issue for our research community as classification algorithms are adopted in societally critical domains such as recidivism prediction and loan approval. In this work, we consider the potential bias based on protected attributes (e.g., race and gender), and tackle this problem by learning …

2019-04-30abs ↗pdf ↗

We give sufficient conditions for a parametrised family of probability measures on a Riemannian manifold with boundary to be represented by random maps of class CkC^k. The conditions allow for the probability densities to approach zero towards the boundary of the manifold. We also formulate two obstructions to regular …

2016-10-10abs ↗pdf ↗

Poly-view contrastive learning improves image representation learning.

problem Learning representations from multiple related views in image data.
method Developed new representation learning objectives for poly-view tasks using information maximization and sufficient statistics.
result Poly-view contrastive models trained for fewer epochs and with smaller batch sizes outperform models trained for more epochs and with larger batch sizes.

the main theorem gives a sufficient condition for a n elements of SL(2,R) to generate a free group.The idea behind it is to use a nonorientable version of the Dehn-Wolpert-Goldman twist and to sew it with the original representation of a free group to get representation of the closed surfase group and then to apply Gol…

1997-09-06abs ↗pdf ↗

Due to the ability of deep neural nets to learn rich representations, recent advances in unsupervised domain adaptation have focused on learning domain-invariant features that achieve a small error on the source domain. The hope is that the learnt representation, together with the hypothesis learnt from the source doma…

2019-01-27abs ↗pdf ↗

New method combines domain changes and sparse mixing for better latent variable learning.

problem Challenges in identifying latent variables due to insufficient domain changes and violated sparsity constraints.
method Combines sufficient changes and sparse mixing constraints, using domain encoding networks and variational autoencoders.
result Identifiability of latent variables achieved with less restrictive constraints.

Paper develops a theory explaining contrastive pre-training for multimodal AI.

problem Limited theoretical understanding of contrastive pre-training for multi-modal AI.
method Introduces approximate sufficient statistics and Joint Generative Hierarchical Model.
result Near-minimizers of contrastive loss are approximately sufficient, enabling diverse downstream tasks.

Pantypes improve prototypical models by capturing diverse input distributions.

problem Prototypical models lack sufficient data representation in low density regions.
method Introducing pantypes, a sparse set of diverse objects to represent the full diversity of input distribution.
result Pantypes empower prototypical models to foster high diversity, interpretability, and fairness.

We prove a uniqueness result for finite-dimensional representations of the Kauffman skein algebra SA(S)\mathcal{S}_A(S) of a surface SS, when AA is a root of unity and when the surface SS is a sphere with at most four punctures or a torus with at most one puncture. We show that, if two irreducible representations of $\…

2015-04-17abs ↗pdf ↗

We present a framework for autonomously learning a portable representation that describes a collection of low-level continuous environments. We show that these abstract representations can be learned in a task-independent egocentric space specific to the agent that, when grounded with problem-specific information, are …

2019-05-28abs ↗pdf ↗

We study spin structures on affine Kac-Moody symmetric spaces and obtain sufficient conditions for their existence.\ As a by product of this, we obtain a spin-c representation of certain Kac-Moody quadratic subgroups of type E.

2017-10-30abs ↗pdf ↗

Given an overcomplete dictionary AA and a signal bb that is a linear combination of a few linearly independent columns of AA, classical sparse recovery theory deals with the problem of recovering the unique sparse representation xx such that b=Axb = A x. It is known that under certain conditions on AA, xx can be re…

2015-07-06abs ↗pdf ↗

We study isometric actions of tree automorphism groups on the infinite-dimensional hyperbolic spaces. On the one hand, we exhibit a general one-parameter family of such representations and analyse the corresponding equivariant embeddings of the trees, showing that they are convex-cocompact and asymptotically isometric.…

2004-04-29abs ↗pdf ↗

LLMs' explanations are often insufficient and vary with input distribution.

problem Evaluating the sufficiency of LLM explanations without predefined biases.
method Generalizing sufficiency to arbitrary explanations, using LLM's input beliefs, and introducing SCSuff metric.
result Explanation sufficiency can vary with input distribution and is weakly correlated with model size, accuracy, or output entropy.

This article studies quadratic semimartingale BSDEs arising in power utility maximization when the market price of risk is of BMO type. In a Brownian setting we provide a necessary and sufficient condition for the existence of a solution but show that uniqueness fails to hold in the sense that there exists a continuum …

2011-07-01abs ↗pdf ↗

The paper studies conjugating complex representations into real ones.

problem Understanding representations of surface groups into complex Lie groups.
method Analyzes representations of finitely generated groups into PGL(k,C)PGL(k, \mathbb{C}) and determines conjugacy conditions.
result Identifies representations in the larger variety that are conjugate in PGL(k,C)PGL(k, \mathbb{C}) to a representation in PGL(k,R)PGL(k, \mathbb{R}).

The paper characterizes isomorphic covers of surfaces and applies it to distinguish representations.

problem Characterizing isomorphic covers of surfaces and distinguishing representations.
method Effective characterization of covers using curves with bounded self-intersection number.
result The set of unmarked traces distinguishes between non-isomorphic covers for large N.