Searcharxiv⌕ Search

arXiv subjects

Yong Luo

Publications and source records attributed to Yong Luo.

At least 145 records · Page 8Linked to original sources

Addendum to "Contact stationary Legendrian surfaces in $\mathbb{S}^5$"[Pacific Math. J. 293(2018), no.1, 101-120]

In \cite{Luo}, the present author proved that if $L$ is a contact stationary Legendrian surface in $\mathbb{S}^5$ with the canonical Sasakian structure and the square length of its second fundamental form belongs to $[0,2]$. Then we have that $L$ is either totally umbilical or is a flat minimal Legendrian torus. In this addendum we further prove that if $L$ is a totally umbilical contact stationary Legendrian surface in $\mathbb{S}^5$ , then $L$ is totally geodesic.

math.DG↗

Nonexistence of proper $p$-biharmonic maps and Liouville type theorems I: case of $p\geq2$

Let $u: (M, g)\to (N, h)$ be a map between Riemannian manifolds $(M, g)$ and $(N, h)$. The $p$-bienergy of $u$ is defined by $E_p(u)=\int_M|τ(u)|^pdν_g$, where $τ(u)$ is the tension field of $u$ and $p>1$. Critical points of $E_p(\cdot)$ are called $p$-biharmonic maps. In this paper we will prove nonexistence result of proper $p$-biharmonic maps when $p\geq2$. In particular when $M=\mathbb{R}^m$, we get Liouville type results under proper integral conditions , which extend the related results of Baird, Fardoun and Ouakkas \cite{BFO}.

math.DG↗

A new characterization of the Calabi torus in the unit sphere

In this paper, we study the rigidity theorem of closed minimally immersed Legendrian submanifolds in the unit sphere. Utilizing the maximum principle, we obtain a new characterization of the Calabi torus in the unit sphere which is the minimal Calabi product Legendrian immersion of a point and the totally geodesic Legendrian sphere. We also establish an optimal Simons' type integral inequality in terms of the second fundamental form of three dimensional closed minimal Legendrian submanifolds in the unit sphere.

math.DG↗

Towards Digital Retina in Smart Cities: A Model Generation, Utilization and Communication Paradigm

The digital retina in smart cities is to select what the City Eye tells the City Brain, and convert the acquired visual data from front-end visual sensors to features in an intelligent sensing manner. By deploying deep learning and/or handcrafted models in front-end devices, the compact features can be extracted and subsequently delivered to back-end cloud for search and advanced analytics. In this context, we propose a model generation, utilization, and communication paradigm, aiming to address a set of unique challenges for better artificial intelligence services in smart cities. In particular, we present an integrated multiple deep learning models reuse and prediction strategy, which greatly increases the feasibility of the digital retina in processing and analyzing the large-scale visual data in smart cities. The promise of the proposed paradigm is demonstrated through a set of experiments.

cs.CV↗

Decomposition-Based Transfer Distance Metric Learning for Image Classification

Distance metric learning (DML) is a critical factor for image analysis and pattern recognition. To learn a robust distance metric for a target task, we need abundant side information (i.e., the similarity/dissimilarity pairwise constraints over the labeled data), which is usually unavailable in practice due to the high labeling cost. This paper considers the transfer learning setting by exploiting the large quantity of side information from certain related, but different source tasks to help with target metric learning (with only a little side information). The state-of-the-art metric learning algorithms usually fail in this setting because the data distributions of the source task and target task are often quite different. We address this problem by assuming that the target distance metric lies in the space spanned by the eigenvectors of the source metrics (or other randomly generated bases). The target metric is represented as a combination of the base metrics, which are computed using the decomposed components of the source metrics (or simply a set of random bases); we call the proposed method, decomposition-based transfer DML (DTDML). In particular, DTDML learns a sparse combination of the base metrics to construct the target metric by forcing the target metric to be close to an integration of the source metrics. The main advantage of the proposed method compared with existing transfer metric learning approaches is that we directly learn the base metric coefficients instead of the target metric. To this end, far fewer variables need to be learned. We therefore obtain more reliable solutions given the limited side information and the optimization tends to be faster. Experiments on the popular handwritten image (digit, letter) classification and challenge natural image annotation tasks demonstrate the effectiveness of the proposed method.

cs.CV↗

Multi-View Matrix Completion for Multi-Label Image Classification

