Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons™

Open Access. Powered by Scholars. Published by Universities.®

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 10681 - 10710 of 63020

Full-Text Articles in Computer Sciences

Exploring Model Dynamics For Accumulative Poisoning Discovery, Jianing Zhu, Xiawei Guo, Jiangchao Yao, Chao Du, Li He, Shuo Yuan, Tongliang Liu, Liang Wang, Bo Han Jul 2023

Exploring Model Dynamics For Accumulative Poisoning Discovery, Jianing Zhu, Xiawei Guo, Jiangchao Yao, Chao Du, Li He, Shuo Yuan, Tongliang Liu, Liang Wang, Bo Han

Machine Learning Faculty Publications

Adversarial poisoning attacks pose huge threats to various machine learning applications. Especially, the recent accumulative poisoning attacks show that it is possible to achieve irreparable harm on models via a sequence of imperceptible attacks followed by a trigger batch. Due to the limited data-level discrepancy in real-time data streaming, current defensive methods are indiscriminate in handling the poison and clean samples. In this paper, we dive into the perspective of model dynamics and propose a novel information measure, namely, Memorization Discrepancy, to explore the defense via the model-level information. By implicitly transferring the changes in the data manipulation to that …


Causal Discovery With Latent Confounders Based On Higher-Order Cumulants, Ruichu Cai, Zhiyi Huang, Wei Chen, Zhifeng Hao, Kun Zhang Jul 2023

Causal Discovery With Latent Confounders Based On Higher-Order Cumulants, Ruichu Cai, Zhiyi Huang, Wei Chen, Zhifeng Hao, Kun Zhang

Machine Learning Faculty Publications

Causal discovery with latent confounders is an important but challenging task in many scientific areas. Despite the success of some overcomplete independent component analysis (OICA) based methods in certain domains, they are computationally expensive and can easily get stuck into local optima. We notice that interestingly, by making use of higher-order cumulants, there exists a closed-form solution to OICA in specific cases, e.g., when the mixing procedure follows the One-Latent-Component structure. In light of the power of the closed-form solution to OICA corresponding to the One-Latent-Component structure, we formulate a way to estimate the mixing matrix using the higher-order cumulants, …


Feature Expansion For Graph Neural Networks, Jiaqi Sun, Lin Zhang, Guangyi Chen, Peng Xu, Kun Zhang, Yujiu Yang Jul 2023

Feature Expansion For Graph Neural Networks, Jiaqi Sun, Lin Zhang, Guangyi Chen, Peng Xu, Kun Zhang, Yujiu Yang

Machine Learning Faculty Publications

Graph neural networks aim to learn representations for graph-structured data and show impressive performance, particularly in node classification. Recently, many methods have studied the representations of GNNs from the perspective of optimization goals and spectral graph theory. However, the feature space that dominates representation learning has not been systematically studied in graph neural networks. In this paper, we propose to fill this gap by analyzing the feature space of both spatial and spectral models. We decompose graph neural networks into determined feature spaces and trainable weights, providing the convenience of studying the feature space explicitly using matrix space analysis. In …


Team Thesyllogist At Semeval-2023 Task 3: Language-Agnostic Framing Detection In Multi-Lingual Online News: A Zero-Shot Transfer Approach, Osama Mohammed Afzal, Preslav Nakov Jul 2023

Team Thesyllogist At Semeval-2023 Task 3: Language-Agnostic Framing Detection In Multi-Lingual Online News: A Zero-Shot Transfer Approach, Osama Mohammed Afzal, Preslav Nakov

Natural Language Processing Faculty Publications

We describe our system for SemEval-2022 Task 3 subtask 2 which on detecting the frames used in a news article in a multi-lingual setup. We propose a multi-lingual approach based on machine translation of the input, followed by an English prediction model. Our system demonstrated good zero-shot transfer capability, achieving micro-F1 scores of 53% for Greek (4th on the leaderboard) and 56.1% for Georgian (3rd on the leaderboard), without any prior training on translated data for these languages. Moreover, our system achieved comparable performance on seven other languages, including German, English, French, Russian, Italian, Polish, and Spanish. Our results demonstrate …


Semeval-2023 Task 3: Detecting The Category, The Framing, And The Persuasion Techniques In Online News In A Multi-Lingual Setup, Jakub Piskorski, Nicolas Stefanovitch, Giovanni Da San Martino, Preslav Nakov Jul 2023

