6,371 research outputs found
Laplacian Mixture Modeling for Network Analysis and Unsupervised Learning on Graphs
Laplacian mixture models identify overlapping regions of influence in
unlabeled graph and network data in a scalable and computationally efficient
way, yielding useful low-dimensional representations. By combining Laplacian
eigenspace and finite mixture modeling methods, they provide probabilistic or
fuzzy dimensionality reductions or domain decompositions for a variety of input
data types, including mixture distributions, feature vectors, and graphs or
networks. Provable optimal recovery using the algorithm is analytically shown
for a nontrivial class of cluster graphs. Heuristic approximations for scalable
high-performance implementations are described and empirically tested.
Connections to PageRank and community detection in network analysis demonstrate
the wide applicability of this approach. The origins of fuzzy spectral methods,
beginning with generalized heat or diffusion equations in physics, are reviewed
and summarized. Comparisons to other dimensionality reduction and clustering
methods for challenging unsupervised machine learning problems are also
discussed.Comment: 13 figures, 35 reference
Higher-order Projected Power Iterations for Scalable Multi-Matching
The matching of multiple objects (e.g. shapes or images) is a fundamental
problem in vision and graphics. In order to robustly handle ambiguities, noise
and repetitive patterns in challenging real-world settings, it is essential to
take geometric consistency between points into account. Computationally, the
multi-matching problem is difficult. It can be phrased as simultaneously
solving multiple (NP-hard) quadratic assignment problems (QAPs) that are
coupled via cycle-consistency constraints. The main limitations of existing
multi-matching methods are that they either ignore geometric consistency and
thus have limited robustness, or they are restricted to small-scale problems
due to their (relatively) high computational cost. We address these
shortcomings by introducing a Higher-order Projected Power Iteration method,
which is (i) efficient and scales to tens of thousands of points, (ii)
straightforward to implement, (iii) able to incorporate geometric consistency,
(iv) guarantees cycle-consistent multi-matchings, and (iv) comes with
theoretical convergence guarantees. Experimentally we show that our approach is
superior to existing methods
Pole Placement and Reduced-Order Modelling for Time-Delayed Systems Using Galerkin Approximations
The dynamics of time-delayed systems (TDS) are governed by delay differential equa-
tions (DDEs), which are infinite dimensional and pose computational challenges. The
Galerkin approximation method is one of several techniques to obtain the spectrum of DDEs
for stability and stabilization studies. In the literature, Galerkin approximations for DDEs
have primarily dealt with second-order TDS (second-order Galerkin method), and the for-
mulations have resulted in spurious roots, i.e., roots that are not among the characteristic
roots of the DDE. Although these spurious roots do not affect stability studies, they never-
theless add to the complexity and computation time for control and reduced-order modelling
studies of DDEs. A refined mathematical model, called the first-order Galerkin method, is
proposed to avoid spurious roots, and the subtle differences between the two formulations
(second-order and first-order Galerkin methods) are highlighted with examples.
For embedding the boundary conditions in the first-order Galerkin method, a new
pseudoinverse-based technique is developed. This method not only gives the exact location
of the rightmost root but also, on average, has a higher number of converged roots when
compared to the existing pseudospectral differencing method. The proposed method is
combined with an optimization framework to develop a pole-placement technique for DDEs
to design closed-loop feedback gains that stabilize TDS. A rotary inverted pendulum system
apparatus with inherent sensing delays as well as deliberately introduced time delays is used
to experimentally validate the Galerkin approximation-based optimization framework for the
pole placement of DDEs.
Optimization-based techniques cannot always place the rightmost root at the desired
location; also, one has no control over the placement of the next set of rightmost roots.
However, one has the precise location of the rightmost root. To overcome this, a pole-
placement technique for second-order TDS is proposed, which combines the strengths of the
method of receptances and an optimization-based strategy. When the method of receptances
provides an unsatisfactory solution, particle swarm optimization is used to improve the
location of the rightmost pole. The proposed approach is demonstrated with numerical
studies and is validated experimentally using a 3D hovercraft apparatus.
The Galerkin approximation method contains both converged and unconverged roots
of the DDE. By using only the information about the converged roots and applying the
eigenvalue decomposition, one obtains an r-dimensional reduced-order model (ROM) of the
DDE. To analyze the dynamics of DDEs, we first choose an appropriate value for r; we
then select the minimum value of the order of the Galerkin approximation method system
at which at least r roots converge. By judiciously selecting r, solutions of the ROM and the
original DDE are found to match closely. Finally, an r-dimensional ROM of a 3D hovercraft
apparatus in the presence of delay is validated experimentally
- …