There is growing interest in multi-label image classification due to its critical role in web-based image analytics-based applications, such as large-scale image retrieval and browsing. Matrix completion has recently been introduced as a method for transductive (semi-supervised) multi-label classification, and has several distinct advantages, including robustness to missing data and background noise in both feature and label space. However, it is limited by only considering data represented by a single-view feature, which cannot precisely characterize images containing several semantic concepts. To utilize multiple features taken from different views, we have to concatenate the different features as a long vector. But this concatenation is prone to over-fitting and often leads to very high time complexity in MC based image classification. Therefore, we propose to weightedly combine the MC outputs of different views, and present the multi-view matrix completion (MVMC) framework for transductive multi-label image classification. To learn the view combination weights effectively, we apply a cross validation strategy on the labeled set. In the learning process, we adopt the average precision (AP) loss, which is particular suitable for multi-label image classification. A least squares loss formulation is also presented for the sake of efficiency, and the robustness of the algorithm based on the AP loss compared with the other losses is investigated. Experimental evaluation on two real world datasets (PASCAL VOC' 07 and MIR Flickr) demonstrate the effectiveness of MVMC for transductive (semi-supervised) multi-label image classification, and show that MVMC can exploit complementary properties of different features and output-consistent labels for improved multi-label image classification.

stat.ML↗

Large Margin Multi-modal Multi-task Feature Extraction for Image Classification

The features used in many image analysis-based applications are frequently of very high dimension. Feature extraction offers several advantages in high-dimensional cases, and many recent studies have used multi-task feature extraction approaches, which often outperform single-task feature extraction approaches. However, most of these methods are limited in that they only consider data represented by a single type of feature, even though features usually represent images from multiple modalities. We therefore propose a novel large margin multi-modal multi-task feature extraction (LM3FE) framework for handling multi-modal features for image classification. In particular, LM3FE simultaneously learns the feature extraction matrix for each modality and the modality combination coefficients. In this way, LM3FE not only handles correlated and noisy features, but also utilizes the complementarity of different modalities to further help reduce feature redundancy in each modality. The large margin principle employed also helps to extract strongly predictive features so that they are more suitable for prediction (e.g., classification). An alternating algorithm is developed for problem optimization and each sub-problem can be efficiently solved. Experiments on two challenging real-world image datasets demonstrate the effectiveness and superiority of the proposed method.

stat.ML↗

Multi-view Vector-valued Manifold Regularization for Multi-label Image Classification

In computer vision, image datasets used for classification are naturally associated with multiple labels and comprised of multiple views, because each image may contain several objects (e.g. pedestrian, bicycle and tree) and is properly characterized by multiple visual features (e.g. color, texture and shape). Currently available tools ignore either the label relationship or the view complementary. Motivated by the success of the vector-valued function that constructs matrix-valued kernels to explore the multi-label structure in the output space, we introduce multi-view vector-valued manifold regularization (MV$\mathbf{^3}$MR) to integrate multiple features. MV$\mathbf{^3}$MR exploits the complementary property of different features and discovers the intrinsic local geometry of the compact support shared by different features under the theme of manifold regularization. We conducted extensive experiments on two challenging, but popular datasets, PASCAL VOC' 07 (VOC) and MIR Flickr (MIR), and validated the effectiveness of the proposed MV$\mathbf{^3}$MR for image classification.

stat.ML↗

Heterogeneous Multi-task Metric Learning across Multiple Domains

Distance metric learning (DML) plays a crucial role in diverse machine learning algorithms and applications. When the labeled information in target domain is limited, transfer metric learning (TML) helps to learn the metric by leveraging the sufficient information from other related domains. Multi-task metric learning (MTML), which can be regarded as a special case of TML, performs transfer across all related domains. Current TML tools usually assume that the same feature representation is exploited for different domains. However, in real-world applications, data may be drawn from heterogeneous domains. Heterogeneous transfer learning approaches can be adopted to remedy this drawback by deriving a metric from the learned transformation across different domains. But they are often limited in that only two domains can be handled. To appropriately handle multiple domains, we develop a novel heterogeneous multi-task metric learning (HMTML) framework. In HMTML, the metrics of all different domains are learned together. The transformations derived from the metrics are utilized to induce a common subspace, and the high-order covariance among the predictive structures of these domains is maximized in this subspace. There do exist a few heterogeneous transfer learning approaches that deal with multiple domains, but the high-order statistics (correlation information), which can only be exploited by simultaneously examining all domains, is ignored in these approaches. Compared with them, the proposed HMTML can effectively explore such high-order information, thus obtaining more reliable feature transformations and metrics. Effectiveness of our method is validated by the extensive and intensive experiments on text categorization, scene classification, and social image annotation.

stat.ML↗

Transferring Knowledge Fragments for Learning Distance Metric from A Heterogeneous Domain

The goal of transfer learning is to improve the performance of target learning task by leveraging information (or transferring knowledge) from other related tasks. In this paper, we examine the problem of transfer distance metric learning (DML), which usually aims to mitigate the label information deficiency issue in the target DML. Most of the current Transfer DML (TDML) methods are not applicable to the scenario where data are drawn from heterogeneous domains. Some existing heterogeneous transfer learning (HTL) approaches can learn target distance metric by usually transforming the samples of source and target domain into a common subspace. However, these approaches lack flexibility in real-world applications, and the learned transformations are often restricted to be linear. This motivates us to develop a general flexible heterogeneous TDML (HTDML) framework. In particular, any (linear/nonlinear) DML algorithms can be employed to learn the source metric beforehand. Then the pre-learned source metric is represented as a set of knowledge fragments to help target metric learning. We show how generalization error in the target domain could be reduced using the proposed transfer strategy, and develop novel algorithm to learn either linear or nonlinear target metric. Extensive experiments on various applications demonstrate the effectiveness of the proposed method.

stat.ML↗

Cost-Sensitive Feature Selection by Optimizing F-Measures

Feature selection is beneficial for improving the performance of general machine learning tasks by extracting an informative subset from the high-dimensional features. Conventional feature selection methods usually ignore the class imbalance problem, thus the selected features will be biased towards the majority class. Considering that F-measure is a more reasonable performance measure than accuracy for imbalanced data, this paper presents an effective feature selection algorithm that explores the class imbalance issue by optimizing F-measures. Since F-measure optimization can be decomposed into a series of cost-sensitive classification problems, we investigate the cost-sensitive feature selection by generating and assigning different costs to each class with rigorous theory guidance. After solving a series of cost-sensitive feature selection problems, features corresponding to the best F-measure will be selected. In this way, the selected features will fully represent the properties of all classes. Experimental results on popular benchmarks and challenging real-world data sets demonstrate the significance of cost-sensitive feature selection for the imbalanced data setting and validate the effectiveness of the proposed method.

cs.CV↗

Transfer Metric Learning: Algorithms, Applications and Outlooks

Distance metric learning (DML) aims to find an appropriate way to reveal the underlying data relationship. It is critical in many machine learning, pattern recognition and data mining algorithms, and usually require large amount of label information (such as class labels or pair/triplet constraints) to achieve satisfactory performance. However, the label information may be insufficient in real-world applications due to the high-labeling cost, and DML may fail in this case. Transfer metric learning (TML) is able to mitigate this issue for DML in the domain of interest (target domain) by leveraging knowledge/information from other related domains (source domains). Although achieved a certain level of development, TML has limited success in various aspects such as selective transfer, theoretical understanding, handling complex data, big data and extreme cases. In this survey, we present a systematic review of the TML literature. In particular, we group TML into different categories according to different settings and metric transfer strategies, such as direct metric approximation, subspace approximation, distance approximation, and distribution approximation. A summarization and insightful discussion of the various TML approaches and their applications will be presented. Finally, we indicate some challenges and provide possible future directions.

stat.ML↗

Rigidity of closed CSL submanifolds in the unit sphere

A contact stationary Legendrian submanifold (briefly, CSL submanifold) is a stationary point of the volume functional of Legendrian submanifolds in a Sasakian manifold. Much effort has been paid in the last two decades to construct examples of such manifolds, mainly by geometers using various geometric methods. But we have rare knowledge about their geometric properties till now. Recently, Y. Luo (\cite{ Luo2, Luo1}) proved that a closed CSL surface in $\mathbb{S}^5$ with the square length of its second fundamental form belonging to $[0,2]$ must be totally geodesic or be a flat minimal Legendrian torus, which generalizes a related gap theorem of minimal Legendrian surface due to Yamaguchi et al. (\cite{YKM}). In this paper, we will study the general dimensional case of this result.

math.DG↗

ResumeNet: A Learning-based Framework for Automatic Resume Quality Assessment

Recruitment of appropriate people for certain positions is critical for any companies or organizations. Manually screening to select appropriate candidates from large amounts of resumes can be exhausted and time-consuming. However, there is no public tool that can be directly used for automatic resume quality assessment (RQA). This motivates us to develop a method for automatic RQA. Since there is also no public dataset for model training and evaluation, we build a dataset for RQA by collecting around 10K resumes, which are provided by a private resume management company. By investigating the dataset, we identify some factors or features that could be useful to discriminate good resumes from bad ones, e.g., the consistency between different parts of a resume. Then a neural-network model is designed to predict the quality of each resume, where some text processing techniques are incorporated. To deal with the label deficiency issue in the dataset, we propose several variants of the model by either utilizing the pair/triplet-based loss, or introducing some semi-supervised learning technique to make use of the abundant unlabeled data. Both the presented baseline model and its variants are general and easy to implement. Various popular criteria including the receiver operating characteristic (ROC) curve, F-measure and ranking-based average precision (AP) are adopted for model evaluation. We compare the different variants with our baseline model. Since there is no public algorithm for RQA, we further compare our results with those obtained from a website that can score a resume. Experimental results in terms of different criteria demonstrate the effectiveness of the proposed method. We foresee that our approach would transform the way of future human resources management.

cs.IR↗

Parameter Recovery with Marginal Maximum Likelihood and Markov Chain Monte Carlo Estimation for the Generalized Partial Credit Model

The generalized partial credit model (GPCM) is a popular polytomous IRT model that has been widely used in large-scale educational surveys and health care services. Same as other IRT models, GPCM can be estimated via marginal maximum likelihood estimation (MMLE) and Markov chain Monte Carlo (MCMC) methods. While studies comparing MMLE and MCMC as estimation methods for other polytomous IRT models such as the nominal response model and the graded response model exist in literature, no studies have compared how well MMLE and MCMC recover the model parameters of GPCM. In the current study, a comprehensive simulation study was conducted to compare parameter recovery of GPCM via MMLE and MCMC. The manipulated factors included latent distribution, sample size, and test length, and parameter recovery was evaluated with bias and root mean square error. It was found that there were no statistically significant differences in recovery of the item location and ability parameters between MMLE and MCMC; for the item discrimination parameter, MCMC had less bias in parameter recovery than MMLE under both normal and uniform latent distributions, and MMLE outperformed MCMC with less bias in parameter recovery under skewed latent distributions. A real dataset from a high-stakes test was used to demonstrate the estimation of GPCM with MMLE and MCMC. Keywords: polytomous IRT, GPCM, MCMC, MMLE, parameter recovery.

stat.AP↗

Some remarks on bi-f-harmonic maps and f-biharmonic maps

In this paper, we prove that the class of bi-f-harmonic maps and that of f-biharmonic maps from a conformal manifold of dimension not equal to 2 are the same (Theorem 1.1). We also give several results on nonexistence of proper bi-f-harmonic maps and f-biharmonic maps from complete Riemannian manifolds into nonpositively curved Riemannian manifolds. These include: any bi-f-harmonic map from a compact manifold into a non-positively curved manifold is f-harmonic (Theorem 1.6), and any f-biharmonic (respectively, bi-f-harmonic) map with bounded f and bounded f-bienrgy (respectively, bi-f-energy) from a complete Riemannian manifold into a manifold of strictly negative curvature has rank < 2 everywhere (Theorems 2.2 and 2.3).

math.DG↗

A nonexistence theorem for proper biharmonic maps into general Riemannian manifolds

In this note we prove a nonexistence result for proper biharmonic maps from complete non-compact Riemannian manifolds of dimension \(m=\dim M\geq 3\) with infinite volume that admit an Euclidean type Sobolev inequality into general Riemannian manifolds by assuming finiteness of $\|τ(ϕ)\|_{L^p(M)}, p>1$ and smallness of $\|dϕ\|_{L^m(M)}$. This is an improvement of a recent result of the first named author, where he assumed $2<p<m$. As applications we also get several nonexistence results for proper biharmonic submersions from complete non-compact manifolds into general Riemannian manifolds.

math.DG↗

Limit Behavior of Mass Critical Hartree Minimization Problems with Steep Potential Wells

We consider minimizers of the following mass critical Hartree minimization problem: \[ e_λ(N):=\underset{\{u\in H^1(R^d),\,\|u\|^2_2=N\}}{\inf} E_λ(u),\,\ d\ge 3, \] where the Hartree energy functional $E_λ(u)$ is defined by \[ E_λ(u):=\int_{R ^d}|\nabla u(x)|^2dx+λ\int_{R ^d}g(x)u^2(x)dx-\frac{1}{2} \int_{R ^d}\int_{R ^d} \frac{u^2(x)u^2(y)}{|x-y|^2}dxdy,\,\ λ>0,\] and the steep potential $g(x)$ satisfies $0=g(0)=\inf _{R^d}g(x)\le g(x)\le 1$ and $1-g(x)\in L^{\frac{d}{2}}(R^d)$. We prove that there exists a constant $N^*>0$, independent of $λg(x)$, such that if $N\ge N^*$, then $e_λ(N)$ does not admit minimizers for any $λ>0$; if $0 0$ such that $e_λ(N)$ admits minimizers for any $λ>λ^*(N)$, and $e_λ(N)$ does not admit minimizers for $0<λ<λ^*(N)$. For any given $0<N<N^*$, the limit behavior of positive minimizers for $e_λ(N)$ is also studied as $λ\to\infty$, where the mass concentrates at the bottom of $g(x)$.

math.FA↗