Semeval-2023 Task 3: Detecting The Category, The Framing, And The Persuasion Techniques In Online News In A Multi-Lingual Setup, Jakub Piskorski, Nicolas Stefanovitch, Giovanni Da San Martino, Preslav Nakov

Natural Language Processing Faculty Publications

We describe SemEval-2023 task 3 on Detecting the Category, the Framing, and the Persuasion Techniques in Online News in a Multilingual Setup: the dataset, the task organization process, the evaluation setup, the results, and the participating systems. The task focused on news articles in nine languages (six known to the participants upfront: English, French, German, Italian, Polish, and Russian), and three additional ones revealed to the participants at the testing phase: Spanish, Greek, and Georgian). The task featured three subtasks: (1) determining the genre of the article (opinion, reporting, or satire), (2) identifying one or more frames used in an …


Multilingual Multifaceted Understanding Of Online News In Terms Of Genre, Framing And Persuasion Techniques, Jakub Piskorski, Nicolas Stefanovitch, Nikolaos Nikolaidis, Giovanni Da San Martino, Preslav Nakov Jul 2023

Multilingual Multifaceted Understanding Of Online News In Terms Of Genre, Framing And Persuasion Techniques, Jakub Piskorski, Nicolas Stefanovitch, Nikolaos Nikolaidis, Giovanni Da San Martino, Preslav Nakov

Natural Language Processing Faculty Publications

We present a new multilingual multifacet dataset of news articles, each annotated for genre (objective news reporting vs. opinion vs. satire), framing (what key aspects are highlighted), and persuasion techniques (logical fallacies, emotional appeals, ad hominem attacks, etc.). The persuasion techniques are annotated at the span level, using a taxonomy of 23 fine-grained techniques grouped into 6 coarse categories. The dataset contains 1,612 news articles covering recent news on current topics of public interest in six European languages (English, French, German, Italian, Polish, and Russian), with more than 37k annotated spans of persuasion techniques. We describe the dataset and the …


Model Transferability With Responsive Decision Subjects, Yatong Chen, Zeyu Tang, Kun Zhang, Yang Liu Jul 2023

Model Transferability With Responsive Decision Subjects, Yatong Chen, Zeyu Tang, Kun Zhang, Yang Liu

Machine Learning Faculty Publications

Given an algorithmic predictor that is accurate on some source population consisting of strategic human decision subjects, will it remain accurate if the population respond to it? In our setting, an agent or a user corresponds to a sample (X, Y ) drawn from a distribution D and will face a model h and its classification result h(X). Agents can modify X to adapt to h, which will incur a distribution shift on (X, Y ). Our formulation is motivated by applications where the deployed machine learning models are subjected to human agents, and will ultimately face responsive and interactive …


Detecting Out-Of-Distribution Data Through In-Distribution Class Prior, Xue Jiang, Feng Liu, Zhen Fang, Hong Chen, Tongliang Liu, Feng Zheng, Bo Han Jul 2023

Detecting Out-Of-Distribution Data Through In-Distribution Class Prior, Xue Jiang, Feng Liu, Zhen Fang, Hong Chen, Tongliang Liu, Feng Zheng, Bo Han

Machine Learning Faculty Publications

Given a pre-trained in-distribution (ID) model, the inference-time out-of-distribution (OOD) detection aims to recognize OOD data during the inference stage. However, some representative methods share an unproven assumption that the probability that OOD data belong to every ID class should be the same, i.e., these OOD-to-ID probabilities actually form a uniform distribution. In this paper, we show that this assumption makes the above methods incapable when the ID model is trained with class-imbalanced data. Fortunately, by analyzing the causal relations between ID/OOD classes and features, we identify several common scenarios where the OOD-to-ID probabilities should be the ID-class-prior distribution and …


How To Make Decision Under Interval Uncertainty: Description Of All Reasonable Partial Orders On The Set Of All Intervals, Tiago M. Costa, Olga Kosheleva, Vladik Kreinovich Jul 2023

How To Make Decision Under Interval Uncertainty: Description Of All Reasonable Partial Orders On The Set Of All Intervals, Tiago M. Costa, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, we need to make a decision while for each alternative, we only know the corresponding value of the objective function with interval uncertainty. To help a decision maker in this situation, we need to know the (in general, partial) order on the set of all intervals that corresponds to the preferences of the decision maker. For this purpose, in this paper, we provide a description of all such partial orders -- under some reasonable conditions. It turns out that each such order is characterized by two linear inequalities relating the endpoints of the corresponding intervals, and …


