arXiv research

Quantum algorithm speeds up MIP solving by a near-quadratic factor.

Improved neural network verification using Lagrangian decomposition and parallel algorithms.

We show that an entire branched cover of finite distortion cannot have a compact branch set if its distortion satisfies a certain asymptotic growth condition. We furthermore show that this bound is strict by constructing an entire, continuous, open and discrete mapping of finite distortion which is piecewise smooth, ha…

Paper uses RL to optimize branching strategy in B&B algorithms.

Branch-and-bound (BnB) algorithms are widely used to solve combinatorial problems, and the performance crucially depends on its branching heuristic.In this work, we consider a typical problem of maximum common subgraph (MCS), and propose a branching heuristic inspired from reinforcement learning with a goal of reaching…

Branch and Bound (B&B) is the exact tree search method typically used to solve Mixed-Integer Linear Programming problems (MILPs). Learning branching policies for MILP has become an active research area, with most works proposing to imitate the strong branching rule and specialize it to distinct classes of problems. We …

Extends branch and bound for probabilistic neural network verification.

Uniformly branching trees are equivalent to certain metric spaces.

A new Branch-and-Bound solver tackles L0-penalized problems with flexible loss functions.

IBP-R improves verified adversarial robustness with simple, effective interval bound propagation.

The paper proposes modern computational methods for optimizing reinsurance contracts.

Combinatorial optimization problems are typically tackled by the branch-and-bound paradigm. We propose a new graph convolutional neural network model for learning branch-and-bound variable selection policies, which leverages the natural variable-constraint bipartite graph representation of mixed-integer linear programs…

Knots generating infinite subgroup bound rational homology balls.

In this paper, we firstly extend Theorem 5.1.1 in \cite {Helein} due to Hélein to a rescaled branched conformal immersed sequence(c.f. Theorem 1.5). By virtue of this local convergence theorem, we study the blowup behavior of a sequence of branched conformal immersions of closed Riemannian surface in $\mathbb{R}^{n}$ w…

We study the curvature of metric spaces and branched covers of Riemannian manifolds, with applications in topology and algebraic geometry. Here curvature bounds are expressed in terms of the CAT(k) inequality. We prove a general CAT(k) extension theorem, giving sufficient conditions on and near the boundary of a locall…

We identify branched coverings (continuous open surjections p:Y->X of Hausdorff spaces with uniformly bounded number of pre-images) with Hilbert C*-modules C(Y) over C(X) and with faithful unital positive conditional expectations E:C(Y)->C(X) topologically of index-finite type. The case of non-branched coverings corres…

We consider closed orientable 3-dimensional hyperbolic manifolds which are cyclic branched coverings of the 3-sphere, with branching set being a two-bridge knot (or link). We establish two-sided linear bounds depending on the order of the covering for the Matveev complexity of the covering manifold. The lower estimate …

New knots bound rational homology balls, using Alexander polynomials.

The article classifies cubiquitous sublattices and applies them to branched covers.

Branched covers are applied frequently in topology - most prominently in the construction of closed oriented PL d-manifolds. In particular, strong bounds for the number of sheets and the topology of the branching set are known for dimension d<=4. On the other hand, Izmestiev and Joswig described how to obtain a simplic…

Uniform bounds on ends for non-branching CD spaces with nonnegative curvature outside a compact set.

Stability of branched immersions with energy constraints.

A new algorithm optimizes Gaussian process posterior mean functions efficiently.

Harmonic maps from surfaces to CAT(k) spheres are branched coverings.

New examples show strong Kato limits can be branching and not satisfy known conditions.

Improved phylogenetic tree reconstruction using flexible branch length distributions.

For a given knot, we study the minimal number of positive eigenvalues of the double branched cover over spanning surfaces for the knot. The value gives a lower bound for various genera, the dealternating number and the alternation number of knots, and we prove that Batson's bound for the non-orientable 4-genus gives an…

Study on bending deformations in hyperbolic manifolds, generalizing Johnson and Millson's work.

We study branched covering spaces in several contexts, proving that under suitable circumstances the cover satisfies the same upper curvature bounds as the base space. The first context is of a branched cover of an arbitrary metric space that satisfies Alexandrov's curvature condition CAT(k), over an arbitrary complete…

We compute exact values respectively bounds of "distances" - in the sense of (transforms of) power divergences and relative entropy - between two discrete-time Galton-Watson branching processes with immigration GWI for which the offspring as well as the immigration is arbitrarily Poisson-distributed (leading to arbitra…

New hybrid model reduces MILP solver time by up to 26%.

Formal verification of neural networks is essential for their deployment in safety-critical areas. Many available formal verification methods have been shown to be instances of a unified Branch and Bound (BaB) formulation. We propose a novel framework for designing an effective branching strategy for BaB. Specifically,…

Proposes a new metric space example showing non-constant topological dimension.

New method solves matrix completion problems to certifiable optimality.

The paper bounds the index of CMC surfaces with capillary boundary.

Study shows $(2,1)$-cable of figure-eight knot can't be smoothly sliced.

Study on minimal surfaces with constraints on index and branching order.

We prove existence and a.e. regularity of an area minimizing soap film with a bound on energy spanning a given Jordan curve in R^3. The energy of a film is defined to be the sum of its surface area and the length of its singular branched set. The class of surfaces over which area is minimized includes images of disks, …

We consider a homology sphere $M_n(K_1,K_2)$ presented by two knots $K_1,K_2$ with linking number 1 and framing $(0,n)$. We call the manifold {\it Matsumoto's manifold}. We show that there exists no contractible bound of $M_n(T_{2,3},K_2)$ if $n<2τ(K_2)$ holds. We also give a formula of Ozsváth-Szabó's $τ$-invariant as…

Study on framed surfaces with bounds on Morse index.

The study introduces hyperbolic angles in Lorentzian spaces and characterizes curvature bounds.

Let $F_n :(Σ, h_n) \to \mathbb C^2$ be a sequence of conformally immersed Lagrangian self-shrinkers with a uniform area upper bound to the mean curvature flow, and suppose that the sequence of metrics $\{h_n\}$ converges smoothly to a Riemannian metric $h$. We show that a subsequence of $\{F_n\}$ converges smoothly to …

New algorithm solves large cardinality-constrained clustering problems.

In this paper we investigate the relationship between a general existence of transport maps of optimal couplings with absolutely continuous first marginal and the property of the background measure called essentially non-branching introduced by Rajala-Sturm (Calc.Var.PDE 2014). In particular, it is shown that the quali…

There is no known efficient method for selecting k Gaussian features from n which achieve the lowest Bayesian classification error. We show an example of how greedy algorithms faced with this task are led to give results that are not optimal. This motivates us to propose a more robust approach. We present a Branch and …

Graph Neural Networks learn to mimic strong branching in MILP solvers.

This paper extends the work in [Suzuki, 1996] and presents an efficient depth-first branch-and-bound algorithm for learning Bayesian network structures, based on the minimum description length (MDL) principle, for a given (consistent) variable ordering. The algorithm exhaustively searches through all network structures…

A GPU framework speeds up BnB for discrete optimization problems.