arXiv research

New algorithm solves maximal monotone inclusion problems.

New algorithms solve nonconvex federated learning problems efficiently.

Online and stochastic learning has emerged as powerful tool in large scale optimization. In this work, we generalize the Douglas-Rachford splitting (DRs) method for minimizing composite functions to online and stochastic settings (to our best knowledge this is the first time DRs been generalized to sequential version).…

We adapt the Douglas-Rachford (DR) splitting method to solve nonconvex feasibility problems by studying this method for a class of nonconvex optimization problem. While the convergence properties of the method for convex problems have been well studied, far less is known in the nonconvex setting. In this paper, for the…

New algorithms solve monotone inclusions and convex-concave minimax problems.

The Douglas Rachford algorithm is an algorithm that converges to a minimizer of a sum of two convex functions. The algorithm consists in fixed point iterations involving computations of the proximity operators of the two functions separately. The paper investigates a stochastic version of the algorithm where both funct…

Convex optimization is an essential tool for machine learning, as many of its problems can be formulated as minimization problems of specific objective functions. While there is a large variety of algorithms available to solve convex problems, we can argue that it becomes more and more important to focus on efficient, …

We revisit the classical Douglas-Rachford (DR) method for finding a zero of the sum of two maximal monotone operators. Since the practical performance of the DR method crucially depends on the stepsizes, we aim at developing an adaptive stepsize rule. To that end, we take a closer look at a linear case of the problem a…

Optimization is at the heart of machine learning, statistics and many applied scientific disciplines. It also has a long history in physics, ranging from the minimal action principle to finding ground states of disordered systems such as spin glasses. Proximal algorithms form a class of methods that are broadly applica…

Derives error formula for convex regression in high dimensions.

In this paper we develop proximal methods for statistical learning. Proximal point algorithms are useful in statistics and machine learning for obtaining optimization solutions for composite functions. Our approach exploits closed-form solutions of proximal operators and envelope representations based on the Moreau, Fo…

SPlit optimizes dataset splitting for better model performance.

The paper extends keenness concept to bridge splittings and finds conditions for existence.

Non-split almost complex supermanifolds and non-split Riemannian supermanifolds are studied. The first obstacle for a splitting is parametrized by group orbits on an infinite dimensional vector space. Further it is shown that non-split structures appear in the first case as deformations of a split reduction and in the …

Study flippable Heegaard splittings in Seifert fibered spaces.

We study the self-dual Yang-Mills equations in split signature. We give a special solution, called the basic split instanton, and describe the ADHM construction in the split signature. Moreover a split version of t'Hooft ansatz is described.

Paper proposes a novel SVM method for creating survival trees.

New methods improve prediction regions for high-dimensional data.

New spheres can split a 4D link in ways not possible in 3D.

This paper studies properties of weak reducing pairs in critical Heegaard splittings.

We show that if a split link is obtained from a split link $L$ in $S^3$ by $1/n$-Dehn surgery along a trivial knot $C$, then the link $L\cup C$ is splittable. That is to say, it is impossible to obtain a split link from a split link via a non-trivial twisting. As its corollary, we completely determine when a trivial li…

Study evaluates when splitting classifiers can improve performance despite disparate treatment.

New methods convert complex link presentations to simpler, recognizable forms.

The splitting number of a link is the minimal number of crossing changes between different components required, on any diagram, to convert it to a split link. We introduce new techniques to compute the splitting number, involving covering links and Alexander invariants. As an application, we completely determine the sp…

New proof of Lorentzian splitting theorems using elliptic operators.

Little is known on the classification of Heegaard splittings for hyperbolic 3-manifolds. Although Kobayashi gave a complete classification of Heegaard splittings for the exteriors of 2-bridge knots, our knowledge of other classes is extremely limited. In particular, there are very few hyperbolic manifolds that are know…

New proof of Giroux Correspondence for tight contact 3-manifolds.

