arXiv subjects

Jia Li

Publications and source records attributed to Jia Li.

At least 577 records · Page 32Linked to original sources

arXiv2018

Graph Pattern Matching for Dynamic Team Formation

Finding a list of k teams of experts, referred to as top-k team formation, with the required skills and high collaboration compatibility has been extensively studied. However, existing methods have not considered the specific collaboration relationships among different team members, i.e., structural constraints, which are typically needed in practice. In this study, we first propose a novel graph pattern matching approach for top-k team formation, which incorporates both structural constraints and capacity bounds. Second, we formulate and study the dynamic top-k team formation problem due to the growing need of a dynamic environment. Third, we develop an unified incremental approach, together with an optimization technique, to handle continuous pattern and data updates, separately and simultaneously, which has not been explored before. Finally, using real-life and synthetic data, we conduct an extensive experimental study to show the effectiveness and efficiency of our graph pattern matching approach for (dynamic) top-k team formation.

cs.DB↗

arXiv2017

Aggregated Wasserstein Metric and State Registration for Hidden Markov Models

We propose a framework, named Aggregated Wasserstein, for computing a dissimilarity measure or distance between two Hidden Markov Models with state conditional distributions being Gaussian. For such HMMs, the marginal distribution at any time position follows a Gaussian mixture distribution, a fact exploited to softly match, aka register, the states in two HMMs. We refer to such HMMs as Gaussian mixture model-HMM (GMM-HMM). The registration of states is inspired by the intrinsic relationship of optimal transport and the Wasserstein metric between distributions. Specifically, the components of the marginal GMMs are matched by solving an optimal transport problem where the cost between components is the Wasserstein metric for Gaussian distributions. The solution of the optimization problem is a fast approximation to the Wasserstein metric between two GMMs. The new Aggregated Wasserstein distance is a semi-metric and can be computed without generating Monte Carlo samples. It is invariant to relabeling or permutation of states. The distance is defined meaningfully even for two HMMs that are estimated from data of different dimensionality, a situation that can arise due to missing variables. This distance quantifies the dissimilarity of GMM-HMMs by measuring both the difference between the two marginal GMMs and that between the two transition matrices. Our new distance is tested on tasks of retrieval, classification, and t-SNE visualization of time series. Experiments on both synthetic and real data have demonstrated its advantages in terms of accuracy as well as efficiency in comparison with existing distances based on the Kullback-Leibler divergence.

cs.LG↗

arXiv2017

Towards the solution of the many-electron problem in real materials: equation of state of the hydrogen chain with state-of-the-art many-body methods

We present numerical results for the equation of state of an infinite chain of hydrogen atoms. A variety of modern many-body methods are employed, with exhaustive cross-checks and validation. Approaches for reaching the continuous space limit and the thermodynamic limit are investigated, proposed, and tested. The detailed comparisons provide a benchmark for assessing the current state of the art in many-body computation, and for the development of new methods. The ground-state energy per atom in the linear chain is accurately determined versus bondlength, with a confidence bound given on all uncertainties.

physics.comp-ph↗

arXiv2017

Impacts and Benefits of UPFC to Wind Power Integration in Unit Commitment

Unified Power Flow Controller (UPFC) is recognized as the most powerful flexible AC transmission systems (FACTS) device for power system operation. This paper addresses how UPFC explores the transmission flexibility and facilitates the integration of uncertain and volatile wind power generation. To this end, a comprehensive unit commitment (UC) model with UPFC and uncertain wind power generation is proposed. Then, some metrics are introduced to evaluate the impacts of UPFC on the reliability, security and economy of power system operation. Further, different dispatch strategies of UPFC are compared to provide helpful guidances on making full use of UPFC to hedge against uncertainties. In addition, facing the challenging mixed-integer non-linear non-convex problems, approximate models are proposed to provide a starting point to solve the problems efficiently. All these models are easy to adapt to other types of FACTS devices. Illustrative numerical results are provided.

math.OC↗

arXiv2017

Optimal Power Flow in Stand-alone DC Microgrids

Direct-current microgrids (DC-MGs) can operate in either grid-connected or stand-alone mode. In particular, stand-alone DC-MG has many distinct applications. However, the optimal power flow problem of a stand-alone DC-MG is inherently non-convex. In this paper, the optimal power flow (OPF) problem of DC-MG is investigated considering convex relaxation based on second-order cone programming (SOCP). Mild assumptions are proposed to guarantee the exactness of relaxation, which only require uniform nodal voltage upper bounds and positive network loss. Furthermore, it is revealed that the exactness of SOCP relaxation of DC-MGs does not rely on either topology or operating mode of DC-MGs, and an optimal solution must be unique if it exists. If line constraints are considered, the exactness of SOCP relaxation may not hold. In this regard, two heuristic methods are proposed to give approximate solutions. Simulations are conducted to confirm the theoretic results.

