News

MCL Research on Green Knowledge Graph Completion

Knowledge graphs (KGs) store human knowledge in a graph-structured format, where nodes and edges denote entities and relations, respectively. Most KGs, such as wikidata [1], suffer from the incompleteness problem; namely, a large number of factual triples are missing, leading to performance degradation in downstream applications. Thus, there is growing interest in developing KG completion (KGC) methods to solve the incompleteness problem by inferring undiscovered factual triples based on existing ones.

Prior KGC work focuses on learning embeddings for entities and relations through a simple score function. Yet, a higher-dimensional embedding space is usually required for a better reasoning capability, which leads to larger model size and hinders applicability to real-world problems (e.g., large-scale KGs or mobile/edge computing). A lightweight modularized KGC solution, called GreenKGC, is proposed to address this issue. GreenKGC consists of three modules: representation learning, feature pruning, and decision learning, to extract discriminant KG features and make accurate predictions on missing relationships using classifiers and negative sampling. The overview of the model is shown in Fig. 1.

Experimental results demonstrate several advantages of GreenKGC. First, it only requires a low-dimensional space (e.g. d = 8) to achieve achieve competitive or even better performance against high-dimensional models with much smaller model sizes. Second, as compared with other classification-based methods, it requires a shorter inference time and provides better performance. Third, the feature pruning module is 20x faster than knowledge distillation methods in training powerful low-dimensional features. A comparison of GreenKGC and other KGC models under different dimensions is given in Fig. 2.

-By Yun Cheng Wang

 

Reference:

[1] Vrandečić, Denny, and Markus Krötzsch. “Wikidata: a free collaborative knowledgebase.” Communications of the ACM 57.10 (2014): 78-85.

By |October 23rd, 2022|News|Comments Off on MCL Research on Green Knowledge Graph Completion|

MCL Genealogical Ancestry Series: Carl Fredrich Gauss

In the MCL genealogy, Carl Friedrich Gauss is a shining star. Min Zhang studied his unusual life and shared with MCL members in the pre-seminar sharing on October 03, 2022. Gauss is the greatest mathematician since antiquity, known for his contributions to number theory, proving the fundamental theorem of algebra, deriving the function representation of normal distribution, his contribution to the theory of magnetism and being PhD advisor to Richard Dedekind and Bernhard Riemann.

Carl Friedrich Gauss was born on April 30, 1777, in Brunswick in the Duchy of Brunswick-Wolfenbüttel which now part of Lower Saxony, Germany. His parents were poor, working-class citizens. His mother was illiterate and never recorded his birthdate, remembering only that was a Wednesday, eight days before the Feast of the Ascension. Gauss figured out his birthday by deriving the date of Easter by himself. There are some interesting anecdotes about Gauss when he was a child. Gauss is child prodigy, he was said to have corrected an error in this father’s payroll calculations at the age of 3, he dazzled his schoolteachers by quickly summing up the integers from 1 to 100 to be 5050 at the age of 7 and he was already criticizing Euclid’s geometry at the age of 12.

Gauss’s intellectual abilities attracted the attention of the Duke of Brunswick, the Duke supported his study and life since he was 14 years old until the Duke passed away in 1806. With the funding from the Duke, Gauss studied at the Collegium Carolinum (now Braunschweig University of Technology) from 1792 to 1795. Then, he got a bachelor’s degree at the University of Göttingen in 1798 when he was 22. Gauss was very productive in 1796. He advanced modular arithmetic [...]

By |October 16th, 2022|News|Comments Off on MCL Genealogical Ancestry Series: Carl Fredrich Gauss|

MCL Genealogical Ancestry Series: Nicolaus Copernicus

Xuejing Lei studied on Nicolaus Copernicus, the first mathematician in MCL genealogy, and shared her study with MCL members in the pre-seminar sharing on September 12, 2022. Nicolaus Copernicus was born in 1473 in Toruń, Royal Prussia, Poland and died in 1543 aged 70. He was a Renaissance polymath, who made contributions in a wide variety of fields including astronomy, canon law, economics, mathematics, etc. He is best known for Heliocentrism, Quantity theory of money and Gresham–Copernicus law.