Which Fuzzy Implications Operations Are Polynomial? A Theorem Proves That This Can Be Determined By A Finite Set Of Inequalities, Sebastia Massanet, Olga Kosheleva, Vladik Kreinovich Jul 2023

Which Fuzzy Implications Operations Are Polynomial? A Theorem Proves That This Can Be Determined By A Finite Set Of Inequalities, Sebastia Massanet, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

To adequately represent human reasoning in a computer-based systems, it is desirable to select fuzzy operations that are as close to human reasoning as possible. In general, every real-valued function can be approximated, with any desired accuracy, by polynomials; it is therefore reasonable to use polynomial fuzzy operations as the appropriate approximations. We thus need to select, among all polynomial operations that satisfy corresponding properties -- like associativity -- the ones that best fit the empirical data. The challenge here is that properties like associativity mean satisfying infinitely many constraints (corresponding to infinitely many possible triples of values), while most …


Fuzzy Mathematics Under Non-Minimal "And"-Operations (T-Norms): Equivalence Leads To Metric, Order Leads To Kinematic Metric, Topology Leads To Area Or Volume, Purbita Jana, Olga Kosheleva, Vladik Kreinovich Jul 2023

Fuzzy Mathematics Under Non-Minimal "And"-Operations (T-Norms): Equivalence Leads To Metric, Order Leads To Kinematic Metric, Topology Leads To Area Or Volume, Purbita Jana, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Most formulas analyzed in fuzzy mathematics assume -- explicitly or implicitly -- that the corresponding "and"-operation (t-norm) is the simplest minimum operation. In this paper, we analyze what happens if instead, we use other "and"-operations. It turns out that for such operations, a fuzzification of a mathematical theory naturally leads to a more complex mathematical setting: fuzzification of equivalence relation leads to metric, fuzzification of order leads to kinematic metric, and fuzzification of topology leads to area or volume.


Why Deep Learning Is Under-Determined? Why Usual Numerical Methods For Solving Partial Differential Equations Do Not Preserve Energy? The Answers May Be Related To Chevalley-Warning Theorem (And Thus To Fermat Last Theorem), Julio C. Urenda, Olga Kosheleva, Vladik Kreinovich Jul 2023

Why Deep Learning Is Under-Determined? Why Usual Numerical Methods For Solving Partial Differential Equations Do Not Preserve Energy? The Answers May Be Related To Chevalley-Warning Theorem (And Thus To Fermat Last Theorem), Julio C. Urenda, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In this paper, we provide a possible explanation to two seemingly unrelated phenomena: (1) that in deep learning, under-determined systems of equations perform much better than the over-determined one -- which are typical in data processing, and that (2) usual numerical methods for solving partial differential equations do not preserve energy. Our explanation is related to the intuition of Fermat behind his Last Theorem and of Euler about more general statements, intuition that led to the proof of Chevalley-Warning Theorem in number theory.


Methodological Lesson Of Pythagorean Triples, Julio C. Urenda, Olga Kosheleva, Vladik Kreinovich Jul 2023

Methodological Lesson Of Pythagorean Triples, Julio C. Urenda, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

There are many right triangles in which all three sides a, b, and c have integer lengths. The triples (a,b,c) formed by such lengths are known as Pythagorean triples. Since ancient times, it is known how to generate all Pythagorean triples: we can enumerate primitive Pythagorean triples -- in which the three numbers have no common divisors -- by considering all pairs of natural numbers m>n in which m and n have no common divisors, and taking a =m2 − n2, b = 2mn, and c = m2 + n2. Multiplying all elements of a triple by the same …


Why Resilient Modulus Is Proportional To The Square Root Of Unconfined Compressive Strength (Ucs): A Qualitative Explanation, Edgar Daniel Rodriguez Velasquez, Vladik Kreinovich Jul 2023

Why Resilient Modulus Is Proportional To The Square Root Of Unconfined Compressive Strength (Ucs): A Qualitative Explanation, Edgar Daniel Rodriguez Velasquez, Vladik Kreinovich

Departmental Technical Reports (CS)