math.OC↗

arXiv2017

Solving Partial Differential Equations on Manifolds From Incomplete Inter-Point Distance

Solutions of partial differential equations (PDEs) on manifolds have provided important applications in different fields in science and engineering. Existing methods are majorly based on discretization of manifolds as implicit functions, triangle meshes, or point clouds, where the manifold structure is approximated by either zero level set of an implicit function or a set of points. In many applications, manifolds might be only provided as an inter-point distance matrix with possible missing values. This paper discusses a framework to discretize PDEs on manifolds represented as incomplete inter-point distance information. Without conducting a time-consuming global coordinates reconstruction, we propose a more efficient strategy by discretizing differential operators only based on point-wisely local reconstruction. Our local reconstruction model is based on the recent advances of low-rank matrix completion theory, where only a very small random portion of distance information is required. This method enables us to conduct analyses of incomplete distance data using solutions of special designed PDEs such as the Laplace-Beltrami (LB) eigen-system. As an application, we demonstrate a new way of manifold reconstruction from an incomplete distance by stitching patches using the spectrum of the LB operator. Intensive numerical experiments demonstrate the effectiveness of the proposed methods.

math.NA↗

arXiv2017

Testing self-energy embedding theory in combination with GW

We present a theoretical framework and implementation details for self-energy embedding theory (SEET) with the GW approximation for the treatment of weakly correlated degrees of freedom and configuration interactions solver for handing the strongly correlated degrees. On a series of molecular examples, for which the exact results are known within a given basis, we demonstrate that SEET(CI/GW) is a systematically improvable and well controlled method capable of giving accurate results and well behaved causal self-energies and Green's functions. We compare the theoretical framework of SEET(CI/GW) to that of GW+DMFT and comment on differences between these to approaches that aim to treat both strongly and weakly correlated simultaneously.

cond-mat.str-el↗

arXiv2017

A Simulated Annealing based Inexact Oracle for Wasserstein Loss Minimization

Learning under a Wasserstein loss, a.k.a. Wasserstein loss minimization (WLM), is an emerging research topic for gaining insights from a large set of structured objects. Despite being conceptually simple, WLM problems are computationally challenging because they involve minimizing over functions of quantities (i.e. Wasserstein distances) that themselves require numerical algorithms to compute. In this paper, we introduce a stochastic approach based on simulated annealing for solving WLMs. Particularly, we have developed a Gibbs sampler to approximate effectively and efficiently the partial gradients of a sequence of Wasserstein losses. Our new approach has the advantages of numerical stability and readiness for warm starts. These characteristics are valuable for WLM problems that often require multiple levels of iterations in which the oracle for computing the value and gradient of a loss function is embedded. We applied the method to optimal transport with Coulomb cost and the Wasserstein non-negative matrix factorization problem, and made comparisons with the existing method of entropy regularization.

stat.CO↗

arXiv2017

A Benchmark Dataset and Saliency-guided Stacked Autoencoders for Video-based Salient Object Detection

Image-based salient object detection (SOD) has been extensively studied in the past decades. However, video-based SOD is much less explored since there lack large-scale video datasets within which salient objects are unambiguously defined and annotated. Toward this end, this paper proposes a video-based SOD dataset that consists of 200 videos (64 minutes). In constructing the dataset, we manually annotate all objects and regions over 7,650 uniformly sampled keyframes and collect the eye-tracking data of 23 subjects that free-view all videos. From the user data, we find salient objects in video can be defined as objects that consistently pop-out throughout the video, and objects with such attributes can be unambiguously annotated by combining manually annotated object/region masks with eye-tracking data of multiple subjects. To the best of our knowledge, it is currently the largest dataset for video-based salient object detection. Based on this dataset, this paper proposes an unsupervised baseline approach for video-based SOD by using saliency-guided stacked autoencoders. In the proposed approach, multiple spatiotemporal saliency cues are first extracted at pixel, superpixel and object levels. With these saliency cues, stacked autoencoders are unsupervisedly constructed which automatically infer a saliency score for each pixel by progressively encoding the high-dimensional saliency cues gathered from the pixel and its spatiotemporal neighbors. Experimental results show that the proposed unsupervised approach outperforms 30 state-of-the-art models on the proposed dataset, including 19 image-based & classic (unsupervised or non-deep learning), 6 image-based & deep learning, and 5 video-based & unsupervised. Moreover, benchmarking results show that the proposed dataset is very challenging and has the potential to boost the development of video-based SOD.

cs.CV↗

arXiv2017

CT Image Reconstruction in a Low Dimensional Manifold

