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

98196294392 · Jun 202019922001200920172026
48 results for Platonic Representation Hypothesis

Proof confirms perfect representation in deep learning models.

problem Tackles the perfect Platonic Representation Hypothesis in deep learning models.
method Detailed proof using stochastic gradient descent (SGD) and analysis of global minima.
result SGD trains EDLNs to learn the same representation up to rotation, suggesting emergent entropic forces.

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.

The paper explains emergent phenomena in deep learning using entropic forces.

problem Understanding the cause of emergent phenomena in deep learning and large language models.
method Proposes a rigorous entropic-force theory for neural networks trained with SGD and variants.
result Shows that representation learning is governed by emergent entropic forces that break continuous symmetries and preserve discrete ones.

We borrow a classical construction from the study of rational billiards in dynamical systems known as the "unfolding construction" and show that it can be used to study the automorphism group of a Platonic surface. More precisely, the monodromy group, or deck group in this case, associated to the cover of a regular pol…

2018-11-16abs ↗pdf ↗

We construct new embedded self-shrinkers of genus 3, 5, 7, 11 and 19 using variational methods. Our self-shrinkers resemble doublings of the Platonic solids and were discovered numerically by D. Chopp in 1994.

2016-02-23abs ↗pdf ↗

A spherical topological manifold of dimension n-1 forms a prototile on its cover, the (n-1)-sphere. The tiling is generated by the fixpoint-free action of the group of deck transformations. By a general theorem, this group is isomorphic to the first homotopy group. Multiplicity and selection rules appear in the form of…

2008-10-19abs ↗pdf ↗

The problem of classifying, upto isometry (or similarity), the orientable spherical, Euclidean and hyperbolic 3-manifolds that arise by identifying the faces of a Platonic solid is formulated in the language of Coxeter groups. In the spherical and hyperbolic cases, this allows us to complete the classification begun by…

2001-04-18abs ↗pdf ↗

Study of translation covers of platonic solids reveals monodromy group structures.

problem Understanding monodromy groups of translation covers of platonic solids.
method Computed Zariski closures using generators, constraints, and Lyapunov spectrum analysis.
result Zariski closures of monodromy groups are powers of SL(2, R).

We study the translation surfaces obtained by considering the unfoldings of the surfaces of Platonic solids. We show that they are all lattice surfaces and we compute the topology of the associated Teichmüller curves. Using an algorithm that can be used generally to compute Teichmüller curves of translation covers of p…

2018-11-09abs ↗pdf ↗

Extends linear representation hypothesis to categorical and hierarchical concepts in LLMs.

problem Representing concepts without natural contrasts in large language models.
method Formalizes linear representation hypothesis for categorical and hierarchical concepts, proving relationships between concept hierarchy and representation geometry.
result Validated theoretical results on large language models, estimating representations for 900+ concepts.

A framework for hypothesis testing on attributed graphs using sampling.

problem Statistical testing on graph data, especially large attributed graphs.
method Sampling-based framework with PHASE and PHASEopt for accurate and efficient hypothesis testing.
result PHASE and PHASEopt improve accuracy and efficiency of hypothesis testing in attributed graphs.

If all but two vertices of a triangulated sphere have degrees divisible by kk, then the exceptional vertices are not adjacent. This theorem is proved for k=2k=2 with the help of the coloring monodromy. For k=3,4,5k = 3, 4, 5 colorings by the vertices of platonic solids have to be used. With a coloring monodromy one can asso…

2015-03-02abs ↗pdf ↗

The paper defines a hypothesis space for deep learning using DNNs.

problem Developing a mathematical framework for deep learning.
method Introducing a Banach space of functions of input variables based on DNNs, proving it's a RKBS, and establishing representer theorems for learning models.
result Solutions to learning problems can be expressed as finite sums of kernel expansions based on training data.

MSA compares neural representations' intrinsic geometry for better understanding.