The strength of the pavement is determine by its resilient modulus, i.e., by its ability to withstand (practically) instantaneous stresses caused by the passing traffic. However, the resilient modulus is not easy to measure: its measurement requires a special expensive equipment that many labs do not have. So, instead of measuring it, practitioners often measure easier-to-measure Unconfined Compressive Strength (UCS) -- that describes the effect of a continuously applied force -- and estimate the resilient modulus based on the result of this measurement. An empirical formula shows that the resilient modulus is proportional to the square root of the Unconfined …


How To Estimate Unknown Unknowns: From Cosmic Light To Election Polls, Talha Azfar, Vignesh Ponraj, Vladik Kreinovich, Nguyen Hoang Phuong Jul 2023

How To Estimate Unknown Unknowns: From Cosmic Light To Election Polls, Talha Azfar, Vignesh Ponraj, Vladik Kreinovich, Nguyen Hoang Phuong

Departmental Technical Reports (CS)

In two different areas of research -- in the study of space light and in the study of voting -- the observed value of the quantity of interest is twice larger than what we would expect. That the observed value is larger makes perfect sense: there are phenomena that we do not take into account in our estimations. However, the fact that the observed value is exactly twice larger deserves explanation. In this paper, we show that Laplace Indeterminacy Principle leads to such an explanation.


Identification Of Dialect For Eastern And Southwestern Ojibwe Words Using A Small Corpus, Kalvin Hartwig, Evan Lucas, Timothy C. Havens Jul 2023

Identification Of Dialect For Eastern And Southwestern Ojibwe Words Using A Small Corpus, Kalvin Hartwig, Evan Lucas, Timothy C. Havens

Michigan Tech Publications

The Ojibwe language has several dialects that vary to some degree in both spoken and written form. We present a method of using support vector machines to classify two different dialects (Eastern and Southwestern Ojibwe) using a very small corpus of text. Classification accuracy at the sentence level is 90% across a five-fold cross validation and 72% when the sentence-trained model is applied to a data set of individual words. Our code and the word level data set are released openly at https://github.com/evanperson/OjibweDialect.


How To Combine Probabilistic And Fuzzy Uncertainty: Theoretical Explanation Of Clustering-Related Empirical Result, Lázló Szilágyi, Olga Kosheleva, Vladik Kreinovich Jul 2023

How To Combine Probabilistic And Fuzzy Uncertainty: Theoretical Explanation Of Clustering-Related Empirical Result, Lázló Szilágyi, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In contrast to crisp clustering techniques that assign each object to a class, fuzzy clustering algorithms assign, to each object and to each class, a degree to which this object belongs to this class. In the most widely used fuzzy clustering algorithm -- fuzzy c-means -- for each object, degrees corresponding to different classes add up to 1. From this viewpoint, these degrees act as probabilities. There exist alternative fuzzy-based clustering techniques in which, in line with the general idea of the fuzzy set, the largest of the degrees is equal to 1. In some practical situations, the probability-type fuzzy …


Fuzzy Techniques Explain The Effectiveness Of Relu Activation Function In Deep Learning, Julio C. Urenda, Olga Kosheleva, Vladik Kreinovich Jul 2023

Fuzzy Techniques Explain The Effectiveness Of Relu Activation Function In Deep Learning, Julio C. Urenda, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In the last decades, deep learning has led to spectacular successes. One of the reasons for these successes was the fact that deep neural networks use a special Rectified Linear Unit (ReLU) activation function s(x) = max(0,x). Why this activation function is so successful is largely a mystery. In this paper, we show that common sense ideas -- as formalized by fuzzy logic -- can explain this mysterious effectiveness.


Why 6-Labels Uncertainty Scale In Geosciences: Probability-Based Explanation, Aaron Velasco, Julio C. Urenda, Olga Kosheleva, Vladik Kreinovich Jul 2023

Why 6-Labels Uncertainty Scale In Geosciences: Probability-Based Explanation, Aaron Velasco, Julio C. Urenda, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

To describe uncertainty in geosciences, several researchers have recently proposed a 6-labels uncertainty scale, in which one the labels corresponds to full certainty, one label to the absence of any knowledge, and the remaining four labels correspond to the degrees of confidence from the intervals [0,0.25], [0.25,0.5], [0.5,0.75], and [0.75,1]. Tests of this 6-labels scale indicate that it indeed conveys uncertainty information to geoscientists much more effectively than previously proposed uncertainty schemes. In this paper, we use probability-related techniques to explain this effectiveness.