Regularization methods are commonly used in X-ray CT image reconstruction. Different regularization methods reflect the characterization of different prior knowledge of images. In a recent work, a new regularization method called a low-dimensional manifold model (LDMM) is investigated to characterize the low-dimensional patch manifold structure of natural images, where the manifold dimensionality characterizes structural information of an image. In this paper, we propose a CT image reconstruction method based on the prior knowledge of the low-dimensional manifold of CT image. Using the clinical raw projection data from GE clinic, we conduct comparisons for the CT image reconstruction among the proposed method, the simultaneous algebraic reconstruction technique (SART) with the total variation (TV) regularization, and the filtered back projection (FBP) method. Results show that the proposed method can successfully recover structural details of an imaging object, and achieve higher spatial and contrast resolution of the reconstructed image than counterparts of FBP and SART with TV.

physics.med-ph↗

arXiv2017

Low Power Microwave Signal Detection With a Spin-Torque Nano-Oscillator in the Active Self-Oscillating Regime

A spin-torque nano-oscillator (STNO) driven by a ramped bias current can perform spectrum analysis quickly over a wide frequency bandwidth. The STNO spectrum analyzer operates by injection locking to external microwave signals and produces an output DC voltage $V_{\rm dc}$ that temporally encodes the input spectrum. We found, via numerical analysis with a macrospin approximation, that an STNO is able to scan a $10~\rm GHz$ bandwidth in less than $100~\rm ns$ (scanning rate $R$ exceeds $100~\rm MHz/ns$). In contrast to conventional quadratic microwave detectors, the output voltage of the STNO analyzer is proportional to the amplitude of the input microwave signal $I_{\rm rf}$ with sensitivity $S = dV_{\rm dc}/dI_{\rm rf} \approx 750~\rm mV/mA$. The minimum detectable signal of the analyzer depends on the scanning rate $R$ and, at low $R \approx 1~\rm MHz/ns$, is about $1~\rm pW$.

cond-mat.mes-hall↗

arXiv2017

Manifold Based Low-rank Regularization for Image Restoration and Semi-supervised Learning

Low-rank structures play important role in recent advances of many problems in image science and data science. As a natural extension of low-rank structures for data with nonlinear structures, the concept of the low-dimensional manifold structure has been considered in many data processing problems. Inspired by this concept, we consider a manifold based low-rank regularization as a linear approximation of manifold dimension. This regularization is less restricted than the global low-rank regularization, and thus enjoy more flexibility to handle data with nonlinear structures. As applications, we demonstrate the proposed regularization to classical inverse problems in image sciences and data sciences including image inpainting, image super-resolution, X-ray computer tomography (CT) image reconstruction and semi-supervised learning. We conduct intensive numerical experiments in several image restoration problems and a semi-supervised learning problem of classifying handwritten digits using the MINST data. Our numerical tests demonstrate the effectiveness of the proposed methods and illustrate that the new regularization methods produce outstanding results by comparing with many existing methods.

cs.CV↗

arXiv2017

Fast Discrete Distribution Clustering Using Wasserstein Barycenter with Sparse Support

In a variety of research areas, the weighted bag of vectors and the histogram are widely used descriptors for complex objects. Both can be expressed as discrete distributions. D2-clustering pursues the minimum total within-cluster variation for a set of discrete distributions subject to the Kantorovich-Wasserstein metric. D2-clustering has a severe scalability issue, the bottleneck being the computation of a centroid distribution, called Wasserstein barycenter, that minimizes its sum of squared distances to the cluster members. In this paper, we develop a modified Bregman ADMM approach for computing the approximate discrete Wasserstein barycenter of large clusters. In the case when the support points of the barycenters are unknown and have low cardinality, our method achieves high accuracy empirically at a much reduced computational cost. The strengths and weaknesses of our method and its alternatives are examined through experiments, and we recommend scenarios for their respective usage. Moreover, we develop both serial and parallelized versions of the algorithm. By experimenting with large-scale data, we demonstrate the computational efficiency of the new methods and investigate their convergence properties and numerical stability. The clustering results obtained on several datasets in different domains are highly competitive in comparison with some widely used methods in the corresponding areas.

stat.CO↗

arXiv2017

Probabilistic Multigraph Modeling for Improving the Quality of Crowdsourced Affective Data

We proposed a probabilistic approach to joint modeling of participants' reliability and humans' regularity in crowdsourced affective studies. Reliability measures how likely a subject will respond to a question seriously; and regularity measures how often a human will agree with other seriously-entered responses coming from a targeted population. Crowdsourcing-based studies or experiments, which rely on human self-reported affect, pose additional challenges as compared with typical crowdsourcing studies that attempt to acquire concrete non-affective labels of objects. The reliability of participants has been massively pursued for typical non-affective crowdsourcing studies, whereas the regularity of humans in an affective experiment in its own right has not been thoroughly considered. It has been often observed that different individuals exhibit different feelings on the same test question, which does not have a sole correct response in the first place. High reliability of responses from one individual thus cannot conclusively result in high consensus across individuals. Instead, globally testing consensus of a population is of interest to investigators. Built upon the agreement multigraph among tasks and workers, our probabilistic model differentiates subject regularity from population reliability. We demonstrate the method's effectiveness for in-depth robust analysis of large-scale crowdsourced affective data, including emotion and aesthetic assessments collected by presenting visual stimuli to human subjects.

