aid stringlengths 9 15 | mid stringlengths 7 10 | abstract stringlengths 78 2.56k | related_work stringlengths 92 1.77k | ref_abstract dict |
|---|---|---|---|---|
1907.11481 | 2966777976 | Good code quality is a prerequisite for efficiently developing maintainable software. In this paper, we present a novel approach to generate exploranative (explanatory and exploratory) data-driven documents that report code quality in an interactive, exploratory environment. We employ a template-based natural language ... | -- The interactive linking of text and visualizations has only been explored to some extent. Beck and Weiskopf @cite_36 propose an abstract interaction model for documents containing text, word-sized graphics, and regular visualizations; all three types of data representations are linked via brushing-and-linking. @cite... | {
"cite_N": [
"@cite_8",
"@cite_36",
"@cite_28",
"@cite_57",
"@cite_27",
"@cite_31"
],
"mid": [
"2889330378",
"2590534375",
"2923187851",
"2897132999",
"2888660171",
"2905178843"
],
"abstract": [
"",
"Generating visualizations at the size of a word creat... |
1907.11481 | 2966777976 | Good code quality is a prerequisite for efficiently developing maintainable software. In this paper, we present a novel approach to generate exploranative (explanatory and exploratory) data-driven documents that report code quality in an interactive, exploratory environment. We employ a template-based natural language ... | In summary, although existing approaches present source code information, they lack in putting data into context and providing explanations. None of the systems, also outside the software engineering community, supports exploranation as a process blending explanations and explorations in a way that we envision leveragi... | {
"cite_N": [
"@cite_36"
],
"mid": [
"2590534375"
],
"abstract": [
"Generating visualizations at the size of a word creates dense information representations often called sparklines . The integration of word-sized graphics into text could avoid additional cognitive load caused by splitting the rea... |
1907.11519 | 2966168818 | Making a single network effectively address diverse contexts---learning the variations within a dataset or multiple datasets---is an intriguing step towards achieving generalized intelligence. Existing approaches of deepening, widening, and assembling networks are not cost effective in general. In view of this, network... | Having deep networks for generalizing to wide-range datasets is a common practice . Although the depth influences the performance of a neural network, training such networks is difficult and the general intelligence of this kind of a network is questionable @cite_23 . Hence, more attention is paid towards generally int... | {
"cite_N": [
"@cite_19",
"@cite_9",
"@cite_23"
],
"mid": [
"2963703618",
"2785994986",
""
],
"abstract": [
"A capsule is a group of neurons whose activity vector represents the instantiation parameters of a specific type of entity such as an object or object part. We use the lengt... |
1907.11519 | 2966168818 | Making a single network effectively address diverse contexts---learning the variations within a dataset or multiple datasets---is an intriguing step towards achieving generalized intelligence. Existing approaches of deepening, widening, and assembling networks are not cost effective in general. In view of this, network... | The common multitasking (MTL) in computer vision refers to processing multiple different tasks in a single input (e.g., semantic segmentation and surface-normal prediction). Conventional approaches to MTL includes using shared layers to some extent along with task-specific layers. Choosing the number of task-specific l... | {
"cite_N": [
"@cite_44",
"@cite_10",
"@cite_20"
],
"mid": [
"1899309388",
"2966182616",
"2964247799"
],
"abstract": [
"In the past few years, convolutional neural nets (CNN) have shown incredible promise for learning visual representations. In this paper, we use CNNs for the task ... |
1907.11519 | 2966168818 | Making a single network effectively address diverse contexts---learning the variations within a dataset or multiple datasets---is an intriguing step towards achieving generalized intelligence. Existing approaches of deepening, widening, and assembling networks are not cost effective in general. In view of this, network... | Lifelong learning involves learning from multiple datasets one after the other. Conventional approaches include fine tuning @cite_12 and feature extraction @cite_14 which suffer from catastrophic forgetting. Rebuffi al @cite_7 introduced incremental classification as opposed to batch training in order to overcome catas... | {
"cite_N": [
"@cite_38",
"@cite_14",
"@cite_7",
"@cite_21",
"@cite_39",
"@cite_47",
"@cite_12"
],
"mid": [
"2791091755",
"2155541015",
"2964189064",
"2963072899",
"2560647685",
"2473930607",
"2102605133"
],
"abstract": [
"This work presents a method... |
1907.11519 | 2966168818 | Making a single network effectively address diverse contexts---learning the variations within a dataset or multiple datasets---is an intriguing step towards achieving generalized intelligence. Existing approaches of deepening, widening, and assembling networks are not cost effective in general. In view of this, network... | Approaches that can gradually build customized networks according to the input are also inspiring for our research. ConvNet-AIG @cite_33 and BlockDrop @cite_13 are two approaches introduced for data dependant choosing of residual blocks in a deep network as alternatives to conventional Residual Networks @cite_31 . Thes... | {
"cite_N": [
"@cite_31",
"@cite_13",
"@cite_33"
],
"mid": [
"2194775991",
"2962944050",
"2884751099"
],
"abstract": [
"Deeper neural networks are more difficult to train. We present a residual learning framework to ease the training of networks that are substantially deeper than t... |
1907.11416 | 2966213978 | In this article, we study generalized liar's dominating set problem in graphs. Let @math be a simple undirected graph. The generalized liar's dominating set, called as the distance- @math @math -liar's dominating set, is a subset @math such that (i) each vertex in @math is distance- @math dominated by at least @math ve... | @cite_0 studied the approximability of the problem in general graphs and given an @math -factor approximation algorithm, where @math is the maximum degree of the given graph. For proper interval graphs also Panda and Paul @cite_9 considered the problem and proposed a linear time algorithm. They also studied the minimum... | {
"cite_N": [
"@cite_0",
"@cite_9",
"@cite_8"
],
"mid": [
"2080619861",
"1993437988",
"120391622"
],
"abstract": [
"A subset L ? V of a graph G = ( V , E ) is called a liar's dominating set of G if (i) | N G u ] ? L | ? 2 for every vertex u ? V , and (ii) | ( N G u ] ? N G v ] ) ? ... |
1907.11569 | 2965957874 | Research on neural networks has gained significant momentum over the past few years. A plethora of neural networks is currently being trained on available data in research as well as in industry. Because training is a resource-intensive process and training data cannot always be made available to everyone, there has be... | Neural networks have been applied as a machine learning method to improve ontologies, in recent years. They are used to align @cite_1 @cite_6 @cite_2 , match @cite_13 @cite_21 or map ontologies @cite_4 @cite_19 . Furthermore, ontologies were combined with neural networks to solve different problems @cite_18 @cite_15 . ... | {
"cite_N": [
"@cite_18",
"@cite_4",
"@cite_21",
"@cite_1",
"@cite_6",
"@cite_19",
"@cite_2",
"@cite_15",
"@cite_13",
"@cite_17"
],
"mid": [
"2146235381",
"2104411079",
"2148985136",
"1984978840",
"1965078122",
"2007226769",
"1591339381",
"29... |
1907.11569 | 2965957874 | Research on neural networks has gained significant momentum over the past few years. A plethora of neural networks is currently being trained on available data in research as well as in industry. Because training is a resource-intensive process and training data cannot always be made available to everyone, there has be... | The paper Model Cards for Model Reporting' @cite_20 suggests relevant infor- mation about neural networks that should be considered when saving information about them. Information such as description, date of the last modification, link to papers or other resources for further information, as well as the intended purpo... | {
"cite_N": [
"@cite_20"
],
"mid": [
"2897042519"
],
"abstract": [
"Trained machine learning models are increasingly used to perform high-impact tasks in areas such as law enforcement, medicine, education, and employment. In order to clarify the intended use cases of machine learning models and mi... |
1907.11440 | 2965160406 | Pooling is one of the main elements in convolutional neural networks. The pooling reduces the size of the feature map, enabling training and testing with a limited amount of computation. This paper proposes a new pooling method named universal pooling. Unlike the existing pooling methods such as average pooling, max po... | Max pooling divides the feature map into blocks and collects the maximum feature value in each block into a smaller output matrix. Max pooling is commonly used between convolution layers and is employed in AlexNet @cite_4 and VGG @cite_7 . Average pooling operates similarly to max pooling, but outputs the average of ea... | {
"cite_N": [
"@cite_13",
"@cite_1",
"@cite_4",
"@cite_7"
],
"mid": [
"2194775991",
"2963446712",
"",
"2962835968"
],
"abstract": [
"Deeper neural networks are more difficult to train. We present a residual learning framework to ease the training of networks that are substa... |
1907.11440 | 2965160406 | Pooling is one of the main elements in convolutional neural networks. The pooling reduces the size of the feature map, enabling training and testing with a limited amount of computation. This paper proposes a new pooling method named universal pooling. Unlike the existing pooling methods such as average pooling, max po... | All of these pooling methods are efficient but simple, and it seems that there is a room to improve the performance. S3pool @cite_6 and stochastic pooling @cite_12 adopt a probability-based pooling approach. @math pooling of various coefficients' norms was proposed in @cite_0 and @cite_3 , and a fractional version of m... | {
"cite_N": [
"@cite_18",
"@cite_9",
"@cite_3",
"@cite_6",
"@cite_0",
"@cite_2",
"@cite_5",
"@cite_10",
"@cite_12"
],
"mid": [
"2964012402",
"1995159036",
"",
"2559156603",
"2949366180",
"1839118408",
"2963919294",
"2901278454",
"2963574257"
... |
1907.11307 | 2966138214 | Optimization algorithms with momentum, e.g., Nesterov Accelerated Gradient and ADAM, have been widely used for building deep learning models because of their faster convergence rates compared to stochastic gradient descent (SGD). Momentum is a method that helps accelerate SGD in the relevant directions in variable upda... | : @cite_21 @cite_0 is proposed based on SGD and momentum concept, and it also computes individual adaptive learning rates for different variables. The variable updating rules in can be represented by the following equations: . records the first-order momentum @math and the second-order momentum @math of the gradients u... | {
"cite_N": [
"@cite_0",
"@cite_21",
"@cite_17"
],
"mid": [
"",
"2964121744",
"2776855315"
],
"abstract": [
"",
"Abstract: We introduce Adam, an algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimates of lower-order m... |
1907.11307 | 2966138214 | Optimization algorithms with momentum, e.g., Nesterov Accelerated Gradient and ADAM, have been widely used for building deep learning models because of their faster convergence rates compared to stochastic gradient descent (SGD). Momentum is a method that helps accelerate SGD in the relevant directions in variable upda... | : @cite_7 is a modified version of . changes the definition of second-order momentum by @math , and other settings are almost the same as . What's more, applies a varied learning rate @math comparing to , but the definition of @math is not specified. | {
"cite_N": [
"@cite_7"
],
"mid": [
"2785523195"
],
"abstract": [
"Several recently proposed stochastic optimization methods that have been successfully used in training deep networks such as RMSProp, Adam, Adadelta, Nadam, etc are based on using gradient updates scaled by square roots of exponent... |
1907.11321 | 2966850631 | In spite of the rapidly increasing number of applications of machine learning in various domains, a principled and systematic approach to the incorporation of domain knowledge in the engineering process is still lacking and ad hoc solutions that are difficult to validate are still the norm in practice, which is of grow... | It is noteworthy that our approach of combining selected operators from Hajek's Product logic, ukasiewicz logic, and G "odel logic in a non-standard fashion needs to be differentiated from work in the area of fuzzy logics, which is not aiming at a probabilistic interpretation but an orthogonal notion of truthiness (see... | {
"cite_N": [
"@cite_38",
"@cite_11"
],
"mid": [
"2053035915",
"2039204373"
],
"abstract": [
"In this paper we investigate a propositional fuzzy logical system L? which contains the well-known Lukasiewicz, Product and Godel fuzzy logics as sublogics. We define the corresponding algebraic s... |
1907.11321 | 2966850631 | In spite of the rapidly increasing number of applications of machine learning in various domains, a principled and systematic approach to the incorporation of domain knowledge in the engineering process is still lacking and ad hoc solutions that are difficult to validate are still the norm in practice, which is of grow... | @cite_14 is another approach to overcome the fact that a probabilistic interpretation of formulas is not truth-functional by using a less abstract semantics that interprets each formula as the set of assignments for which it holds so that conjunction becomes a simple intersection. Although this is an elegant solution, ... | {
"cite_N": [
"@cite_14"
],
"mid": [
"1554205565"
],
"abstract": [
"Mechanisms for the automation of uncertainty are required for expert systems. Sometimes these mechanisms need to obey the properties of probabilistic reasoning. We argue that a purely numeric mechanism, like those proposed so far,... |
1907.11565 | 2965034157 | When describing images with natural language, the descriptions can be made more informative if tuned using downstream tasks. This is often achieved by training two networks: a "speaker network" that generates sentences given an image, and a "listener network" that uses them to perform a task. Unfortunately, training mu... | Image captioning has been studied intensively since encoder-decoder models were introduced . Large efforts have been invested in making captions more natural and diverse. For example, @cite_11 used conditional GANs to train a caption generator to improve fidelity, naturalness, and diversity. Using GANs allows avoiding ... | {
"cite_N": [
"@cite_3",
"@cite_6",
"@cite_7",
"@cite_11"
],
"mid": [
"2604178507",
"2963299217",
"2963747812",
"2962968835"
],
"abstract": [
"While strong progress has been made in image captioning recently, machine and human captions are still quite distinct. This is prim... |
1907.11565 | 2965034157 | When describing images with natural language, the descriptions can be made more informative if tuned using downstream tasks. This is often achieved by training two networks: a "speaker network" that generates sentences given an image, and a "listener network" that uses them to perform a task. Unfortunately, training mu... | Beyond the naturalness of communication, several studies looked into the problem of generating captions that allow discriminating an image from other similar images. @cite_18 showed how captions can take into account a distractor image at inference time and create a caption that discriminates a target image from a dist... | {
"cite_N": [
"@cite_0",
"@cite_18",
"@cite_16"
],
"mid": [
"2964183327",
"1861492603",
"2914543347"
],
"abstract": [
"",
"We present a new dataset with the goal of advancing the state-of-the-art in object recognition by placing the question of object recognition in the context... |
1907.11565 | 2965034157 | When describing images with natural language, the descriptions can be made more informative if tuned using downstream tasks. This is often achieved by training two networks: a "speaker network" that generates sentences given an image, and a "listener network" that uses them to perform a task. Unfortunately, training mu... | Several authors studied the properties of languages that are learned when agents communicate in visual tasks, @cite_4 @cite_13 @cite_2 @cite_15 . The current paper purposefully focuses on keeping the language close to natural, rather than study properties or emergent language. | {
"cite_N": [
"@cite_13",
"@cite_15",
"@cite_4",
"@cite_2"
],
"mid": [
"2953189990",
"2950472486",
"2730230212",
"2963166531"
],
"abstract": [
"There is growing interest in the language developed by agents interacting in emergent-communication settings. Earlier studies have... |
1907.11065 | 2963744496 | Variants dropout methods have been designed for the fully-connected layer, convolutional layer and recurrent layer in neural networks, and shown to be effective to avoid overfitting. As an appealing alternative to recurrent and convolutional layers, the fully-connected self-attention layer surprisingly lacks a specific... | We present a summary of existing models by highlighting differences among , and as shown in Table . The original idea of Dropout is proposed by @cite_26 for fully-connected networks, which is regarded as an effective regularization method. After that, many dropout techniques for specific network architectures, such as ... | {
"cite_N": [
"@cite_18",
"@cite_26",
"@cite_22",
"@cite_7",
"@cite_28",
"@cite_24",
"@cite_23",
"@cite_5",
"@cite_15",
"@cite_25",
"@cite_12",
"@cite_17"
],
"mid": [
"1936750108",
"2095705004",
"2408279554",
"2120615054",
"2963266340",
"",
... |
1907.11035 | 2963146525 | Robotic grasping in cluttered environments is often infeasible due to obstacles preventing possible grasps. Then, pre-grasping manipulation like shifting or pushing an object becomes necessary. We developed an algorithm that can learn, in addition to grasping, to shift objects in such a way that their grasp probability... | Object manipulation and in particular grasping are well-researched fields within robotics. @cite_4 differentiate between analytical and data-driven approaches to grasping. Historically, grasp synthesis was based on analytical constructions of force-closure grasps @cite_8 . In comparison, data-driven approaches are defi... | {
"cite_N": [
"@cite_4",
"@cite_8",
"@cite_1",
"@cite_2",
"@cite_15",
"@cite_12"
],
"mid": [
"2950303304",
"1794703952",
"2128082316",
"1977497512",
"1510186039",
""
],
"abstract": [
"",
"The authors address the problem of planning optimal grasps. Two ge... |
1907.11078 | 2920771172 | Zwick's @math -approximation algorithm for the All Pairs Shortest Path (APSP) problem runs in time @math , where @math is the exponent of matrix multiplication and @math denotes the largest weight. This can be used to approximate several graph characteristics including the diameter, radius, median, minimum-weight trian... | It is known that in general not every scaling-based algorithm can be made strongly polynomial, see, e.g., Hochbaum's work on the allocation problem @cite_2 . | {
"cite_N": [
"@cite_2"
],
"mid": [
"1989262026"
],
"abstract": [
"We demonstrate the impossibility of strongly polynomial algorithms for the allocation problem, in the comparison model and in the algebraic tree computation model, that follow from lower bound results. Consequently, there are no st... |
1907.11078 | 2920771172 | Zwick's @math -approximation algorithm for the All Pairs Shortest Path (APSP) problem runs in time @math , where @math is the exponent of matrix multiplication and @math denotes the largest weight. This can be used to approximate several graph characteristics including the diameter, radius, median, minimum-weight trian... | For undirected graphs with weights in @math , APSP can be solved exactly in time @math @cite_18 @cite_33 @cite_1 @cite_35 , where @math is the matrix multiplication exponent @cite_47 . For directed graphs with weights in @math , presented an @math -time algorithm that also uses fast matrix multiplication (in fact, rece... | {
"cite_N": [
"@cite_35",
"@cite_18",
"@cite_33",
"@cite_1",
"@cite_39",
"@cite_49",
"@cite_47"
],
"mid": [
"1823654214",
"2066582699",
"1970052762",
"2618199688",
"",
"2114177725",
"2120248756"
],
"abstract": [
"We show that the all pairs shortest p... |
1907.11078 | 2920771172 | Zwick's @math -approximation algorithm for the All Pairs Shortest Path (APSP) problem runs in time @math , where @math is the exponent of matrix multiplication and @math denotes the largest weight. This can be used to approximate several graph characteristics including the diameter, radius, median, minimum-weight trian... | For approximate APSP for real-valued graphs with weights in @math , presented an additive @math -approximation in time @math . More recently, among other results, gave an algorithm computing every distance @math up to an additive error of @math in time @math . For very small @math , this interpolates between Zwick's fa... | {
"cite_N": [
"@cite_15"
],
"mid": [
"2049500052"
],
"abstract": [
"We present two new algorithms for solving the All Pairs Shortest Paths (APSP) problem for weighted directed graphs. Both algorithms use fast matrix multiplication algorithms.The first algorithm solves the APSP problem for weighted... |
1907.11078 | 2920771172 | Zwick's @math -approximation algorithm for the All Pairs Shortest Path (APSP) problem runs in time @math , where @math is the exponent of matrix multiplication and @math denotes the largest weight. This can be used to approximate several graph characteristics including the diameter, radius, median, minimum-weight trian... | In this paper we will focus on the problem of @math -approximating APSP when @math is close to @math . For @math the problem is at least as hard as Boolean matrix multiplication @cite_7 and thus requires time @math . However, there are more efficient algorithms in the regime @math for undirected graphs, using and @cite... | {
"cite_N": [
"@cite_42",
"@cite_7"
],
"mid": [
"2045446569",
"2083534148"
],
"abstract": [
"Let G = (V,E) be an undirected weighted graph with vVv = n and vEv = m. Let k ≥ 1 be an integer. We show that G = (V,E) can be preprocessed in O(kmn1 k) expected time, constructing a data structure... |
1907.11078 | 2920771172 | Zwick's @math -approximation algorithm for the All Pairs Shortest Path (APSP) problem runs in time @math , where @math is the exponent of matrix multiplication and @math denotes the largest weight. This can be used to approximate several graph characteristics including the diameter, radius, median, minimum-weight trian... | APSP and APBP can be easily computed in time @math on quantum computers @cite_40 . designed the first quantum algorithm for computing in time @math , and noted that every problem equivalent to APBP admits a nontrivial @math -time algorithm in the quantum realm. | {
"cite_N": [
"@cite_40"
],
"mid": [
"1554473710"
],
"abstract": [
"We consider the quantum time complexity of the all pairs shortest paths (APSP) problem and some of its variants. The trivial classical algorithm for APSP and most all pairs path problems runs in @math time, while the trivial algor... |
1907.11078 | 2920771172 | Zwick's @math -approximation algorithm for the All Pairs Shortest Path (APSP) problem runs in time @math , where @math is the exponent of matrix multiplication and @math denotes the largest weight. This can be used to approximate several graph characteristics including the diameter, radius, median, minimum-weight trian... | It is also worth mentioning that there are efficient algorithms for products in other algebraic structures, e.g., dominance product, @math -product, @math -product (see, e.g., @cite_31 ). | {
"cite_N": [
"@cite_31"
],
"mid": [
"2268320119"
],
"abstract": [
"Problems related to computing optimal paths have been abundant in computer science since its emergence as a field. Yet for a large number of such problems we still do not know whether the state-of-the-art algorithms are the best p... |
1907.10931 | 2963645312 | Nonlinear image registration continues to be a fundamentally important tool in medical image analysis. Diagnostic tasks, image-guided surgery and radiotherapy as well as motion analysis all rely heavily on accurate intra-patient alignment. Furthermore, inter-patient registration enables atlas-based segmentation or land... | * Contributions We propose a new learning model for DLIR that better leverages the advantages of probabilistic dense displacement sampling by introducing strong regularisation with differentiable constraints that explicitly considers the 6D nature of the problem. We hence decouple convolutional feature learning from th... | {
"cite_N": [
"@cite_16",
"@cite_13",
"@cite_6",
"@cite_17"
],
"mid": [
"2161236525",
"2913629396",
"2124592697",
"2165949176"
],
"abstract": [
"Most state-of-the-art techniques for multi-class image segmentation and labeling use conditional random fields defined over pixel... |
1907.11117 | 2963229777 | This work introduces verb-only representations for both recognition and retrieval of visual actions, in video. Current methods neglect legitimate semantic ambiguities between verbs, instead choosing unambiguous subsets of verbs along with objects to disambiguate the actions. We instead propose multiple verb-only labels... | Action Recognition in Videos Video Action Recognition datasets are commonly annotated with a reduced set of semantically distinct verb labels @cite_26 @cite_18 @cite_54 @cite_25 @cite_24 @cite_29 @cite_31 @cite_43 . Only in EPIC-Kitchens @cite_26 , verb labels are collected from narrations with an open vocabulary leadi... | {
"cite_N": [
"@cite_18",
"@cite_26",
"@cite_48",
"@cite_54",
"@cite_29",
"@cite_1",
"@cite_24",
"@cite_43",
"@cite_31",
"@cite_51",
"@cite_25"
],
"mid": [
"2198667788",
"2964242760",
"1946832903",
"105287674",
"2949827582",
"2121678312",
"26... |
1907.11117 | 2963229777 | This work introduces verb-only representations for both recognition and retrieval of visual actions, in video. Current methods neglect legitimate semantic ambiguities between verbs, instead choosing unambiguous subsets of verbs along with objects to disambiguate the actions. We instead propose multiple verb-only labels... | Action Retrieval Distinct from recognition, cross-modal retrieval approaches have been proposed for visual actions both in images @cite_6 @cite_21 @cite_30 and videos @cite_49 @cite_15 @cite_27 . These works focus on instance retrieval, given a caption can the corresponding video image be retrieved and vice versa. This... | {
"cite_N": [
"@cite_30",
"@cite_21",
"@cite_52",
"@cite_6",
"@cite_39",
"@cite_44",
"@cite_27",
"@cite_40",
"@cite_49",
"@cite_15"
],
"mid": [
"2405223529",
"2963125676",
"24089286",
"2744926832",
"2126579184",
"2908138876",
"877909479",
"26... |
1907.10992 | 2963178965 | This paper addresses the problem of enhancing underexposed photos. Existing methods have tackled this problem from many different perspectives and achieved remarkable progress. However, they may fail to produce satisfactory results due to the presence of visual artifacts such as color distortion, loss of details and un... | Mapping pixel intensities with sigmoid functions is another commonly-used way to enhance photos. A well-known representative is Gamma Correction, which expands the dynamic range via a power-law function. As globally applying sigmoid mapping may generate visually distorted results, existing methods usually perform local... | {
"cite_N": [
"@cite_5",
"@cite_15",
"@cite_20"
],
"mid": [
"",
"2343431701",
"2165107586"
],
"abstract": [
"",
"Underexposed video enhancement aims at revealing hidden details that are barely noticeable in LDR video frames with noise. Previous work typically relies on a single... |
1907.10992 | 2963178965 | This paper addresses the problem of enhancing underexposed photos. Existing methods have tackled this problem from many different perspectives and achieved remarkable progress. However, they may fail to produce satisfactory results due to the presence of visual artifacts such as color distortion, loss of details and un... | This kind of method is built upon the assumption that an underexposed image is the pixel-wise product of the expected enhancement result and a single-channel illumination map. In this fashion, the enhancement problem can be treated as an illumination estimation problem. Jobson al @cite_3 made an early attempt to this p... | {
"cite_N": [
"@cite_8",
"@cite_28",
"@cite_21",
"@cite_3",
"@cite_45",
"@cite_12"
],
"mid": [
"2566376500",
"",
"2412926690",
"2150721269",
"",
"2054814429"
],
"abstract": [
"When one captures images in low-light conditions, the images often suffer from low... |
1907.10992 | 2963178965 | This paper addresses the problem of enhancing underexposed photos. Existing methods have tackled this problem from many different perspectives and achieved remarkable progress. However, they may fail to produce satisfactory results due to the presence of visual artifacts such as color distortion, loss of details and un... | An increasing amount of efforts focus on investigating learning-based enhancement methods since the pioneering work of Bychkovsky al @cite_43 , which provides the first and largest MIT-Adobe FiveK dataset consisting of input output image pairs for tone adjustment. Yan al @cite_23 achieved automatic color enhancement by... | {
"cite_N": [
"@cite_14",
"@cite_4",
"@cite_36",
"@cite_39",
"@cite_43",
"@cite_23"
],
"mid": [
"1920280450",
"2735974062",
"2254039850",
"2798844427",
"2025328853",
"2113636985"
],
"abstract": [
"Photo retouching enables photographers to invoke dramatic vis... |
1907.10827 | 2963935048 | Deep reinforcement learning has achieved great successes in recent years, but there are still open challenges, such as convergence to locally optimal policies and sample inefficiency. In this paper, we contribute a novel self-supervised auxiliary task, i.e., Terminal Prediction (TP), estimating temporal closeness to te... | Reinforcement learning approaches mainly fall under three categories: value-based methods such as Q-learning @cite_1 or Deep-Q Network @cite_6 ; policy-based methods such as REINFORCE @cite_26 ; and a combination of value- and policy-based techniques, i.e. actor-critic methods @cite_25 . In particular, in the last cate... | {
"cite_N": [
"@cite_26",
"@cite_22",
"@cite_1",
"@cite_6",
"@cite_16",
"@cite_25"
],
"mid": [
"2119717200",
"2950872548",
"",
"2145339207",
"2260756217",
""
],
"abstract": [
"This article presents a general class of associative reinforcement learning algori... |
1907.10827 | 2963935048 | Deep reinforcement learning has achieved great successes in recent years, but there are still open challenges, such as convergence to locally optimal policies and sample inefficiency. In this paper, we contribute a novel self-supervised auxiliary task, i.e., Terminal Prediction (TP), estimating temporal closeness to te... | Another related work to ours is the UNREAL framework @cite_22 which is built on top of the A3C with several refinements and integration. In particular, UNREAL proposes to learn a reward prediction based task besides a pixel-control based task to speed up learning by improving representation learning. In contrast to on-... | {
"cite_N": [
"@cite_22"
],
"mid": [
"2950872548"
],
"abstract": [
"Deep reinforcement learning agents have achieved state-of-the-art results by directly maximising cumulative reward. However, environments contain a much wider variety of possible training signals. In this paper, we introduce an ag... |
1907.10628 | 2963606129 | Domain adaptation is essential to enable wide usage of deep learning based networks trained using large labeled datasets. Adversarial learning based techniques have shown their utility towards solving this problem using a discriminator that ensures source and target distributions are close. However, here we suggest tha... | A large number of methods have been proposed to tackle the domain adaptation problem. The basic common structure that has been followed is the Siamese architecture @cite_35 with two streams, representing the source and target models. It is trained with a combination of a classification loss and the other being one of d... | {
"cite_N": [
"@cite_35",
"@cite_14",
"@cite_22",
"@cite_48",
"@cite_54",
"@cite_42",
"@cite_55",
"@cite_52",
"@cite_43",
"@cite_40",
"@cite_45",
"@cite_23",
"@cite_17"
],
"mid": [
"2127589108",
"2312004824",
"2964278684",
"2963275094",
"",
... |
1907.10628 | 2963606129 | Domain adaptation is essential to enable wide usage of deep learning based networks trained using large labeled datasets. Adversarial learning based techniques have shown their utility towards solving this problem using a discriminator that ensures source and target distributions are close. However, here we suggest tha... | In the domain adaptation setting, an adversarial network provides domain invariant representations by making the source and target domain indistinguishable by the discriminator. Adversarial Discriminative Domain Adaptation @cite_26 uses an inverted label GAN loss to split the optimization into two independent objective... | {
"cite_N": [
"@cite_18",
"@cite_26",
"@cite_46",
"@cite_10",
"@cite_3",
"@cite_0",
"@cite_44",
"@cite_49",
"@cite_2",
"@cite_51",
"@cite_15",
"@cite_13",
"@cite_25",
"@cite_12"
],
"mid": [
"2815449720",
"2593768305",
"2962986791",
"278876884... |
1907.10695 | 2963916533 | We present a method for recovering the dense 3D surface of the hand by regressing the vertex coordinates of a mesh model from a single depth map. To this end, we use a two-stage 2D fully convolutional network architecture. In the first stage, the network estimates a dense correspondence field for every pixel on the dep... | Deep learning has significantly advanced state-of-the-art for hand pose estimation. The general trend has been the development of ever deeper and more sophisticated neural network architectures @cite_13 @cite_37 @cite_54 @cite_62 @cite_49 @cite_5 @cite_55 . However, such progress has also hinged on the availability of ... | {
"cite_N": [
"@cite_37",
"@cite_62",
"@cite_31",
"@cite_7",
"@cite_10",
"@cite_54",
"@cite_55",
"@cite_52",
"@cite_56",
"@cite_57",
"@cite_0",
"@cite_49",
"@cite_50",
"@cite_51",
"@cite_5",
"@cite_59",
"@cite_58",
"@cite_13"
],
"mid": [
... |
1907.10695 | 2963916533 | We present a method for recovering the dense 3D surface of the hand by regressing the vertex coordinates of a mesh model from a single depth map. To this end, we use a two-stage 2D fully convolutional network architecture. In the first stage, the network estimates a dense correspondence field for every pixel on the dep... | An alternative line of work @cite_29 @cite_53 @cite_60 @cite_63 @cite_9 @cite_64 @cite_45 @cite_14 tackles hand pose estimation by minimizing a model-fitting error. Model-fitting needs little to no human labels, but the accuracy is heavily dependent on the careful design of the energy function. A recent trend tries to ... | {
"cite_N": [
"@cite_64",
"@cite_14",
"@cite_26",
"@cite_60",
"@cite_41",
"@cite_29",
"@cite_9",
"@cite_53",
"@cite_45",
"@cite_63",
"@cite_15"
],
"mid": [
"2423984454",
"2768466711",
"",
"",
"2964093990",
"1995713470",
"2218414108",
"199... |
1907.10695 | 2963916533 | We present a method for recovering the dense 3D surface of the hand by regressing the vertex coordinates of a mesh model from a single depth map. To this end, we use a two-stage 2D fully convolutional network architecture. In the first stage, the network estimates a dense correspondence field for every pixel on the dep... | It is highly intuitive to parameterize 3D inputs and or outputs as an occupancy grid or distance field and use for example a 3D voxel net @cite_46 @cite_42 @cite_49 . However, such an architecture is parameter heavy and severely limited in spatial resolution. PointNet @cite_18 is a light-weight alternative and while it... | {
"cite_N": [
"@cite_46",
"@cite_42",
"@cite_18",
"@cite_49"
],
"mid": [
"2737305288",
"2797515701",
"2950642167",
""
],
"abstract": [
"We propose a simple, yet effective approach for real-time hand pose estimation from single depth images using three-dimensional Convolutio... |
1907.10695 | 2963916533 | We present a method for recovering the dense 3D surface of the hand by regressing the vertex coordinates of a mesh model from a single depth map. To this end, we use a two-stage 2D fully convolutional network architecture. In the first stage, the network estimates a dense correspondence field for every pixel on the dep... | Since captured 3D inputs are inherently object surfaces, it is natural to consider them as a 2D embedding in 3D Euclidean space. As such, several works @cite_12 @cite_19 @cite_24 have modeled mesh surfaces as a graph and have applied graph network architectures to capture intrinsic and extrinsic geometric properties of... | {
"cite_N": [
"@cite_3",
"@cite_24",
"@cite_19",
"@cite_12",
"@cite_17"
],
"mid": [
"2788158258",
"2883221003",
"",
"2964321699",
"2964253930"
],
"abstract": [
"We present a network architecture for processing point clouds that directly operates on a collection of p... |
1907.10781 | 2963008717 | Nowadays, we are surrounded by more and more online news articles. Tens or hundreds of news articles need to be read if we wish to explore a hot news event or topic. So it is of vital importance to automatically synthesize a batch of news articles related to the event or topic into a new synthesis article (or overview ... | One of the related fields is document summarization. The methods can be divided into extractive methods @cite_0 @cite_6 @cite_7 @cite_2 @cite_5 @cite_17 @cite_19 @cite_16 and abstractive methods @cite_13 @cite_14 @cite_10 . | {
"cite_N": [
"@cite_14",
"@cite_7",
"@cite_10",
"@cite_6",
"@cite_0",
"@cite_19",
"@cite_2",
"@cite_5",
"@cite_16",
"@cite_13",
"@cite_17"
],
"mid": [
"2341401723",
"2122311631",
"2741375528",
"1962684803",
"2150869743",
"2574535369",
"21389... |
1907.10781 | 2963008717 | Nowadays, we are surrounded by more and more online news articles. Tens or hundreds of news articles need to be read if we wish to explore a hot news event or topic. So it is of vital importance to automatically synthesize a batch of news articles related to the event or topic into a new synthesis article (or overview ... | There are several pilot studies on producing long articles from a batch of news articles or web pages @cite_4 @cite_12 @cite_15 . However, the generated overview articles do not have good structures and there are no interaction functions. | {
"cite_N": [
"@cite_15",
"@cite_4",
"@cite_12"
],
"mid": [
"2787214294",
"1995067232",
"2771080244"
],
"abstract": [
"We show that generating English Wikipedia articles can be approached as a multi- document summarization of source documents. We use extractive summarization to coa... |
1907.10781 | 2963008717 | Nowadays, we are surrounded by more and more online news articles. Tens or hundreds of news articles need to be read if we wish to explore a hot news event or topic. So it is of vital importance to automatically synthesize a batch of news articles related to the event or topic into a new synthesis article (or overview ... | There are some attempts of adding interaction functions into the traditional document summarization tasks @cite_3 @cite_11 . However, the above work focuses on producing short summaries and the generation of long news overview articles is more challenging. Moreover, in the above work, the keyphrases to represent salien... | {
"cite_N": [
"@cite_3",
"@cite_11"
],
"mid": [
"2120704803",
"2110983154"
],
"abstract": [
"This paper describes the Interactive Document Summariser (IDS). IDS provides dynamic control over document summary characteristics, such as length and topic focus, so that changes made by the user ... |
1907.10700 | 2963909142 | We introduce a system and methods for the three-dimensional measurement of extended specular surfaces with high surface normal variations. Our system consists only of a mobile hand held device and exploits screen and front camera for Deflectometry-based surface measurements. We demonstrate high quality measurements wit... | The authors of @cite_14 used the reflection of color coded circles observed by multiple cameras (which also resolves the bas-relief ambiguity). In other works, the authors utilized self illuminated screens with patterns such as stripes @cite_2 , multiple lines @cite_0 , or even a light field created from two stacked LE... | {
"cite_N": [
"@cite_14",
"@cite_7",
"@cite_0",
"@cite_24",
"@cite_2",
"@cite_11"
],
"mid": [
"2124958603",
"2179918789",
"2170554555",
"",
"2010544530",
"2438151519"
],
"abstract": [
"We present an novel algorithm that reconstructs voxels of a general 3D sp... |
1907.10843 | 2963402660 | Person re-identification (re-ID) solves the task of matching images across cameras and is among the research topics in vision community. Since query images in real-world scenarios might suffer from resolution loss, how to solve the resolution mismatch problem during person re-ID becomes a practical problem. Instead of ... | Person re-ID has been widely studied in the literature. Most of the existing methods @cite_17 @cite_14 @cite_21 @cite_10 @cite_12 @cite_4 @cite_16 @cite_15 @cite_8 @cite_9 @cite_5 focus on tackling the challenges of matching images with viewpoint and pose variations, or those with background clutter or occlusion presen... | {
"cite_N": [
"@cite_13",
"@cite_14",
"@cite_4",
"@cite_8",
"@cite_9",
"@cite_21",
"@cite_19",
"@cite_5",
"@cite_15",
"@cite_16",
"@cite_10",
"@cite_12",
"@cite_17"
],
"mid": [
"2099471712",
"2604463754",
"",
"2798775284",
"2798874329",
"... |
1907.10843 | 2963402660 | Person re-identification (re-ID) solves the task of matching images across cameras and is among the research topics in vision community. Since query images in real-world scenarios might suffer from resolution loss, how to solve the resolution mismatch problem during person re-ID becomes a practical problem. Instead of ... | To address the challenging resolution mismatch problem, a couple of methods @cite_22 @cite_20 @cite_18 @cite_34 @cite_11 @cite_28 have been recently proposed. Li al @cite_22 present a joint learning framework that simultaneously optimizes cross-scale image domain alignment and discriminant distance metric modeling. The... | {
"cite_N": [
"@cite_18",
"@cite_22",
"@cite_28",
"@cite_34",
"@cite_20",
"@cite_11"
],
"mid": [
"2573751786",
"2213726222",
"2967084945",
"",
"1897123318",
"2807957650"
],
"abstract": [
"Person re-identification, as an important task in video surveillance a... |
1907.10738 | 2962927471 | Open book question answering is a type of natural language based QA (NLQA) where questions are expected to be answered with respect to a given set of open book facts, and common knowledge about a topic. Recently a challenge involving such QA, OpenBookQA, has been proposed. Unlike most other NLQA tasks that focus on lin... | Among these, the closest to our work is the work in @cite_22 which perform QA using fine tuned language model and the works of @cite_6 @cite_17 which performs QA using external knowledge. | {
"cite_N": [
"@cite_22",
"@cite_6",
"@cite_17"
],
"mid": [
"2896457183",
"2964222271",
"2805387248"
],
"abstract": [
"We introduce a new language representation model called BERT, which stands for Bidirectional Encoder Representations from Transformers. Unlike recent language repr... |
1907.10738 | 2962927471 | Open book question answering is a type of natural language based QA (NLQA) where questions are expected to be answered with respect to a given set of open book facts, and common knowledge about a topic. Recently a challenge involving such QA, OpenBookQA, has been proposed. Unlike most other NLQA tasks that focus on lin... | Related to our work for extracting missing knowledge are the works of @cite_1 @cite_9 @cite_15 which respectively generate a query either by extracting key terms from a question and an answer option or by classifying key terms or by Seq2Seq models to generate key terms. In comparison, we generate queries using the ques... | {
"cite_N": [
"@cite_14",
"@cite_7",
"@cite_8",
"@cite_28",
"@cite_9",
"@cite_29",
"@cite_1",
"@cite_2",
"@cite_15",
"@cite_16",
"@cite_13"
],
"mid": [
"2158937425",
"1550791699",
"1569107316",
"103216324",
"2951922096",
"1481897178",
"288947... |
1907.10903 | 2963481198 | Existing Graph Convolutional Networks (GCNs) are shallow---the number of the layers is usually not larger than 2. The deeper variants by simply stacking more layers, unfortunately perform worse, even involving well-known tricks like weight penalizing, dropout, and residual connections. This paper reveals that developin... | Inspired by the huge success of CNNs in computer vision, a large number of methods come redefining the notion of convolution on graphs under the umbrella of GCNs. The first prominent research on GCNs is presented in @cite_25 , which develops graph convolution based on spectral graph theory. Later, @cite_14 @cite_17 @ci... | {
"cite_N": [
"@cite_31",
"@cite_14",
"@cite_11",
"@cite_7",
"@cite_8",
"@cite_28",
"@cite_9",
"@cite_24",
"@cite_5",
"@cite_15",
"@cite_25",
"@cite_17"
],
"mid": [
"2406128552",
"",
"2809418595",
"2786915849",
"637153065",
"2890703109",
... |
1907.10903 | 2963481198 | Existing Graph Convolutional Networks (GCNs) are shallow---the number of the layers is usually not larger than 2. The deeper variants by simply stacking more layers, unfortunately perform worse, even involving well-known tricks like weight penalizing, dropout, and residual connections. This paper reveals that developin... | Despite the fruitful progress, most previous works only focus on shallow GCNs while the deeper extension is seldom discussed. The work by @cite_30 first introduces the concept of over-smoothing in GCNs, but it never proposes a deep GCN with addressing this issue. Its following study @cite_22 solves over-smoothing by us... | {
"cite_N": [
"@cite_30",
"@cite_10",
"@cite_22"
],
"mid": [
"2784814091",
"",
"2949945331"
],
"abstract": [
"Many interesting problems in machine learning are being revisited with new deep learning tools. For graph-based semisupervised learning, a recent important development is g... |
1907.10861 | 2962969695 | For any positive real number @math , the @math -frame potential of @math unit vectors @math is defined as @math . In this paper, we focus on the special case @math and establish the unique minimizer of @math for @math . Our results completely solve the minimization problem of @math -frame potential when @math , which c... | For any @math , Ehler and Okoudjou provided another bound in @cite_12 : where the equality holds if and only if @math is an equiangular tight frame (ETF) in @math @cite_1 @cite_15 . We take @math as an example. Since there always exist @math unit vectors in @math forming an ETF @cite_3 , then the set of these @math vec... | {
"cite_N": [
"@cite_15",
"@cite_3",
"@cite_1",
"@cite_12"
],
"mid": [
"2072565885",
"",
"1665316997",
"2098598867"
],
"abstract": [
"We study frames from the viewpoint of coding theory. We introduce a numerical measure of how well a frame reconstructs vectors when some of ... |
1907.10861 | 2962969695 | For any positive real number @math , the @math -frame potential of @math unit vectors @math is defined as @math . In this paper, we focus on the special case @math and establish the unique minimizer of @math for @math . Our results completely solve the minimization problem of @math -frame potential when @math , which c... | However, when @math , not much is known except few special cases. In @cite_12 , Ehler and Okoudjou solved the simplest case where @math and @math and also proved that the minimizer of the @math -frame potential is exactly @math copies of an orthonormal basis if @math where @math is a positive integer. In @cite_4 , Glaz... | {
"cite_N": [
"@cite_13",
"@cite_4",
"@cite_12"
],
"mid": [
"2935225848",
"2940712159",
"2098598867"
],
"abstract": [
"Given @math and @math we consider a family of functionals, the @math -frame potentials FP @math , defined on the set of all collections of @math unit-norm vectors ... |
1907.10861 | 2962969695 | For any positive real number @math , the @math -frame potential of @math unit vectors @math is defined as @math . In this paper, we focus on the special case @math and establish the unique minimizer of @math for @math . Our results completely solve the minimization problem of @math -frame potential when @math , which c... | The cases @math and @math for Conjecture are already solved in @cite_12 and @cite_9 , respectively. The first new result for Conjecture is obtained by Glazyrin in @cite_14 who shows that an orthonormal basis in @math plus a repeated vector minimizes @math for any @math . Combining Glazyrin's result with the previous on... | {
"cite_N": [
"@cite_5",
"@cite_9",
"@cite_14",
"@cite_12"
],
"mid": [
"2916660142",
"2182304189",
"2908565045",
"2098598867"
],
"abstract": [
"An extension is given of a recent result of Glazyrin, showing that an orthonormal basis @math joined with the vectors @math , wher... |
1907.10758 | 1568415925 | Wi-Fi was originally designed to provide broadband wireless Internet access for devices which generate rather heavy streams. And Wi-Fi succeeded. The coming revolution of the Internet of Things with myriads of autonomous devices and machine type communications (MTC) traffic raises a question: can the Wi-Fi success stor... | The widest known mathematical model of DCF --- the basic random channel access used in Wi-Fi networks --- was developed by Bianchi in @cite_1 . The model allows estimating maximal throughput, assuming that a constant number of active STAs work in saturated conditions. So the model cannot be used to solve the problems s... | {
"cite_N": [
"@cite_1"
],
"mid": [
"2162598825"
],
"abstract": [
"The IEEE has standardized the 802.11 protocol for wireless local area networks. The primary medium access control (MAC) technique of 802.11 is called the distributed coordination function (DCF). The DCF is a carrier sense multiple ... |
1907.10758 | 1568415925 | Wi-Fi was originally designed to provide broadband wireless Internet access for devices which generate rather heavy streams. And Wi-Fi succeeded. The coming revolution of the Internet of Things with myriads of autonomous devices and machine type communications (MTC) traffic raises a question: can the Wi-Fi success stor... | Paper @cite_0 presents a model, which allows estimating the maximal throughput (again, in saturated scenarios) if all STAs are equally divided into several groups and each slot is assigned to a group. It proves that RAW manifold increases throughput in a network with thousands STAs, however the model can not be used fo... | {
"cite_N": [
"@cite_0"
],
"mid": [
"2028769336"
],
"abstract": [
"In IEEE 802.11 networks, how to improve the efficiency of contention-based media access is an important, challenging issue. Recently, the grouping strategy is introduced in the IEEE 802.11ah standard to alleviate the channel conten... |
1907.10758 | 1568415925 | Wi-Fi was originally designed to provide broadband wireless Internet access for devices which generate rather heavy streams. And Wi-Fi succeeded. The coming revolution of the Internet of Things with myriads of autonomous devices and machine type communications (MTC) traffic raises a question: can the Wi-Fi success stor... | In @cite_4 , the authors consider another protocol, IEEE 802.15.4 that uses similar to EDCA channel access. However, in .15.4 a STA senses the channel only when the backoff ends. Although both papers present performance evaluation in the scenario similar to the one described in this paper, the authors assume that colli... | {
"cite_N": [
"@cite_4"
],
"mid": [
"2168959209"
],
"abstract": [
"In this paper, a mathematical model for the beacon-enabled mode of the IEEE 802.15.4 medium-access control (MAC) protocol is provided. A personal area network (PAN) composed of multiple nodes, which transmit data to a PAN coordinat... |
1907.10758 | 1568415925 | Wi-Fi was originally designed to provide broadband wireless Internet access for devices which generate rather heavy streams. And Wi-Fi succeeded. The coming revolution of the Internet of Things with myriads of autonomous devices and machine type communications (MTC) traffic raises a question: can the Wi-Fi success stor... | The authors of @cite_7 study the power saving mechanism. They have developed a model, which allows estimating the average energy consumed by a STA and average time used by a STA to retrieve its data. As shown in , even though the model developed in @cite_7 can be used to find the average frame transmission time for a S... | {
"cite_N": [
"@cite_7"
],
"mid": [
"1991290762"
],
"abstract": [
"Communication is an enabling technology for the efficient control and management of next-generation Smart Grids. Energy conservation of the communication devices is essential for future large scale deployment of Smart Grid communic... |
1907.10786 | 2963577681 | Despite the recent advance of Generative Adversarial Networks (GANs) in high-fidelity image synthesis, there lacks enough understandings on how GANs are able to map the latent code sampled from a random distribution to a photo-realistic image. Previous work assumes the latent space learned by GAN follows a distributed ... | GANs @cite_6 have brought wide attention in recent years. The efforts made to improve GANs lie in various aspects, including designing better objective functions @cite_22 @cite_12 , improving synthesis diversity @cite_14 @cite_33 @cite_8 , image resolution @cite_24 @cite_7 , as well as training stability @cite_11 @cite... | {
"cite_N": [
"@cite_35",
"@cite_14",
"@cite_26",
"@cite_33",
"@cite_22",
"@cite_8",
"@cite_7",
"@cite_6",
"@cite_24",
"@cite_0",
"@cite_5",
"@cite_12",
"@cite_11"
],
"mid": [
"2963870144",
"2950893734",
"2962879692",
"2963836885",
"296368408... |
1907.10786 | 2963577681 | Despite the recent advance of Generative Adversarial Networks (GANs) in high-fidelity image synthesis, there lacks enough understandings on how GANs are able to map the latent code sampled from a random distribution to a photo-realistic image. Previous work assumes the latent space learned by GAN follows a distributed ... | Besides improving GANs to synthesize images in an unconditional way, plenty of work has been done to control the contents and attributes of the outputs. CGAN @cite_31 was firstly proposed to add constraints into the training procedure. Specifically, additional label together with the random latent code is fed into the ... | {
"cite_N": [
"@cite_13",
"@cite_4",
"@cite_21",
"@cite_3",
"@cite_19",
"@cite_27",
"@cite_31",
"@cite_34",
"@cite_10",
"@cite_25"
],
"mid": [
"2799209711",
"2962975391",
"",
"2964118024",
"2963100452",
"2737047298",
"2125389028",
"2548275288... |
1907.10786 | 2963577681 | Despite the recent advance of Generative Adversarial Networks (GANs) in high-fidelity image synthesis, there lacks enough understandings on how GANs are able to map the latent code sampled from a random distribution to a photo-realistic image. Previous work assumes the latent space learned by GAN follows a distributed ... | Latent space is treated as Riemannian manifolds by recent work @cite_23 @cite_18 @cite_36 . They focus on exploring how to make the output image vary more smoothly through interpolation in latent space. This idea is improved in @cite_17 by employing feature-based metrics as the path length in image space. Some work @ci... | {
"cite_N": [
"@cite_30",
"@cite_18",
"@cite_36",
"@cite_28",
"@cite_9",
"@cite_1",
"@cite_32",
"@cite_23",
"@cite_15",
"@cite_20",
"@cite_17"
],
"mid": [
"2959108703",
"2964011399",
"2804013387",
"2964231450",
"2737057113",
"2950419363",
"25... |
1907.10801 | 2963861395 | Automatic image aesthetics assessment is important for a wide variety of applications such as on-line photo suggestion, photo album management and image retrieval. Previous methods have focused on mapping the holistic image content to a high or low aesthetics rating. However, the composition information of an image cha... | . Modeling the relations of different visual components in visual data has been proven effective in computer vision community. Ma . @cite_14 proposed to model higher-order object interactions with attention mechanism for understanding the actions in videos. Wang . @cite_29 proposed to represent video as a space-time gr... | {
"cite_N": [
"@cite_30",
"@cite_14",
"@cite_29",
"@cite_53",
"@cite_52",
"@cite_57",
"@cite_27",
"@cite_46",
"@cite_51",
"@cite_20"
],
"mid": [
"",
"",
"2806331055",
"2890671550",
"",
"",
"",
"2791092480",
"2116341502",
"2161236525"
... |
1907.10265 | 2962741219 | Cyber-physical system applications such as autonomous vehicles, wearable devices, and avionic systems generate a large volume of time-series data. Designers often look for tools to help classify and categorize the data. Traditional machine learning techniques for time-series data offer several solutions to solve these ... | There has been considerable recent work on learning STL formulas from data for various applications such as supervised learning @cite_28 @cite_31 , clustering @cite_15 @cite_33 , or anomaly detection @cite_17 . | {
"cite_N": [
"@cite_33",
"@cite_15",
"@cite_28",
"@cite_31",
"@cite_17"
],
"mid": [
"2963427179",
"2964140991",
"2339807279",
"2086092403",
"2086359741"
],
"abstract": [
"Cyber-physical systems of today are generating large volumes of time-series data. As manual in... |
1907.10265 | 2962741219 | Cyber-physical system applications such as autonomous vehicles, wearable devices, and avionic systems generate a large volume of time-series data. Designers often look for tools to help classify and categorize the data. Traditional machine learning techniques for time-series data offer several solutions to solve these ... | In @cite_31 , a fragment of PSTL (rPSTL or reactive parametric signal temporal logic) is defined to capture causal relationships from data. However, there are some temporal properties namely, concurrent eventuality and nested always eventually that cannot be described directly in rPSTL. In @cite_17 , the authors extend... | {
"cite_N": [
"@cite_28",
"@cite_31",
"@cite_17"
],
"mid": [
"2339807279",
"2086092403",
"2086359741"
],
"abstract": [
"This paper introduces a framework for inference of timed temporal logic properties from data. The dataset is given as a finite set of pairs of finite-time system ... |
1907.10265 | 2962741219 | Cyber-physical system applications such as autonomous vehicles, wearable devices, and avionic systems generate a large volume of time-series data. Designers often look for tools to help classify and categorize the data. Traditional machine learning techniques for time-series data offer several solutions to solve these ... | In template-based techniques, a fixed PSTL template is provided by the user, and the techniques only learn the values of parameters associated with the PSTL. In @cite_15 , a total ordering on parameter space of PSTL specifications is utilized as feature vectors for learning logical specifications. Unfortunately, recogn... | {
"cite_N": [
"@cite_15",
"@cite_29",
"@cite_33"
],
"mid": [
"2964140991",
"2956034981",
"2963427179"
],
"abstract": [
"",
"Formal verification of a control system can be performed by checking if a model of its dynamical behavior conforms to temporal requirements. Unfortunately... |
1907.10218 | 2963829227 | The state-of-the-art federated learning brings a new direction for the data privacy protection of mobile crowdsensing machine learning applications. However, besides being vulnerable to GAN based user data construction attack, the existing gradient descent based federate learning schemes are lack of consideration for h... | Most of the existing privacy-preserving works for machine learning are data driven and based traditional cryptographic algorithms. For example, Q. Wang @cite_23 proposed a privacy-preserving data mining model learning scheme for canonical correlation analysis in cross-media retrieval system garbled circuit. Z. Ma @cite... | {
"cite_N": [
"@cite_9",
"@cite_12",
"@cite_23",
"@cite_11"
],
"mid": [
"2922482186",
"2911667635",
"2762867797",
"2793685318"
],
"abstract": [
"The development of machine learning technology and visual sensors is promoting the wider applications of face recognition into ou... |
1907.10218 | 2963829227 | The state-of-the-art federated learning brings a new direction for the data privacy protection of mobile crowdsensing machine learning applications. However, besides being vulnerable to GAN based user data construction attack, the existing gradient descent based federate learning schemes are lack of consideration for h... | Therefore, the federated learning concept was proposed @cite_22 . However, up to now, there were only a few works that adapted the architecture to propose practical schemes for applications @cite_13 . And most existing federated learning schemes still concentrated on the SGD based models. For example, considering the l... | {
"cite_N": [
"@cite_22",
"@cite_0",
"@cite_24",
"@cite_15",
"@cite_16",
"@cite_13"
],
"mid": [
"2541884796",
"2963333146",
"2793216106",
"2767079719",
"2793925626",
"2920095265"
],
"abstract": [
"",
"In this paper, a novel joint transmit power and resou... |
1907.10274 | 2964328619 | Photorealistic style transfer aims to transfer the style of a reference photo onto a content photo naturally, such that the stylized image looks like a real photo taken by a camera. Existing state-of-the-art methods are prone to spatial structure distortion of the content image and global color inconsistency across dif... | Classical style transfer methods stylize an image in a global fashion with spatial-invariant transfer functions @cite_41 @cite_7 @cite_3 @cite_2 @cite_43 @cite_23 . These methods can handle global color shifts, but they are limited in matching sophisticated styles with drastic color changes @cite_36 @cite_17 , as shown... | {
"cite_N": [
"@cite_7",
"@cite_41",
"@cite_36",
"@cite_3",
"@cite_43",
"@cite_23",
"@cite_2",
"@cite_17"
],
"mid": [
"2141015396",
"2129112648",
"2604721644",
"2147821504",
"",
"",
"2006957355",
"2963683323"
],
"abstract": [
"This article pr... |
1907.10274 | 2964328619 | Photorealistic style transfer aims to transfer the style of a reference photo onto a content photo naturally, such that the stylized image looks like a real photo taken by a camera. Existing state-of-the-art methods are prone to spatial structure distortion of the content image and global color inconsistency across dif... | The quality of image stylization can be improved by densely matching the low-level or high-level features between the content and style images @cite_1 @cite_29 @cite_33 @cite_34 . Gatys al @cite_34 demonstrated impressive art style transfer results with pretrained CNN, which matches the correlations of deep features ex... | {
"cite_N": [
"@cite_35",
"@cite_37",
"@cite_33",
"@cite_22",
"@cite_29",
"@cite_1",
"@cite_0",
"@cite_40",
"@cite_5",
"@cite_31",
"@cite_34",
"@cite_10",
"@cite_12"
],
"mid": [
"2962772087",
"2951924128",
"",
"2331128040",
"2019969451",
... |
1907.10274 | 2964328619 | Photorealistic style transfer aims to transfer the style of a reference photo onto a content photo naturally, such that the stylized image looks like a real photo taken by a camera. Existing state-of-the-art methods are prone to spatial structure distortion of the content image and global color inconsistency across dif... | Recently, there have been a few methods specifically designed for photorealistic image stylization @cite_18 @cite_25 . Luan al @cite_36 preserved the structure of the content image by adopting a color-affine-transfer constraint and color transfer is performed according to the semantic region. However, the generated res... | {
"cite_N": [
"@cite_36",
"@cite_18",
"@cite_25",
"@cite_17"
],
"mid": [
"2604721644",
"2904949811",
"2756646128",
"2963683323"
],
"abstract": [
"This paper introduces a deep-learning approach to photographic style transfer that handles a large variety of image content whil... |
1907.08440 | 2963361436 | Cross-Domain Collaborative Filtering (CDCF) provides a way to alleviate data sparsity and cold-start problems present in recommendation systems by exploiting the knowledge from related domains. Existing CDCF models are either based on matrix factorization or deep neural networks. Either of the techniques in isolation m... | In the literature of CDR, early works @cite_31 @cite_3 @cite_14 @cite_6 @cite_5 mainly adopt matrix factorization models. In particular, @cite_3 constructs a cluster-level rating matrix (code-book) from user-item rating patterns and through which it establishes links to transfer the knowledge across domains. A similar ... | {
"cite_N": [
"@cite_35",
"@cite_14",
"@cite_42",
"@cite_6",
"@cite_3",
"@cite_40",
"@cite_5",
"@cite_31"
],
"mid": [
"2605350416",
"2118338035",
"2739273093",
"2129679514",
"143867266",
"1956916606",
"",
"2117420919"
],
"abstract": [
"In rec... |
1907.08440 | 2963361436 | Cross-Domain Collaborative Filtering (CDCF) provides a way to alleviate data sparsity and cold-start problems present in recommendation systems by exploiting the knowledge from related domains. Existing CDCF models are either based on matrix factorization or deep neural networks. Either of the techniques in isolation m... | On the other hand, recently, there has been a surge in methods proposed to explore deep learning networks for recommender systems @cite_42 . Most of the models in this category focus on utilizing neural network models for extracting embeddings from side information such as reviews @cite_36 , descriptions @cite_10 , con... | {
"cite_N": [
"@cite_36",
"@cite_29",
"@cite_42",
"@cite_32",
"@cite_24",
"@cite_27",
"@cite_10",
"@cite_25"
],
"mid": [
"2575006718",
"2137245235",
"2739273093",
"2509893387",
"2963655167",
"",
"2515144511",
"2054141820"
],
"abstract": [
"A ... |
1907.08440 | 2963361436 | Cross-Domain Collaborative Filtering (CDCF) provides a way to alleviate data sparsity and cold-start problems present in recommendation systems by exploiting the knowledge from related domains. Existing CDCF models are either based on matrix factorization or deep neural networks. Either of the techniques in isolation m... | More recently, to combine the advantages of both matrix factorization models and deep networks such as multi-layer perceptron (MLP), some models have been proposed @cite_20 @cite_35 @cite_33 for learning representations from only ratings. These models combine both the wide and deep networks together to provide better r... | {
"cite_N": [
"@cite_35",
"@cite_38",
"@cite_33",
"@cite_7",
"@cite_8",
"@cite_21",
"@cite_19",
"@cite_20"
],
"mid": [
"2605350416",
"2253995343",
"2740920897",
"2725606191",
"2099866409",
"2615395371",
"1720514416",
"2475334473"
],
"abstract": [... |
1907.08440 | 2963361436 | Cross-Domain Collaborative Filtering (CDCF) provides a way to alleviate data sparsity and cold-start problems present in recommendation systems by exploiting the knowledge from related domains. Existing CDCF models are either based on matrix factorization or deep neural networks. Either of the techniques in isolation m... | Though the use of multiple related domains and neural networks for recommendations has been studied and justified in many works @cite_42 , very few attempts have been made to make use of neural networks in cross-domain recommendation setting @cite_23 @cite_0 @cite_13 @cite_43 . In particular, MV-DNN @cite_23 uses an ML... | {
"cite_N": [
"@cite_42",
"@cite_0",
"@cite_43",
"@cite_23",
"@cite_13"
],
"mid": [
"2739273093",
"2612388534",
"2808716093",
"2114079787",
"2740605635"
],
"abstract": [
"With the growing volume of online information, recommender systems have been an effective strat... |
1907.08440 | 2963361436 | Cross-Domain Collaborative Filtering (CDCF) provides a way to alleviate data sparsity and cold-start problems present in recommendation systems by exploiting the knowledge from related domains. Existing CDCF models are either based on matrix factorization or deep neural networks. Either of the techniques in isolation m... | While the models @cite_23 @cite_0 @cite_13 @cite_43 consider learning embeddings together, they completely ignore the domain-specific representations for the shared users or items. The performance of these models @cite_23 @cite_0 is heavily dependent on the relatedness of the domains. In contrast, our proposed model le... | {
"cite_N": [
"@cite_30",
"@cite_28",
"@cite_0",
"@cite_43",
"@cite_23",
"@cite_2",
"@cite_13"
],
"mid": [
"2791324866",
"2280921826",
"2612388534",
"2808716093",
"2114079787",
"2808396937",
"2740605635"
],
"abstract": [
"The behavior of users in cer... |
1907.08661 | 2963611731 | Searching sounds by text labels is often difficult, as text descriptions cannot describe the audio content in detail. Query by vocal imitation bridges such gap and provides a novel way to sound search. Several algorithms for sound search by vocal imitation have been proposed and evaluated in a simulation environment, h... | In our previous work @cite_13 , we first proposed a supervised system using a Stacked Auto-Encoder (SAE) for automatic feature learning followed by an SVM for imitation classification. We then proposed an unsupervised system called IMISOUND @cite_27 to overcome the close-set limitation in @cite_13 . The SAE was adopted... | {
"cite_N": [
"@cite_26",
"@cite_7",
"@cite_17",
"@cite_6",
"@cite_24",
"@cite_27",
"@cite_2",
"@cite_15",
"@cite_13",
"@cite_11"
],
"mid": [
"2940168379",
"1965555277",
"2775430159",
"",
"",
"2406791552",
"2889726676",
"2890913619",
"198... |
1907.08553 | 2964344820 | LightGuider is a novel guidance-based approach to interactive lighting design, which typically consists of interleaved 3D modeling operations and light transport simulations. Rather than having designers use a trial-and-error approach to match their illumination constraints and aesthetic goals, LightGuider supports the... | In the scientific domain, several approaches automate or simplify light-source placement and orientation---either with procedural methods as suggested by Schwarz and Wonka @cite_11 , or by painting'' the parts of a scene for illumination @cite_3 @cite_15 @cite_8 @cite_23 @cite_28 @cite_41 . While these methods deliver ... | {
"cite_N": [
"@cite_37",
"@cite_8",
"@cite_28",
"@cite_41",
"@cite_21",
"@cite_3",
"@cite_23",
"@cite_15",
"@cite_11"
],
"mid": [
"2028497605",
"1983440625",
"1993525930",
"2619323557",
"2757993879",
"2093238777",
"2055893387",
"2100097348",
... |
1907.08553 | 2964344820 | LightGuider is a novel guidance-based approach to interactive lighting design, which typically consists of interleaved 3D modeling operations and light transport simulations. Rather than having designers use a trial-and-error approach to match their illumination constraints and aesthetic goals, LightGuider supports the... | @cite_12 tackle the problem of comparing different light configurations by linking the simulation results and a spatial view with non-spatial ranking and comparison visualizations. Their idea of setting the importance of certain criteria to compute the overall score (i.e., giving more weight to certain illumination req... | {
"cite_N": [
"@cite_34",
"@cite_12"
],
"mid": [
"2902079786",
"1934088123"
],
"abstract": [
"Physically based rendering is a well-understood technique to produce realistic-looking images. However, different algorithms exist for efficiency reasons, which work well in certain cases but fail... |
1907.08553 | 2964344820 | LightGuider is a novel guidance-based approach to interactive lighting design, which typically consists of interleaved 3D modeling operations and light transport simulations. Rather than having designers use a trial-and-error approach to match their illumination constraints and aesthetic goals, LightGuider supports the... | In accordance with @cite_32 , we classify LightGuider as follows: Utilizing an interactive lighting simulation, lighting designers start out with a single sample and generate new on-the-fly supported by guidance mechanisms (see sec:relworkguidance ) suggesting alternatives in the parameter space. Immediate feedback of ... | {
"cite_N": [
"@cite_32"
],
"mid": [
"1964473154"
],
"abstract": [
"Various case studies in different application domains have shown the great potential of visual parameter space analysis to support validating and using simulation models. In order to guide and systematize research endeavors in thi... |
1907.08553 | 2964344820 | LightGuider is a novel guidance-based approach to interactive lighting design, which typically consists of interleaved 3D modeling operations and light transport simulations. Rather than having designers use a trial-and-error approach to match their illumination constraints and aesthetic goals, LightGuider supports the... | When it comes to provenance information in visualization, @cite_27 give a comprehensive overview of the different types of provenance information (e.g., the history of data editing, the history of graphical views and visualization types, or the history of interactions) and different purposes of using them in the contex... | {
"cite_N": [
"@cite_27",
"@cite_29"
],
"mid": [
"1959365993",
"195157153"
],
"abstract": [
"While the primary goal of visual analytics research is to improve the quality of insights and findings, a substantial amount of research in provenance has focused on the history of changes and adva... |
1907.08553 | 2964344820 | LightGuider is a novel guidance-based approach to interactive lighting design, which typically consists of interleaved 3D modeling operations and light transport simulations. Rather than having designers use a trial-and-error approach to match their illumination constraints and aesthetic goals, LightGuider supports the... | @cite_46 focus on the scalability of node-link diagrams for encoding a history of analysis workflows. They use filtering, node aggregation, as well as a user-interest driven expansion of nodes (i.e., a degree-of-interest function) to make the tree more comprehensible. In a different work, @cite_7 use a provenance tree ... | {
"cite_N": [
"@cite_46",
"@cite_7"
],
"mid": [
"2950879328",
"2888018391"
],
"abstract": [
"A major challenge in data-driven biomedical research lies in the collection and representation of data provenance information to ensure that findings are reproducibile. In order to communicate and ... |
1907.08553 | 2964344820 | LightGuider is a novel guidance-based approach to interactive lighting design, which typically consists of interleaved 3D modeling operations and light transport simulations. Rather than having designers use a trial-and-error approach to match their illumination constraints and aesthetic goals, LightGuider supports the... | Besides node-link diagrams, there are examples of other visualization types used to show provenance information. Vi 'e @cite_16 , for instance, visualize the history of the editing that was applied to a Wikipedia (wikipedia.org) page in a flow-like visualization. This visualization is specifically designed to represent... | {
"cite_N": [
"@cite_40",
"@cite_16"
],
"mid": [
"2102675982",
"2111122424"
],
"abstract": [
"Presentation and graphics software enables users to experiment with variations of illustrations. They can revisit recent editing operations using the ubiquitous undo command, but they are limited ... |
1907.08553 | 2964344820 | LightGuider is a novel guidance-based approach to interactive lighting design, which typically consists of interleaved 3D modeling operations and light transport simulations. Rather than having designers use a trial-and-error approach to match their illumination constraints and aesthetic goals, LightGuider supports the... | Guidance in visualization as defined by Ceneda at al. @cite_18 can be found in various forms and application scenarios. However, only a few approaches relate to our problem at hand. @cite_33 present a guidance approach to automatically generate a set of information-visualization designs appropriate for the given data a... | {
"cite_N": [
"@cite_0",
"@cite_18",
"@cite_33"
],
"mid": [
"2131210874",
"2488113179",
"2151122362"
],
"abstract": [
"Creating graphic designs can be challenging for novice users. This paper presents DesignScape, a system which aids the design process by making interactive layout ... |
1907.08553 | 2964344820 | LightGuider is a novel guidance-based approach to interactive lighting design, which typically consists of interleaved 3D modeling operations and light transport simulations. Rather than having designers use a trial-and-error approach to match their illumination constraints and aesthetic goals, LightGuider supports the... | @cite_45 present a guidance approach that helps to discover interesting data and patterns based on the system user's interests. They provide a system to extract, combine, refine, and visualize such findings of interest. They distinguish between user-driven and data-driven findings. In our work we combine user-driven (i... | {
"cite_N": [
"@cite_45"
],
"mid": [
"2050035370"
],
"abstract": [
"Visualization systems traditionally focus on graphical representation of information. They tend not to provide integrated analytical services that could aid users in tackling complex knowledge discovery tasks. Users' exploration i... |
1907.08427 | 2964016487 | Video person re-identification (re-ID) plays an important role in surveillance video analysis. However, the performance of video re-ID degenerates severely under partial occlusion. In this paper, we propose a novel network, called Spatio-Temporal Completion network (STCnet), to explicitly handle partial occlusion probl... | Person re-ID for still images has been extensively studied @cite_34 @cite_13 @cite_25 @cite_19 @cite_37 @cite_40 @cite_10 . Recently, researchers start to pay attention to video re-ID @cite_29 @cite_21 @cite_33 @cite_27 @cite_41 @cite_20 @cite_23 @cite_9 @cite_12 . McLaughlin al @cite_21 and Wu al @cite_33 proposed a b... | {
"cite_N": [
"@cite_37",
"@cite_33",
"@cite_41",
"@cite_10",
"@cite_29",
"@cite_21",
"@cite_9",
"@cite_19",
"@cite_40",
"@cite_27",
"@cite_23",
"@cite_12",
"@cite_34",
"@cite_13",
"@cite_25",
"@cite_20"
],
"mid": [
"2964163358",
"2473702307"... |
1907.08427 | 2964016487 | Video person re-identification (re-ID) plays an important role in surveillance video analysis. However, the performance of video re-ID degenerates severely under partial occlusion. In this paper, we propose a novel network, called Spatio-Temporal Completion network (STCnet), to explicitly handle partial occlusion probl... | To handle partial occlusion, the attention based approaches are gaining popularity. Zhou al @cite_41 proposed a RNN temporal attention mechanism to select the most discriminative frames from video. Liu al @cite_9 used a convolutional subnet to predict quality score for each frame of video. Xu al @cite_23 presented a Sp... | {
"cite_N": [
"@cite_41",
"@cite_9",
"@cite_20",
"@cite_23"
],
"mid": [
"2622829582",
"2963216120",
"2963736028",
"2963960612"
],
"abstract": [
"Surveillance cameras have been widely used in different scenes. Accordingly, a demanding need is to recognize a person under diff... |
1907.08427 | 2964016487 | Video person re-identification (re-ID) plays an important role in surveillance video analysis. However, the performance of video re-ID degenerates severely under partial occlusion. In this paper, we propose a novel network, called Spatio-Temporal Completion network (STCnet), to explicitly handle partial occlusion probl... | Image completion aims to fill the missing or masked regions in images with plausibly synthesized contents. It has many applications in photo editing, textual synthesis and computational photography. Early works @cite_32 @cite_14 attempted to solve the problem by matching and copying background patches into the missing ... | {
"cite_N": [
"@cite_14",
"@cite_22",
"@cite_28",
"@cite_36",
"@cite_32",
"@cite_16"
],
"mid": [
"1993120651",
"2963420272",
"2738588019",
"2286929393",
"2171011251",
"2099471712"
],
"abstract": [
"This paper presents interactive image editing tools using a ... |
1907.08375 | 2962785319 | Unsupervised domain adaptation for classification tasks has achieved great progress in leveraging the knowledge in a labeled (source) domain to improve the task performance in an unlabeled (target) domain by mitigating the effect of distribution discrepancy. However, most existing methods can only handle unsupervised c... | Ben- @cite_23 proposed generalization bounds for closed set domain adaptation. The bound represents that the performance of the target classifier depends on the performance of the source classifier and the discrepancy between the source and target domains. Many UCSDA methods @cite_26 @cite_11 @cite_3 have been proposed... | {
"cite_N": [
"@cite_26",
"@cite_3",
"@cite_23",
"@cite_11"
],
"mid": [
"2057266281",
"2888851832",
"2131953535",
"2342085406"
],
"abstract": [
"Visual domain adaptation, which learns an accurate classifier for a new domain using labeled images from an old domain, has shown... |
1907.08375 | 2962785319 | Unsupervised domain adaptation for classification tasks has achieved great progress in leveraging the knowledge in a labeled (source) domain to improve the task performance in an unlabeled (target) domain by mitigating the effect of distribution discrepancy. However, most existing methods can only handle unsupervised c... | Feature matching aims to reduce the distribution discrepancy by learning a new feature representation. (TCA) @cite_35 learns a new feature space to match distributions by employing the (MMD) @cite_29 . (JDA) @cite_14 improves TCA by jointly matching marginal distributions and conditional distributions. (ARTL) @cite_20 ... | {
"cite_N": [
"@cite_35",
"@cite_18",
"@cite_14",
"@cite_4",
"@cite_29",
"@cite_21",
"@cite_6",
"@cite_20",
"@cite_17"
],
"mid": [
"2115403315",
"2104290444",
"2096943734",
"2159291411",
"2212660284",
"2110097068",
"2616287544",
"2100664256",
... |
1907.08375 | 2962785319 | Unsupervised domain adaptation for classification tasks has achieved great progress in leveraging the knowledge in a labeled (source) domain to improve the task performance in an unlabeled (target) domain by mitigating the effect of distribution discrepancy. However, most existing methods can only handle unsupervised c... | The instance reweighting method reduces distribution discrepancy by weighting the source samples. (KMM) @cite_25 defines the weights as the density ratio between the source domain and the target domain. @cite_22 provided a theoretical analysis for important instance reweighting methods. However, when the domain discrep... | {
"cite_N": [
"@cite_22",
"@cite_25"
],
"mid": [
"2111272908",
"2112483442"
],
"abstract": [
"In real supervised learning scenarios, it is not uncommon that the training and test sample follow different probability distributions, thus rendering the necessity to correct the sampling bias. F... |
1907.08375 | 2962785319 | Unsupervised domain adaptation for classification tasks has achieved great progress in leveraging the knowledge in a labeled (source) domain to improve the task performance in an unlabeled (target) domain by mitigating the effect of distribution discrepancy. However, most existing methods can only handle unsupervised c... | When the source domain and target domain for known classes share the same distribution, the open set domain adaptation becomes . A common method for handling open set recognition relies on the use of threshold-based classification strategies @cite_30 . Establishing a threshold on the similarity score means rejecting di... | {
"cite_N": [
"@cite_30",
"@cite_36",
"@cite_39",
"@cite_5",
"@cite_16"
],
"mid": [
"1520795124",
"2248269543",
"2785496677",
"2018459374",
"1032927584"
],
"abstract": [
"The heart of designing and conducting evaluations and is the experimental protocol. The protoco... |
1907.08375 | 2962785319 | Unsupervised domain adaptation for classification tasks has achieved great progress in leveraging the knowledge in a labeled (source) domain to improve the task performance in an unlabeled (target) domain by mitigating the effect of distribution discrepancy. However, most existing methods can only handle unsupervised c... | The open set domain adaptation problem was proposed by Assign-and-Transform-Iteratively (ATI- @math ) @cite_41 . Using @math distance between each target sample and the center of each source class, ATI- @math constructs a constraint integer programming to recognize unknown target samples @math , then learns a linear tr... | {
"cite_N": [
"@cite_41",
"@cite_19"
],
"mid": [
"2779610669",
"2798593490"
],
"abstract": [
"When the training and the test data belong to different domains, the accuracy of an object classifier is significantly reduced. Therefore, several algorithms have been proposed in the last years t... |
1907.08307 | 2963457350 | The term Neural Architecture Search (NAS) refers to the automatic optimization of network architectures for a new, previously unknown task. Since testing an architecture is computationally very expensive, many optimizers need days or even weeks to find suitable architectures. However, this search time can be significan... | Neural Architecture Search (NAS), the structural optimization of neural networks, is solved with a variety of optimization techniques. These include reinforcement learning @cite_3 @cite_0 @cite_4 @cite_13 @cite_2 @cite_27 @cite_11 , evolutionary algorithms @cite_17 @cite_33 @cite_34 @cite_15 , and surrogate model-based... | {
"cite_N": [
"@cite_30",
"@cite_22",
"@cite_3",
"@cite_2",
"@cite_15",
"@cite_18",
"@cite_4",
"@cite_21",
"@cite_23",
"@cite_17",
"@cite_32",
"@cite_27",
"@cite_16",
"@cite_34",
"@cite_12",
"@cite_33",
"@cite_0",
"@cite_13",
"@cite_11"
],
... |
1907.08116 | 2956997324 | Designing fast and reliable distributed consensus protocols is a key to enabling mission-critical and real-time controls of industrial Internet of Things (IIoT) nodes communicating over wireless links. However, chasing both low-latency and reliability of a consensus protocol at once is a challenging task. The problem i... | Nonetheless, most of the aforementioned algorithms postulate that nodes are communicating over fast and reliable wired links. To support large-scale systems, wireless connectivity is mandatory in consensus operations, and its impact on consensus reliability and latency should be carefully examined. On this account, wir... | {
"cite_N": [
"@cite_18",
"@cite_15",
"@cite_29",
"@cite_9",
"@cite_0",
"@cite_23",
"@cite_31",
"@cite_25",
"@cite_20"
],
"mid": [
"",
"2922250870",
"2883173846",
"2908039420",
"",
"2921088707",
"2888550303",
"2954103930",
"2953611374"
],
... |
1907.08362 | 2963011296 | In this paper we consider the following sparse recovery problem. We have query access to a vector @math such that @math is @math -sparse (or nearly @math -sparse) for some orthogonal transform @math . The goal is to output an approximation (in an @math sense) to @math in sublinear time. This problem has been well-studi... | The sample complexity of OP transforms @math has been largely pinned down by the compressed sensing literature. For example, suppose that @math is any orthogonal and sufficiently flat matrix, in the sense that none of the entries of @math are too large. Then a result of Rudelson and Vershynin (and a sharpening of their... | {
"cite_N": [
"@cite_0",
"@cite_16",
"@cite_4",
"@cite_30"
],
"mid": [
"641843003",
"2923536738",
"2055064119",
"2924908021"
],
"abstract": [
"It is shown that for the n × n-Hadamard matrix (or, more generally, a bounded orthogonal matrix) the RIP-property for r-space vecto... |
1907.08362 | 2963011296 | In this paper we consider the following sparse recovery problem. We have query access to a vector @math such that @math is @math -sparse (or nearly @math -sparse) for some orthogonal transform @math . The goal is to output an approximation (in an @math sense) to @math in sublinear time. This problem has been well-studi... | Rauhut and Ward @cite_13 show that for Jacobi polynomial transforms if the evaluation points were picked according to the Chebyshev measure , then with @math random measurements, the corresponding matrix has the RIP (note that the Foucart and Rauhut sample the evaluation points according to the measure of orthogonality... | {
"cite_N": [
"@cite_26",
"@cite_13"
],
"mid": [
"2963520188",
"2141454789"
],
"abstract": [
"In this paper, we propose a general strategy for rapidly computing sparse Legendre expansions. The resulting methods yield a new class of fast algorithms capable of approximating a given function ... |
1907.08362 | 2963011296 | In this paper we consider the following sparse recovery problem. We have query access to a vector @math such that @math is @math -sparse (or nearly @math -sparse) for some orthogonal transform @math . The goal is to output an approximation (in an @math sense) to @math in sublinear time. This problem has been well-studi... | While these approaches can give near-optimal sample complexity, they do not give sublinear-time algorithms. In fact, it is faster to compute @math exactly by computing @math , if we care only about the running time and not about sample complexity @cite_8 . Thus, we turn our attention to sublinear-time algorithms. | {
"cite_N": [
"@cite_8"
],
"mid": [
"2149599446"
],
"abstract": [
"Let @math denote a set of polynomials with complex coefficients. Let @math denote any set of sample points . For any @math , the discrete polynomial transform of @math (with respect to @math and @math ) is defined as the collection... |
1907.08362 | 2963011296 | In this paper we consider the following sparse recovery problem. We have query access to a vector @math such that @math is @math -sparse (or nearly @math -sparse) for some orthogonal transform @math . The goal is to output an approximation (in an @math sense) to @math in sublinear time. This problem has been well-studi... | There have been several works generalizing and building on the sFFT results mentioned above. One direction is to the multi-dimensional DFT (for example in @cite_27 @cite_9 ). Another direction is to apply the sFFT framework to orthogonal polynomials with similar structure. One example is Chebyshev polynomials and the D... | {
"cite_N": [
"@cite_9",
"@cite_27",
"@cite_26"
],
"mid": [
"2903067870",
"2082051116",
"2963520188"
],
"abstract": [
"",
"We give an algorithm for l2 l2 sparse recovery from Fourier measurements using O(klog N) samples, matching the lower bound of Do Ba-Indyk-Price-Woodruff'10... |
1907.08362 | 2963011296 | In this paper we consider the following sparse recovery problem. We have query access to a vector @math such that @math is @math -sparse (or nearly @math -sparse) for some orthogonal transform @math . The goal is to output an approximation (in an @math sense) to @math in sublinear time. This problem has been well-studi... | @cite_18 study higher dimensions and obtain sublinear-time algorithms for more general harmonic expansions in multiple dimensions. The results of @cite_18 complement our work. More precisely, that work shows how to use any algorithm for a univariate polynomial transform to design an algorithm for a multi-variate polyno... | {
"cite_N": [
"@cite_18"
],
"mid": [
"2885396681"
],
"abstract": [
"We develop fast and memory efficient numerical methods for learning functions of many variables that admit sparse representations in terms of general bounded orthonormal tensor product bases. Such functions appear in many applicat... |
1907.08362 | 2963011296 | In this paper we consider the following sparse recovery problem. We have query access to a vector @math such that @math is @math -sparse (or nearly @math -sparse) for some orthogonal transform @math . The goal is to output an approximation (in an @math sense) to @math in sublinear time. This problem has been well-studi... | Finally, there are sparse OP transforms based on Prony's method. The work @cite_20 extends Prony's method to a very general setting, including Jacobi polynomials, and gives an algorithm that requires only @math queries to recover exactly @math -sparse polynomials. However, these general results work only for exact spar... | {
"cite_N": [
"@cite_31",
"@cite_32",
"@cite_20",
"@cite_11"
],
"mid": [
"1978356474",
"2211482116",
"2022821885",
"2065656021"
],
"abstract": [
"The recovery of signal parameters from noisy sampled data is a fundamental problem in digital signal processing. In this paper, ... |
1907.08302 | 2964151964 | With the demand to process ever-growing data volumes, a variety of new data stream processing frameworks have been developed. Moving an implementation from one such system to another, e.g., for performance reasons, requires adapting existing applications to new interfaces. Apache Beam addresses these high substitution ... | With respect to benchmarking DSPSs in general, the Linear Road benchmark by @cite_42 is a very well-known work. It is an application benchmark that provides a benchmarking toolkit. This toolkit consists of a data generator, a data sender, and a result validator. The underlying idea of the benchmark is a variable tollin... | {
"cite_N": [
"@cite_42"
],
"mid": [
"2112215401"
],
"abstract": [
"This paper specifies the Linear Road Benchmark for Stream Data Management Systems (SDMS). Stream Data Management Systems process streaming data by executing continuous and historical queries while producing query results in real-t... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.