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.
Graph Neural Networks learn to mimic strong branching in MILP solvers.
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…
Quantum algorithm speeds up MIP solving by a near-quadratic factor.
Improved neural network verification using Lagrangian decomposition and parallel algorithms.
New method decomposes corrupted data matrices into sparse and low-rank components.
Neuro# learns heuristics to speed up #SAT solvers.
Recently two search algorithms, A* and breadth-first branch and bound (BFBnB), were developed based on a simple admissible heuristic for learning Bayesian network structures that optimize a scoring function. The heuristic represents a relaxation of the learning problem such that each variable chooses optimal parents in…
This paper proposes a new dimensionality reduction algorithm named branching embedding (BE). It converts a dendrogram to a two-dimensional scatter plot, and visualizes the inherent structures of the original high-dimensional data. Since the conversion part is not computationally demanding, the BE algorithm would be ben…
We present the Integrated Size and Price Optimization Problem (ISPO) for a fashion discounter with many branches. Based on a two-stage stochastic programming model with recourse, we develop an exact algorithm and a production-compliant heuristic that produces small optimality gaps. In a field study we show that a distr…
We propose the new Top-Dog-Index to quantify the historic deviation of the supply data of many small branches for a commodity group from sales data. On the one hand, the common parametric assumptions on the customer demand distribution in the literature could not at all be supported in our real-world data set. On the o…
Paper uses RL to optimize branching strategy in B&B algorithms.
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,…
Several models of stock trading [P. Bak et al, Physica A {\bf 246}, 430 (1997)] are analyzed in analogy with one-dimensional, two-species reaction-diffusion-branching processes. Using heuristic and scaling arguments, we show that the short-time market price variation is subdiffusive with a Hurst exponent . Biase…
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…
IBP-R improves verified adversarial robustness with simple, effective interval bound propagation.
In classical differential geometry, a central question has been whether abstract surfaces with given geometric features can be realized as surfaces in Euclidean space. Inspired by the rich theory of embedded triply periodic minimal surfaces, we seek examples of triply periodic polyhedral surfaces that have an identifia…
Develops a machine learning method for parameter estimation in branching processes models.
A new model tracks indices without rebalancing, solving NP-hard problems.
GLSearch uses GNN to learn efficient search strategies for finding large common subgraphs.
Integer programming (IP) is a general optimization framework widely applicable to a variety of unstructured and structured problems arising in, e.g., scheduling, production planning, and graph optimization. As IP models many provably hard to solve problems, modern IP solvers rely on many heuristics. These heuristics ar…
New method solves matrix completion problems to certifiable optimality.
Adapting neural networks to guide program optimization for better classifiers.
The game of Chinese Checkers is a challenging traditional board game of perfect information that differs from other traditional games in two main aspects: first, unlike Chess, all checkers remain indefinitely in the game and hence the branching factor of the search tree does not decrease as the game progresses; second,…
DMTG groups tasks for multi-task learning in one shot.
New method speeds up model selection for complex scientific tasks.
Study on moduli spaces of branched projective structures on surfaces.
We define a laminar branched surface to be a branched surface satisfying the following conditions: (1) Its horizontal boundary is incompressible; (2) there is no monogon; (3) there is no Reeb component; (4) there is no sink disk (after eliminating trivial bubbles in the branched surface). The first three conditions are…
Graph neural networks improve solving linear optimization problems.
New algorithm solves complex variable selection problems in high dimensions.
New criterion for branched covers between 2-spheres.
Given a branched covering of degree d between closed surfaces, it determines a collection of partitions of d, the branch data. In this work we show that any branch data are realized by an indecomposable primitive branched covering on a connected close surface N with Euler's characteristic less than or equal to 0. This …
Uniformly branching trees are equivalent to certain metric spaces.
The paper studies which branched covers can be lifted to braided embeddings.
We consider 3-dimensional pseudo-manifolds M with a given set of marked point V such that M-V is the interior of a compact 3-manifold with boundary. An ideal triangulation T of (M, V ) has V as its set of vertices. A branching (T, b) enhances T to a Delta-complex. Branched triangulations of (M, V ) are considered up to…
The paper details folding of branched covers of the 3-sphere over knots.
In this work we characterize branch data of branched coverings of even degree over the projective plane which are realizable by indecomposable branched coverings.
Course on knots using branched coverings.
New method learns better branching policies for MILP problems.
A branched covering surface-knot is a surface-knot in the form of a branched covering over an oriented surface-knot , where we include the case when the covering has no branch points. A branched covering surface-knot is presented by a graph called a chart on a surface diagram of . We can simplify a branched cover…
Techniques for constructing codimension 2 embeddings and immersions of the 2 and 3-fold branched covers of the 3 and 4-dimensional spheres are presented. These covers are in braided form, and it is in this sense that they are folded. More precisely the composition of the embedding (or immersion) and the canonical proje…
Formula compares metrics on branched coverings of line bundles.
A branched covering surface-knot is a surface-knot in the form of a branched covering over a surface-knot. For a branched covering surface-knot, we have a numerical invariant called the simplifying number. We show that branched covering surface-knots with degree three have the simplifying numbers less than three.
New examples show transverse knots are determined by their branched covers.
We establish a calculus for branched spines of 3-manifolds by means of branched Matveev-Piergallini moves and branched bubble-moves. We briefly indicate some of its possible applications in the study and definition of State-Sum Quantum Invariants.
Quantized Coulomb branches linked to skein algebras.
Characterizes groups of branched twist-spun knots.
We prove that if S is a closed compact surface of negative Euler characteristic, and if R is a quasi-Fuchsian representation in PSL(2,C), then the deformation space M(k,R) of branched projective structures on S with total branching order k and holonomy R is connected, as soon as k>0. Equivalently, two branched projecti…
We provide criteria ensuring that a tunnel number one knot is not determined by its double branched cover, in the sense that the double branched cover is also the double branched cover of a knot not equivalent to .