Multi-Source Multi-View Clustering via Discrepancy Penalty

With the advance of technology, entities can be observed in multiple views. Multiple views containing different types of features can be used for clustering. Although multi-view clustering has been successfully applied in many applications, the previous methods usually assume the complete instance mapping between different views. In many real-world applications, information can be gathered from multiple sources, while each source can contain multiple views, which are more cohesive for learning. The views under the same source are usually fully mapped, but they can be very heterogeneous. Moreover, the mappings between different sources are usually incomplete and partially observed, which makes it more difficult to integrate all the views across different sources. In this paper, we propose MMC (Multi-source Multi-view Clustering), which is a framework based on collective spectral clustering with a discrepancy penalty across sources, to tackle these challenges. MMC has several advantages compared with other existing methods. First, MMC can deal with incomplete mapping between sources. Second, it considers the disagreements between sources while treating views in the same source as a cohesive set. Third, MMC also tries to infer the instance similarities across sources to enhance the clustering performance. Extensive experiments conducted on real-world data demonstrate the effectiveness of the proposed approach

Generative Adversarial Networks (GANs): Challenges, Solutions, and Future Directions

Generative Adversarial Networks (GANs) is a novel class of deep generative models which has recently gained significant attention. GANs learns complex and high-dimensional distributions implicitly over images, audio, and data. However, there exists major challenges in training of GANs, i.e., mode collapse, non-convergence and instability, due to inappropriate design of network architecture, use of objective function and selection of optimization algorithm. Recently, to address these challenges, several solutions for better design and optimization of GANs have been investigated based on techniques of re-engineered network architectures, new objective functions and alternative optimization algorithms. To the best of our knowledge, there is no existing survey that has particularly focused on broad and systematic developments of these solutions. In this study, we perform a comprehensive survey of the advancements in GANs design and optimization solutions proposed to handle GANs challenges. We first identify key research issues within each design and optimization technique and then propose a new taxonomy to structure solutions by key research issues. In accordance with the taxonomy, we provide a detailed discussion on different GANs variants proposed within each solution and their relationships. Finally, based on the insights gained, we present the promising research directions in this rapidly growing field.Comment: 42 pages, Figure 13, Table

Structured Sparsity: Discrete and Convex approaches

Compressive sensing (CS) exploits sparsity to recover sparse or compressible signals from dimensionality reducing, non-adaptive sensing mechanisms. Sparsity is also used to enhance interpretability in machine learning and statistics applications: While the ambient dimension is vast in modern data analysis problems, the relevant information therein typically resides in a much lower dimensional space. However, many solutions proposed nowadays do not leverage the true underlying structure. Recent results in CS extend the simple sparsity idea to more sophisticated {\em structured} sparsity models, which describe the interdependency between the nonzero components of a signal, allowing to increase the interpretability of the results and lead to better recovery performance. In order to better understand the impact of structured sparsity, in this chapter we analyze the connections between the discrete models and their convex relaxations, highlighting their relative advantages. We start with the general group sparse model and then elaborate on two important special cases: the dispersive and the hierarchical models. For each, we present the models in their discrete nature, discuss how to solve the ensuing discrete problems and then describe convex relaxations. We also consider more general structures as defined by set functions and present their convex proxies. Further, we discuss efficient optimization solutions for structured sparsity problems and illustrate structured sparsity in action via three applications.Comment: 30 pages, 18 figure

Generative models of the human connectome

The human connectome represents a network map of the brain's wiring diagram and the pattern into which its connections are organized is thought to play an important role in cognitive function. The generative rules that shape the topology of the human connectome remain incompletely understood. Earlier work in model organisms has suggested that wiring rules based on geometric relationships (distance) can account for many but likely not all topological features. Here we systematically explore a family of generative models of the human connectome that yield synthetic networks designed according to different wiring rules combining geometric and a broad range of topological factors. We find that a combination of geometric constraints with a homophilic attachment mechanism can create synthetic networks that closely match many topological characteristics of individual human connectomes, including features that were not included in the optimization of the generative model itself. We use these models to investigate a lifespan dataset and show that, with age, the model parameters undergo progressive changes, suggesting a rebalancing of the generative factors underlying the connectome across the lifespan.Comment: 38 pages, 5 figures + 19 supplemental figures, 1 tabl

Approaches to integrated strategic/tactical forest planning

Traditionally forest planning is divided into a hierarchy of planning phases. Strategic planning is conducted to make decisions about sustainable harvest levels while taking into account legislation and policy issues. Within the frame of the strategic plan, the purpose of tactical planning is to schedule harvest operations to specific areas in the immediate few years and on a finer time scale than in the strategic plan. The operative phase focuses on scheduling harvest crews on a monthly or weekly basis, truck scheduling and choosing bucking instructions. Decisions at each level are to a varying degree supported by computerized tools. A problem that may arise when planning is divided into levels and that is noted in the literature focusing on decision support tools is that solutions at one level may be inconsistent with the results of another level. When moving from the strategic plan to the tactical plan, three sources of inconsistencies are often present; spatial discrepancies, temporal discrepancies and discrepancies due to different levels of constraint. The models used in the papers presented in this thesis approaches two of these discrepancies. To address the spatial discrepancies, the same spatial resolution has been used at both levels, i.e., stands. Temporal discrepancies are addressed by modelling the tactical and strategic issues simultaneously. Integrated approaches can yield large models. One way of circumventing this is to aggregate time and/or space. The first paper addresses the consequences of temporal aggregation in the strategic part of a mixed integer programming integrated strategic/tactical model. For reference, linear programming based strategic models are also used. The results of the first paper provide information on what temporal resolutions could be used and indicate that outputs from strategic and integrated plans are not particularly affected by the number of equal length strategic periods when more than five periods, i.e. about 20 year period length, are used. The approach used in the first paper could produce models that are very large, and the second paper provides a two-stage procedure that can reduce the number of variables and preserve the allocation of stands to the first 10 years provided by a linear programming based strategic plan, while concentrating tactical harvest activities using a penalty concept in a mixed integer programming formulation. Results show that it is possible to use the approach to concentrate harvest activities at the tactical level in a full scale forest management scenario. In the case study, the effects of concentration on strategic outputs were small, and the number of harvest tracts declined towards a minimum level. Furthermore, the discrepancies between the two planning levels were small