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

152304455607 · Jun 202019922001200920172026
48 results for representation convergence

Cataclysm deformations study Anosov representations and their convergence.

problem Understanding convergence of Anosov representations under deformation.
method Cataclysm deformation of Anosov representations using twisted transverse cocycles.
result Uniform convergence of cataclysm deformations on compact sets.

Cataclysm deformations study Anosov representations, leading to new formulas and non-open sets.

problem Understanding Anosov representations and their deformations.
method Cataclysm deformations based on twisted transverse cocycles.
result Uniform convergence of cataclysm deformations on compact sets.

CKA with Gaussian RBF kernels converges linearly as bandwidth increases.

problem Understanding the behavior of CKA with large bandwidth Gaussian kernels.
method Analyzing the convergence of CKA based on Gaussian RBF kernels in the large-bandwidth limit.
result CKA based on Gaussian RBF kernels converges linearly as bandwidth increases.

Temporal-difference and Q-learning learn feature representations that converge to optimal ones.

problem Understanding how feature representations evolve in temporal-difference and Q-learning with neural networks.
method Mean-field theory applied to overparameterized two-layer neural networks.
result The feature representation converges to the optimal one, generalizing previous results.

Random harmonic maps into spheres converge to a specific metric under strong convergence of representations.

problem Understanding the behavior of harmonic maps into spheres under representation convergence.
method Introduced renormalized energy and harmonic representatives, proving convergence to a rescaled hyperbolic metric.
result Renormalized energies and harmonic representatives converge to a specific metric under strong convergence of representations.

In this paper we investigate the Hausdorff dimension of limit sets of Anosov representations. In this context we revisit and extend the framework of hyperconvex representations and establish a convergence property for them, analogue to a differentiability property. As an application of this convergence, we prove that t…

2019-02-04abs ↗pdf ↗

Many loss functions in representation learning are invariant under a continuous symmetry transformation. For example, the loss function of word embeddings (Mikolov et al., 2013) remains unchanged if we simultaneously rotate all word and context embedding vectors. We show that representation learning models for time ser…

2018-03-08abs ↗pdf ↗

Early alignment in neural networks leads to sparse representations but hinders convergence.

problem The implicit bias of gradient descent during early training phases.
method Quantitative description of early alignment phase in small initialisation, one hidden layer networks.
result Early alignment induces a sparse representation but also hinders convergence to global minima.

We develop a stochastic target representation for Ricci flow and normalized Ricci flow on smooth, compact surfaces, analogous to Soner and Touzi's representation of mean curvature flow. We prove a verification/uniqueness theorem, and then consider geometric consequences of this stochastic representation. Based on this …

2012-09-19abs ↗pdf ↗

New theory explains how self-supervised learning converges, advancing AI research.

problem Lack of precise theoretical explanation for self-supervised learning convergence.
method Synthesized Identifiability Theory with empirical evidence to propose Singular Identifiability Theory (SITh).
result SITh provides deeper insights into SSL's implicit data assumptions and advances representation learning.

In this paper, we obtain stability results for martingale representations in a very general framework. More specifically, we consider a sequence of martingales each adapted to its own filtration, and a sequence of random variables measurable with respect to those filtrations. We assume that the terminal values of the m…

2018-06-04abs ↗pdf ↗

Shallow neural networks can represent polynomials efficiently.

problem Representing polynomials using shallow neural networks.
method Using shallow neural networks of width 2(R+d)d2(R+d)^d to represent dd-variate polynomials of degree RR.
result Derives minimax optimal convergence rate for shallow networks to unknown univariate regression functions.

We extend contrastive learning theory for multiway classification and prove convergence guarantees.

problem Efficient self-supervised training for multiway classification tasks.
method Contrastive representation learning with multiple negative samples and convergence guarantees for gradient descent.
result Convergence guarantees for contrastive learning with gradient descent of an overparametrized encoder.

Neural networks learn spectral representations for group composition.

problem Understanding structured emergence in neural network training.
method Lifting gradient flow to Fourier domain, proving convergence to irreducible representations.
result Neurons converge to single irreducible representations, cross-layer coefficients align.

EBM reduces dimensionality for estimating heterogeneous CATEs.