Let M_1 and M_2 be compact, orientable 3-manifolds, and M the manifold obtained by gluing some component F of \bdy M_1 to some component of \bdy M_2 by a homeomorphism φ. We show that when φis "sufficiently complicated" then (1) the amalgamation of low genus, unstabilized, boundary-unstabilized Heegaard splittings of M…

Minimal splitting factors help study scalar curvature constraints.

Non-isotopic Heegaard splittings of non-minimal genus were known previously only for very special 3-manifolds. We show in this paper that they are in fact a wide spread phenomenon in 3-manifold theory: We exhibit a large class of knots and manifolds obtained by Dehn surgery on these knots which admit such splittings. M…

Introduces nonlinear splittings on fibre bundles for generalizing connections.

We define a notion of Hempel distance for one-sided Heegaard splittings and show that the existence of alternate surfaces restricts distance for one-sided splittings in a manner similar to Hartshorn's and Scharlemann-Tomova's results for two-sided splittings. We also show that every geometrically compressible one-sided…

New method escapes local optima in neural architecture optimization.

We explicitly compute the lower algebraic K-theory of the split three-dimensional crystallographic groups; i.e., the groups G that act properly and cocompactly on three-dimensional Euclidean space by isometries, such that the natural map from G to O(3) is a split injection onto its image. There are 73 split three-dimen…

We describe an example of a closed orientable 3-manifold with distinct distance three genus two Heegaard splittings. This demonstrates that the constructions of alternate genus two Heegaard splittings of closed orientable 3-manifolds described by Rubinstein and Scharlemann in their 1998 paper Genus Two Heegaard Splitti…

Casson and Gordon gave the rectangle condition for strong irreducibility of Heegaard splittings [1]. We give a parity condition for irreducibility of Heegaard splittings of irreducible manifolds. As an application, we give examples of non-stabilized Heegaard splittings by doing a single Dehn twist.

Using basic properties of one-sided Heegaard splittings, a direct proof that geometrically compressible one-sided splittings of RP^3 are stabilised is given. The argument is modelled on that used by Waldhausen to show that two-sided splittings of S^3 are standard.

New approach connects stochastic gradient descent to ODE splitting schemes.

Let M be a totally orientable graph manifold with characteristic submanifold T and let M = V cup_S W be a Heegaard splitting. We prove that S is standard. In particular, S is the amalgamation of strongly irreducible Heegaard splittings. The splitting surfaces S_i of these strongly irreducible Heegaard splittings have t…

The splitting number of a link is the minimum number of crossing changes between distinct components that is required to convert the link into a split link. We provide a bound on the splitting number in terms of the four-genus of related knots.

Extend Kauffman bracket skein module to homology theory using Heegaard splittings

A new method for kernel tests without data splitting increases power.

This paper studies Heegaard splittings of surface bundles via the curve complex of the fibre. The translation distance of the monodromy is the smallest distance it moves any vertex of the curve complex. We prove that the translation distance is bounded above in terms of the genus of any strongly irreducible Heegaard sp…

We show that if a Heegaard splitting is obtained by gluing a splitting of Hempel distance at least 4 and the genus-1 splitting of $S^2 \times S^1$, then the Goeritz group of the splitting is finitely generated. To show this, we first provide a sufficient condition for a full subcomplex of the arc complex for a compact …

Twinning splits data into fast, statistically similar sets.

We construct families of manifolds that have pairs of genus $g$ Heegaard splittings that must be stabilized roughly $g$ times to become equivalent. We also show that when two unstabilized, boundary-unstabilized Heegaard splittings are amalgamated by a "sufficiently complicated" map, the resulting splitting is unstabili…

A Heegaard splitting which admits a unique pair of disjoint compression disks on distinct sides is said to be keen weakly reducible. This paper provides an construction of keen weakly reducible Heegaard splittings of arbitrary genus except 2. Furthermore, critical Heegaard splittings may yield if we change some conditi…

The study examines stock splits and their effects on companies, managers, and shareholders.