Complex Numbers Explain Why In Chinese Tradition, 4 Is Bad But 8 Is Good, Luc Longpre, Olga Kosheleva, Vladik Kreinovich Jul 2023

Complex Numbers Explain Why In Chinese Tradition, 4 Is Bad But 8 Is Good, Luc Longpre, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In the traditional Chinese culture, 4 is considered to be an unlucky number, while the number 8 is considered to be very lucky. In this paper, we show that both "badness" and "goodness" can be explained if we take into account the role of complex numbers in the analysis of general dynamical systems.


Why Bump Reward Function Works Well In Training Insulin Delivery Systems, Lehel Dénes-Fazakas, Lásló Szilágyi, Gyorgy Eigner, Olga Kosheleva, Vladik Kreinovich, Nguyen Hoang Phuong Jul 2023

Why Bump Reward Function Works Well In Training Insulin Delivery Systems, Lehel Dénes-Fazakas, Lásló Szilágyi, Gyorgy Eigner, Olga Kosheleva, Vladik Kreinovich, Nguyen Hoang Phuong

Departmental Technical Reports (CS)

Diabetes is a disease when the body can no longer properly regulate blood glucose level, which can lead to life-threatening situations. To avoid such situations and regulate blood glucose level, patients with severe form of diabetes need insulin injections. Ideally, the system should automatically decide when best to inject insulin and how much to inject. To find the optimal control, researchers applied machine learning with different reward functions. It turns out that the most effective learning occurred when they used the so-called bump function. In this paper, we provide a possible explanation for this empirical result.


We Can Always Reduce A Non-Linear Dynamical System To Linear -- At Least Locally -- But Does It Help?, Orsolya Csiszar, Gábor Csiszar, Olga Kosheleva, Vladik Kreinovich, Nguyen Hoang Phuong Jul 2023

We Can Always Reduce A Non-Linear Dynamical System To Linear -- At Least Locally -- But Does It Help?, Orsolya Csiszar, Gábor Csiszar, Olga Kosheleva, Vladik Kreinovich, Nguyen Hoang Phuong

Departmental Technical Reports (CS)

Many real-life phenomena are described by dynamical systems. Sometimes, these dynamical systems are linear. For such systems, solutions are well known. In some cases, it is possible to transform a nonlinear system into a linear one by appropriately transforming its variables, and this helps to solve the original nonlinear system. For other nonlinear systems -- even for the simplest ones -- such transformation is not known. A natural question is: which nonlinear systems allow such transformations? In this paper, we show that we can always reduce a nonlinear system to a linear one -- but, in general, it does not …


What Was More Frequently Used -- "And" Or "Or": Based On Analysis Of European Languages, Olga Kosheleva, Vladik Kreinovich Jul 2023

What Was More Frequently Used -- "And" Or "Or": Based On Analysis Of European Languages, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Traditional logic has two main connectives: "and" and "or". A natural question is: which of the two is more frequently used? This question is easy to answer for the current usage of these connectives -- we can simply analyze all the texts, but what can we say about the past usage? To answer this question, we use the known linguistics fact that, in general, notions that are more frequently used are described by shorter words. It turns out that in most European languages, the word for "and" is shorter -- or of the same length -- as the word for …


How To Propagate Interval (And Fuzzy) Uncertainty: Optimism-Pessimism Approach, Vinícius F. Wasques, Olga Kosheleva, Vladik Kreinovich Jul 2023

How To Propagate Interval (And Fuzzy) Uncertainty: Optimism-Pessimism Approach, Vinícius F. Wasques, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, inputs to a data processing algorithm are known with interval uncertainty, and we need to propagate this uncertainty through the algorithm, i.e., estimate the uncertainty of the result of data processing. Traditional interval computation techniques provide guaranteed estimates, but from the practical viewpoint, these bounds are too pessimistic: they take into account highly improbable worst-case situations when all the measurement and estimation errors happen to be strongly correlated. In this paper, we show that a natural idea of having more realistic estimates leads to the use of so-called interactive addition of intervals, techniques that has already …


Classification Of Drainage Crossings On High-Resolution Digital Elevation Models: A Deep Learning Approach, Di Wu, Ruopu Li, Banafsheh Rekabdar, Claire Talbert, Michael Edidem, Guangxing Wang Jul 2023