problem Estimating CATEs requires many confounding variables, increasing sample complexity.
method Proposes an EBM that learns a low-dimensional representation of variables.
result EBM representations keep CATE estimates consistent and perform better than other methods.

This paper analyzes neural networks for solving complex optimization problems.

problem Minimax optimization problems in infinite-dimensional function spaces.
method Mean-field analysis of stochastic gradient descent-ascent in neural networks.
result The algorithm converges to a stationary point at a sublinear rate.

For each oriented surface ΣΣ of genus gg we study a limit of quantum representations of the mapping class group arising in TQFT derived from the Kauffman bracket. We determine that these representations converge in the Fell topology to the representation of the mapping class group on $\boH(Σ)$, the space of regular f…

2006-04-25abs ↗pdf ↗

This paper studies nonlinear representation learning dynamics beyond the NTK regime.

problem Efficient reasoning and inference in raw sensory data representations.
method Identifies common model structure assumption and data-architecture alignment condition for global convergence and optimality.
result Theoretical framework explains network size effects and provides practical model structure guidelines.

We construct a sequence of primitive-stable representations of free groups into PSL(2,C) whose ranks go to infinity, but whose images are discrete with quotient manifolds that converge geometrically to a knot complement. In particular this implies that the rank and geometry of the image of a primitive-stable representa…

2010-09-30abs ↗pdf ↗

KL annealing helps VAEs avoid posterior collapse and overfitting.

problem Posterior collapse and overfitting in VAEs.
method Theoretical analysis of learning dynamics with KL annealing.
result Posterior collapse is inevitable when ββ exceeds a threshold.

Paper shows linear convergence of ISTA and FISTA for ill-conditioned images.

problem Solving linear inverse problems with sparse representation in signal and image processing.
method Revisits iterative shrinkage-thresholding algorithms (ISTA) and improves their convergence properties.
result Linear convergence of ISTA and FISTA for strongly convex smooth parts, even in ill-conditioned cases.

Adapting functional gradients improves FGD's practicality and theoretical guarantees.

problem Implementing FGD in practice due to infinite-dimensional functional gradients.
method Adapting the representation of functional gradients.
result Establishes convergence to a stationary point for smooth losses and a global minimizer under smoothness + Polyak-Lojasiewicz condition.

Most model-free reinforcement learning methods leverage state representations (embeddings) for generalization, but either ignore structure in the space of actions or assume the structure is provided a priori. We show how a policy can be decomposed into a component that acts in a low-dimensional space of action represen…

2019-02-01abs ↗pdf ↗

Paper develops a method for causal representation learning from irregular tensors.

problem Complex patterns in high-dimensional, irregular tensor data.
method Novel causal formulation and CaRTeD framework integrating temporal causal representation learning with irregular tensor decomposition.
result Framework provides theoretical guarantees and outperforms state-of-the-art techniques.

In this paper, we establish Basmajian's identity for (1,1,2)(1,1,2)-hyperconvex Anosov representations from a free group into PGL(n,R)PGL(n, R). We then study our series identities on holomorphic families of Cantor non-conformal repellers associated to complex (1,1,2)(1,1,2)-hyperconvex Anosov representations. We show that the series …

2019-09-24abs ↗pdf ↗

PFedRL-Rep learns shared and personalized policies for heterogeneous environments.

problem Poor performance of single policy in heterogeneous environments.
method Develops PFedRL-Rep framework with shared feature representation and personalized weights.
result Proves linear convergence speedup with respect to the number of agents.

The paper proves a criterion for L-space knots and their representations.

problem Conditions for abelian SL(2,R)\mathrm{SL}(2,\mathbb{R})-representations of knot groups.
method Continuous family of irreducible representations converging to abelian representations.
result Alexander polynomial of nontrivial L-space knots has odd order on the unit circle.

For N2N \geq 2, we study a certain sequence (ρp(cp))(ρ_p^{(c_p)}) of N-dimensional representations of the mapping class group of the one-holed torus arising from SO(3)-TQFT, and show that the conjecture of Andersen, Masbaum, and Ueno \cite{1} holds for these representations. This is done by proving that, in a certain basis a…

2012-02-08abs ↗pdf ↗