Nicolaus Copernicus was born in a powerful family. His father was a well-to-do merchant who dealt in copper, and died about 1483. His mother was the daughter of a wealthy Toruń patrician and city councilor, deceased after 1495. After his father’s death, his maternal uncle, Lucas Watzenrode the Younger, took the little boy under his wing and saw to his education and career. Lucas formed close relations with three successive Polish monarchs Watzenrode and many rulers. He came to be considered the most powerful man in Warmia, and his wealth, connections and influence allowed him to secure Copernicus’s education and career as a canon at Frombork Cathedral.

Nicolaus Copernicus’s study in University of Kraków (now Jagiellonian University) gave him a thorough grounding in the mathematical astronomy and initiated his analysis of logical contradictions in the two “official” systems of astronomy — Aristotle’s theory of homocentric spheres, and Ptolemy’s mechanism of eccentrics and epicycles. He then went to Italy and studied in University of Bologna for 4 years and University of Padua for 2 years, and obtained his Doctoral degree of Canon Law in University of Ferrara in 1503.

Although Nicolaus Copernicus was best known to his contemporaries as a doctor and the Canon of Frauenburg Cathedral, he is best [...]

By |October 9th, 2022|News|Comments Off on MCL Genealogical Ancestry Series: Nicolaus Copernicus|

Welcome Tsung-Shan Yang to Join MCL as a new PhD student

We are so happy to welcome a new graduate member of MCL, Tsung-Shan Yang. Here is an interview with Tsung-Shan:

 

Could you briefly introduce yourself and your research interests?

I am Tsung-Shan Yang. I am pursuing my Ph.D. degree in Electrical Engineering at USC now. I received my Bachelor’s and Master’s degrees in Electrical Engineering from National Taiwan University. During my graduate studies, I researched alleviating distortions and analyzing saliency maps in panoramic images. My research interests include 3D computer vision and machine learning.

What is your impression about MCL and USC?

USC is a prominent educational institution over the world, especially MCL. Being one of the most prestigious research groups on campus, this group proposes plenty of novel and sound approaches to challenging engineering problems. There are brilliant and outstanding people at MCL, and it is my honor to work with them.

What is your future expectation and plan in MCL?

The most crucial thing for me is learning how to define a question. As an engineer, I want to find the technical problem in life and address the issues. Besides, I want to broaden my horizon by discussing with the talented members of MCL. After the training in MCL, I hope I will be able to solve real-world difficulties theoretically and practically.

By |October 2nd, 2022|News|Comments Off on Welcome Tsung-Shan Yang to Join MCL as a new PhD student|

Welcome Haiyi Li to Join MCL as a new PhD student

We are so happy to welcome a new graduate member of MCL, Haiyi Li. Here is an interview with Haiyi:

 

Could you briefly introduce yourself and your research interests?

My name is Haiyi Li. I am currently a Ph.D student in Electrical Engineering at USC. I received my bachelor’s degree in Automation Engineering from the University of Electronic Science and Technology of China in 2022. I enjoy swimming and outdoor sports in my spare time. My research interests include image processing and machine learning.

What is your impression about MCL and USC?

MCL is a fantastic place to exchange thoughts and obtain inspiration. Professor Kuo is a knowledgeable and passionate advisor, providing us with a lot of new ideas. And he is also a patient and responsible instructor, offering me some research directions to dig deeper. Also, students in MCL are really nice and intelligent. I feel inspired when discussing questions with them. USC is a vibrant campus. I am impressed by the strong academic resources and diverse environment here.

What is your future expectation and plan in MCL?

I plan to have more inspiring discussions with Professor Kuo and senior students of MCL and lay a sound foundation for my research. And I will focus on some specific image processing research directions to conduct some hands-on projects to make models more reasonable with better performance. I hope I am able to equip myself with mature research ability and insightful ideas.

By |September 25th, 2022|News|Comments Off on Welcome Haiyi Li to Join MCL as a new PhD student|

Welcome Aolin Feng to Join MCL as a new PhD student

We are so happy to welcome a new graduate member of MCL, Aolin Feng. Here is an interview with Aolin:

 

