aid stringlengths 9 15 | mid stringlengths 7 10 | abstract stringlengths 78 2.56k | related_work stringlengths 92 1.77k | ref_abstract dict |
|---|---|---|---|---|
1812.11252 | 2908253384 | As science advances, the academic community has published millions of research papers. Researchers devote time and effort to search relevant manuscripts when writing a paper or simply to keep up with current research. In this paper, we consider the problem of citation recommendation by extending a set of known-to-be-re... | @cite_23 addressed the problem of citation recommendation using singular value decomposition on the adjacency matrix associated with the citation graph to construct a latent semantic space: a lower-dimensional space where correlated papers can be easily identified. Their experiments on Citeseer show this approach achie... | {
"cite_N": [
"@cite_23",
"@cite_11"
],
"mid": [
"1978059262",
"2135790056"
],
"abstract": [
"Scientists continue to find challenges in the ever increasing amount of information that has been produced on a world wide scale, during the last decades. When writing a paper, an author searches ... |
1812.11252 | 2908253384 | As science advances, the academic community has published millions of research papers. Researchers devote time and effort to search relevant manuscripts when writing a paper or simply to keep up with current research. In this paper, we consider the problem of citation recommendation by extending a set of known-to-be-re... | A typical related paper search scenario is that a user starts with a seed of one or more papers, by reading the available text and searching related cited references. Sofia is a system that automates this recursive process @cite_33 . | {
"cite_N": [
"@cite_33"
],
"mid": [
"2095368000"
],
"abstract": [
"When working on a new project, researchers need to devote a significant amount of time and effort to surveying the relevant literature. This is required in order to gain expertise, evaluate the significance of their work and gain ... |
1812.11252 | 2908253384 | As science advances, the academic community has published millions of research papers. Researchers devote time and effort to search relevant manuscripts when writing a paper or simply to keep up with current research. In this paper, we consider the problem of citation recommendation by extending a set of known-to-be-re... | The approach proposed by @cite_9 returns a set of relevant articles by optimizing a function based on a fine-grained notion of influence between documents; and also claim that, for paper recommendation, defining a query as a small set of known-to-be-relevant papers is better than a string of keywords. | {
"cite_N": [
"@cite_9"
],
"mid": [
"2000613522"
],
"abstract": [
"In scientific research, it is often difficult to express information needs as simple keyword queries. We present a more natural way of searching for relevant scientific literature. Rather than a string of keywords, we define a quer... |
1812.11252 | 2908253384 | As science advances, the academic community has published millions of research papers. Researchers devote time and effort to search relevant manuscripts when writing a paper or simply to keep up with current research. In this paper, we consider the problem of citation recommendation by extending a set of known-to-be-re... | @cite_2 examined the effectiveness of various text-based and citation-based features on citation recommendation, they find that neither text-based nor citation-based features performed very well in isolation, while text similarity alone achieves a surprisingly poor performance at this task. @cite_10 considered the prob... | {
"cite_N": [
"@cite_10",
"@cite_32",
"@cite_2"
],
"mid": [
"",
"2002642763",
"1995326326"
],
"abstract": [
"",
"Automatic recommendation of citations for a manuscript is highly valuable for scholarly activities since it can substantially improve the efficiency and quality of l... |
1812.11252 | 2908253384 | As science advances, the academic community has published millions of research papers. Researchers devote time and effort to search relevant manuscripts when writing a paper or simply to keep up with current research. In this paper, we consider the problem of citation recommendation by extending a set of known-to-be-re... | Recently, citation recommendation from heterogeneous network mining perspective has attracted more attention. Besides papers, metadata such as authors or keywords are also considered as entities in the graph schema. Two entities can be connected via different paths, called meta-paths, which usually carry different sema... | {
"cite_N": [
"@cite_21",
"@cite_4",
"@cite_6",
"@cite_26"
],
"mid": [
"2029099433",
"2394638270",
"2164259805",
"2091002342"
],
"abstract": [
"Citation relationship between scientific publications has been successfully used for scholarly bibliometrics, information retrieva... |
1812.11252 | 2908253384 | As science advances, the academic community has published millions of research papers. Researchers devote time and effort to search relevant manuscripts when writing a paper or simply to keep up with current research. In this paper, we consider the problem of citation recommendation by extending a set of known-to-be-re... | The vocabulary used in the citation context and in the content of papers are usually quite different. To address this problem, some works propose to use translation model, which can bridge the gap between two heterogeneous languages @cite_5 @cite_22 . Based on previous work @cite_10 @cite_32 @cite_22 , built a citation... | {
"cite_N": [
"@cite_30",
"@cite_22",
"@cite_32",
"@cite_5",
"@cite_10"
],
"mid": [
"2023930240",
"2122778642",
"2002642763",
"2088772104",
""
],
"abstract": [
"Citations are important in academic dissemination. To help researchers check the completeness of citation... |
1812.11252 | 2908253384 | As science advances, the academic community has published millions of research papers. Researchers devote time and effort to search relevant manuscripts when writing a paper or simply to keep up with current research. In this paper, we consider the problem of citation recommendation by extending a set of known-to-be-re... | Based on the hypothesis that an author's published works constitute a clean signal of the latent interests of a researcher, @cite_34 examined the effect of modeling a researcher's past works in recommending papers. Specifically, they first construct a user profile based on her his recent works, then rank candidate pape... | {
"cite_N": [
"@cite_28",
"@cite_34"
],
"mid": [
"2163089586",
"2062340319"
],
"abstract": [
"To help generate relevant suggestions for researchers, recommendation systems have started to leverage the latent interests in the publication profiles of the researchers themselves. While using s... |
1812.11485 | 2908196222 | Memory-Augmented Neural Networks (MANNs) are a class of neural networks equipped with an external memory, and are reported to be effective for tasks requiring a large long-term memory and its selective use. The core module of a MANN is called a controller, which is usually implemented as a recurrent neural network (RNN... | NTM-based MANNs have been actively studied since the advent of the NTM @cite_18 @cite_15 @cite_8 . proposed Sparse Access Memory (SAM), which is a scalable end-to-end differentiable memory access scheme. One of the biggest restrictions of MANNs is that the capacity of memory depends on the size of the external memory, ... | {
"cite_N": [
"@cite_8",
"@cite_18",
"@cite_15"
],
"mid": [
"2950308898",
"2472819217",
""
],
"abstract": [
"Deep learning models are often not easily adaptable to new tasks and require task-specific adjustments. The differentiable neural computer (DNC), a memory-augmented neural n... |
1812.11423 | 2962969859 | The delivery of mental health interventions via ubiquitous devices has shown much promise. A conversational chatbot is a promising oracle for delivering appropriate just-in-time interventions. However, designing emotionally-aware agents, specially in this context, is under-explored. Furthermore, the feasibility of auto... | Conversational agents have shown promise in automating the detection of psychological symptoms for both assessment and the evaluation of treatment impact @cite_13 . There is evidence suggesting that the general population can also benefit from such eHealth interventions. Anxiety and depression prevention EMIs are assoc... | {
"cite_N": [
"@cite_1",
"@cite_13"
],
"mid": [
"2751552421",
"2525807009"
],
"abstract": [
"Abstract Background Anxiety and depression are associated with a range of adverse outcomes and represent a large global burden to individuals and health care systems. Prevention programs are an imp... |
1812.11039 | 2907931557 | In this paper, we study the loss surface of the over-parameterized fully connected deep neural networks. We prove that for any continuous activation functions, the loss function has no bad strict local minimum, both in the regular sense and in the sense of sets. This result holds for any convex and continuous loss func... | Finally, landscape analysis is just one part of the deep learning theory, which includes representation, algorithm convergence, optimization landscape and generalization. In terms of algorithm convergence, there is much recent interest in analyzing algorithms that escape saddle points for generic non-convex functions @... | {
"cite_N": [
"@cite_37",
"@cite_9",
"@cite_32",
"@cite_47",
"@cite_10",
"@cite_20",
"@cite_11"
],
"mid": [
"2283214199",
"2769394111",
"2592651140",
"1697075315",
"2709553318",
"2565538933",
"813605148"
],
"abstract": [
"We show that gradient descen... |
1812.11004 | 2908356592 | Recent progress has been made in using attention based encoder-decoder framework for image and video captioning. Most existing decoders apply the attention mechanism to every generated word including both visual words (e.g., "gun" and "shooting") and non-visual words (e.g. "the", "a"). However, these non-visual words c... | At the earlier stage of visual captioning, several models such as @cite_46 @cite_8 @cite_68 have been proposed by directly bring together previous advances in natural language processing and computer vision. More specifically, semantic representation of an image is captured by a CNN network and then decoded into a capt... | {
"cite_N": [
"@cite_46",
"@cite_68",
"@cite_8"
],
"mid": [
"",
"877909479",
"1895577753"
],
"abstract": [
"",
"Recently, joint video-language modeling has been attracting more and more attention. However, most existing approaches focus on exploring the language model upon on a... |
1812.11004 | 2908356592 | Recent progress has been made in using attention based encoder-decoder framework for image and video captioning. Most existing decoders apply the attention mechanism to every generated word including both visual words (e.g., "gun" and "shooting") and non-visual words (e.g. "the", "a"). However, these non-visual words c... | Later on, researchers found that different regions in images and frames in videos have different weights, and thus various attention mechanisms are introduced to guide captioning models by telling where to look at for sentence generation, such as @cite_28 @cite_30 @cite_69 @cite_11 . Yao @cite_69 proposed to incorporat... | {
"cite_N": [
"@cite_30",
"@cite_69",
"@cite_28",
"@cite_41",
"@cite_11"
],
"mid": [
"1957740064",
"2950307714",
"2963843052",
"2949828251",
"2950178297"
],
"abstract": [
"We present an approach that exploits hierarchical Recurrent Neural Networks (RNNs) to tackle t... |
1812.11004 | 2908356592 | Recent progress has been made in using attention based encoder-decoder framework for image and video captioning. Most existing decoders apply the attention mechanism to every generated word including both visual words (e.g., "gun" and "shooting") and non-visual words (e.g. "the", "a"). However, these non-visual words c... | Semantic attention has been proposed in previous work @cite_34 @cite_36 @cite_72 by adopting attributes or concepts generated by other pre-trained models to enhance captioning performance. Basically, semantic attention is able to attend to a semantically important concepts or attributes or region of interest in an imag... | {
"cite_N": [
"@cite_36",
"@cite_72",
"@cite_34"
],
"mid": [
"2552161745",
"2951159095",
""
],
"abstract": [
"Automatically describing an image with a natural language has been an emerging challenge in both fields of computer vision and natural language processing. In this paper, w... |
1812.11004 | 2908356592 | Recent progress has been made in using attention based encoder-decoder framework for image and video captioning. Most existing decoders apply the attention mechanism to every generated word including both visual words (e.g., "gun" and "shooting") and non-visual words (e.g. "the", "a"). However, these non-visual words c... | Recently, several researchers have started to utilize reinforcement learning to optimize image captioning @cite_3 @cite_63 @cite_65 @cite_35 . To collaboratively generate caption, Ren @cite_35 incorporated a policy network" for generating sentence and a value network" for evaluating predicting sentence globally, and th... | {
"cite_N": [
"@cite_35",
"@cite_63",
"@cite_65",
"@cite_3"
],
"mid": [
"2952591111",
"2963084599",
"2949376505",
"2176263492"
],
"abstract": [
"Image captioning is a challenging problem owing to the complexity in understanding the image content and diverse ways of describi... |
1812.11149 | 2888540334 | We consider the online problem in which an intermediary trades identical items with a sequence of n buyers and n sellers, each of unit demand. We assume that the values of the traders are selected by an adversary and the sequence is randomly permuted. We give competitive algorithms for two objectives: welfare and gain-... | The wide range of applications of secretary models (and the related prophet inequalities) have led to the design of posted price mechanisms, that are simple to describe, robust, truthful and achieve surprisingly good approximation ratios. introduced prophet inequality techniques in online auction in @cite_14 . The @mat... | {
"cite_N": [
"@cite_14",
"@cite_1",
"@cite_3",
"@cite_16",
"@cite_10",
"@cite_12"
],
"mid": [
"1530458910",
"2077124610",
"2950351404",
"2150582214",
"2746812626",
"2061418963"
],
"abstract": [
"Recent work on online auctions for digital goods has explored ... |
1907.03572 | 2956148802 | Emotional aspects play an important part in our interaction with music. However, modelling these aspects in MIR systems have been notoriously challenging since emotion is an inherently abstract and subjective experience, thus making it difficult to quantify or predict in the first place, and to make sense of the predic... | In the MIR field, audio-based music emotion recognition (MER) has traditionally been done by extracting selected features from the audio and predicting emotion based on subsequent processing of these features @cite_1 . Methods such as linear regression, regression trees, support vector regression, and variants have bee... | {
"cite_N": [
"@cite_7",
"@cite_8",
"@cite_1",
"@cite_6",
"@cite_2",
"@cite_5",
"@cite_10",
"@cite_12"
],
"mid": [
"2592535880",
"2403697441",
"2341090665",
"",
"2400268313",
"2149628368",
"",
"2023001347"
],
"abstract": [
"Music emotion reco... |
1907.03572 | 2956148802 | Emotional aspects play an important part in our interaction with music. However, modelling these aspects in MIR systems have been notoriously challenging since emotion is an inherently abstract and subjective experience, thus making it difficult to quantify or predict in the first place, and to make sense of the predic... | Deep neural networks are preferable for many tasks due to their high performance but can be considered black boxes due to their non-linear and nested structure. While in some fields such as healthcare or criminal justice the use of predictive analytics can have life-affecting consequences @cite_9 , the decisions of MIR... | {
"cite_N": [
"@cite_9",
"@cite_16",
"@cite_13",
"@cite_3"
],
"mid": [
"2894881080",
"2964052309",
"2414752589",
"2918524527"
],
"abstract": [
"The authors developed and implemented transparent machine-learning models that call into question the use of black-box machine-lea... |
1907.03336 | 2955271505 | Over the past 10 years, many recommendation techniques have been based on embedding users and items in latent vector spaces, where the inner product of a (user,item) pair of vectors represents the predicted affinity of the user to the item. A wealth of literature has focused on the various modeling approaches that resu... | Matrix Factorization @cite_9 , made popular by the Netflix prize competition, embeds both users and the items into a latent feature space of a given dimension. Factorization Machines and their Field-Aware extension (FM) @cite_2 @cite_7 extend the basic matrix factorization model to model feature interactions. Every fea... | {
"cite_N": [
"@cite_9",
"@cite_3",
"@cite_7",
"@cite_2"
],
"mid": [
"2054141820",
"1992554260",
"2509235963",
""
],
"abstract": [
"As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearest neighbor techniques for produci... |
1907.03336 | 2955271505 | Over the past 10 years, many recommendation techniques have been based on embedding users and items in latent vector spaces, where the inner product of a (user,item) pair of vectors represents the predicted affinity of the user to the item. A wealth of literature has focused on the various modeling approaches that resu... | More recent techniques use deep neural nets to perform collaborative filtering (CF) @cite_5 and to extend factorization machines @cite_10 . Another neural approach is Facebook's Starspace @cite_8 , which embeds objects of different types into a common vector space. @cite_1 use deep learning to generate embeddings for s... | {
"cite_N": [
"@cite_1",
"@cite_5",
"@cite_10",
"@cite_8"
],
"mid": [
"2742272831",
"2605350416",
"2951001079",
"2962779279"
],
"abstract": [
"It is necessary to understand the content of articles and user preferences to make effective news recommendations. While ID-based m... |
1907.03395 | 2954414836 | Predicting the future trajectories of multiple interacting agents in a scene has become an increasingly important problem for many different applications ranging from control of autonomous vehicles and social robots to security and surveillance. This problem is compounded by the presence of social interactions between ... | In recent years due to the rise of popularity in development of autonomous driving systems and social robots, the problem of trajectory forecasting has received significant attention from many researchers in the community. The majority of existing works have been focused on the effects of incorporating physical feature... | {
"cite_N": [
"@cite_36",
"@cite_28",
"@cite_41",
"@cite_32",
"@cite_39",
"@cite_12",
"@cite_25",
"@cite_20"
],
"mid": [
"2134944993",
"",
"2805102305",
"2963330667",
"",
"2626778328",
"2952024198",
"2794787653"
],
"abstract": [
"In crowded s... |
1907.03395 | 2954414836 | Predicting the future trajectories of multiple interacting agents in a scene has become an increasingly important problem for many different applications ranging from control of autonomous vehicles and social robots to security and surveillance. This problem is compounded by the presence of social interactions between ... | The field of image domain translation has gone through several seminal advancements in the past couple years. The first advancement was made with the framework @cite_21 , which enabled translation but was limited by requiring paired training examples. Zhu al improved this model with CycleGAN @cite_3 , which was able to... | {
"cite_N": [
"@cite_18",
"@cite_21",
"@cite_32",
"@cite_3"
],
"mid": [
"2434741482",
"2963073614",
"2963330667",
"2962793481"
],
"abstract": [
"This paper describes InfoGAN, an information-theoretic extension to the Generative Adversarial Network that is able to learn dise... |
1907.03351 | 2953990100 | Most amino acids are encoded by multiple synonymous codons. For an amino acid, some of its synonymous codons are used much more rarely than others. Analyses of positions of such rare codons in protein sequences revealed that rare codons can impact co-translational protein folding and that positions of some rare codons ... | The genetic code is redundant, meaning that most amino acids are encoded by more than one codon. Codons that code for the same amino acid are called synonymous codons. For an amino acid, it is usually the case that some of its synonymous codons encode it in the given genome relatively more commonly than the others @cit... | {
"cite_N": [
"@cite_24",
"@cite_1",
"@cite_22"
],
"mid": [
"2785468798",
"",
"2070163065"
],
"abstract": [
"The unequal utilization of synonymous codons affects numerous cellular processes including translation rates, protein folding and mRNA degradation. In order to understand th... |
1907.03351 | 2953990100 | Most amino acids are encoded by multiple synonymous codons. For an amino acid, some of its synonymous codons are used much more rarely than others. Analyses of positions of such rare codons in protein sequences revealed that rare codons can impact co-translational protein folding and that positions of some rare codons ... | Rare codons are associated with lower tRNA levels, expression levels, and translational accuracy @cite_12 @cite_18 @cite_5 . As a result, it has been hypothesized that since common codons show efficient translation, they are more likely to be under selective pressure to occupy important regions in protein structures. T... | {
"cite_N": [
"@cite_18",
"@cite_7",
"@cite_27",
"@cite_5",
"@cite_10",
"@cite_25",
"@cite_12"
],
"mid": [
"2018590530",
"",
"2042548693",
"2141997506",
"1593377767",
"",
"2164618276"
],
"abstract": [
"A simple, effective measure of synonymous codon ... |
1907.03305 | 2953604211 | This paper presents a real-time control system for surface inspection using multiple unmanned aerial vehicles (UAVs). The UAVs are coordinated in a specific formation to collect data of the inspecting objects. The communication platform for data transmission is based on the Internet of things (IoT). In the proposed arc... | For automatic inspection, sophisticated systems featured path planning and path-following control algorithms have been proposed. In @cite_36 , an aerial robotic system for the contact-based surface inspection has been introduced using not only optimal trajectory tracking but also accurate force control techniques. In @... | {
"cite_N": [
"@cite_36",
"@cite_37",
"@cite_46",
"@cite_33"
],
"mid": [
"2219720796",
"2011272678",
"2516781553",
"1607046631"
],
"abstract": [
"The challenge of aerial robotic contact-based inspection is the driving motivation of this paper. The problem is approached on b... |
1907.03305 | 2953604211 | This paper presents a real-time control system for surface inspection using multiple unmanned aerial vehicles (UAVs). The UAVs are coordinated in a specific formation to collect data of the inspecting objects. The communication platform for data transmission is based on the Internet of things (IoT). In the proposed arc... | In terms of surface inspection, several studies have been conducted for defect detection tasks. In @cite_28 , a fast and effective defect detection method has been proposed using the size-based estimation with data obtained from both color and infrared cameras. In @cite_17 , Haar-like features and a cascading classifie... | {
"cite_N": [
"@cite_28",
"@cite_15",
"@cite_0",
"@cite_17"
],
"mid": [
"2520427900",
"2019949051",
"2527787519",
"2597358295"
],
"abstract": [
"Abstract The rapid, cost-effective, and non-disruptive assessment of bridge deck condition has emerged as a critical challenge fo... |
1907.03196 | 2954869531 | This paper presents a novel deep neural network (DNN) for multimodal fusion of audio, video and text modalities for emotion recognition. The proposed DNN architecture has independent and shared layers which aim to learn the representation for each modality, as well as the best combined representation to achieve the bes... | Over the past decade, facial expression recognition (ER) has been a topic of significant interest. Many ER techniques have been proposed to automatically detect the seven universally recognizable types of emotions -- joy, surprise, anger, fear, disgust, sadness and neutral -- from a single still facial image @cite_10 @... | {
"cite_N": [
"@cite_22",
"@cite_8",
"@cite_10",
"@cite_9",
"@cite_1",
"@cite_2",
"@cite_15",
"@cite_13"
],
"mid": [
"2947369712",
"2110885456",
"2556027894",
"2302333535",
"2161362162",
"2021890937",
"1669230375",
"2066332159"
],
"abstract": [
... |
1907.03196 | 2954869531 | This paper presents a novel deep neural network (DNN) for multimodal fusion of audio, video and text modalities for emotion recognition. The proposed DNN architecture has independent and shared layers which aim to learn the representation for each modality, as well as the best combined representation to achieve the bes... | Shape based methods like the constrained local model (CLM) describe facial component shapes based on salient anchor points. The movement of those landmarks provides discriminant information to guide the recognition process. Appearance based methods like LBP-TOP extract image intensity or other texture features from fac... | {
"cite_N": [
"@cite_9"
],
"mid": [
"2302333535"
],
"abstract": [
"In this paper, a new dynamic facial expression recognition method is proposed. Dynamic facial expression recognition is formulated as a longitudinal groupwise registration problem. The main contributions of this method lie in the f... |
1907.03196 | 2954869531 | This paper presents a novel deep neural network (DNN) for multimodal fusion of audio, video and text modalities for emotion recognition. The proposed DNN architecture has independent and shared layers which aim to learn the representation for each modality, as well as the best combined representation to achieve the bes... | This paper is focused on exploiting deep learning architectures to produce accurate mixtures of affect recognition systems. For instance, Kim @cite_21 proposed a hierarchical 3-level CNN architecture to combine multi-modal sources. DNNs are considered to learn a transformation sequence with the specific objective to ob... | {
"cite_N": [
"@cite_21"
],
"mid": [
"2294427751"
],
"abstract": [
"We present a pattern recognition framework to improve committee machines of deep convolutional neural networks (deep CNNs) and its application to static facial expression recognition in the wild (SFEW). In order to generate enough... |
1907.03331 | 2954943135 | Cryptocurrencies, which promise to become a global means of money transactions, are typically implemented with blockchain protocols. Blockchains utilize a variety of consensus algorithms, and their performance is advancing rapidly. However, a bottleneck remains: each node processes all transactions in the system. We pr... | * Client partitioning In Aspen @cite_58 and SplitScale @cite_60 , a leader is chosen using like in Bitcoin. The elected leader creates blocks on several concurrent chains. Clients can track a portion of the state, one sub-chain, but overall performance is not affected, in contrast to Ostraka. | {
"cite_N": [
"@cite_58",
"@cite_60"
],
"mid": [
"2551240797",
"2949975911"
],
"abstract": [
"The rise of blockchain-based cryptocurrencies has led to an explosion of services using distributed ledgers as their underlying infrastructure. However, due to inherently single-service oriented b... |
1907.03331 | 2954943135 | Cryptocurrencies, which promise to become a global means of money transactions, are typically implemented with blockchain protocols. Blockchains utilize a variety of consensus algorithms, and their performance is advancing rapidly. However, a bottleneck remains: each node processes all transactions in the system. We pr... | * Storage sharding Dietcoin @cite_47 shards the UTXO set of a blockchain and uses Merkle trees of UTXO-shards for SPV. Clients can efficiently obtain proofs of inclusion for their transactions by obtaining only the relevant UTXO-shard. @cite_10 reduce node storage complexity by using lower-degree replication of the blo... | {
"cite_N": [
"@cite_47",
"@cite_10"
],
"mid": [
"2795364690",
"2902571157"
],
"abstract": [
"Blockchains have a storage scalability issue. Their size is not bounded and they grow indefinitely as time passes. As of August 2017, the Bitcoin blockchain is about 120 GiB big while it was only ... |
1907.03248 | 2962988034 | Face alignment consists in aligning a shape model on a face in an image. It is an active domain in computer vision as it is a preprocessing for applications like facial expression recognition, face recognition and tracking, face animation, etc. Current state-of-the-art methods already perform well on "easy" datasets, i... | Other methods aim to be robust to all sources of variation. @cite_20 proposes a global framework, trained in a cascaded manner, which simultaneously performs facial landmarks localization, occlusion detection, head pose estimation and deformation estimation with separate modules. Relationships between these allows the ... | {
"cite_N": [
"@cite_25",
"@cite_20",
"@cite_8"
],
"mid": [
"2962887041",
"202494559",
"1795776638"
],
"abstract": [
"We present two techniques to improve landmark localization in images from partially annotated datasets. Our primary goal is to leverage the common situation where p... |
1907.03248 | 2962988034 | Face alignment consists in aligning a shape model on a face in an image. It is an active domain in computer vision as it is a preprocessing for applications like facial expression recognition, face recognition and tracking, face animation, etc. Current state-of-the-art methods already perform well on "easy" datasets, i... | A second approach may be to parallelize a set of small networks instead of a single large network. The idea of using a set of regressors within an end-to-end system was firstly introduced by @cite_16 and more recently taken up by @cite_14 , presenting promising results and well adapted to our problem. design a Mixture-... | {
"cite_N": [
"@cite_14",
"@cite_16",
"@cite_4"
],
"mid": [
"2963280294",
"2150884987",
"2581624817"
],
"abstract": [
"Mixtures of Experts combine the outputs of several “expert” networks, each of which specializes in a different part of the input space. This is achieved by trainin... |
1907.03398 | 2955639709 | To meet the women appearance needs, we present a novel virtual experience approach of facial makeup transfer, developed into windows platform application software. The makeup effects could present on the user's input image in real time, with an only single reference image. The input image and reference image are divide... | In 2015, @cite_10 of Zhejiang University proposed a facial image makeup editing method based on intrinsic images. The method uses the intrinsic image decomposition method to directly decompose the input facial image into the illumination layer and the reflectance layer, and then edits the makeup information of the faci... | {
"cite_N": [
"@cite_10"
],
"mid": [
"1916003155"
],
"abstract": [
"We present a method for simulating makeup in a face image. To generate realistic results without detailed geometric and reflectance measurements of the user, we propose to separate the image into intrinsic image layers and alter t... |
1907.03398 | 2955639709 | To meet the women appearance needs, we present a novel virtual experience approach of facial makeup transfer, developed into windows platform application software. The makeup effects could present on the user's input image in real time, with an only single reference image. The input image and reference image are divide... | In 2016, @cite_28 of NVIDIA Research designed a new deep convolutional neural network for makeup transfer, which not only could transfer makeup, eye shadow, lip makeup, but also recommend the most suitable input image’s makeup. The network consists of two consecutive steps. The first step is to use the FCN network to p... | {
"cite_N": [
"@cite_28"
],
"mid": [
"2963832775"
],
"abstract": [
"In this paper, we propose a novel Deep Localized Makeup Transfer Network to automatically recommend the most suitable makeup for a female and synthesis the makeup on her face. Given a before-makeup face, her most suitable makeup i... |
1907.03398 | 2955639709 | To meet the women appearance needs, we present a novel virtual experience approach of facial makeup transfer, developed into windows platform application software. The makeup effects could present on the user's input image in real time, with an only single reference image. The input image and reference image are divide... | In 2018, @cite_1 of Princeton University in the United States proposed the PairedCycleGAN network for transfering the facial makeup of the reference image to the input image. The main idea is to train the generation network @math and the authentication network @math to transfer a specific makeup style. @cite_1 trained ... | {
"cite_N": [
"@cite_1"
],
"mid": [
"2798600195"
],
"abstract": [
"This paper introduces an automatic method for editing a portrait photo so that the subject appears to be wearing makeup in the style of another person in a reference photo. Our unsupervised learning approach relies on a new framewo... |
1907.03402 | 2961134045 | We propose a new semi-supervised learning method on face-related tasks based on Multi-Task Learning (MTL) and data distillation. The proposed method exploits multiple datasets with different labels for different-but-related tasks such as simultaneous age, gender, race, facial expression estimation. Specifically, when t... | There are a large number of researches attempt to transfer knowledge from a teacher model to a student model. Romero al @cite_1 proposed FitNets, a two-stage strategy to train networks by providing from the teacher middle layers. Knowledge Distillation (KD) proposed by Hinton al @cite_28 leverage the predictions of a l... | {
"cite_N": [
"@cite_28",
"@cite_41",
"@cite_1",
"@cite_31",
"@cite_34",
"@cite_12"
],
"mid": [
"1821462560",
"",
"",
"2787752464",
"2561238782",
"2803023299"
],
"abstract": [
"A very simple way to improve the performance of almost any machine learning algor... |
1907.03402 | 2961134045 | We propose a new semi-supervised learning method on face-related tasks based on Multi-Task Learning (MTL) and data distillation. The proposed method exploits multiple datasets with different labels for different-but-related tasks such as simultaneous age, gender, race, facial expression estimation. Specifically, when t... | Saenko al @cite_19 was one of the first researchers who proposed a method to solve the domain shift problem. More recent works are based on deep neural network aiming to align features by minimizing domain gaps using some distance function @cite_2 @cite_37 . In these methods, domain discriminator trains to distinguish ... | {
"cite_N": [
"@cite_19",
"@cite_37",
"@cite_2"
],
"mid": [
"1722318740",
"",
"2015112703"
],
"abstract": [
"Domain adaptation is an important emerging topic in computer vision. In this paper, we present one of the first studies of domain shift in the context of object recognition.... |
1907.03285 | 2954507894 | Finite-state models are widely used in software engineering, especially in control systems development. Commonly, in control applications such models are developed manually, hence, keeping them up-to-date requires extra effort. To simplify the maintenance process, an automatic approach may be used, allowing to infer mo... | The problem of finding a minimal deterministic finite-state machine from behavior examples is known to be NP-complete @cite_27 , and the complexity of the LTL synthesis problem is double exponential in the length of the LTL specification @cite_30 . Despite this, synthesis of various types of finite-state models from be... | {
"cite_N": [
"@cite_30",
"@cite_38",
"@cite_37",
"@cite_14",
"@cite_4",
"@cite_7",
"@cite_28",
"@cite_29",
"@cite_1",
"@cite_0",
"@cite_27",
"@cite_2",
"@cite_12"
],
"mid": [
"168680193",
"2033269895",
"2912788251",
"2734817039",
"2226549490... |
1907.03285 | 2954507894 | Finite-state models are widely used in software engineering, especially in control systems development. Commonly, in control applications such models are developed manually, hence, keeping them up-to-date requires extra effort. To simplify the maintenance process, an automatic approach may be used, allowing to infer mo... | Extended Finite-State Machine () is the model most similar to the ECC considered in this paper -- it combines a Mealy and a Moore automaton extended with conditional transitions. Transitions are labeled with input events and Boolean formulas over the input variables, and automaton states have associated sequences of ou... | {
"cite_N": [
"@cite_29",
"@cite_10"
],
"mid": [
"2408207366",
"2026252407"
],
"abstract": [
"Finite-state models, such as finite-state machines (FSMs), aid software engineering in many ways. They are often used in formal verification and also can serve as visual software models. The latte... |
1907.03285 | 2954507894 | Finite-state models are widely used in software engineering, especially in control systems development. Commonly, in control applications such models are developed manually, hence, keeping them up-to-date requires extra effort. To simplify the maintenance process, an automatic approach may be used, allowing to infer mo... | @cite_26 , the method is proposed for inferring an FB model from given execution scenarios by means of translation to the Constraint Satisfaction Problem (CSP). However, has the following restrictions. Guard conditions are generated in form -- corresponding Boolean formulas depend on input variables. Such models do not... | {
"cite_N": [
"@cite_29",
"@cite_15",
"@cite_26"
],
"mid": [
"2408207366",
"2898670592",
"2770374269"
],
"abstract": [
"Finite-state models, such as finite-state machines (FSMs), aid software engineering in many ways. They are often used in formal verification and also can serve as... |
1907.03285 | 2954507894 | Finite-state models are widely used in software engineering, especially in control systems development. Commonly, in control applications such models are developed manually, hence, keeping them up-to-date requires extra effort. To simplify the maintenance process, an automatic approach may be used, allowing to infer mo... | @cite_35 the two-stage approach of is developed further: on the first stage, a base model is inferred with a translation to SAT, and on the second stage its guard conditions are minimized via a CSP-based approach, in which guard condition Boolean formulas are represented with parse trees. By introducing a total bound o... | {
"cite_N": [
"@cite_35",
"@cite_31"
],
"mid": [
"2908682741",
"2495534164"
],
"abstract": [
"We propose a two-stage exact approach for identifying finite-state models of function blocks based on given execution traces. First, a base finite-state model is inferred with a method based on tr... |
1907.03285 | 2954507894 | Finite-state models are widely used in software engineering, especially in control systems development. Commonly, in control applications such models are developed manually, hence, keeping them up-to-date requires extra effort. To simplify the maintenance process, an automatic approach may be used, allowing to infer mo... | Overall, none of the existing methods allow simultaneously and efficiently accounting for (1) behavior examples, (2) LTL properties, and (3) minimality of synthesized automata in terms of both number of states and guard conditions complexity. The approach proposed in this paper extends @cite_35 and contributes to the s... | {
"cite_N": [
"@cite_35"
],
"mid": [
"2908682741"
],
"abstract": [
"We propose a two-stage exact approach for identifying finite-state models of function blocks based on given execution traces. First, a base finite-state model is inferred with a method based on translation to the Boolean satisfiab... |
1907.03390 | 2953400733 | Some robots can interact with humans using natural language, and identify service requests through human-robot dialog. However, few robots are able to improve their language capabilities from this experience. In this paper, we develop a dialog agent for robots that is able to interpret user commands using a semantic pa... | Researchers have developed algorithms for learning to interpret natural language commands @cite_20 @cite_0 @cite_11 . Recent research enabled the co-learning of syntax and semantics of spatial language @cite_17 @cite_2 . Although the systems support the learning of language skills, they do not have a dialog management ... | {
"cite_N": [
"@cite_11",
"@cite_0",
"@cite_2",
"@cite_20",
"@cite_17"
],
"mid": [
"2236233024",
"2296135247",
"2889756642",
"46490633",
"2230046320"
],
"abstract": [
"This paper describes a new model for understanding natural language commands given to autonomous s... |
1907.03390 | 2953400733 | Some robots can interact with humans using natural language, and identify service requests through human-robot dialog. However, few robots are able to improve their language capabilities from this experience. In this paper, we develop a dialog agent for robots that is able to interpret user commands using a semantic pa... | Algorithms have been developed for dialog policy learning @cite_30 @cite_25 @cite_10 . Recent research on Deep RL has enabled dialog agents to learn complex representations for dialog management @cite_26 @cite_6 . The systems do not include a language parsing component. As a result, users can only communicate with thei... | {
"cite_N": [
"@cite_30",
"@cite_26",
"@cite_6",
"@cite_10",
"@cite_25"
],
"mid": [
"1681299129",
"2294065713",
"2951805158",
"2121863487",
"2119567691"
],
"abstract": [
"Designing the dialogue policy of a spoken dialogue system involves many nontrivial choices. Thi... |
1907.03390 | 2953400733 | Some robots can interact with humans using natural language, and identify service requests through human-robot dialog. However, few robots are able to improve their language capabilities from this experience. In this paper, we develop a dialog agent for robots that is able to interpret user commands using a semantic pa... | Mobile robot platforms have been equipped with semantic parsing and dialog management capabilities. After a task is identified in dialog, these robots are able to conduct service tasks using a task planner @cite_12 @cite_23 @cite_24 . Although these works enable a robot to identify human requests via dialog, they do no... | {
"cite_N": [
"@cite_24",
"@cite_23",
"@cite_12"
],
"mid": [
"2773498419",
"1864247448",
"2737759620"
],
"abstract": [
"Probabilistic graphical models, such as partially observable Markov decision processes (POMDPs), have been used in stochastic spoken dialog systems to handle the ... |
1907.03535 | 2955537983 | A highly successful approach to route planning in networks (particularly road networks) is to identify a hierarchy in the network that allows faster queries after some preprocessing that basically inserts additional "shortcut"-edges into a graph. In the past there has been a succession of techniques that infer a more a... | There has been a lot of work on route planning. Refer to @cite_11 for a recent overview. Here we only give selected references to place EHs into the big picture. Besides hierarchical route planning techniques there are also techniques which direct the shortest path search towards the goal (e.g., landmarks @cite_16 , pr... | {
"cite_N": [
"@cite_3",
"@cite_0",
"@cite_2",
"@cite_5",
"@cite_16",
"@cite_12",
"@cite_20",
"@cite_11"
],
"mid": [
"1601313669",
"2132044905",
"2150418461",
"2083019227",
"2151400766",
"2112513979",
"1559814459",
"2104317982"
],
"abstract": [
... |
1907.03565 | 2966487081 | More than two decades ago, combinatorial topology was shown to be useful for analyzing distributed fault-tolerant algorithms in shared memory systems and in message passing systems. In this work, we show that combinatorial topology can also be useful for analyzing distributed algorithms in networks of arbitrary structu... | The deep connections between combinatorial topology and distributed computing were concurrently and independently identified in @cite_8 and @cite_0 . Since then, numerous outstanding results were obtained using combinatorial topology for various types of tasks, including agreement tasks such as consensus and set-agreem... | {
"cite_N": [
"@cite_26",
"@cite_14",
"@cite_22",
"@cite_4",
"@cite_8",
"@cite_9",
"@cite_39",
"@cite_0",
"@cite_23",
"@cite_34",
"@cite_12",
"@cite_11"
],
"mid": [
"2908176613",
"2024581561",
"2946137447",
"1526652053",
"1965990175",
"205691... |
1907.03565 | 2966487081 | More than two decades ago, combinatorial topology was shown to be useful for analyzing distributed fault-tolerant algorithms in shared memory systems and in message passing systems. In this work, we show that combinatorial topology can also be useful for analyzing distributed algorithms in networks of arbitrary structu... | In contrast, distributed network computing has not been impacted by combinatorial topology. This domain of distributed computing is extremely active and productive this last decade, analyzing a large variety of network problems in the so-called model @cite_30 , capturing the ability to solve task locally in networks Th... | {
"cite_N": [
"@cite_30",
"@cite_37",
"@cite_33",
"@cite_36",
"@cite_41",
"@cite_28",
"@cite_21",
"@cite_32",
"@cite_40",
"@cite_2",
"@cite_5",
"@cite_15",
"@cite_10",
"@cite_25"
],
"mid": [
"1568961751",
"2243868910",
"2552279664",
"24675146... |
1812.10779 | 2908322352 | Nowadays, pedestrian detection is one of the pivotal fields in computer vision, especially when performed over video surveillance scenarios. People detection methods are highly sensitive to occlusions among pedestrians, which dramatically degrades performance in crowded scenarios. The cutback in camera prices has allow... | There are several approaches @cite_10 @cite_18 that rely on manually annotated operational areas where evaluation is performed. An advantage of these areas is that camera calibration errors are limited and controlled. Besides, these areas are defined to maximize the overlapping between the field of view of the involved... | {
"cite_N": [
"@cite_18",
"@cite_10",
"@cite_20"
],
"mid": [
"",
"1994774201",
"2889337521"
],
"abstract": [
"",
"Multi-camera pedestrian detection is the challenging problem in the field of surveillance video analysis. However, existing approaches may produce \"phantoms\" (i.e... |
1812.10779 | 2908322352 | Nowadays, pedestrian detection is one of the pivotal fields in computer vision, especially when performed over video surveillance scenarios. People detection methods are highly sensitive to occlusions among pedestrians, which dramatically degrades performance in crowded scenarios. The cutback in camera prices has allow... | Semantic segmentation is the task of assigning a unique object label to every pixel of an image. Top-performing strategies for semantic segmentation are based on CNNs. For instance, a dense up-sampling CNN can be used to generate pixel-level predictions within a hybrid dilated convolution framework @cite_12 . Performan... | {
"cite_N": [
"@cite_3",
"@cite_6",
"@cite_12"
],
"mid": [
"2952147788",
"2952596663",
"2950510876"
],
"abstract": [
"The trend towards increasingly deep neural networks has been driven by a general observation that increasing depth increases the performance of a network. Recently,... |
1812.10779 | 2908322352 | Nowadays, pedestrian detection is one of the pivotal fields in computer vision, especially when performed over video surveillance scenarios. People detection methods are highly sensitive to occlusions among pedestrians, which dramatically degrades performance in crowded scenarios. The cutback in camera prices has allow... | Concerning methods, an interesting example is the use of a multi-view model shaped by a Bayesian network to model the relationships between occlusions @cite_10 . Detections are here assumed to be images of either pedestrians or , the former differentiated from the latter by inference on the network. | {
"cite_N": [
"@cite_10"
],
"mid": [
"1994774201"
],
"abstract": [
"Multi-camera pedestrian detection is the challenging problem in the field of surveillance video analysis. However, existing approaches may produce \"phantoms\" (i.e., fake pedestrians) due to the heavy occlusions in real surveilla... |
1812.10779 | 2908322352 | Nowadays, pedestrian detection is one of the pivotal fields in computer vision, especially when performed over video surveillance scenarios. People detection methods are highly sensitive to occlusions among pedestrians, which dramatically degrades performance in crowded scenarios. The cutback in camera prices has allow... | Recent approaches are focused on methods. The combination of CNNs and Conditional Random Fields (CRF) can be used to explicitly model ambiguities in crowded scenes @cite_1 . High-order CRF terms are used to model potential occlusions, providing robust pedestrian detection. Alternatively, multi-view detection can be han... | {
"cite_N": [
"@cite_1",
"@cite_4"
],
"mid": [
"2608772507",
"2951221967"
],
"abstract": [
"People detection in single 2D images has improved greatly in recent years. However, comparatively little of this progress has percolated into multi-camera multi-people tracking algorithms, whose per... |
1812.10779 | 2908322352 | Nowadays, pedestrian detection is one of the pivotal fields in computer vision, especially when performed over video surveillance scenarios. People detection methods are highly sensitive to occlusions among pedestrians, which dramatically degrades performance in crowded scenarios. The cutback in camera prices has allow... | Algorithms in all of these groups require accurate scene calibration: small calibration errors can produce inaccurate projections and back-projections which may contravene key assumptions of the methods. These errors may lead to misaligned detections, hindering their later use. To cope with this problematic, one can re... | {
"cite_N": [
"@cite_10"
],
"mid": [
"1994774201"
],
"abstract": [
"Multi-camera pedestrian detection is the challenging problem in the field of surveillance video analysis. However, existing approaches may produce \"phantoms\" (i.e., fake pedestrians) due to the heavy occlusions in real surveilla... |
1812.10766 | 2907777862 | Current state-of-the-art in 3D human pose and shape recovery relies on deep neural networks and statistical morphable body models, such as the Skinned Multi-Person Linear model (SMPL). However, regardless of the advantages of having both body pose and shape, SMPL-based solutions have shown difficulties to predict 3D bo... | Depth regression given 2D joints has been an active research topic in 3D human pose recovery. Nevertheless, this is an ill-posed problem where several 3D poses can be projected to the same 2D joints. Chen and Ramanan @cite_6 show that copying depth from 3D mocap data can provide a fair estimation when a nearest 2D matc... | {
"cite_N": [
"@cite_18",
"@cite_26",
"@cite_6",
"@cite_5",
"@cite_13"
],
"mid": [
"2891377836",
"2557698284",
"2583372902",
"2795089319",
"2612706635"
],
"abstract": [
"We present a feed-forward, multitask, end-to-end trainable system for the integrated 2d localiza... |
1812.10766 | 2907777862 | Current state-of-the-art in 3D human pose and shape recovery relies on deep neural networks and statistical morphable body models, such as the Skinned Multi-Person Linear model (SMPL). However, regardless of the advantages of having both body pose and shape, SMPL-based solutions have shown difficulties to predict 3D bo... | It refers to regressing 3D pose directly from RGB image. Due to the nonlinear nature of the human pose, 3D pose regression without modeling correlation of joints is not a trivial task. Brau and Jiang @cite_23 estimate 3D joints and camera parameters without direct supervision on them. Instead, they use several loss fun... | {
"cite_N": [
"@cite_21",
"@cite_23"
],
"mid": [
"2953258117",
"2566741951"
],
"abstract": [
"Regression based methods are not performing as well as detection based methods for human pose estimation. A central problem is that the structural information in the pose is not well exploited in ... |
1812.10915 | 2908415820 | Precipitation nowcasting using neural networks and ground-based radars has become one of the key components of modern weather prediction services, but it is limited to the regions covered by ground-based radars. Truly global precipitation nowcasting requires fusion of radar and satellite observations. We propose the da... | The main idea behind partial convolution from @cite_11 is the following. Let @math be the convolutional weights and @math the corresponding bias. @math are the pixels values for the current convolution window and @math is the corresponding binary mask. The partial convolution at every location is expressed as: | {
"cite_N": [
"@cite_11"
],
"mid": [
"2950820654"
],
"abstract": [
"Existing deep learning based image inpainting methods use a standard convolutional network over the corrupted image, using convolutional filter responses conditioned on both valid pixels as well as the substitute values in the mas... |
1812.10851 | 2908313473 | In the multi-agent path finding problem (MAPF) we are given a set of agents each with respective start and goal positions. The task is to find paths for all agents while avoiding collisions aiming to minimize an objective function. Two such common objective functions is the sum-of-costs and the makespan. Many optimal s... | A simple admissible heuristic that is used within A* for MAPF is to sum the individual heuristics of the single agents such as Manhattan distance for 4-connected grids or Euclidean distance for Euclidean graphs @cite_6 . A more-informed heuristic is called the sum of individual costs heuristic . For each agent @math we... | {
"cite_N": [
"@cite_23",
"@cite_6",
"@cite_49"
],
"mid": [
"1521683430",
"2135939055",
"2155992093"
],
"abstract": [
"It is known that A* is optimal with respect to the expanded nodes (Dechter and Pearl 1985) (D&P). The exact meaning of this optimality varies depending on the clas... |
1812.10851 | 2908313473 | In the multi-agent path finding problem (MAPF) we are given a set of agents each with respective start and goal positions. The task is to find paths for all agents while avoiding collisions aiming to minimize an objective function. Two such common objective functions is the sum-of-costs and the makespan. Many optimal s... | More A*-based Algorithms. Enhanced Partial Expansion () @cite_49 avoids the generation of surplus nodes (i.e. nodes @math with @math where @math is the optimal cost; we assume standard A* notation with @math ) by using a priori domain knowledge. When expanding a node @math generates only the children @math with @math a... | {
"cite_N": [
"@cite_49"
],
"mid": [
"2155992093"
],
"abstract": [
"When solving instances of problem domains that feature a large branching factor, A* may generate a large number of nodes whose cost is greater than the cost of the optimal solution. We designate such nodes as surplus. Generating s... |
1812.10851 | 2908313473 | In the multi-agent path finding problem (MAPF) we are given a set of agents each with respective start and goal positions. The task is to find paths for all agents while avoiding collisions aiming to minimize an objective function. Two such common objective functions is the sum-of-costs and the makespan. Many optimal s... | M* @cite_30 @cite_39 and its enhanced recursive variant () are important A*-based algorithms related to . M* dynamically changes the dimensionality and branching factor based on conflicts. The dimensionality is the number of agents that are not allowed to conflict. When a node is expanded, M* initially generates only o... | {
"cite_N": [
"@cite_30",
"@cite_32",
"@cite_39"
],
"mid": [
"2124015815",
"2039107569",
"2123030512"
],
"abstract": [
"Multirobot path planning is difficult because the full configuration space of the system grows exponentially with the number of robots. Planning in the joint conf... |
1812.10851 | 2908313473 | In the multi-agent path finding problem (MAPF) we are given a set of agents each with respective start and goal positions. The task is to find paths for all agents while avoiding collisions aiming to minimize an objective function. Two such common objective functions is the sum-of-costs and the makespan. Many optimal s... | The low level acts as a goal test for the high level. For each node @math visited by the high level, the low level is invoked. Its task is to find a non-conflicting complete solution such that the cost of the individual path of agent @math is exactly @math . For each agent @math , stores all single-agent paths of cost ... | {
"cite_N": [
"@cite_37"
],
"mid": [
"2137108108"
],
"abstract": [
"An investigation was made of the analogous graph structure for representing and manipulating discrete variable problems. The authors define the multi-valued decision diagram (MDD), analyze its properties (in particular prove a str... |
1812.10851 | 2908313473 | In the multi-agent path finding problem (MAPF) we are given a set of agents each with respective start and goal positions. The task is to find paths for all agents while avoiding collisions aiming to minimize an objective function. Two such common objective functions is the sum-of-costs and the makespan. Many optimal s... | SAT encoding. The encoding @cite_4 again employs log-space representation of variables but position of agent @math at time step @math , that is, @math is represented instead of representing vertex occupancy - that is, variables @math are represented using log-space encoding. To ensure that conflicts among agents in ver... | {
"cite_N": [
"@cite_24",
"@cite_15",
"@cite_21",
"@cite_4"
],
"mid": [
"2142563857",
"2164279585",
"2398115889",
""
],
"abstract": [
"This paper shows how all different constraints (ADCs) over bit-vectors can be handled within a SAT solver. It also contains encouraging exp... |
1812.10851 | 2908313473 | In the multi-agent path finding problem (MAPF) we are given a set of agents each with respective start and goal positions. The task is to find paths for all agents while avoiding collisions aiming to minimize an objective function. Two such common objective functions is the sum-of-costs and the makespan. Many optimal s... | SAT encoding. The next development has been done in SAT encoding called that separates conflict rules in MAPF and agents transitions between time steps @cite_51 . Conflict rules are expressed over anonymized agents that are encoded by direct variables @math . | {
"cite_N": [
"@cite_51"
],
"mid": [
"2044113147"
],
"abstract": [
"This paper addresses make span optimal solving of cooperative path-finding problem (CPF) by translating it to propositional satisfiability (SAT). The task is to relocate set of agents to given goal positions so that they do not co... |
1812.10851 | 2908313473 | In the multi-agent path finding problem (MAPF) we are given a set of agents each with respective start and goal positions. The task is to find paths for all agents while avoiding collisions aiming to minimize an objective function. Two such common objective functions is the sum-of-costs and the makespan. Many optimal s... | ASP, CSP, and ILP approach. Although lot of work in makespan optimal solving has been done for SAT other compilation-based approaches to MAPF like ASP-based @cite_14 and CSP-based @cite_46 exist. Both ASP and CSP offer rich formalism to express various objective functions in MAPF. The ASP-based approach adopts a more s... | {
"cite_N": [
"@cite_46",
"@cite_14",
"@cite_16"
],
"mid": [
"2109802566",
"1510564526",
""
],
"abstract": [
"Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approac... |
1812.10818 | 2951930671 | Data labeling is currently a time-consuming task that often requires expert knowledge. In research settings, the availability of correctly labeled data is crucial to ensure that model predictions are accurate and useful. We propose relatively simple machine learning-based models that achieve high performance metrics in... | Other researchers implemented ML and NLP methods to automate more general information extraction tasks. In particular, @cite_14 developed automatic methods to extract pulmonary embolism findings from thoracic CT reports, @cite_18 identified mammography findings by implementing a rule-based NLP approach, and @cite_3 dev... | {
"cite_N": [
"@cite_18",
"@cite_14",
"@cite_3"
],
"mid": [
"2139054399",
"2768567289",
""
],
"abstract": [
"Communication of follow-up recommendations when abnormalities are identified on imaging studies is prone to error. The absence of an automated system to identify and track r... |
1812.10868 | 2908511362 | Shill bidding occurs when fake bids are introduced into an auction on the seller's behalf in order to artificially inflate the final price. This is typically achieved by the seller having friends bid in her auctions, or the seller controls multiple fake bidder accounts that are used for the sole purpose of shill biddin... | Xu and Cheng @cite_2 propose an approach to detect shill suspects in concurrent online auctions (where multiple auctions for identical items are simultaneously taking place). Their auction model can be formally verified using a model checker according to a set of behavioural properties specified in pattern-based linear... | {
"cite_N": [
"@cite_14",
"@cite_22",
"@cite_7",
"@cite_8",
"@cite_2"
],
"mid": [
"",
"2124219971",
"2021119487",
"2106990685",
"109229848"
],
"abstract": [
"",
"Highlights? A Web crawling agent is used to collect real auction cases. ? The Page-Rank algorithm is... |
1812.10868 | 2908511362 | Shill bidding occurs when fake bids are introduced into an auction on the seller's behalf in order to artificially inflate the final price. This is typically achieved by the seller having friends bid in her auctions, or the seller controls multiple fake bidder accounts that are used for the sole purpose of shill biddin... | Some approaches have been proposed to detect shill bidding in real-time (i.e., while an auction is in progress) @cite_24 @cite_15 @cite_17 @cite_5 @cite_23 . The motivation is that actions can be taken to penalise the seller or shill bidder before the auction terminates to ensure that innocent bidders do not become vic... | {
"cite_N": [
"@cite_24",
"@cite_23",
"@cite_5",
"@cite_15",
"@cite_17"
],
"mid": [
"2802653551",
"58586023",
"2480260901",
"2786625053",
"827185887"
],
"abstract": [
"espanolAuction fraud; Bidding behaviour; Live shill score; Online auction; Post-filtering process;... |
1812.10735 | 2908378553 | Aspect level sentiment classification is a fine-grained sentiment analysis task, compared to the sentence level classification. A sentence usually contains one or more aspects. To detect the sentiment towards a particular aspect in a sentence, previous studies have developed various methods for generating aspect-specif... | Aspect level sentiment classification is a fine-grained sentiment analysis task. Earlier methods are usually based on explicit features @cite_12 @cite_7 . @cite_12 uses different linguistic features for sentiment classification. @cite_7 studies aspect-based Twitter sentiment classification by applying automatic feature... | {
"cite_N": [
"@cite_7",
"@cite_9",
"@cite_21",
"@cite_1",
"@cite_6",
"@cite_0",
"@cite_19",
"@cite_13",
"@cite_12",
"@cite_17"
],
"mid": [
"2296071000",
"2788810909",
"2963494756",
"2804000041",
"2964164368",
"2767439512",
"2788610610",
"276... |
1812.10563 | 2906886582 | The setting of the classic prophet inequality is as follows: a gambler is shown the probability distributions of @math independent, non-negative random variables with finite expectations. In their indexed order, a value is drawn from each distribution, and after every draw the gambler may choose to accept the value and... | The constraint of being able to choose one item has been expanded to many combinatorial domains including multiple choices @cite_1 , matroids @cite_2 , and general down-closed set systems @cite_12 . The connection between prophet inequalities and auction design was first noted by Hajiaghayi, Kleinberg, and Sandholm @ci... | {
"cite_N": [
"@cite_7",
"@cite_8",
"@cite_1",
"@cite_3",
"@cite_2",
"@cite_15",
"@cite_12",
"@cite_11"
],
"mid": [
"2077124610",
"2810576705",
"2950397526",
"2734590272",
"2949499418",
"",
"2329590824",
""
],
"abstract": [
"We study the clas... |
1812.10687 | 2967737057 | Deep learning provides a powerful tool for robotic perception in the open world. However, real-world robotic systems, especially mobile robots, must be able to react intelligently and safely even in unexpected circumstances. This requires a system that knows what it knows, and can estimate its own uncertainty for unfam... | Prior work has investigated improving the calibration of deep models. Bayesian neural networks based on variational inference have been widely applied to neural network training @cite_18 @cite_5 . Bootstrapping provides an effective alternative to variational Bayesian methods @cite_13 @cite_4 , and simple ensembles (wi... | {
"cite_N": [
"@cite_5",
"@cite_18",
"@cite_13",
"@cite_4"
],
"mid": [
"2951266961",
"",
"2963938771",
"2963238274"
],
"abstract": [
"We introduce a new, efficient, principled and backpropagation-compatible algorithm for learning a probability distribution on the weights of... |
1812.10687 | 2967737057 | Deep learning provides a powerful tool for robotic perception in the open world. However, real-world robotic systems, especially mobile robots, must be able to react intelligently and safely even in unexpected circumstances. This requires a system that knows what it knows, and can estimate its own uncertainty for unfam... | Our approach aims to map observations into the training distribution, which is similar to the goals of domain adaptation methods that transform target domain images into the source domain, and vice versa, typically for simulation to real world transfer @cite_12 @cite_1 @cite_22 . However, these prior methods do not exp... | {
"cite_N": [
"@cite_1",
"@cite_22",
"@cite_12"
],
"mid": [
"2799034341",
"2767657961",
"2786551991"
],
"abstract": [
"Developing visual perception models for active agents and sensorimotor control in the physical world are cumbersome as existing algorithms are too slow to efficien... |
1812.10352 | 2906169349 | We propose a novel regularization algorithm to train deep neural networks, in which data at training time is severely biased. Since a neural network efficiently learns data distribution, a network is likely to learn the bias information to categorize input data. It leads to poor performance at test time, if the bias is... | The existence of unknown unknowns was experimentally demonstrated by Attenberg al in @cite_16 . The authors separated the decisions rendered by predictive models into four conceptual categories: known knowns, known unknowns, unknown knowns, and unknown unknowns. Subsequently, the authors developed and participated in a... | {
"cite_N": [
"@cite_16"
],
"mid": [
"2059362837"
],
"abstract": [
"We present techniques for gathering data that expose errors of automatic predictive models. In certain common settings, traditional methods for evaluating predictive models tend to miss rare but important errors—most importantly, ... |
1812.10352 | 2906169349 | We propose a novel regularization algorithm to train deep neural networks, in which data at training time is severely biased. Since a neural network efficiently learns data distribution, a network is likely to learn the bias information to categorize input data. It leads to poor performance at test time, if the bias is... | Embracing the UDA problem, disentangling feature representation has been widely researched in the literature. The application of disentangled features has been explored in detail @cite_22 @cite_8 . The authors constructed new face images using a disentangled feature input, while preserving the original identities. Usin... | {
"cite_N": [
"@cite_4",
"@cite_22",
"@cite_8",
"@cite_21",
"@cite_23",
"@cite_17"
],
"mid": [
"2099471712",
"1955369839",
"2594202937",
"2434741482",
"2737047298",
"2798813225"
],
"abstract": [
"We propose a new framework for estimating generative models vi... |
1812.10352 | 2906169349 | We propose a novel regularization algorithm to train deep neural networks, in which data at training time is severely biased. Since a neural network efficiently learns data distribution, a network is likely to learn the bias information to categorize input data. It leads to poor performance at test time, if the bias is... | These studies highlighted the importance of feature disentanglement, which is the first step in understanding the information contained within the feature. Inspired by various applications, we have attempted to remove certain information from the feature. In contrast to the InfoGan @cite_21 , we minimize the mutual inf... | {
"cite_N": [
"@cite_21"
],
"mid": [
"2434741482"
],
"abstract": [
"This paper describes InfoGAN, an information-theoretic extension to the Generative Adversarial Network that is able to learn disentangled representations in a completely unsupervised manner. InfoGAN is a generative adversarial net... |
1812.10193 | 2906169906 | Recent advances in computing have allowed for the possibility to collect large amounts of data on personal activities and private living spaces. Collecting and publishing a dataset in this environment can cause concerns over privacy of the individuals in the dataset. In this paper we examine these privacy concerns. In ... | A lot of work have focused on manipulating the existing training and inference algorithms to protect privacy of training data, for example, a differentially private training algorithm for deep neural networks in which noise is added to the gradient during each iteration @cite_44 @cite_3 @cite_17 , and a teacher-student... | {
"cite_N": [
"@cite_33",
"@cite_29",
"@cite_3",
"@cite_44",
"@cite_12",
"@cite_17"
],
"mid": [
"2950602864",
"2140596092",
"2520442116",
"2473418344",
"2535838896",
"2053637704"
],
"abstract": [
"Some machine learning applications involve training data that... |
1812.10193 | 2906169906 | Recent advances in computing have allowed for the possibility to collect large amounts of data on personal activities and private living spaces. Collecting and publishing a dataset in this environment can cause concerns over privacy of the individuals in the dataset. In this paper we examine these privacy concerns. In ... | A different approach to preserve privacy is making sure sensitive elements of the data is removed before publishing it, often called privacy-preserving data publishing (PPDP) @cite_15 . A main line of work in this field focuses on transforming numerical data into a secondary feature space, such that certain statistical... | {
"cite_N": [
"@cite_43",
"@cite_15",
"@cite_9",
"@cite_8"
],
"mid": [
"2129533844",
"2168757172",
"2160553465",
""
],
"abstract": [
"Due to growing concerns about the privacy of personal information, organizations that use their customers' records in data mining activities... |
1812.10193 | 2906169906 | Recent advances in computing have allowed for the possibility to collect large amounts of data on personal activities and private living spaces. Collecting and publishing a dataset in this environment can cause concerns over privacy of the individuals in the dataset. In this paper we examine these privacy concerns. In ... | In recent years GANs have been successfully used to produce that can fool a classifier to predict wrong classes @cite_1 . Some have formulated the problem of privacy protection as producing adversarial examples for an identity-revealing classifier @cite_45 @cite_27 . However, we demonstrate through experiments that the... | {
"cite_N": [
"@cite_27",
"@cite_45",
"@cite_1"
],
"mid": [
"2765886485",
"2805329444",
"2783555701"
],
"abstract": [
"Preserving the utility of published datasets while simultaneously providing provable privacy guarantees is a well-known challenge. On the one hand, context-free pr... |
1812.10193 | 2906169906 | Recent advances in computing have allowed for the possibility to collect large amounts of data on personal activities and private living spaces. Collecting and publishing a dataset in this environment can cause concerns over privacy of the individuals in the dataset. In this paper we examine these privacy concerns. In ... | Similar efforts have been made in the fairness literature to make sure that certain attributes (e.g., gender, or race) in a dataset do not create unwanted bias that affects decision making systems @cite_41 @cite_32 . There is a key distinction between our work and that of censorship_fairness @cite_32 in how we train ou... | {
"cite_N": [
"@cite_41",
"@cite_32"
],
"mid": [
"2725155646",
"2247194987"
],
"abstract": [
"How can we learn a classifier that is \"fair\" for a protected or sensitive group, when we do not know if the input to the classifier belongs to the protected group? How can we train such a classi... |
1812.10411 | 2952984976 | Cross-lingual speech emotion recognition is an important task for practical applications. The performance of automatic speech emotion recognition systems degrades in cross-corpus scenarios, particularly in scenarios involving multiple languages or a previously unseen language such as Urdu for which limited or no data i... | To study the universality of emotional cues among languages, @cite_6 studied speech emotion recognition for Mandarin vs. Western languages (i.e., German, and Danish). They evaluated gender-specific speech emotion classification and achieved the accuracy more than the chance level. In @cite_9 , authors used six emotiona... | {
"cite_N": [
"@cite_9",
"@cite_6",
"@cite_15"
],
"mid": [
"",
"2638999229",
"2344608732"
],
"abstract": [
"",
"An investigation on classification of emotional speech cross different language families is proposed in this paper. Datasets on three languages, CDESD in Mandarin, Em... |
1812.10328 | 2906046032 | In this work, we present a framework based on multi-stream convolutional neural networks (CNNs) for group activity recognition. Streams of CNNs are separately trained on different modalities and their predictions are fused at the end. Each stream has two branches to predict the group activity based on person and scene ... | There have been efforts to use probabilistic graphical models to tackle the group activity recognition problem. @cite_26 propose a graphical model with person-person and group-person factors and employ a two-stage inference mechanism to find the optimal graph structure and the best possible labels for the individual ac... | {
"cite_N": [
"@cite_15",
"@cite_26",
"@cite_17"
],
"mid": [
"100367037",
"2047499569",
"2320007652"
],
"abstract": [
"We present a coherent, discriminative framework for simultaneously tracking multiple people and estimating their collective activities. Instead of treating the two... |
1812.10328 | 2906046032 | In this work, we present a framework based on multi-stream convolutional neural networks (CNNs) for group activity recognition. Streams of CNNs are separately trained on different modalities and their predictions are fused at the end. Each stream has two branches to predict the group activity based on person and scene ... | Recently, a series of works have studied the group activity recognition using RNNs to model temporal information @cite_18 @cite_19 @cite_20 @cite_23 @cite_1 @cite_2 @cite_10 . @cite_18 employ a hierarchy of Long-Short Term Memory (LSTM) networks to predict individual actions and collective activity. In @cite_19 , indiv... | {
"cite_N": [
"@cite_18",
"@cite_1",
"@cite_19",
"@cite_23",
"@cite_2",
"@cite_10",
"@cite_20"
],
"mid": [
"2949887038",
"",
"2206427987",
"2736442062",
"2558630670",
"2778252923",
"2737024909"
],
"abstract": [
"In group activity recognition, the tem... |
1812.10328 | 2906046032 | In this work, we present a framework based on multi-stream convolutional neural networks (CNNs) for group activity recognition. Streams of CNNs are separately trained on different modalities and their predictions are fused at the end. Each stream has two branches to predict the group activity based on person and scene ... | @cite_1 propose confidence-energy recurrent network in which a novel energy layer is used instead of the common softmax layer and the uncertain predictions are avoided by the computation of p-values at the same layer. @cite_2 detect persons and classify group activity in an end to end framework. To do so, a fully convo... | {
"cite_N": [
"@cite_10",
"@cite_1",
"@cite_2"
],
"mid": [
"2778252923",
"",
"2558630670"
],
"abstract": [
"Activity recognition has become an important function in many emerging computer vision applications e.g. automatic video surveillance system, human-computer interaction appli... |
1812.10328 | 2906046032 | In this work, we present a framework based on multi-stream convolutional neural networks (CNNs) for group activity recognition. Streams of CNNs are separately trained on different modalities and their predictions are fused at the end. Each stream has two branches to predict the group activity based on person and scene ... | In @cite_5 , Temporal Segment Network is proposed to model long-range temporal information. Each video is divided into segments of which snippets of frames are sampled. A differentiable segmental consensus of CNNs on different segments is performed which makes end-to-end joint training of segment CNNs possible. They tr... | {
"cite_N": [
"@cite_5",
"@cite_21"
],
"mid": [
"2507009361",
"2619082050"
],
"abstract": [
"Deep convolutional networks have achieved great success for visual recognition in still images. However, for action recognition in videos, the advantage over traditional methods is not so evident. ... |
1812.10437 | 2906221980 | A central machine is interested in estimating the underlying structure of a sparse Gaussian Graphical Model (GGM) from datasets distributed across multiple local machines. The local machines can communicate with the central machine through a wireless multiple access channel. In this paper, we are interested in designin... | The Chow-Liu algorithm obtains the maximum likelihood estimate of the structure if the underlying graph is a tree @cite_1 . Although this algorithm is applicable for discrete random variables, it can be used for tree structured GGMs in a similar manner @cite_14 . @cite_13 proposed a distributed version of the Chow-Liu ... | {
"cite_N": [
"@cite_14",
"@cite_9",
"@cite_1",
"@cite_16",
"@cite_13"
],
"mid": [
"",
"2124988974",
"2163166770",
"2117245428",
"2891030779"
],
"abstract": [
"",
"The problem of maximum-likelihood (ML) estimation of discrete tree-structured distributions is con... |
1812.10479 | 2907386696 | Stock market volatility forecasting is a task relevant to assessing market risk. We investigate the interaction between news and prices for the one-day-ahead volatility prediction using state-of-the-art deep learning approaches. The proposed models are trained either end-to-end or using sentence encoders transfered fro... | The works described above ( @cite_7 @cite_42 @cite_32 @cite_30 ) target long-horizon volatility predictions (one year or quarterly @cite_30 ). In particular, @cite_30 and @cite_32 uses market data (price) features along with the textual representation of the 10-K reports. These existing works that employ multi-modal le... | {
"cite_N": [
"@cite_30",
"@cite_7",
"@cite_42",
"@cite_32",
"@cite_45"
],
"mid": [
"2592713985",
"2251998780",
"2251697431",
"2251162459",
"2951127645"
],
"abstract": [
"Volatility prediction--an essential concept in financial markets--has recently been addressed u... |
1812.10156 | 2905889633 | We prove that the binary classifiers of bit strings generated by random wide deep neural networks are biased towards simple functions. The simplicity is captured by the following two properties. For any given input bit string, the average Hamming distance of the closest input bit string with a different classification ... | The properties of deep neural networks with randomly initialized weights have been the subject of intensive studies @cite_19 @cite_60 @cite_7 @cite_2 @cite_23 @cite_25 @cite_4 @cite_16 . | {
"cite_N": [
"@cite_4",
"@cite_7",
"@cite_60",
"@cite_19",
"@cite_23",
"@cite_2",
"@cite_16",
"@cite_25"
],
"mid": [
"2556364298",
"2766678531",
"",
"2433379750",
"2885059312",
"2785626633",
"2789210533",
"2423689290"
],
"abstract": [
"We st... |
1812.10156 | 2905889633 | We prove that the binary classifiers of bit strings generated by random wide deep neural networks are biased towards simple functions. The simplicity is captured by the following two properties. For any given input bit string, the average Hamming distance of the closest input bit string with a different classification ... | The relation between generalization and simplicity was first conjectured in 2006 in @cite_10 , where the authors define a complexity measure for Boolean functions, called generalization complexity, and provide numerical evidence that this measure is correlated with the generalization error. @cite_48 explore the general... | {
"cite_N": [
"@cite_15",
"@cite_48",
"@cite_3",
"@cite_46",
"@cite_10"
],
"mid": [
"2731468224",
"2950220847",
"2682189153",
"2766965791",
"2122613489"
],
"abstract": [
"It is widely observed that deep learning models with learned parameters generalize well, even w... |
1812.10156 | 2905889633 | We prove that the binary classifiers of bit strings generated by random wide deep neural networks are biased towards simple functions. The simplicity is captured by the following two properties. For any given input bit string, the average Hamming distance of the closest input bit string with a different classification ... | The idea of a bias towards simple patterns has been applied to learning theory through the concepts of minimum description length @cite_39 , Blumer algorithms @cite_41 @cite_29 and universal induction @cite_43 . @cite_21 proved that the generalization error grows with the Kolmogorov complexity of the target function if... | {
"cite_N": [
"@cite_61",
"@cite_30",
"@cite_62",
"@cite_41",
"@cite_29",
"@cite_21",
"@cite_53",
"@cite_55",
"@cite_39",
"@cite_43",
"@cite_25"
],
"mid": [
"2084323233",
"2806891045",
"2951603627",
"",
"",
"1897981530",
"2794316594",
"19... |
1812.10119 | 2906208572 | Using sequence to sequence algorithms for query expansion has not been explored yet in Information Retrieval literature nor in Question-Answering's. We tried to fill this gap in the literature with a custom Query Expansion engine trained and tested on open datasets. Starting from open datasets, we built a Query Expansi... | Paraphrase generation is a very close field. Generating new utterances carrying the same meaning expands the initial query and highly increases the robustness of a search-based chatbot @cite_5 @cite_3 . | {
"cite_N": [
"@cite_5",
"@cite_3"
],
"mid": [
"2395170394",
"1980519283"
],
"abstract": [
"This paper presents an approach to creating intelligent conversational agents that are capable of returning appropriate responses to natural language input. Our approach consists of using a supervis... |
1812.09809 | 2906129565 | Recently, the hybrid convolutional neural network hidden Markov model (CNN-HMM) has been introduced for offline handwritten Chinese text recognition (HCTR) and has achieved state-of-the-art performance. In a CNN-HMM system, a handwritten text line is modeled by a series of cascading HMMs, each representing one characte... | Offline HCTR can be formulated as the Bayesian decision problem: where @math is the feature sequence of a given text line image and @math is the underlying @math -character sequence. In oversegmentation-based approaches @cite_24 , the posterior probability @math can be computed by searching the optimal segmentation pat... | {
"cite_N": [
"@cite_24",
"@cite_9",
"@cite_14",
"@cite_39"
],
"mid": [
"2033404582",
"2127141656",
"2808523546",
"2785979806"
],
"abstract": [
"This paper presents an effective approach for the offline recognition of unconstrained handwritten Chinese texts. Under the gener... |
1812.09809 | 2906129565 | Recently, the hybrid convolutional neural network hidden Markov model (CNN-HMM) has been introduced for offline handwritten Chinese text recognition (HCTR) and has achieved state-of-the-art performance. In a CNN-HMM system, a handwritten text line is modeled by a series of cascading HMMs, each representing one characte... | This study is comprehensively extended from our previous conference papers @cite_46 @cite_40 with the following new contributions: 1) the proposed PHMM is introduced with more technical details and verified for a more promising CNN-HMM, rather than the DNN-HMM in @cite_46 ; 2) we present a novel unsupervised adaptation... | {
"cite_N": [
"@cite_40",
"@cite_46"
],
"mid": [
"2573871018",
"2887688727"
],
"abstract": [
"Recently, we propose deep neural network based hidden Markov models (DNN-HMMs) for offline handwritten Chinese text recognition. In this study, we design a novel writer code based adaptation on to... |
1812.10027 | 2949628230 | Recent years have witnessed a rapid growth of deep-network based services and applications. A practical and critical problem thus has emerged: how to effectively deploy the deep neural network models such that they can be executed efficiently. Conventional cloud-based approaches usually run the deep models in data cent... | Deep neural network has become the structure for today's practical machine learning model selection @cite_37 , thanks to its simplicity and effectiveness. In order to deploy the tons of pre-trained deep neural networks and run them on different devices, researchers propose the following deep network model deployment so... | {
"cite_N": [
"@cite_37"
],
"mid": [
"2145287260"
],
"abstract": [
"In modern face recognition, the conventional pipeline consists of four stages: detect => align => represent => classify. We revisit both the alignment step and the representation step by employing explicit 3D face modeling in orde... |
1812.10027 | 2949628230 | Recent years have witnessed a rapid growth of deep-network based services and applications. A practical and critical problem thus has emerged: how to effectively deploy the deep neural network models such that they can be executed efficiently. Conventional cloud-based approaches usually run the deep models in data cent... | Attracted by the elasticity in computing power and flexible collaboration, hierarchically distributed computing structures(e.g., cloud computing, fog computing, edge computing) naturally becomes the choice for supporting deep-structure-based services and applications @cite_43 @cite_35 @cite_21 @cite_5 @cite_17 . Consid... | {
"cite_N": [
"@cite_35",
"@cite_21",
"@cite_43",
"@cite_5",
"@cite_17"
],
"mid": [
"2416799949",
"",
"2045371716",
"2208484250",
"2777638777"
],
"abstract": [
"The proliferation of Internet of Things (IoT) and the success of rich cloud services have pushed the hori... |
1812.10027 | 2949628230 | Recent years have witnessed a rapid growth of deep-network based services and applications. A practical and critical problem thus has emerged: how to effectively deploy the deep neural network models such that they can be executed efficiently. Conventional cloud-based approaches usually run the deep models in data cent... | : Conventionally, most of today's deep neural network usually deployed on dedicated servers in the datacenter @cite_5 . Users usually have to upload a large amount of original data (e.g., images) to the servers, causing the latency. To reduce the latency, @cite_34 proposed a bandwidth efficiency object tracking system ... | {
"cite_N": [
"@cite_5",
"@cite_34",
"@cite_32"
],
"mid": [
"2208484250",
"2029016069",
""
],
"abstract": [
"The paper considers the conceptual approach for organization of the vertical hierarchical links between the scalable distributed computing paradigms: Cloud Computing, Fog Co... |
1812.10027 | 2949628230 | Recent years have witnessed a rapid growth of deep-network based services and applications. A practical and critical problem thus has emerged: how to effectively deploy the deep neural network models such that they can be executed efficiently. Conventional cloud-based approaches usually run the deep models in data cent... | However, these former proposal took into account only latency measurement and raw data quantity between layers, not taking the sparsity in the feature maps into account, thus their partition point frequently falls on the first or the last layer of a DNN structure in their experiments, which makes their divided model tu... | {
"cite_N": [
"@cite_23"
],
"mid": [
"2792220137"
],
"abstract": [
"Deep learning shows great promise in providing more intelligence to augmented reality (AR) devices, but few AR apps use deep learning due to lack of infrastructure support. Deep learning algorithms are computationally intensive, a... |
1812.10061 | 2906211136 | Neural models enjoy widespread use across a variety of tasks and have grown to become crucial components of many industrial systems. Despite their effectiveness and extensive popularity, they are not without their exploitable flaws. Initially applied to computer vision systems, the generation of adversarial examples is... | The attack against Speech Commands described by @cite_4 is particularly relevant within the realm of telephony, as it could be adapted to fool limited-vocabulary speech classifiers used for automated attendants. This attack produces adversarial examples using a gradient-free genetic algorithm, allowing the attack to pe... | {
"cite_N": [
"@cite_4"
],
"mid": [
"2782403400"
],
"abstract": [
"Speech is a common and effective way of communication between humans, and modern consumer devices such as smartphones and home hubs are equipped with deep learning based accurate automatic speech recognition to enable natural inter... |
1812.10061 | 2906211136 | Neural models enjoy widespread use across a variety of tasks and have grown to become crucial components of many industrial systems. Despite their effectiveness and extensive popularity, they are not without their exploitable flaws. Initially applied to computer vision systems, the generation of adversarial examples is... | Recent work in computer vision has shown that some preprocessing, such as JPEG and JPEG2000 image compression @cite_3 or cropping and resizing @cite_9 , can be employed with a certain degree of success in defending against adversarial attacks. In a similar vein, preprocessing defenses have also been used for defending ... | {
"cite_N": [
"@cite_9",
"@cite_10",
"@cite_3"
],
"mid": [
"2949162339",
"2916239775",
"2794785996"
],
"abstract": [
"Deep neural networks are facing a potential security threat from adversarial examples, inputs that look normal but cause an incorrect classification by the deep neu... |
1812.10061 | 2906211136 | Neural models enjoy widespread use across a variety of tasks and have grown to become crucial components of many industrial systems. Despite their effectiveness and extensive popularity, they are not without their exploitable flaws. Initially applied to computer vision systems, the generation of adversarial examples is... | While the aforementioned defenses focus on removing or distorting adversarial noise, one could also defend against an adversarial example by adding noise to the signal. Artificial neural network (ANN) classifiers are relatively robust to natural noise, whereas adversarial examples are less so. @cite_13 used this observ... | {
"cite_N": [
"@cite_13"
],
"mid": [
"2962933288"
],
"abstract": [
"CNNs are poised to become integral parts of many critical systems. Despite their robustness to natural variations, image pixel values can be manipulated, via small, carefully crafted, imperceptible perturbations, to cause a model ... |
1812.09961 | 2947357873 | Appropriate test data is a crucial factor to reach success in dynamic software testing, e.g., fuzzing. Most of the real-world applications, however, accept complex structure inputs containing data surrounded by meta-data which is processed in several stages comprising of the parsing and rendering (execution). It makes ... | In this section, we discuss some related works in fuzzing and explain their existing problems concerning test data generation. According to the test data generation methods, fuzzers are categorized as Mutation-based and generation-based @cite_29 @cite_28 @cite_34 . Various techniques are applied to both methods to impr... | {
"cite_N": [
"@cite_28",
"@cite_29",
"@cite_34"
],
"mid": [
"2798388185",
"348312514",
""
],
"abstract": [
"Abstract Fuzzing is an effective and widely used technique for finding security bugs and vulnerabilities in software. It inputs irregular test data into a target program to ... |
1812.10037 | 2906637185 | Semantic parsing is the task of converting natural language utterances into machine interpretable meaning representations which can be executed against a real-world environment such as a database. Scaling semantic parsing to arbitrary domains faces two interrelated challenges: obtaining broad coverage training data eff... | In reaction to these problems in 1970s, the focus of semantic parsing research shifted from rule-based method to empirical or statistical methods, where data and machine learning plays an important role. Statistical semantic parsers typically consist of three key components: a grammar, a trainable model, and a parsing ... | {
"cite_N": [
"@cite_31"
],
"mid": [
"2163274265"
],
"abstract": [
"This paper presents recent work using the CHILL parser acquisition system to automate the construction of a natural-language interface for database queries. CHILL treats parser acquisition as the learning of search-control rules w... |
1812.10037 | 2906637185 | Semantic parsing is the task of converting natural language utterances into machine interpretable meaning representations which can be executed against a real-world environment such as a database. Scaling semantic parsing to arbitrary domains faces two interrelated challenges: obtaining broad coverage training data eff... | Until early 2000, semantic parsing research mainly focused on restricted domains. Besides , commonly used datasets are for coaching advice to soccer agents @cite_41 , and for air travel information service @cite_46 . At that time, statistical approaches for parsing domains-specific context-free grammars have been large... | {
"cite_N": [
"@cite_41",
"@cite_46"
],
"mid": [
"2167932310",
"2091671846"
],
"abstract": [
"RoboCup Challenge offers a set of challenges for intelligent agent researchers using a friendly competition in a dynamic, real-time, multiagent domain. While RoboCup in general envisions longer ra... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.