On the flexibility of the design of Multiple Try Metropolis schemes

The Multiple Try Metropolis (MTM) method is a generalization of the classical Metropolis-Hastings algorithm in which the next state of the chain is chosen among a set of samples, according to normalized weights. In the literature, several extensions have been proposed. In this work, we show and remark upon the flexibility of the design of MTM-type methods, fulfilling the detailed balance condition. We discuss several possibilities and show different numerical results

Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers

Building on recent progress at the intersection of combinatorial optimization and deep learning, we propose an end-to-end trainable architecture for deep graph matching that contains unmodified combinatorial solvers. Using the presence of heavily optimized combinatorial solvers together with some improvements in architecture design, we advance state-of-the-art on deep graph matching benchmarks for keypoint correspondence. In addition, we highlight the conceptual advantages of incorporating solvers into deep learning architectures, such as the possibility of post-processing with a strong multi-graph matching solver or the indifference to changes in the training setting. Finally, we propose two new challenging experimental setups. The code is available at https://github.com/martius-lab/blackbox-deep-graph-matchingComment: ECCV 2020 conference pape

Basin-scale phenology and effects of climate variability on global timing of initial seaward migration of Atlantic salmon (Salmo salar)

Migrations between different habitats are key events in the lives of many organisms. Such movements involve annually recurring travel over long distances usually triggered by seasonal changes in the environment. Often, the migration is associated with travel to or from reproduction areas to regions of growth. Young anadromous Atlantic salmon (Salmo salar) emigrate from freshwater nursery areas during spring and early summer to feed and grow in the North Atlantic Ocean. The transition from the freshwater (parr') stage to the migratory stage where they descend streams and enter salt water (smolt') is characterized by morphological, physiological and behavioural changes where the timing of this parr-smolt transition is cued by photoperiod and water temperature. Environmental conditions in the freshwater habitat control the downstream migration and contribute to within- and among-river variation in migratory timing. Moreover, the timing of the freshwater emigration has likely evolved to meet environmental conditions in the ocean as these affect growth and survival of the post-smolts. Using generalized additive mixed-effects modelling, we analysed spatio-temporal variations in the dates of downstream smolt migration in 67 rivers throughout the North Atlantic during the last five decades and found that migrations were earlier in populations in the east than the west. After accounting for this spatial effect, the initiation of the downstream migration among rivers was positively associated with freshwater temperatures, up to about 10 degrees C and levelling off at higher values, and with sea-surface temperatures. Earlier migration occurred when river discharge levels were low but increasing. On average, the initiation of the smolt seaward migration has occurred 2.5days earlier per decade throughout the basin of the North Atlantic. This shift in phenology matches changes in air, river, and ocean temperatures, suggesting that Atlantic salmon emigration is responding to the current global climate changes

Automatically Selecting Inference Algorithms for Discrete Energy Minimisation

Minimisation of discrete energies defined over factors is an important problem in computer vision, and a vast number of MAP inference algorithms have been proposed. Different inference algorithms perform better on factor graph models (GMs) from different underlying problem classes, and in general it is difficult to know which algorithm will yield the lowest energy for a given GM. To mitigate this difficulty, survey papers advise the practitioner on what algorithms perform well on what classes of models. We take the next step forward, and present a technique to automatically select the best inference algorithm for an input GM. We validate our method experimentally on an extended version of the OpenGM2 benchmark, containing a diverse set of vision problems. On average, our method selects an inference algorithm yielding labellings with 96% of variables the same as the best available algorithm

Large scale integer programs in image analysis

An important problem in image analysis is to segment an image into regions with different class-labels. This is releveant in applications in medicine and cartography. In a proper statistical framework this problem may be viewed as a discrete optimization problem. We present two integer linear programming formulations of the problem and study some properties of these models and associated polytopes. Different algorithms for solving these problems are suggested and compared on some realis- tic data. In particular, a Lagrangian algorithm is shown to have a very promising performance. The algorithm is based on the technique of cost splitting and uses the fact that certain relaxed problems may be solved as shortest path problems