Could you briefly introduce yourself and your research interests?

My name is Aolin Feng. I received my bachelor’s and master’s degrees from University of Science and Technology of China (USTC). I developed my research interest in video compression when pursuing master’s degree. I join USC MCL lab to do further research in image/video processing-related area.

What is your impression about MCL and USC?

My impression about MCL lab is that it is such a big family. The atmosphere here is kind of serious but lively – people here are serious about academics but lively in life. Professor Kuo leads a lab full of creativity and passion. For USC, I like the campus, which is beautiful and has its own style. The culture here is diverse and the people I met are all friendly. I look forward to the study and life at USC.

What is your future expectation and plan in MCL?

I expect to broaden my research horizons and explore more interesting and cutting-edge directions. I wish I could learn a lot from Professor Kuo and the students in the lab. Besides, I wish to strengthen my mathematical foundation from course study and research.

By |September 18th, 2022|News|Comments Off on Welcome Aolin Feng to Join MCL as a new PhD student|
  • Permalink Gallery

    MCL PixelHop Paper Received the 2022 Best Paper Award from JVCI

MCL PixelHop Paper Received the 2022 Best Paper Award from JVCI

Congratulations to MCL Alumnus, Dr. Yueru Chen, and Director, Professor Jay Kuo, for receiving the 2022 Best Paper Award from the Journal of Visual Communication and Image Representation for their work:

Yueru Chen and C.-C. Jay Kuo, “PixelHop: a successive subspace learning (SSL) method for object recognition,” Journal of Visual Communication and Image Representation, Vol. 70, July 2020, 102749.

The PixelHop paper proposed a successive subspace learning (SSL) framework for unsupervised feature representation. It lays a key foundation for green learning. Professor Kuo said, “Deep learning has been very dominating in the computer vision and image analysis field in the last 10 years. It was not easy for Yueru to pursue a totally different research direction in her PhD research. I am glad to see that her effort on developing an interpretable and modularized learning system has been gradually recognized by the community.”

MCL has received three best paper awards (2018, 2021, 2022) and two best paper award runner-ups (2019, 2020) from the Journal of Visual Communication and Image Representation in the last five years. The other four papers are listed below.

The 2021 Best Paper Award of the Journal of Visual Communication and Image Representation.

C.-C. Jay Kuo, Min Zhang, Siyang Li, Jiali Duan and Yueru Chen, “Interpretable convolutional neural networks via feedforward design,” the Journal of Visual Communication and Image Representation, Vol. 60, pp. 346-359, April 2019.

The 2020 Best Paper Award Runner-up of the Journal of Visual Communication and Image Representation.

C.-C. Jay Kuo and Yueru Chen, “On data-driven Saak transform,” the Journal of Visual Communication and Image Representation, Vol. 50, pp. 237-246, January 2018.

The 2019 Best Paper Award Runner-up of the Journal of Visual Communication and Image Representation.

Ronald Salloum, Yuzhou Ren [...]

By |September 11th, 2022|News|Comments Off on MCL PixelHop Paper Received the 2022 Best Paper Award from JVCI|

MCL Research on Sentence Similarity Modeling

Sentence similarity evaluation has a wide range of applications in natural language processing, such as semantic similarity computation, text generation evaluation, and information retrieval. As one of the word-alignment-based methods, Word Mover’s Distance (WMD)[1] formulates text similarity evaluation as a minimum-cost flow problem. It finds the most efficient way to align the information between text sequences through a flow network defined by word-level similarities. By assigning flows to individual words, WMD computes text dissimilarity as the minimum cost of moving words’ flows from one sentence to another based on pre-trained word embeddings.

However, a naive WMD method does not perform well on sentence similarity evaluation for several reasons.
– First, WMD assigns word flow based on words’ frequency in a sentence. This frequency-based word weighting scheme is weak in capturing word importance when considering the statistics of the whole corpus.
– Second, the distance between words solely depends on the embedding of isolated words without considering the contextual and structural information of input sentences. Since the meaning of a sentence depends on individual words as well as their interaction, simply considering the alignment between individual words is deficient in evaluating sentence similarity.

