SearcharxivSearch

arXiv subjects

Adam Czapliński

Publications and source records attributed to Adam Czapliński.

7 recordsLinked to original sources

A Simple Strategy to Provable Invariance via Orbit Mapping

Many applications require robustness, or ideally invariance, of neural networks to certain transformations of input data. Most commonly, this requirement is addressed by training data augmentation, using adversarial training, or defining network architectures that include the desired invariance by design. In this work, we propose a method to make network architectures provably invariant with respect to group actions by choosing one element from a (possibly continuous) orbit based on a fixed criterion. In a nutshell, we intend to 'undo' any possible transformation before feeding the data into the actual network. Further, we empirically analyze the properties of different approaches which incorporate invariance via training or architecture, and demonstrate the advantages of our method in terms of robustness and computational efficiency. In particular, we investigate the robustness with respect to rotations of images (which can hold up to discretization artifacts) as well as the provable orientation and scaling invariance of 3D point cloud classification.

cs.CV

Compactified Jacobians of Extended ADE Curves and Lagrangian Fibrations

We observe that general reducible curves in sufficiently positive linear systems on K3 surfaces are of a form that generalises Kodaira's classification of singular elliptic fibres and thus call them extended ADE curves. On such a curve $C$, we describe a compactified Jacobian and show that its components reflect the intersection graph of $C$. This extends known results when $C$ is reduced, but new difficulties arise when $C$ is non-reduced. As an application, we get an explicit description of general singular fibres of certain Lagrangian fibrations of Beauville-Mukai type.

math.AG

Training or Architecture? How to Incorporate Invariance in Neural Networks

Many applications require the robustness, or ideally the invariance, of a neural network to certain transformations of input data. Most commonly, this requirement is addressed by either augmenting the training data, using adversarial training, or defining network architectures that include the desired invariance automatically. Unfortunately, the latter often relies on the ability to enlist all possible transformations, which make such approaches largely infeasible for infinite sets of transformations, such as arbitrary rotations or scaling. In this work, we propose a method for provably invariant network architectures with respect to group actions by choosing one element from a (possibly continuous) orbit based on a fixed criterion. In a nutshell, we intend to 'undo' any possible transformation before feeding the data into the actual network. We analyze properties of such approaches, extend them to equivariant networks, and demonstrate their advantages in terms of robustness as well as computational efficiency in several numerical examples. In particular, we investigate the robustness with respect to rotations of images (which can possibly hold up to discretization artifacts only) as well as the provable rotational and scaling invariance of 3D point cloud classification.

cs.CV

Semi-algebraic properties of Minkowski sums of a twisted cubic segment

We find a semi-algebraic description of the Minkowski sum $\mathcal{A}_{3,n}$ of $n$ copies of the bounded twisted cubic $\{(t,t^2,t^3)\mid -1\leq t\leq 1\}$ for each integer $n\geq3$. These descriptions provide efficient membership tests for the sets $\mathcal{A}_{3,n}$. These membership tests in turn can be used to resolve some instances of the underdetermined matrix moment problem, which was formulated by Michael Rubinstein and Peter Sarnak in order to study problems related to $L$-functions and their zeros.

math.AG

Uniform matrix product states from an algebraic geometer's point of view

We apply methods from algebraic geometry to study uniform matrix product states. Our main results concern the topology of the locus of tensors expressed as uMPS, their defining equations and identifiability. By an interplay of theorems from algebra, geometry and quantum physics we answer several questions and conjectures posed by Critch, Morton and Hackbusch.

math-ph

Curve configurations in the projective plane and their characteristic numbers

In this paper we study the concept of characteristic numbers and Chern slopes in the context of curve configurations in the real and complex projective plane. We show that some extremal line configurations inherit the same asymptotic invariants, namely asymptotic Chern slopes and asymptotic Harbourne constants which sheds some light on relations between the bounded negativity conjecture and the geography problem for surfaces of general type. We discuss some properties of Kummer extensions, especially in the context of ball-quotients. Moreover, we prove that for a certain class of smooth curve configurations in the projective plane their characterstic numbers are bounded by $8/3$.

math.AG