arXiv:2607. 13796v1 Announce Type: cross Abstract: This paper establishes a direct analogue of the classical Coding Theorem in the setting of symmetry groups.
Summary generated by The Flow from the publisher's feed. The full article lives at arXiv AI.
arXiv:2507. 05972v3 Announce Type: replace-cross Abstract: Pseudoentropy characterizations give quantitatively precise formulations of the relationship between computational hardness and computational randomness.
arXiv:2607. 10194v1 Announce Type: cross Abstract: We present IsalHG, a method for representing the structure of any finite, connected hypergraph of bounded hyperedge arity as a string over a compact instruction alphabet $\Sigma_{\mathrm{HG}}$.
arXiv:2606. 24418v1 Announce Type: new Abstract: Data augmentation is a simple and model-agnostic approach for exploiting known invariances in learning problems.
arXiv:2607. 21183v1 Announce Type: cross Abstract: The propositional abduction problem is a well-known form of non-monotonic reasoning where we are asked to find an explanation of a given manifestation.
arXiv:2510. 17303v2 Announce Type: replace Abstract: Symmetries are known to improve the empirical performance of machine learning models, yet theoretical guarantees explaining these gains remain limited.
arXiv:2409. 15600v3 Announce Type: replace Abstract: A representation of a molecule or material should be invariant to the symmetries of physics, unique, continuous, efficient and general.