MCL proposed a new syntax-aware word flow calculation method, Syntax-aware Word Mover’s Distance (SynWMD)[2], for sentence similarity evaluation.
– Words are first represented as a weighted graph based on the co-occurrence statistics obtained by dependency parsing trees. Then, a PageRank-based algorithm is used to infer word importance.
– The word distance model in WMD is enhanced by the context extracted from dependency parse trees, which is illustrated in Figure 1. The contextual information of words and structural information of sentences are explicitly modeled as additional subtree embeddings.
– As shown in Table 1, we [...]

By |September 4th, 2022|News|Comments Off on MCL Research on Sentence Similarity Modeling|

MCL Research on Green Blind Image Quality Assessment

Image quality assessment (IQA) aims to evaluate image quality at various stages of image processing such as image acquisition, transmission, and compression. Based on the availability of undistorted reference images, objective IQA can be classified into three categories [1]: full-reference (FR), reduced-referenced (RR) and no-reference (NR). The last one is also known as blind IQA (BIQA). FR-IQA metrics have achieved high consistency with human subjective evaluation. Many FR-IQA methods have been well developed in the last two decades such as SSIM [2] and FSIM [3]. RR-IQA metrics only utilize features of reference images for quality evaluation. In some application scenarios (e.g., image receivers), users cannot access reference images so that NR-IQA is the only choice. BIQA methods attract growing attention in recent years.

Generally speaking, conventional BIQA methods consist of two stages: 1) extraction of quality-aware features and 2) adoption of a regression model for quality score prediction. As the amount of user generated images grows rapidly, a handcrafted feature extraction method is limited in its power of modeling a wide range of image content and distortion characteristics. Deep neural networks (DNNs) achieve great success in blind image quality assessment (BIQA) with large pre-trained models in recent years. However, their solutions cannot be easily deployed at mobile or edge devices, and a lightweight solution is desired.

In this work, we propose a novel BIQA model, called GreenBIQA, that aims at high performance, low computational complexity and a small model size. GreenBIQA adopts an unsupervised feature generation method and a supervised feature selection method to extract quality-aware features. Then, it trains an XGBoost regressor to predict quality scores of test images. We conduct experiments on four popular IQA datasets, which include two synthetic-distortion and two authentic-distortion [...]

By |August 30th, 2022|News|Comments Off on MCL Research on Green Blind Image Quality Assessment|

MCL Research on Effective Knowledge Graph Embedding

Knowledge Graph encodes human-readable information and knowledge in graph format. Triples, denoted by (h,r,t), are basic elements of a KG, where h and t are head and tail entities while r is the relation connecting them. Both manual effort by domain experts and automated information extraction algorithms have contributed to the creation of many existing Knowledge Graphs today. However, given the limited information accessible to each individual and the limitation of algorithms, it is nearly impossible for a Knowledge Graph to perfectly capture every single piece of facts about the world. As such, Knowledge Graphs are often incomplete and many researchers have developed different algorithms to predict missing facts in Knowledge Graphs. Knowledge Graph Embedding models were first proposed to mainly solve the Knowledge Graph Completion problem. Besides, embedding models can also be useful in solving many downstream tasks such as entity classification and entity alignment.

MCL has been recently working on Effective Knowledge Graph Embedding. Translation, rotation, and scaling are three commonly used geometric manipulation operations in image processing. Besides, some of them are successfully used in developing effective knowledge graph embedding (KGE) models such as TransE and RotatE. Inspired by the synergy, we propose a new KGE model by leveraging all three operations. Since translation, rotation, and scaling operations are cascaded to form a compound one, the new model is named CompoundE. By casting CompoundE in the framework of group theory, we show that quite a few distanced-based KGE models are special cases of CompoundE. CompoundE extends the simple distance-based scoring functions to relation-dependent compound operations on head and/or tail entities. To demonstrate the effectiveness of CompoundE, we conduct experiments on three popular knowledge graph completion datasets. Experimental results show that CompoundE consistently [...]

By |August 22nd, 2022|News|Comments Off on MCL Research on Effective Knowledge Graph Embedding|