stat.ML↗

arXiv2016

Robust Coordinated Transmission and Generation Expansion Planning Considering Ramping Requirements and Construction Periods

Two critical issues have arisen in transmission expansion planning with the rapid growth of wind power generation. First, severe power ramping events in daily operation due to the high variability of wind power generation pose great challenges to multi-year planning decision making. Second, the long construction periods of transmission lines may not be able to keep pace with the fast growing uncertainty due to the increasing integration of renewable energy generation. To address such issues, we propose a comprehensive robust planning model considering different resources, namely, transmission lines, generators, and FACTS devices. Various factors are taken into account, including flexibility requirement, construction period, and cost. We construct the hourly net load ramping uncertainty (HLRU) set to characterize the variation of hourly net load including wind power generation, and the annual net load duration curve uncertainty (LDCU) set for the uncertainty of normal annual net load duration curve. This results in a two-stage robust optimization model with two different types of uncertainty sets, which are decoupled into two different sets of subproblems to make the entire solution process tractable. Numerical simulations with real-world data show that the proposed model and solution method are effective to coordinate different flexible resources, rendering robust expansion planning strategies.

math.OC↗

arXiv2016

AutoScaler: Scale-Attention Networks for Visual Correspondence

Finding visual correspondence between local features is key to many computer vision problems. While defining features with larger contextual scales usually implies greater discriminativeness, it could also lead to less spatial accuracy of the features. We propose AutoScaler, a scale-attention network to explicitly optimize this trade-off in visual correspondence tasks. Our network consists of a weight-sharing feature network to compute multi-scale feature maps and an attention network to combine them optimally in the scale space. This allows our network to have adaptive receptive field sizes over different scales of the input. The entire network is trained end-to-end in a siamese framework for visual correspondence tasks. Our method achieves favorable results compared to state-of-the-art methods on challenging optical flow and semantic matching benchmarks, including Sintel, KITTI and CUB-2011. We also show that our method can generalize to improve hand-crafted descriptors (e.g Daisy) on general visual correspondence tasks. Finally, our attention network can generate visually interpretable scale attention maps.

cs.CV↗

arXiv2016

Spin-current probe for phase transition in an insulator

Spin fluctuation and transition have always been one of central topics of magnetism and condensed matter science. Experimentally, the spin fluctuation is found transcribed onto scattering intensity in the neutron scattering process, which is represented by dynamical magnetic susceptibility and maximized at phase transitions. Importantly, a neutron carries spin without electric charge, and it can bring spin into a sample without being disturbed by electric energy, although large facilities such as a nuclear reactor is necessary. Here we show that spin pumping, frequently used in nanoscale spintronic devices, provides a desktop micro probe for spin transition; spin current is a flux of spin without an electric charge and its transport reflects spin excitation. We demonstrate detection of antiferromagnetic transition in ultra-thin CoO films via frequency dependent spin-current transmission measurements, which provides a versatile probe for phase transition in an electric manner in minute devices.

cond-mat.mes-hall↗

arXiv2016

A Distance for HMMs based on Aggregated Wasserstein Metric and State Registration

We propose a framework, named Aggregated Wasserstein, for computing a dissimilarity measure or distance between two Hidden Markov Models with state conditional distributions being Gaussian. For such HMMs, the marginal distribution at any time spot follows a Gaussian mixture distribution, a fact exploited to softly match, aka register, the states in two HMMs. We refer to such HMMs as Gaussian mixture model-HMM (GMM-HMM). The registration of states is inspired by the intrinsic relationship of optimal transport and the Wasserstein metric between distributions. Specifically, the components of the marginal GMMs are matched by solving an optimal transport problem where the cost between components is the Wasserstein metric for Gaussian distributions. The solution of the optimization problem is a fast approximation to the Wasserstein metric between two GMMs. The new Aggregated Wasserstein distance is a semi-metric and can be computed without generating Monte Carlo samples. It is invariant to relabeling or permutation of the states. This distance quantifies the dissimilarity of GMM-HMMs by measuring both the difference between the two marginal GMMs and the difference between the two transition matrices. Our new distance is tested on the tasks of retrieval and classification of time series. Experiments on both synthetic data and real data have demonstrated its advantages in terms of accuracy as well as efficiency in comparison with existing distances based on the Kullback-Leibler divergence.

cs.LG↗