doc_id
string
arxiv_id
string
title
string
text
string
url
string
doi
string
category
string
published
string
era
string
dendro_not_after
string
dendro_not_after_year
int64
dendro_human_origin_p
float64
dendro_ci_low
float64
dendro_ci_high
float64
dendro_abstained
bool
dendro_operators
int64
dendro_evidence_logodds
float64
dendro_flags
list
dendro_ancestor
null
dendro_explanation
string
low_background
bool
arxiv:1912.03937
1912.03937
Deep Ritz revisited
Deep Ritz revisited Recently, progress has been made in the application of neural networks to the numerical analysis of partial differential equations (PDEs). In the latter the variational formulation of the Poisson problem is used in order to obtain an objective function - a regularised Dirichlet energy - that was us...
https://arxiv.org/abs/1912.03937
null
math.NA
2020-01-10T00:00:00+00:00
pre2021
2020-01-10
2,020
0.990706
0.844442
0.99558
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-10, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1912.07777
1912.07777
Mosaic: A Sample-Based Database System for Open World Query Processing
Mosaic: A Sample-Based Database System for Open World Query Processing Data scientists have relied on samples to analyze populations of interest for decades. Recently, with the increase in the number of public data repositories, sample data has become easier to access. It has not, however, become easier to analyze. Th...
https://arxiv.org/abs/1912.07777
null
cs.DB
2020-01-10T00:00:00+00:00
pre2021
2020-01-10
2,020
0.990706
0.844442
0.99558
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-10, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1912.12941
1912.12941
A general anomaly detection framework for fleet-based condition monitoring of machines
A general anomaly detection framework for fleet-based condition monitoring of machines Machine failures decrease up-time and can lead to extra repair costs or even to human casualties and environmental pollution. Recent condition monitoring techniques use artificial intelligence in an effort to avoid time-consuming ma...
https://arxiv.org/abs/1912.12941
10.1016/j.ymssp.2019.106585
cs.LG
2020-01-07T00:00:00+00:00
pre2021
2020-01-07
2,020
0.990756
0.844521
0.995591
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-07, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.00003
2001.00003
Learning Numeral Embeddings
Learning Numeral Embeddings Word embedding is an essential building block for deep learning methods for natural language processing. Although word embedding has been extensively studied over the years, the problem of how to effectively embed numerals, a special subset of words, is still underexplored. Existing word em...
https://arxiv.org/abs/2001.00003
null
cs.CL
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.00259
2001.00259
Optimal Scheduling of Content Caching Subject to Deadline
Optimal Scheduling of Content Caching Subject to Deadline Content caching at the edge of network is a promising technique to alleviate the burden of backhaul networks. In this paper, we consider content caching along time in a base station with limited cache capacity. As the popularity of contents may vary over time, ...
https://arxiv.org/abs/2001.00259
null
cs.NI
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.00315
2001.00315
Complexity and Efficient Algorithms for Data Inconsistency Evaluating and Repairing
Complexity and Efficient Algorithms for Data Inconsistency Evaluating and Repairing Data inconsistency evaluating and repairing are major concerns in data quality management. As the basic computing task, optimal subset repair is not only applied for cost estimation during the progress of database repairing, but also d...
https://arxiv.org/abs/2001.00315
null
cs.DB
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.00585
2001.00585
Self-Supervised Learning of Generative Spin-Glasses with Normalizing Flows
Self-Supervised Learning of Generative Spin-Glasses with Normalizing Flows Spin-glasses are universal models that can capture complex behavior of many-body systems at the interface of statistical physics and computer science including discrete optimization, inference in graphical models, and automated reasoning. Compu...
https://arxiv.org/abs/2001.00585
null
cs.LG
2020-01-10T00:00:00+00:00
pre2021
2020-01-10
2,020
0.990706
0.844442
0.99558
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-10, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.00927
2001.00927
A Probability Density Theory for Spin-Glass Systems
A Probability Density Theory for Spin-Glass Systems Spin-glass systems are universal models for representing many-body phenomena in statistical physics and computer science. High quality solutions of NP-hard combinatorial optimization problems can be encoded into low energy states of spin-glass systems. In general, ev...
https://arxiv.org/abs/2001.00927
null
cond-mat.dis-nn
2020-01-10T00:00:00+00:00
pre2021
2020-01-10
2,020
0.990706
0.844442
0.99558
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-10, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.01999
2001.01999
Universal Wait-Free Memory Reclamation
Universal Wait-Free Memory Reclamation In this paper, we present a universal memory reclamation scheme, Wait-Free Eras (WFE), for deleted memory blocks in wait-free concurrent data structures. WFE's key innovation is that it is completely wait-free. Although some prior techniques provide similar guarantees for certain...
https://arxiv.org/abs/2001.01999
10.1145/3332466.3374540
cs.DC
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.02082
2001.02082
A New Formulation of Coupling and Sliding Motions of Grain Boundaries Based on Dislocation Structure
A New Formulation of Coupling and Sliding Motions of Grain Boundaries Based on Dislocation Structure A continuum model of the two dimensional low angle grain boundary motion and the dislocation structure evolution on the grain boundaries has been developed in Ref. [48]. The model is based on the motion and reaction of...
https://arxiv.org/abs/2001.02082
null
cond-mat.mtrl-sci
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.02491
2001.02491
Comparing Python, Go, and C++ on the N-Queens Problem
Comparing Python, Go, and C++ on the N-Queens Problem Python currently is the dominant language in the field of Machine Learning but is often criticized for being slow to perform certain tasks. In this report, we use the well-known $N$-queens puzzle as a benchmark to show that once compiled using the Numba compiler it...
https://arxiv.org/abs/2001.02491
null
cs.MS
2020-01-08T00:00:00+00:00
pre2021
2020-01-08
2,020
0.990739
0.844494
0.995587
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-08, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.02611
2001.02611
Peer-to-Peer based Social Networks: A Comprehensive Survey
Peer-to-Peer based Social Networks: A Comprehensive Survey Online social networks, such as Facebook and twitter, are a growing phenomenon in today's world, with various platforms providing capabilities for individuals to collaborate through messaging and chatting as well as sharing of content such as videos and photos...
https://arxiv.org/abs/2001.02611
null
cs.SI
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.02670
2001.02670
Synchronous Byzantine Lattice Agreement in ${\cal O}(\log (f))$ Rounds
Synchronous Byzantine Lattice Agreement in ${\cal O}(\log (f))$ Rounds In the Lattice Agreement (LA) problem, originally proposed by Attiya et al. \cite{Attiya:1995}, a set of processes has to decide on a chain of a lattice. More precisely, each correct process proposes an element $e$ of a certain join-semi lattice $L...
https://arxiv.org/abs/2001.02670
null
cs.DC
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.02712
2001.02712
Latent Factor Analysis of Gaussian Distributions under Graphical Constraints
Latent Factor Analysis of Gaussian Distributions under Graphical Constraints We explore the algebraic structure of the solution space of convex optimization problem Constrained Minimum Trace Factor Analysis (CMTFA), when the population covariance matrix $Σ_x$ has an additional latent graphical constraint, namely, a l...
https://arxiv.org/abs/2001.02712
null
cs.IT
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.02792
2001.02792
On Computation and Generalization of Generative Adversarial Imitation Learning
On Computation and Generalization of Generative Adversarial Imitation Learning Generative Adversarial Imitation Learning (GAIL) is a powerful and practical approach for learning sequential decision-making policies. Different from Reinforcement Learning (RL), GAIL takes advantage of demonstration data by experts (e.g.,...
https://arxiv.org/abs/2001.02792
null
cs.LG
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.02962
2001.02962
LibreSocial: A Peer-to-Peer Framework for Online Social Networks
LibreSocial: A Peer-to-Peer Framework for Online Social Networks Distributed online social networks (DOSNs) were first proposed to solve the problem of privacy, security and scalability. A significant amount of research was undertaken to offer viable DOSN solutions that were capable of competing with the existing cent...
https://arxiv.org/abs/2001.02962
null
cs.SI
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.02970
2001.02970
Closed-loop deep learning: generating forward models with back-propagation
Closed-loop deep learning: generating forward models with back-propagation A reflex is a simple closed loop control approach which tries to minimise an error but fails to do so because it will always react too late. An adaptive algorithm can use this error to learn a forward model with the help of predictive cues. For...
https://arxiv.org/abs/2001.02970
null
cs.LG
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03071
2001.03071
Investigating the Impact of Inclusion in Face Recognition Training Data on Individual Face Identification
Investigating the Impact of Inclusion in Face Recognition Training Data on Individual Face Identification Modern face recognition systems leverage datasets containing images of hundreds of thousands of specific individuals' faces to train deep convolutional neural networks to learn an embedding space that maps an arbi...
https://arxiv.org/abs/2001.03071
null
cs.CY
2020-01-10T00:00:00+00:00
pre2021
2020-01-10
2,020
0.990706
0.844442
0.99558
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-10, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03096
2001.03096
On The Optimality of The Whittle's Index Policy For Minimizing The Age of Information
On The Optimality of The Whittle's Index Policy For Minimizing The Age of Information In this paper, we consider the average age minimization problem where a central entity schedules M users among the N available users for transmission over unreliable channels. It is well-known that obtaining the optimal policy, in th...
https://arxiv.org/abs/2001.03096
null
cs.IT
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03253
2001.03253
Campfire: Compressible, Regularization-Free, Structured Sparse Training for Hardware Accelerators
Campfire: Compressible, Regularization-Free, Structured Sparse Training for Hardware Accelerators This paper studies structured sparse training of CNNs with a gradual pruning technique that leads to fixed, sparse weight matrices after a set number of epochs. We simplify the structure of the enforced sparsity so that i...
https://arxiv.org/abs/2001.03253
null
cs.LG
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03447
2001.03447
Explaining the Explainer: A First Theoretical Analysis of LIME
Explaining the Explainer: A First Theoretical Analysis of LIME Machine learning is used more and more often for sensitive applications, sometimes replacing humans in critical decision-making processes. As such, interpretability of these algorithms is a pressing need. One popular algorithm to provide interpretability i...
https://arxiv.org/abs/2001.03447
null
cs.LG
2020-01-13T00:00:00+00:00
pre2021
2020-01-13
2,020
0.990655
0.844363
0.995569
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-13, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03618
2001.03618
Encode, Shuffle, Analyze Privacy Revisited: Formalizations and Empirical Evaluation
Encode, Shuffle, Analyze Privacy Revisited: Formalizations and Empirical Evaluation Recently, a number of approaches and techniques have been introduced for reporting software statistics with strong privacy guarantees. These range from abstract algorithms to comprehensive systems with varying assumptions and built upo...
https://arxiv.org/abs/2001.03618
null
cs.CR
2020-01-10T00:00:00+00:00
pre2021
2020-01-10
2,020
0.990706
0.844442
0.99558
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-10, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03632
2001.03632
Does syntax need to grow on trees? Sources of hierarchical inductive bias in sequence-to-sequence networks
Does syntax need to grow on trees? Sources of hierarchical inductive bias in sequence-to-sequence networks Learners that are exposed to the same training data might generalize differently due to differing inductive biases. In neural network models, inductive biases could in theory arise from any aspect of the model ar...
https://arxiv.org/abs/2001.03632
null
cs.CL
2020-01-10T00:00:00+00:00
pre2021
2020-01-10
2,020
0.990706
0.844442
0.99558
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-10, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03643
2001.03643
Understanding and Mitigating the Security Risks of Content Inclusion in Web Browsers
Understanding and Mitigating the Security Risks of Content Inclusion in Web Browsers Thanks to the wide range of features offered by web browsers, modern websites include various types of content such as JavaScript and CSS in order to create interactive user interfaces. Browser vendors also provided extensions to enha...
https://arxiv.org/abs/2001.03643
null
cs.CR
2020-01-10T00:00:00+00:00
pre2021
2020-01-10
2,020
0.990706
0.844442
0.99558
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-10, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03645
2001.03645
Extreme Software Defined Radio -- GHz in Real Time
Extreme Software Defined Radio -- GHz in Real Time Software defined radio is a widely accepted paradigm for design of reconfigurable modems. The continuing march of Moore's law makes real-time signal processing on general purpose processors feasible for a large set of waveforms. Data rates in the low Mbps can be proce...
https://arxiv.org/abs/2001.03645
null
eess.SP
2020-01-10T00:00:00+00:00
pre2021
2020-01-10
2,020
0.990706
0.844442
0.99558
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-10, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03651
2001.03651
Modifications of Prony's Method for the Recovery and Sparse Approximation of Generalized Exponential Sums
Modifications of Prony's Method for the Recovery and Sparse Approximation of Generalized Exponential Sums In this survey we describe some modifications of Prony's method. In particular, we consider the recovery of general expansions into eigenfunctions of linear differential operators of first order and show, how thes...
https://arxiv.org/abs/2001.03651
null
math.NA
2020-01-10T00:00:00+00:00
pre2021
2020-01-10
2,020
0.990706
0.844442
0.99558
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-10, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03653
2001.03653
Towards GAN Benchmarks Which Require Generalization
Towards GAN Benchmarks Which Require Generalization For many evaluation metrics commonly used as benchmarks for unconditional image generation, trivially memorizing the training set attains a better score than models which are considered state-of-the-art; we consider this problematic. We clarify a necessary condition ...
https://arxiv.org/abs/2001.03653
null
cs.LG
2020-01-10T00:00:00+00:00
pre2021
2020-01-10
2,020
0.990706
0.844442
0.99558
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-10, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03657
2001.03657
Dominance Move calculation using a MIP approach for comparison of multi and many-objective optimization solution sets
Dominance Move calculation using a MIP approach for comparison of multi and many-objective optimization solution sets Dominance move (DoM) is a binary quality indicator that can be used in multiobjective optimization. It can compare solution sets while representing some important features such as convergence, spread, ...
https://arxiv.org/abs/2001.03657
null
math.OC
2020-01-10T00:00:00+00:00
pre2021
2020-01-10
2,020
0.990706
0.844442
0.99558
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-10, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03659
2001.03659
Network of Steel: Neural Font Style Transfer from Heavy Metal to Corporate Logos
Network of Steel: Neural Font Style Transfer from Heavy Metal to Corporate Logos We introduce a method for transferring style from the logos of heavy metal bands onto corporate logos using a VGG16 network. We establish the contribution of different layers and loss coefficients to the learning of style, minimization of...
https://arxiv.org/abs/2001.03659
null
cs.CV
2020-01-10T00:00:00+00:00
pre2021
2020-01-10
2,020
0.990706
0.844442
0.99558
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-10, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03664
2001.03664
Obtaining a Canonical Polygonal Schema from a Greedy Homotopy Basis with Minimal Mesh Refinement
Obtaining a Canonical Polygonal Schema from a Greedy Homotopy Basis with Minimal Mesh Refinement Any closed manifold of genus g can be cut open to form a topological disk and then mapped to a regular polygon with 4g sides. This construction is called the canonical polygonal schema of the manifold, and is a key ingredi...
https://arxiv.org/abs/2001.03664
null
cs.CG
2020-01-10T00:00:00+00:00
pre2021
2020-01-10
2,020
0.990706
0.844442
0.99558
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-10, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03671
2001.03671
Retouchdown: Adding Touchdown to StreetLearn as a Shareable Resource for Language Grounding Tasks in Street View
Retouchdown: Adding Touchdown to StreetLearn as a Shareable Resource for Language Grounding Tasks in Street View The Touchdown dataset (Chen et al., 2019) provides instructions by human annotators for navigation through New York City streets and for resolving spatial descriptions at a given location. To enable the wid...
https://arxiv.org/abs/2001.03671
null
cs.CV
2020-01-10T00:00:00+00:00
pre2021
2020-01-10
2,020
0.990706
0.844442
0.99558
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-10, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03674
2001.03674
Semi-supervised Anomaly Detection using AutoEncoders
Semi-supervised Anomaly Detection using AutoEncoders Anomaly detection refers to the task of finding unusual instances that stand out from the normal data. In several applications, these outliers or anomalous instances are of greater interest compared to the normal ones. Specifically in the case of industrial optical ...
https://arxiv.org/abs/2001.03674
null
eess.IV
2020-01-06T00:00:00+00:00
pre2021
2020-01-06
2,020
0.990773
0.844547
0.995595
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-06, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03676
2001.03676
Learning Topometric Semantic Maps from Occupancy Grids
Learning Topometric Semantic Maps from Occupancy Grids Today's mobile robots are expected to operate in complex environments they share with humans. To allow intuitive human-robot collaboration, robots require a human-like understanding of their surroundings in terms of semantically classified instances. In this paper...
https://arxiv.org/abs/2001.03676
null
cs.CV
2020-01-10T00:00:00+00:00
pre2021
2020-01-10
2,020
0.990706
0.844442
0.99558
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-10, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03687
2001.03687
Recognition and Localisation of Pointing Gestures using a RGB-D Camera
Recognition and Localisation of Pointing Gestures using a RGB-D Camera Non-verbal communication is part of our regular conversation, and multiple gestures are used to exchange information. Among those gestures, pointing is the most important one. If such gestures cannot be perceived by other team members, e.g. by blin...
https://arxiv.org/abs/2001.03687
null
cs.HC
2020-01-10T00:00:00+00:00
pre2021
2020-01-10
2,020
0.990706
0.844442
0.99558
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-10, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03692
2001.03692
Locally Decodable Codes with Randomized Encoding
Locally Decodable Codes with Randomized Encoding We initiate a study of locally decodable codes with randomized encoding. Standard locally decodable codes are error correcting codes with a deterministic encoding function and a randomized decoding function, such that any desired message bit can be recovered with good p...
https://arxiv.org/abs/2001.03692
null
cs.IT
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03705
2001.03705
On Approximate Message Passing for Unsourced Access with Coded Compressed Sensing
On Approximate Message Passing for Unsourced Access with Coded Compressed Sensing Sparse regression codes with approximate message passing (AMP) decoding have gained much attention in recent times. The concepts underlying this coding scheme extend to unsourced access with coded compressed sensing (CCS), as first point...
https://arxiv.org/abs/2001.03705
null
cs.IT
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03708
2001.03708
PatentTransformer-2: Controlling Patent Text Generation by Structural Metadata
PatentTransformer-2: Controlling Patent Text Generation by Structural Metadata PatentTransformer is our codename for patent text generation based on Transformer-based models. Our goal is "Augmented Inventing." In this second version, we leverage more of the structural metadata in patents. The structural metadata inclu...
https://arxiv.org/abs/2001.03708
null
cs.CL
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03712
2001.03712
MHSAN: Multi-Head Self-Attention Network for Visual Semantic Embedding
MHSAN: Multi-Head Self-Attention Network for Visual Semantic Embedding Visual-semantic embedding enables various tasks such as image-text retrieval, image captioning, and visual question answering. The key to successful visual-semantic embedding is to express visual and textual data properly by accounting for their in...
https://arxiv.org/abs/2001.03712
null
cs.CV
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03722
2001.03722
An Achievable Region for the Multiple Access Wiretap Channels with Confidential and Open Messages
An Achievable Region for the Multiple Access Wiretap Channels with Confidential and Open Messages This paper investigates the capacity region of a discrete memoryless (DM) multiple access wiretap (MAC-WT) channel where, besides confidential messages, the users have also open messages to transmit. All these messages ar...
https://arxiv.org/abs/2001.03722
null
cs.IT
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03730
2001.03730
Strategic Scheduling of Discrete Control Devices in Active Distribution Systems
Strategic Scheduling of Discrete Control Devices in Active Distribution Systems The frequent actuation of discrete control devices dcds, e.g., on-load tap changers, drastically reduces their lifetime. This, in turn, imposes a huge replacement cost. Simultaneous scheduling of these \textsc{dcd}s and continuous control ...
https://arxiv.org/abs/2001.03730
10.1109/TPWRD.2020.2965110
eess.SY
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03742
2001.03742
Entropy-dissipating finite-difference schemes for nonlinear fourth-order parabolic equations
Entropy-dissipating finite-difference schemes for nonlinear fourth-order parabolic equations Structure-preserving finite-difference schemes for general nonlinear fourth-order parabolic equations on the one-dimensional torus are derived. Examples include the thin-film and the Derrida-Lebowitz-Speer-Spohn equations. The...
https://arxiv.org/abs/2001.03742
null
math.NA
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03757
2001.03757
NOMA Enhanced Terrestrial and Aerial IoT Networks with Partial CSI
NOMA Enhanced Terrestrial and Aerial IoT Networks with Partial CSI This article investigates a non-orthogonal multiple access (NOMA) enhanced Internet of Things (IoT) network. In order to provide connectivity, a novel cluster strategy is proposed, where multiple devices can be served simultaneously. Two potential scen...
https://arxiv.org/abs/2001.03757
null
cs.IT
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03763
2001.03763
Economic Value of Inertia in Low-Carbon Power Systems
Economic Value of Inertia in Low-Carbon Power Systems Most renewable energy sources (RES) do not provide any inertial response. Their integration in a power grid implies a highly reduced level of system inertia, which leads to a deteriorated frequency performance. Then, the requirement for frequency response is signif...
https://arxiv.org/abs/2001.03763
10.1109/ISGTEurope.2017.8260153
eess.SY
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03765
2001.03765
Learning Cross-Context Entity Representations from Text
Learning Cross-Context Entity Representations from Text Language modeling tasks, in which words, or word-pieces, are predicted on the basis of a local context, have been very effective for learning word embeddings and context dependent representations of phrases. Motivated by the observation that efforts to code world...
https://arxiv.org/abs/2001.03765
null
cs.CL
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03779
2001.03779
Unsupervised Enhancement of Real-World Depth Images Using Tri-Cycle GAN
Unsupervised Enhancement of Real-World Depth Images Using Tri-Cycle GAN Low quality depth poses a considerable challenge to computer vision algorithms. In this work we aim to enhance highly degraded, real-world depth images acquired by a low-cost sensor, for which an analytical noise model is unavailable. In the absen...
https://arxiv.org/abs/2001.03779
null
cs.CV
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03782
2001.03782
Optimizing Investments in Cyber Hygiene for Protecting Healthcare Users
Optimizing Investments in Cyber Hygiene for Protecting Healthcare Users Cyber hygiene measures are often recommended for strengthening an organization's security posture, especially for protecting against social engineering attacks that target the human element. However, the related recommendations are typically the s...
https://arxiv.org/abs/2001.03782
null
cs.CR
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03784
2001.03784
List Decoding of Universal Polar Codes
List Decoding of Universal Polar Codes A list decoding scheme for universal polar codes is presented. Our scheme applies to the universal polar codes first introduced by Sasoglu and Wang, and generalized to processes with memory by the authors. These codes are based on the concatenation of different polar transforms: ...
https://arxiv.org/abs/2001.03784
null
cs.IT
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03792
2001.03792
Reward Engineering for Object Pick and Place Training
Reward Engineering for Object Pick and Place Training Robotic grasping is a crucial area of research as it can result in the acceleration of the automation of several Industries utilizing robots ranging from manufacturing to healthcare. Reinforcement learning is the field of study where an agent learns a policy to exe...
https://arxiv.org/abs/2001.03792
null
cs.AI
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03794
2001.03794
Grundy Coloring & friends, Half-Graphs, Bicliques
Grundy Coloring & friends, Half-Graphs, Bicliques The first-fit coloring is a heuristic that assigns to each vertex, arriving in a specified order $σ$, the smallest available color. The problem Grundy Coloring asks how many colors are needed for the most adversarial vertex ordering $σ$, i.e., the maximum number of c...
https://arxiv.org/abs/2001.03794
null
cs.CC
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03801
2001.03801
Dynamic Coronary Roadmapping via Catheter Tip Tracking in X-ray Fluoroscopy with Deep Learning Based Bayesian Filtering
Dynamic Coronary Roadmapping via Catheter Tip Tracking in X-ray Fluoroscopy with Deep Learning Based Bayesian Filtering Percutaneous coronary intervention (PCI) is typically performed with image guidance using X-ray angiograms in which coronary arteries are opacified with X-ray opaque contrast agents. Interventional c...
https://arxiv.org/abs/2001.03801
10.1016/j.media.2020.101634
eess.IV
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03809
2001.03809
Point-Based Methods for Model Checking in Partially Observable Markov Decision Processes
Point-Based Methods for Model Checking in Partially Observable Markov Decision Processes Autonomous systems are often required to operate in partially observable environments. They must reliably execute a specified objective even with incomplete information about the state of the environment. We propose a methodology ...
https://arxiv.org/abs/2001.03809
null
cs.AI
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03810
2001.03810
Secure Decentralized Pliable Index Coding
Secure Decentralized Pliable Index Coding This paper studies a variant of the Pliable Index CODing (PICOD) problem, i.e., an index coding problem where a user can be satisfied by decoding any message that is not in its side information set, where communication is decentralized, i.e., it occurs among users rather than ...
https://arxiv.org/abs/2001.03810
null
cs.IT
2020-01-11T00:00:00+00:00
pre2021
2020-01-11
2,020
0.990689
0.844416
0.995576
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03814
2001.03814
Functional Error Correction for Robust Neural Networks
Functional Error Correction for Robust Neural Networks When neural networks (NeuralNets) are implemented in hardware, their weights need to be stored in memory devices. As noise accumulates in the stored weights, the NeuralNet's performance will degrade. This paper studies how to use error correcting codes (ECCs) to p...
https://arxiv.org/abs/2001.03814
null
cs.IT
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03822
2001.03822
Permissioned Blockchain Revisited: A Byzantine Game-Theoretical Perspective
Permissioned Blockchain Revisited: A Byzantine Game-Theoretical Perspective Despite the popularity and practical applicability of blockchains, there is very limited work on the theoretical foundation of blockchains: The lack of rigorous theory and analysis behind the curtain of blockchains has severely staggered its b...
https://arxiv.org/abs/2001.03822
null
cs.GT
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03829
2001.03829
Deciding the Loosely Guarded Fragment and Querying Its Horn Fragment Using Resolution
Deciding the Loosely Guarded Fragment and Querying Its Horn Fragment Using Resolution We consider the following query answering problem: Given a Boolean conjunctive query and a theory in the Horn loosely guarded fragment, the aim is to determine whether the query is entailed by the theory. In this paper, we present a ...
https://arxiv.org/abs/2001.03829
null
cs.LO
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03830
2001.03830
Revisiting Challenges in Data-to-Text Generation with Fact Grounding
Revisiting Challenges in Data-to-Text Generation with Fact Grounding Data-to-text generation models face challenges in ensuring data fidelity by referring to the correct input source. To inspire studies in this area, Wiseman et al. (2017) introduced the RotoWire corpus on generating NBA game summaries from the box- an...
https://arxiv.org/abs/2001.03830
10.18653/v1/W19-8639
cs.CL
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03831
2001.03831
A Comparative Study for Non-rigid Image Registration and Rigid Image Registration
A Comparative Study for Non-rigid Image Registration and Rigid Image Registration Image registration algorithms can be generally categorized into two groups: non-rigid and rigid. Recently, many deep learning-based algorithms employ a neural net to characterize non-rigid image registration function. However, do they al...
https://arxiv.org/abs/2001.03831
null
cs.CV
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03844
2001.03844
Rethinking Generalization of Neural Models: A Named Entity Recognition Case Study
Rethinking Generalization of Neural Models: A Named Entity Recognition Case Study While neural network-based models have achieved impressive performance on a large body of NLP tasks, the generalization behavior of different models remains poorly understood: Does this excellent performance imply a perfect generalizatio...
https://arxiv.org/abs/2001.03844
null
cs.CL
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03847
2001.03847
Concurrently Extrapolating and Interpolating Networks for Continuous Model Generation
Concurrently Extrapolating and Interpolating Networks for Continuous Model Generation Most deep image smoothing operators are always trained repetitively when different explicit structure-texture pairs are employed as label images for each algorithm configured with different parameters. This kind of training strategy ...
https://arxiv.org/abs/2001.03847
null
cs.CV
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03851
2001.03851
Deep Optimized Multiple Description Image Coding via Scalar Quantization Learning
Deep Optimized Multiple Description Image Coding via Scalar Quantization Learning In this paper, we introduce a deep multiple description coding (MDC) framework optimized by minimizing multiple description (MD) compressive loss. First, MD multi-scale-dilated encoder network generates multiple description tensors, whic...
https://arxiv.org/abs/2001.03851
null
cs.CV
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03855
2001.03855
Hyperparameters optimization for Deep Learning based emotion prediction for Human Robot Interaction
Hyperparameters optimization for Deep Learning based emotion prediction for Human Robot Interaction To enable humanoid robots to share our social space we need to develop technology for easy interaction with the robots using multiple modes such as speech, gestures and share our emotions with them. We have targeted thi...
https://arxiv.org/abs/2001.03855
null
cs.LG
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03857
2001.03857
Robust Brain Magnetic Resonance Image Segmentation for Hydrocephalus Patients: Hard and Soft Attention
Robust Brain Magnetic Resonance Image Segmentation for Hydrocephalus Patients: Hard and Soft Attention Brain magnetic resonance (MR) segmentation for hydrocephalus patients is considered as a challenging work. Encoding the variation of the brain anatomical structures from different individuals cannot be easily achieve...
https://arxiv.org/abs/2001.03857
null
eess.IV
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03864
2001.03864
Learning to drive via Apprenticeship Learning and Deep Reinforcement Learning
Learning to drive via Apprenticeship Learning and Deep Reinforcement Learning With the implementation of reinforcement learning (RL) algorithms, current state-of-art autonomous vehicle technology have the potential to get closer to full automation. However, most of the applications have been limited to game domains or...
https://arxiv.org/abs/2001.03864
null
cs.RO
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03869
2001.03869
Finite-Sample Analysis of Image Registration
Finite-Sample Analysis of Image Registration We study the problem of image registration in the finite-resolution regime and characterize the error probability of algorithms as a function of properties of the transformation and the image capture noise. Specifically, we define a channel-aware Feinstein decoder to obtain...
https://arxiv.org/abs/2001.03869
null
cs.IT
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03872
2001.03872
Attribute-guided Feature Learning Network for Vehicle Re-identification
Attribute-guided Feature Learning Network for Vehicle Re-identification Vehicle re-identification (reID) plays an important role in the automatic analysis of the increasing urban surveillance videos, which has become a hot topic in recent years. However, it poses the critical but challenging problem that is caused by ...
https://arxiv.org/abs/2001.03872
null
cs.CV
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03877
2001.03877
Deep Reinforcement Learning for Complex Manipulation Tasks with Sparse Feedback
Deep Reinforcement Learning for Complex Manipulation Tasks with Sparse Feedback Learning optimal policies from sparse feedback is a known challenge in reinforcement learning. Hindsight Experience Replay (HER) is a multi-goal reinforcement learning algorithm that comes to solve such tasks. The algorithm treats every fa...
https://arxiv.org/abs/2001.03877
null
cs.LG
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:2001.03886
2001.03886
Multi-source Domain Adaptation for Visual Sentiment Classification
Multi-source Domain Adaptation for Visual Sentiment Classification Existing domain adaptation methods on visual sentiment classification typically are investigated under the single-source scenario, where the knowledge learned from a source domain of sufficient labeled data is transferred to the target domain of loosel...
https://arxiv.org/abs/2001.03886
null
cs.CV
2020-01-12T00:00:00+00:00
pre2021
2020-01-12
2,020
0.990672
0.844389
0.995573
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-12, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1205.3380
1205.3380
Unfair items detection in educational measurement
Unfair items detection in educational measurement Measurement professionals cannot come to an agreement on the definition of the term 'item fairness'. In this paper a continuous measure of item unfairness is proposed. The more the unfairness measure deviates from zero, the less fair the item is. If the measure exceeds...
https://arxiv.org/abs/1205.3380
null
cs.AI
2012-02-11T00:00:00+00:00
pre2021
2012-02-11
2,012
0.995331
0.85174
0.996548
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2012-02-11, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.4% of ...
true
arxiv:1308.6198
1308.6198
PDA: Semantically Secure Time-Series Data Analytics with Dynamic Subgroups
PDA: Semantically Secure Time-Series Data Analytics with Dynamic Subgroups Third-party analysis on private records is becoming increasingly important due to the widespread data collection for various analysis purposes. However, the data in its original form often contains sensitive information about individuals, and i...
https://arxiv.org/abs/1308.6198
10.1109/TDSC.2016.2577034
cs.CR
2015-09-25T00:00:00+00:00
pre2021
2015-09-25
2,015
0.995317
0.851718
0.996545
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2015-09-25, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.4% of ...
true
arxiv:1602.01969
1602.01969
Voltage stress minimization by optimal reactive power control
Voltage stress minimization by optimal reactive power control A standard operational requirement in power systems is that the voltage magnitudes lie within prespecified bounds. Conventional engineering wisdom suggests that such a tightly-regulated profile, imposed for system design purposes and good operation of the n...
https://arxiv.org/abs/1602.01969
10.1109/TCNS.2017.2722818
math.OC
2016-02-05T00:00:00+00:00
pre2021
2016-02-05
2,016
0.995308
0.851704
0.996543
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2016-02-05, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.4% of ...
true
arxiv:1603.02238
1603.02238
On higher order computations, rewiring the connectome, and non-von Neumann computer architecture
On higher order computations, rewiring the connectome, and non-von Neumann computer architecture Structural plasticity in the brain (i.e. rewiring the connectome) may be viewed as mechanisms for dynamic reconfiguration of neural circuits. First order computations in the brain are done by static neural circuits, wherea...
https://arxiv.org/abs/1603.02238
null
cs.NE
2020-10-03T00:00:00+00:00
pre2021
2020-10-03
2,020
0.983159
0.832891
0.993769
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-03, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1608.08472
1608.08472
ALLSAT compressed with wildcards: From CNF's to orthogonal DNF's by imposing the clauses one by one
ALLSAT compressed with wildcards: From CNF's to orthogonal DNF's by imposing the clauses one by one We present a novel technique for converting a Boolean CNF into an orthogonal DNF, aka exclusive sum of products. Our method (which will be pitted against a hardwired command from Mathematica) zooms in on the models of t...
https://arxiv.org/abs/1608.08472
null
cs.AI
2020-10-03T00:00:00+00:00
pre2021
2020-10-03
2,020
0.983159
0.832891
0.993769
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-03, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1610.04022
1610.04022
Bounds for elimination of unknowns in systems of differential-algebraic equations
Bounds for elimination of unknowns in systems of differential-algebraic equations Elimination of unknowns in systems of equations, starting with Gaussian elimination, is a problem of general interest. The problem of finding an a priori upper bound for the number of differentiations in elimination of unknowns in a syst...
https://arxiv.org/abs/1610.04022
null
math.AC
2020-10-05T00:00:00+00:00
pre2021
2020-10-05
2,020
0.983072
0.832759
0.993746
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-05, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1611.02966
1611.02966
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals For an undirected edge-weighted graph $G$ and a set $R$ of pairs of vertices called pairs of terminals, a multicut is a set of edges such that removing these edges from $G$ disconnects each pair in $R$. We provide an a...
https://arxiv.org/abs/1611.02966
null
cs.DS
2020-10-05T00:00:00+00:00
pre2021
2020-10-05
2,020
0.983072
0.832759
0.993746
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-05, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1611.05134
1611.05134
Cost-Sensitive Deep Learning with Layer-Wise Cost Estimation
Cost-Sensitive Deep Learning with Layer-Wise Cost Estimation While deep neural networks have succeeded in several visual applications, such as object recognition, detection, and localization, by reaching very high classification accuracies, it is important to note that many real-world applications demand varying costs...
https://arxiv.org/abs/1611.05134
null
cs.CV
2020-10-03T00:00:00+00:00
pre2021
2020-10-03
2,020
0.983159
0.832891
0.993769
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-03, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1702.00150
1702.00150
Visibility of minorities in social networks
Visibility of minorities in social networks Homophily can put minority groups at a disadvantage by restricting their ability to establish links with people from a majority group. This can limit the overall visibility of minorities in the network. Building on a Barabási-Albert model variation with groups and homophily...
https://arxiv.org/abs/1702.00150
10.1038/s41598-018-29405-7
physics.soc-ph
2017-02-01T00:00:00+00:00
pre2021
2017-02-01
2,017
0.995243
0.8516
0.99653
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2017-02-01, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.4% of ...
true
arxiv:1705.01485
1705.01485
Efficient Spatio-Temporal Gaussian Regression via Kalman Filtering
Efficient Spatio-Temporal Gaussian Regression via Kalman Filtering In this work we study the non-parametric reconstruction of spatio-temporal dynamical Gaussian processes (GPs) via GP regression from sparse and noisy data. GPs have been mainly applied to spatial regression where they represent one of the most powerful...
https://arxiv.org/abs/1705.01485
10.1016/j.automatica.2020.109032
cs.LG
2017-05-03T00:00:00+00:00
pre2021
2017-05-03
2,017
0.995208
0.851543
0.996523
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2017-05-03, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.4% of ...
true
arxiv:1710.10829
1710.10829
Generalized gradient optimization over lossy networks for partition-based estimation
Generalized gradient optimization over lossy networks for partition-based estimation We address the problem of distributed convex unconstrained optimization over networks characterized by asynchronous and possibly lossy communications. We analyze the case where the global cost function is the sum of locally coupled lo...
https://arxiv.org/abs/1710.10829
10.1016/j.automatica.2019.108648
math.OC
2017-10-30T00:00:00+00:00
pre2021
2017-10-30
2,017
0.995091
0.851356
0.9965
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2017-10-30, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.4% of ...
true
arxiv:1711.10241
1711.10241
The Price of Quota-based Diversity in Assignment Problems
The Price of Quota-based Diversity in Assignment Problems We introduce and analyze an extension to the matching problem on a weighted bipartite graph: Assignment with Type Constraints. The two parts of the graph are partitioned into subsets called types and blocks; we seek a matching with the largest sum of weights un...
https://arxiv.org/abs/1711.10241
10.1145/3411513
cs.AI
2020-10-03T00:00:00+00:00
pre2021
2020-10-03
2,020
0.983159
0.832891
0.993769
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-03, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1804.08778
1804.08778
Query-Efficient Black-Box Attack Against Sequence-Based Malware Classifiers
Query-Efficient Black-Box Attack Against Sequence-Based Malware Classifiers In this paper, we present a generic, query-efficient black-box attack against API call-based machine learning malware classifiers. We generate adversarial examples by modifying the malware's API call sequences and non-sequential features (prin...
https://arxiv.org/abs/1804.08778
null
cs.CR
2020-10-03T00:00:00+00:00
pre2021
2020-10-03
2,020
0.983159
0.832891
0.993769
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-03, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1804.11149
1804.11149
Q-Map: Clinical Concept Mining from Clinical Documents
Q-Map: Clinical Concept Mining from Clinical Documents Over the past decade, there has been a steep rise in the data-driven analysis in major areas of medicine, such as clinical decision support system, survival analysis, patient similarity analysis, image analytics etc. Most of the data in the field are well-structur...
https://arxiv.org/abs/1804.11149
10.5281/zenodo.1474513
cs.IR
2018-07-16T00:00:00+00:00
pre2021
2018-07-16
2,018
0.994705
0.850741
0.996423
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2018-07-16, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.5% of ...
true
arxiv:1806.11038
1806.11038
Neural Network Cognitive Engine for Autonomous and Distributed Underlay Dynamic Spectrum Access
Neural Network Cognitive Engine for Autonomous and Distributed Underlay Dynamic Spectrum Access Two key challenges in underlay dynamic spectrum access (DSA) are how to establish an interference limit from the primary network (PN) and how cognitive radios (CRs) in the secondary network (SN) become aware of the interfer...
https://arxiv.org/abs/1806.11038
null
cs.NI
2020-10-05T00:00:00+00:00
pre2021
2020-10-05
2,020
0.983072
0.832759
0.993746
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-05, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1807.01098
1807.01098
Multi-Source Multi-Sink Nash Flows Over Time
Multi-Source Multi-Sink Nash Flows Over Time Nash flows over time describe the behavior of selfish users eager to reach their destination as early as possible while traveling along the arcs of a network with capacities and transit times. Throughout the past decade, they have been thoroughly studied in single-source si...
https://arxiv.org/abs/1807.01098
null
cs.GT
2020-10-05T00:00:00+00:00
pre2021
2020-10-05
2,020
0.983072
0.832759
0.993746
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-05, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1807.05862
1807.05862
Nash Flows over Time with Spillback and Kinematic Waves
Nash Flows over Time with Spillback and Kinematic Waves Modeling traffic in road networks is a widely studied but challenging problem, especially under the assumption that drivers act selfishly. A common approach is the deterministic queuing model, for which the structure of dynamic equilibria has been studied extensi...
https://arxiv.org/abs/1807.05862
null
cs.GT
2020-10-05T00:00:00+00:00
pre2021
2020-10-05
2,020
0.983072
0.832759
0.993746
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-05, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1810.11514
1810.11514
Learning and Interpreting Multi-Multi-Instance Learning Networks
Learning and Interpreting Multi-Multi-Instance Learning Networks We introduce an extension of the multi-instance learning problem where examples are organized as nested bags of instances (e.g., a document could be represented as a bag of sentences, which in turn are bags of words). This framework can be useful in vari...
https://arxiv.org/abs/1810.11514
null
cs.LG
2020-10-03T00:00:00+00:00
pre2021
2020-10-03
2,020
0.983159
0.832891
0.993769
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-03, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1811.01399
1811.01399
Logic Attention Based Neighborhood Aggregation for Inductive Knowledge Graph Embedding
Logic Attention Based Neighborhood Aggregation for Inductive Knowledge Graph Embedding Knowledge graph embedding aims at modeling entities and relations with low-dimensional vectors. Most previous methods require that all entities should be seen during training, which is unpractical for real-world knowledge graphs wit...
https://arxiv.org/abs/1811.01399
null
cs.AI
2020-10-04T00:00:00+00:00
pre2021
2020-10-04
2,020
0.983115
0.832825
0.993757
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-04, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1811.12547
1811.12547
The inverse Voronoi problem in graphs
The inverse Voronoi problem in graphs We introduce the inverse Voronoi diagram problem in graphs: given a graph $G$ with positive edge-lengths and a collection $\mathbb{U}$ of subsets of vertices of $V(G)$, decide whether $\mathbb{U}$ is a Voronoi diagram in $G$ with respect to the shortest-path metric. We show that t...
https://arxiv.org/abs/1811.12547
null
cs.DS
2020-10-03T00:00:00+00:00
pre2021
2020-10-03
2,020
0.983159
0.832891
0.993769
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-03, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1812.05980
1812.05980
Probabilistic Class-Specific Discriminant Analysis
Probabilistic Class-Specific Discriminant Analysis In this paper we formulate a probabilistic model for class-specific discriminant subspace learning. The proposed model can naturally incorporate the multi-modal structure of the negative class, which is neglected by existing class-specific methods. Moreover, it can be...
https://arxiv.org/abs/1812.05980
null
cs.LG
2020-10-05T00:00:00+00:00
pre2021
2020-10-05
2,020
0.983072
0.832759
0.993746
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-05, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1901.02364
1901.02364
Optimization of Solidification in Die Casting using Numerical Simulations and Machine Learning
Optimization of Solidification in Die Casting using Numerical Simulations and Machine Learning In this paper, we demonstrate the combination of machine learning and three dimensional numerical simulations for multi-objective optimization of low pressure die casting. The cooling of molten metal inside the mold is achie...
https://arxiv.org/abs/1901.02364
10.1016/j.jmapro.2020.01.016
cs.CE
2020-01-03T00:00:00+00:00
pre2021
2020-01-03
2,020
0.990822
0.844624
0.995606
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-01-03, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.9% of ...
true
arxiv:1901.11437
1901.11437
Successor Features Combine Elements of Model-Free and Model-based Reinforcement Learning
Successor Features Combine Elements of Model-Free and Model-based Reinforcement Learning A key question in reinforcement learning is how an intelligent agent can generalize knowledge across different inputs. By generalizing across different inputs, information learned for one input can be immediately reused for improv...
https://arxiv.org/abs/1901.11437
null
cs.LG
2020-10-04T00:00:00+00:00
pre2021
2020-10-04
2,020
0.983115
0.832825
0.993757
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-04, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1902.03387
1902.03387
Performance Modeling of Microservice Platforms
Performance Modeling of Microservice Platforms Microservice architecture has transformed the way developers are building and deploying applications in the nowadays cloud computing centers. This new approach provides increased scalability, flexibility, manageability, and performance while reducing the complexity of the...
https://arxiv.org/abs/1902.03387
null
cs.DC
2020-10-03T00:00:00+00:00
pre2021
2020-10-03
2,020
0.983159
0.832891
0.993769
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-03, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1903.00699
1903.00699
Selective Exposure shapes the Facebook News Diet
Selective Exposure shapes the Facebook News Diet The social brain hypothesis fixes to 150 the number of social relationships we are able to maintain. Similar cognitive constraints emerge in several aspects of our daily life, from our mobility up to the way we communicate, and might even affect the way we consume infor...
https://arxiv.org/abs/1903.00699
10.1371/journal.pone.0229129
cs.SI
2019-03-02T00:00:00+00:00
pre2021
2019-03-02
2,019
0.993873
0.849419
0.996255
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2019-03-02, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.5% of ...
true
arxiv:1904.02291
1904.02291
Finite-Sample Concentration of the Multinomial in Relative Entropy
Finite-Sample Concentration of the Multinomial in Relative Entropy We show that the moment generating function of the Kullback-Leibler divergence (relative entropy) between the empirical distribution of $n$ independent samples from a distribution $P$ over a finite alphabet of size $k$ (i.e. a multinomial distribution)...
https://arxiv.org/abs/1904.02291
10.1109/TIT.2020.2996134
cs.IT
2020-10-05T00:00:00+00:00
pre2021
2020-10-05
2,020
0.983072
0.832759
0.993746
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-05, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1904.02951
1904.02951
Unavoidable minors for graphs with large $\ell_p$-dimension
Unavoidable minors for graphs with large $\ell_p$-dimension A metric graph is a pair $(G,d)$, where $G$ is a graph and $d:E(G) \to\mathbb{R}_{\geq0}$ is a distance function. Let $p \in [1,\infty]$ be fixed. An isometric embedding of the metric graph $(G,d)$ in $\ell_p^k = (\mathbb{R}^k, d_p)$ is a map $ϕ: V(G) \to \m...
https://arxiv.org/abs/1904.02951
null
math.CO
2020-10-05T00:00:00+00:00
pre2021
2020-10-05
2,020
0.983072
0.832759
0.993746
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-05, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1904.04755
1904.04755
Hypothesis Set Stability and Generalization
Hypothesis Set Stability and Generalization We present a study of generalization for data-dependent hypothesis sets. We give a general learning guarantee for data-dependent hypothesis sets based on a notion of transductive Rademacher complexity. Our main result is a generalization bound for data-dependent hypothesis s...
https://arxiv.org/abs/1904.04755
null
cs.LG
2020-10-05T00:00:00+00:00
pre2021
2020-10-05
2,020
0.983072
0.832759
0.993746
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-05, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1905.06458
1905.06458
Relaxed 2-D Principal Component Analysis by $L_p$ Norm for Face Recognition
Relaxed 2-D Principal Component Analysis by $L_p$ Norm for Face Recognition A relaxed two dimensional principal component analysis (R2DPCA) approach is proposed for face recognition. Different to the 2DPCA, 2DPCA-$L_1$ and G2DPCA, the R2DPCA utilizes the label information (if known) of training samples to calculate a ...
https://arxiv.org/abs/1905.06458
10.1007/978-3-030-26763-6_19
cs.CV
2019-05-15T00:00:00+00:00
pre2021
2019-05-15
2,019
0.993415
0.848696
0.996161
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2019-05-15, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~0.6% of ...
true
arxiv:1905.10630
1905.10630
Stochastic Shared Embeddings: Data-driven Regularization of Embedding Layers
Stochastic Shared Embeddings: Data-driven Regularization of Embedding Layers In deep neural nets, lower level embedding layers account for a large portion of the total number of parameters. Tikhonov regularization, graph-based regularization, and hard parameter sharing are approaches that introduce explicit biases int...
https://arxiv.org/abs/1905.10630
null
cs.LG
2020-10-03T00:00:00+00:00
pre2021
2020-10-03
2,020
0.983159
0.832891
0.993769
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-03, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1905.11079
1905.11079
Learning to Discretize: Solving 1D Scalar Conservation Laws via Deep Reinforcement Learning
Learning to Discretize: Solving 1D Scalar Conservation Laws via Deep Reinforcement Learning Conservation laws are considered to be fundamental laws of nature. It has broad applications in many fields, including physics, chemistry, biology, geology, and engineering. Solving the differential equations associated with co...
https://arxiv.org/abs/1905.11079
null
cs.LG
2020-10-05T00:00:00+00:00
pre2021
2020-10-05
2,020
0.983072
0.832759
0.993746
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-05, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1905.11233
1905.11233
Derivative Manipulation for General Example Weighting
Derivative Manipulation for General Example Weighting Real-world large-scale datasets usually contain noisy labels and are imbalanced. Therefore, we propose derivative manipulation (DM), a novel and general example weighting approach for training robust deep models under these adverse conditions. DM has two main merit...
https://arxiv.org/abs/1905.11233
null
cs.LG
2020-10-03T00:00:00+00:00
pre2021
2020-10-03
2,020
0.983159
0.832891
0.993769
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-03, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true
arxiv:1905.11368
1905.11368
Simple and Effective Regularization Methods for Training on Noisily Labeled Data with Generalization Guarantee
Simple and Effective Regularization Methods for Training on Noisily Labeled Data with Generalization Guarantee Over-parameterized deep neural networks trained by simple first-order methods are known to be able to fit any labeling of data. Such over-fitting ability hinders generalization when mislabeled training exampl...
https://arxiv.org/abs/1905.11368
null
cs.LG
2020-10-02T00:00:00+00:00
pre2021
2020-10-02
2,020
0.983203
0.832957
0.99378
false
1
6.5026
[ "single_operator" ]
null
Existence bound: content existed on or before 2020-10-02, witnessed by 1 independent operator(s) (arxiv-cornell). Flag [low] single_operator: bound rests on a single operator (arxiv-cornell); compromising it would be sufficient to move the date Under the configured prevalence curve, machine-generated text was ~1.6% of ...
true