131,228 research outputs found
Learning Combinatorial Embedding Networks for Deep Graph Matching
Graph matching refers to finding node correspondence between graphs, such
that the corresponding node and edge's affinity can be maximized. In addition
with its NP-completeness nature, another important challenge is effective
modeling of the node-wise and structure-wise affinity across graphs and the
resulting objective, to guide the matching procedure effectively finding the
true matching against noises. To this end, this paper devises an end-to-end
differentiable deep network pipeline to learn the affinity for graph matching.
It involves a supervised permutation loss regarding with node correspondence to
capture the combinatorial nature for graph matching. Meanwhile deep graph
embedding models are adopted to parameterize both intra-graph and cross-graph
affinity functions, instead of the traditional shallow and simple parametric
forms e.g. a Gaussian kernel. The embedding can also effectively capture the
higher-order structure beyond second-order edges. The permutation loss model is
agnostic to the number of nodes, and the embedding model is shared among nodes
such that the network allows for varying numbers of nodes in graphs for
training and inference. Moreover, our network is class-agnostic with some
generalization capability across different categories. All these features are
welcomed for real-world applications. Experiments show its superiority against
state-of-the-art graph matching learning methods.Comment: ICCV2019 oral. Code available at
https://github.com/Thinklab-SJTU/PCA-G
New results about multi-band uncertainty in Robust Optimization
"The Price of Robustness" by Bertsimas and Sim represented a breakthrough in
the development of a tractable robust counterpart of Linear Programming
Problems. However, the central modeling assumption that the deviation band of
each uncertain parameter is single may be too limitative in practice:
experience indeed suggests that the deviations distribute also internally to
the single band, so that getting a higher resolution by partitioning the band
into multiple sub-bands seems advisable. The critical aim of our work is to
close the knowledge gap about the adoption of a multi-band uncertainty set in
Robust Optimization: a general definition and intensive theoretical study of a
multi-band model are actually still missing. Our new developments have been
also strongly inspired and encouraged by our industrial partners, which have
been interested in getting a better modeling of arbitrary distributions, built
on historical data of the uncertainty affecting the considered real-world
problems. In this paper, we study the robust counterpart of a Linear
Programming Problem with uncertain coefficient matrix, when a multi-band
uncertainty set is considered. We first show that the robust counterpart
corresponds to a compact LP formulation. Then we investigate the problem of
separating cuts imposing robustness and we show that the separation can be
efficiently operated by solving a min-cost flow problem. Finally, we test the
performance of our new approach to Robust Optimization on realistic instances
of a Wireless Network Design Problem subject to uncertainty.Comment: 15 pages. The present paper is a revised version of the one appeared
in the Proceedings of SEA 201
Role models for complex networks
We present a framework for automatically decomposing ("block-modeling") the
functional classes of agents within a complex network. These classes are
represented by the nodes of an image graph ("block model") depicting the main
patterns of connectivity and thus functional roles in the network. Using a
first principles approach, we derive a measure for the fit of a network to any
given image graph allowing objective hypothesis testing. From the properties of
an optimal fit, we derive how to find the best fitting image graph directly
from the network and present a criterion to avoid overfitting. The method can
handle both two-mode and one-mode data, directed and undirected as well as
weighted networks and allows for different types of links to be dealt with
simultaneously. It is non-parametric and computationally efficient. The
concepts of structural equivalence and modularity are found as special cases of
our approach. We apply our method to the world trade network and analyze the
roles individual countries play in the global economy
Weakly-Supervised Action Segmentation with Iterative Soft Boundary Assignment
In this work, we address the task of weakly-supervised human action
segmentation in long, untrimmed videos. Recent methods have relied on expensive
learning models, such as Recurrent Neural Networks (RNN) and Hidden Markov
Models (HMM). However, these methods suffer from expensive computational cost,
thus are unable to be deployed in large scale. To overcome the limitations, the
keys to our design are efficiency and scalability. We propose a novel action
modeling framework, which consists of a new temporal convolutional network,
named Temporal Convolutional Feature Pyramid Network (TCFPN), for predicting
frame-wise action labels, and a novel training strategy for weakly-supervised
sequence modeling, named Iterative Soft Boundary Assignment (ISBA), to align
action sequences and update the network in an iterative fashion. The proposed
framework is evaluated on two benchmark datasets, Breakfast and Hollywood
Extended, with four different evaluation metrics. Extensive experimental
results show that our methods achieve competitive or superior performance to
state-of-the-art methods.Comment: CVPR 201
- …