Classification Of Drainage Crossings On High-Resolution Digital Elevation Models: A Deep Learning Approach, Di Wu, Ruopu Li, Banafsheh Rekabdar, Claire Talbert, Michael Edidem, Guangxing Wang

Computer Science Faculty Publications and Presentations

High-Resolution Digital Elevation Models (HRDEMs) have been used to delineate fine-scale hydrographic features in landscapes with relatively level topography. However, artificial flow barriers associated with roads are known to cause incorrect modeled flowlines, because these barriers substantially increase the terrain elevation and often terminate flowlines. A common practice is to breach the elevation of roads near drainage crossing locations, which, however, are often unavailable. Thus, developing a reliable drainage crossing dataset is essential to improve the HRDEMs for hydrographic delineation. The purpose of this research is to develop deep learning models for classifying the images that contain the locations of …


Lossy Kernelization Of Same-Size Clustering, Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov Jul 2023

Lossy Kernelization Of Same-Size Clustering, Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov

Computer Science Faculty Publications and Presentations

In this work, we study the k-median clustering problem with an additional equal-size constraint on the clusters from the perspective of parameterized preprocessing. Our main result is the first lossy (2-approximate) polynomial kernel for this problem parameterized by the cost of clustering. We complement this result by establishing lower bounds for the problem that eliminate the existence of an (exact) kernel of polynomial size and a PTAS.


Research On Legal Text Matching Based On Pre-Training Model, Chuanming Yu, Yifan Jiang Jul 2023

Research On Legal Text Matching Based On Pre-Training Model, Chuanming Yu, Yifan Jiang

Journal of Scientific Information Research

[Purpose/significance]This study aims to solve the problem of traditional short text matching models being difficult to apply to long text matching tasks such as legal case retrieval. [Method/process]For the task of legal case matching, this paper proposes a Legal Text Matching model based on RoFormer (LTMR). In the coding layer, the legal case is encoded through the RoFormer model and the legal feature extractor. In the reasoning layer, the context and interactive information of long text are further extracted by using interactive attention and self-attention mechanisms. We conducted the empirical research by applying the proposed model to the CAIL2019-SCM dataset. …


Stock-Oriented Measurement Of Financial News Correlation: Based On Theory Of Quantifying News Value, Jing Shi, Bin Zhang, Ye Chen Jul 2023

Stock-Oriented Measurement Of Financial News Correlation: Based On Theory Of Quantifying News Value, Jing Shi, Bin Zhang, Ye Chen

Journal of Scientific Information Research

[Purpose/significance]To identify crucial financial news information and tap its potential value related to specific stocks more quickly and accurately, we conduct financial news correlation measurement research in terms of stocks.[Method/process]Natural Language Processing and Machine Learning are used to measure the correlation by text analysis in the word's dimension. Then, the theory of quantifying news is applied to construct a stock-oriented evaluation index system for financial news correlation.[Result/conclusion]This paper realizes a personalized and automatic measurement of news correlation with the index system. Further, the influence of each index is also be analyzed.


Singapore's Ai Applications In The Public Sector: Six Examples, Steven M. Miller Jul 2023

Singapore's Ai Applications In The Public Sector: Six Examples, Steven M. Miller

Research Collection School Of Computing and Information Systems

Steven M. Miller describes six instances in which Singapore has applied AI in the public sector, illustrating different ways of improving its engagement with the public by making government services more accessible, anywhere, anytime, and speeding its responses to public processes and feedback. He illustrates how its leaders made the city a living lab for AI use, and what they learned.


Qebverif: Quantization Error Bound Verification Of Neural Networks, Yedi Zhang, Fu Song, Jun Sun Jul 2023

Qebverif: Quantization Error Bound Verification Of Neural Networks, Yedi Zhang, Fu Song, Jun Sun

Research Collection School Of Computing and Information Systems

To alleviate the practical constraints for deploying deep neural networks (DNNs) on edge devices, quantization is widely regarded as one promising technique. It reduces the resource requirements for computational power and storage space by quantizing the weights and/or activation tensors of a DNN into lower bit-width fixed-point numbers, resulting in quantized neural networks (QNNs). While it has been empirically shown to introduce minor accuracy loss, critical verified properties of a DNN might become invalid once quantized. Existing verification methods focus on either individual neural networks (DNNs or QNNs) or quantization error bound for partial quantization. In this work, we propose …