problem Existing similarity measures fail to capture subtle distinctions between neural network solutions.
method Metric similarity analysis (MSA) using Riemannian geometry.
result MSA can disentangle features of neural computations and compare nonlinear dynamics.

Method measures weight similarity in neural networks using normalization and statistical inference.

problem Quantifying weight similarity in non-convex neural networks.
method Chain normalization rule and hypothesis-training-testing statistical inference.
result Weights of identical neural networks converge to similar local solutions.

Differential privacy is a statistical concept that can be explained through hypothesis testing.

problem Formalizing differential privacy as a statistical concept.
method Using David Blackwell's informativeness theorem, the paper shows differential privacy can be understood through hypothesis testing.
result The definition of ff-differential privacy provides a unified framework for analyzing privacy bounds.

IMA addresses non-identifiability in nonlinear ICA by assuming orthogonal Jacobian columns.

problem Non-identifiability in nonlinear ICA.
method IMA assumes orthogonal Jacobian columns and extends to manifold settings.
result IMA circumvents non-identifiability issues and can be beneficial for higher-dimensional observations.

Semi-Equivelar maps are generalizations of Archimedean Solids (as are equivelar maps of the Platonic solids) to the surfaces other than 22-Sphere. We classify some semi equivelar maps on surface of Euler characteristic -1 and show that none of these are vertex transitive. We establish existence of 12-covered triangula…

2011-01-04abs ↗pdf ↗

The paper explores linear representations in language models using counterfactuals.

problem Understanding linear representations and geometric concepts in large language models.
method Formalized linear representation in output and input spaces, identified causal inner product.
result Unified understanding of linear representations and their connection to interpretation and control.

Probably the most important problem in machine learning is the preliminary biasing of a learner's hypothesis space so that it is small enough to ensure good generalisation from reasonable training sets, yet large enough that it contains a good solution to the problem being learnt. In this paper a mechanism for {\em aut…

2019-11-13abs ↗pdf ↗

The paper refutes the manifold hypothesis for image data and proposes the union of manifolds hypothesis.

problem The manifold hypothesis fails to capture the structure of image data.
method Empirical verification of the union of manifolds hypothesis on image datasets.
result Image data lies on a disconnected set with varying intrinsic dimensions.

This work lists and describes the main recent strategies for building fixed-length, dense and distributed representations for words, based on the distributional hypothesis. These representations are now commonly called word embeddings and, in addition to encoding surprisingly good syntactic and semantic information, ha…

2019-01-25abs ↗pdf ↗

Let ΣgΣ_g be a compact, connected, orientable surface of genus g2g \geq 2. We ask for a parametrization of the discrete, faithful, totally loxodromic representations in the deformation space Hom(π1(Σg),SU(3,1))/SU(3,1){\rm Hom}(π_1(Σ_g), {\rm SU}(3,1))/{\rm SU}(3,1). We show that such a representation, under some hypothesis, can be determined …

2014-11-25abs ↗pdf ↗

A classical result of H. S. M. Coxeter asserts that a certain quotient B(m,n)B(m,n) of the braid group B(m)B(m) on mm strands is finite if and only if (m,n)(m,n) corresponds to the type of one of the five Platonic solids. If k{\bf k} is a knot or virtual knot, one can study similar quotients G(k,n)G({\bf k}, n) for the correspond…

2015-05-23abs ↗pdf ↗

New method reduces bias in NLI models using ensemble adversarial training.

problem Spurious correlations between hypotheses and entailment classes in NLI datasets.
method Adversarial training with an ensemble of classifiers to reduce bias in sentence representations.
result Ensemble adversarial training produces more robust NLI models, outperforming previous methods.

Unified theory for representation learning using learnable functions.

problem Insufficient theoretical understanding of unsupervised and self-supervised learning.
method Discriminative theoretical framework for analyzing sample complexity.
result Learnable regularization functions can reduce the amount of labeled data needed.