paper_url
stringlengths
35
81
arxiv_id
stringlengths
6
35
nips_id
null
openreview_id
stringlengths
9
93
title
stringlengths
1
1.02k
abstract
stringlengths
0
56.5k
short_abstract
stringlengths
0
1.95k
url_abs
stringlengths
16
996
url_pdf
stringlengths
16
996
proceeding
stringlengths
7
1.03k
authors
listlengths
0
3.31k
tasks
listlengths
0
147
date
timestamp[ns]date
1951-09-01 00:00:00
2222-12-22 00:00:00
conference_url_abs
stringlengths
16
199
conference_url_pdf
stringlengths
21
200
conference
stringlengths
2
47
reproduces_paper
stringclasses
22 values
methods
listlengths
0
7.5k
https://paperswithcode.com/paper/dynamic-network-model-from-partial
1805.10616
null
null
Dynamic Network Model from Partial Observations
Can evolving networks be inferred and modeled without directly observing their nodes and edges? In many applications, the edges of a dynamic network might not be observed, but one can observe the dynamics of stochastic cascading processes (e.g., information diffusion, virus propagation) occurring over the unobserved ne...
null
http://arxiv.org/abs/1805.10616v4
http://arxiv.org/pdf/1805.10616v4.pdf
NeurIPS 2018 12
[ "Elahe Ghalebi", "Baharan Mirzasoleiman", "Radu Grosu", "Jure Leskovec" ]
[ "model", "Open-Ended Question Answering" ]
2018-05-27T00:00:00
http://papers.nips.cc/paper/8192-dynamic-network-model-from-partial-observations
http://papers.nips.cc/paper/8192-dynamic-network-model-from-partial-observations.pdf
dynamic-network-model-from-partial-1
null
[ { "code_snippet_url": null, "description": "Please enter a description about the method here", "full_name": "ooJpiued", "introduced_year": 2000, "main_collection": { "area": "Natural Language Processing", "description": "**Language Models** are models for predicting the next word or ...
https://paperswithcode.com/paper/pac-bayes-bounds-for-stable-algorithms-with
1806.06827
null
null
PAC-Bayes bounds for stable algorithms with instance-dependent priors
PAC-Bayes bounds have been proposed to get risk estimates based on a training sample. In this paper the PAC-Bayes approach is combined with stability of the hypothesis learned by a Hilbert space valued algorithm. The PAC-Bayes setting is used with a Gaussian prior centered at the expected output. Thus a novelty of our ...
null
http://arxiv.org/abs/1806.06827v2
http://arxiv.org/pdf/1806.06827v2.pdf
NeurIPS 2018 12
[ "Omar Rivasplata", "Emilio Parrado-Hernandez", "John Shawe-Taylor", "Shiliang Sun", "Csaba Szepesvari" ]
[]
2018-06-18T00:00:00
http://papers.nips.cc/paper/8134-pac-bayes-bounds-for-stable-algorithms-with-instance-dependent-priors
http://papers.nips.cc/paper/8134-pac-bayes-bounds-for-stable-algorithms-with-instance-dependent-priors.pdf
pac-bayes-bounds-for-stable-algorithms-with-1
null
[ { "code_snippet_url": "", "description": "A **Support Vector Machine**, or **SVM**, is a non-parametric supervised learning model. For non-linear classification and regression, they utilise the kernel trick to map inputs to high-dimensional feature spaces. SVMs construct a hyper-plane or set of hyper-planes...
https://paperswithcode.com/paper/automated-bridge-component-recognition-using
1806.06820
null
null
Automated Bridge Component Recognition using Video Data
This paper investigates the automated recognition of structural bridge components using video data. Although understanding video data for structural inspections is straightforward for human inspectors, the implementation of the same task using machine learning methods has not been fully realized. In particular, single-...
null
http://arxiv.org/abs/1806.06820v2
http://arxiv.org/pdf/1806.06820v2.pdf
null
[ "Yasutaka Narazaki", "Vedhus Hoskere", "Tu A. Hoang", "Billie F. Spencer Jr" ]
[ "BIG-bench Machine Learning" ]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/gradient-descent-with-identity-initialization-1
1802.06093
null
null
Gradient descent with identity initialization efficiently learns positive definite linear transformations by deep residual networks
We analyze algorithms for approximating a function $f(x) = \Phi x$ mapping $\Re^d$ to $\Re^d$ using deep linear neural networks, i.e. that learn a function $h$ parameterized by matrices $\Theta_1,...,\Theta_L$ and defined by $h(x) = \Theta_L \Theta_{L-1} ... \Theta_1 x$. We focus on algorithms that learn through gradie...
null
http://arxiv.org/abs/1802.06093v4
http://arxiv.org/pdf/1802.06093v4.pdf
ICML 2018
[ "Peter L. Bartlett", "David P. Helmbold", "Philip M. Long" ]
[]
2018-02-16T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/temporal-coherence-based-self-supervised
1806.06811
null
null
Temporal coherence-based self-supervised learning for laparoscopic workflow analysis
In order to provide the right type of assistance at the right time, computer-assisted surgery systems need context awareness. To achieve this, methods for surgical workflow analysis are crucial. Currently, convolutional neural networks provide the best performance for video-based workflow analysis tasks. For training s...
To achieve this, methods for surgical workflow analysis are crucial.
http://arxiv.org/abs/1806.06811v2
http://arxiv.org/pdf/1806.06811v2.pdf
null
[ "Isabel Funke", "Alexander Jenke", "Sören Torge Mees", "Jürgen Weitz", "Stefanie Speidel", "Sebastian Bodenstedt" ]
[ "Self-Supervised Learning", "Surgical phase recognition" ]
2018-06-18T00:00:00
null
null
null
null
[ { "code_snippet_url": null, "description": "", "full_name": null, "introduced_year": 2000, "main_collection": { "area": "Graphs", "description": "", "name": "Graph Representation Learning", "parent": null }, "name": "Contrastive Learning", "source_title": null...
https://paperswithcode.com/paper/better-runtime-guarantees-via-stochastic
1801.04487
null
null
Better Runtime Guarantees Via Stochastic Domination
Apart from few exceptions, the mathematical runtime analysis of evolutionary algorithms is mostly concerned with expected runtimes. In this work, we argue that stochastic domination is a notion that should be used more frequently in this area. Stochastic domination allows to formulate much more informative performance ...
null
http://arxiv.org/abs/1801.04487v5
http://arxiv.org/pdf/1801.04487v5.pdf
null
[ "Benjamin Doerr" ]
[ "Evolutionary Algorithms" ]
2018-01-13T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/scaling-neural-machine-translation
1806.00187
null
null
Scaling Neural Machine Translation
Sequence to sequence learning models still require several days to reach state of the art performance on large benchmark datasets using a single machine. This paper shows that reduced precision and large batch training can speedup training by nearly 5x on a single 8-GPU machine with careful tuning and implementation. O...
Sequence to sequence learning models still require several days to reach state of the art performance on large benchmark datasets using a single machine.
http://arxiv.org/abs/1806.00187v3
http://arxiv.org/pdf/1806.00187v3.pdf
WS 2018 10
[ "Myle Ott", "Sergey Edunov", "David Grangier", "Michael Auli" ]
[ "GPU", "Machine Translation", "Question Answering", "Translation" ]
2018-06-01T00:00:00
https://aclanthology.org/W18-6301
https://aclanthology.org/W18-6301.pdf
scaling-neural-machine-translation-1
null
[]
https://paperswithcode.com/paper/almost-exact-matching-with-replacement-for
1806.06802
null
null
Interpretable Almost Matching Exactly for Causal Inference
We aim to create the highest possible quality of treatment-control matches for categorical data in the potential outcomes framework. Matching methods are heavily used in the social sciences due to their interpretability, but most matching methods do not pass basic sanity checks: they fail when irrelevant variables are ...
Notable advantages of our method over existing matching procedures are its high-quality matches, versatility in handling different data distributions that may have irrelevant variables, and ability to handle missing data by matching on as many available covariates as possible.
https://arxiv.org/abs/1806.06802v6
https://arxiv.org/pdf/1806.06802v6.pdf
null
[ "Yameng Liu", "Aw Dieng", "Sudeepa Roy", "Cynthia Rudin", "Alexander Volfovsky" ]
[ "Causal Inference" ]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/deep-spatiotemporal-representation-of-the
1806.06793
null
null
Deep Spatiotemporal Representation of the Face for Automatic Pain Intensity Estimation
Automatic pain intensity assessment has a high value in disease diagnosis applications. Inspired by the fact that many diseases and brain disorders can interrupt normal facial expression formation, we aim to develop a computational model for automatic pain intensity assessment from spontaneous and micro facial variatio...
null
http://arxiv.org/abs/1806.06793v1
http://arxiv.org/pdf/1806.06793v1.pdf
null
[ "Mohammad Tavakolian", "Abdenour Hadid" ]
[]
2018-06-18T00:00:00
null
null
null
null
[ { "code_snippet_url": "https://github.com/pytorch/pytorch/blob/73642d9425a358b51a683cf6f95852d06cba1096/torch/nn/modules/conv.py#L421", "description": "A **3D Convolution** is a type of [convolution](https://paperswithcode.com/method/convolution) where the kernel slides in 3 dimensions as opposed to 2 dimen...
https://paperswithcode.com/paper/flexible-collaborative-estimation-of-the
1806.06784
null
null
Robust inference on the average treatment effect using the outcome highly adaptive lasso
Many estimators of the average effect of a treatment on an outcome require estimation of the propensity score, the outcome regression, or both. It is often beneficial to utilize flexible techniques such as semiparametric regression or machine learning to estimate these quantities. However, optimal estimation of these r...
null
https://arxiv.org/abs/1806.06784v3
https://arxiv.org/pdf/1806.06784v3.pdf
null
[ "Cheng Ju", "David Benkeser", "Mark J. Van Der Laan" ]
[ "regression" ]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/consistent-individualized-feature-attribution
1802.03888
null
null
Consistent Individualized Feature Attribution for Tree Ensembles
A unified approach to explain the output of any machine learning model.
A unified approach to explain the output of any machine learning model.
http://arxiv.org/abs/1802.03888v3
http://arxiv.org/pdf/1802.03888v3.pdf
null
[ "Scott M. Lundberg", "Gabriel G. Erion", "Su-In Lee" ]
[ "BIG-bench Machine Learning" ]
2018-02-12T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/bingan-learning-compact-binary-descriptors
1806.06778
null
null
BinGAN: Learning Compact Binary Descriptors with a Regularized GAN
In this paper, we propose a novel regularization method for Generative Adversarial Networks, which allows the model to learn discriminative yet compact binary representations of image patches (image descriptors). We employ the dimensionality reduction that takes place in the intermediate layers of the discriminator net...
In this paper, we propose a novel regularization method for Generative Adversarial Networks, which allows the model to learn discriminative yet compact binary representations of image patches (image descriptors).
http://arxiv.org/abs/1806.06778v5
http://arxiv.org/pdf/1806.06778v5.pdf
NeurIPS 2018 12
[ "Maciej Zieba", "Piotr Semberecki", "Tarek El-Gaaly", "Tomasz Trzcinski" ]
[ "Dimensionality Reduction", "Retrieval" ]
2018-06-18T00:00:00
http://papers.nips.cc/paper/7619-bingan-learning-compact-binary-descriptors-with-a-regularized-gan
http://papers.nips.cc/paper/7619-bingan-learning-compact-binary-descriptors-with-a-regularized-gan.pdf
bingan-learning-compact-binary-descriptors-1
null
[ { "code_snippet_url": null, "description": "Need help with a Lufthansa Airlines reservation, cancellation, or flight change? Speaking directly with a live Lufthansa agent at ☎️1→(855)*(200)→(2631) [US/OTA] (Live Person) who can save your time, eliminate confusion, and ensure your travel needs are met quickl...
https://paperswithcode.com/paper/multifit-a-multivariate-multiscale-framework
1806.06777
null
null
Multiscale Fisher's Independence Test for Multivariate Dependence
Identifying dependency in multivariate data is a common inference task that arises in numerous applications. However, existing nonparametric independence tests typically require computation that scales at least quadratically with the sample size, making it difficult to apply them to massive data. Moreover, resampling i...
Identifying dependency in multivariate data is a common inference task that arises in numerous applications.
https://arxiv.org/abs/1806.06777v7
https://arxiv.org/pdf/1806.06777v7.pdf
null
[ "Shai Gorsky", "Li Ma" ]
[]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/kernel-based-outlier-detection-using-the
1806.06775
null
null
Kernel-based Outlier Detection using the Inverse Christoffel Function
Outlier detection methods have become increasingly relevant in recent years due to increased security concerns and because of its vast application to different fields. Recently, Pauwels and Lasserre (2016) noticed that the sublevel sets of the inverse Christoffel function accurately depict the shape of a cloud of data ...
null
http://arxiv.org/abs/1806.06775v1
http://arxiv.org/pdf/1806.06775v1.pdf
null
[ "Armin Askari", "Forest Yang", "Laurent El Ghaoui" ]
[ "Outlier Detection" ]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/kid-net-convolution-networks-for-kidney
1806.06769
null
null
Kid-Net: Convolution Networks for Kidney Vessels Segmentation from CT-Volumes
Semantic image segmentation plays an important role in modeling patient-specific anatomy. We propose a convolution neural network, called Kid-Net, along with a training schema to segment kidney vessels: artery, vein and collecting system. Such segmentation is vital during the surgical planning phase in which medical de...
null
http://arxiv.org/abs/1806.06769v1
http://arxiv.org/pdf/1806.06769v1.pdf
null
[ "Ahmed Taha", "Pechin Lo", "Junning Li", "Tao Zhao" ]
[ "Anatomy", "Image Segmentation", "Segmentation", "Semantic Segmentation" ]
2018-06-18T00:00:00
null
null
null
null
[ { "code_snippet_url": "", "description": "A **convolution** is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the part of the input it is on, then summing the results into an output.\r\n\r\nIntuitively, a...
https://paperswithcode.com/paper/modularity-matters-learning-invariant
1806.06765
null
null
Modularity Matters: Learning Invariant Relational Reasoning Tasks
We focus on two supervised visual reasoning tasks whose labels encode a semantic relational rule between two or more objects in an image: the MNIST Parity task and the colorized Pentomino task. The objects in the images undergo random translation, scaling, rotation and coloring transformations. Thus these tasks involve...
null
http://arxiv.org/abs/1806.06765v1
http://arxiv.org/pdf/1806.06765v1.pdf
null
[ "Jason Jo", "Vikas Verma", "Yoshua Bengio" ]
[ "Mixture-of-Experts", "Relational Reasoning", "Visual Reasoning" ]
2018-06-18T00:00:00
null
null
null
null
[ { "code_snippet_url": "", "description": "**Average Pooling** is a pooling operation that calculates the average value for patches of a feature map, and uses it to create a downsampled (pooled) feature map. It is usually used after a convolutional layer. It adds a small amount of translation invariance - me...
https://paperswithcode.com/paper/closing-the-generalization-gap-of-adaptive
1806.06763
null
null
Closing the Generalization Gap of Adaptive Gradient Methods in Training Deep Neural Networks
Adaptive gradient methods, which adopt historical gradient information to automatically adjust the learning rate, despite the nice property of fast convergence, have been observed to generalize worse than stochastic gradient descent (SGD) with momentum in training deep neural networks. This leaves how to close the gene...
Experiments on standard benchmarks show that our proposed algorithm can maintain a fast convergence rate as Adam/Amsgrad while generalizing as well as SGD in training deep neural networks.
https://arxiv.org/abs/1806.06763v3
https://arxiv.org/pdf/1806.06763v3.pdf
null
[ "Jinghui Chen", "Dongruo Zhou", "Yiqi Tang", "Ziyan Yang", "Yuan Cao", "Quanquan Gu" ]
[]
2018-06-18T00:00:00
null
null
null
null
[ { "code_snippet_url": "https://github.com/paultsw/nice_pytorch/blob/15cfc543fc3dc81ee70398b8dfc37b67269ede95/nice/layers.py#L109", "description": "**Affine Coupling** is a method for implementing a normalizing flow (where we stack a sequence of invertible bijective transformation functions). Affine coupling...
https://paperswithcode.com/paper/a-memory-network-approach-for-story-based
1805.02838
null
null
A Memory Network Approach for Story-based Temporal Summarization of 360° Videos
We address the problem of story-based temporal summarization of long 360{\deg} videos. We propose a novel memory network model named Past-Future Memory Network (PFMN), in which we first compute the scores of 81 normal field of view (NFOV) region proposals cropped from the input 360{\deg} video, and then recover a laten...
null
http://arxiv.org/abs/1805.02838v3
http://arxiv.org/pdf/1805.02838v3.pdf
CVPR 2018
[ "Sang-ho Lee", "Jinyoung Sung", "Youngjae Yu", "Gunhee Kim" ]
[ "Video Summarization" ]
2018-05-08T00:00:00
null
null
null
null
[ { "code_snippet_url": "https://github.com/aykutaaykut/Memory-Networks", "description": "A **Memory Network** provides a memory component that can be read from and written to with the inference capabilities of a neural network model. The motivation is that many neural networks lack a long-term memory compone...
https://paperswithcode.com/paper/pots-protective-optimization-technologies
1806.02711
null
null
POTs: Protective Optimization Technologies
Algorithmic fairness aims to address the economic, moral, social, and political impact that digital systems have on populations through solutions that can be applied by service providers. Fairness frameworks do so, in part, by mapping these problems to a narrow definition and assuming the service providers can be trust...
Fairness frameworks do so, in part, by mapping these problems to a narrow definition and assuming the service providers can be trusted to deploy countermeasures.
https://arxiv.org/abs/1806.02711v6
https://arxiv.org/pdf/1806.02711v6.pdf
null
[ "Bogdan Kulynych", "Rebekah Overdorf", "Carmela Troncoso", "Seda Gürses" ]
[ "Decision Making", "Fairness" ]
2018-06-07T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/surface-networks
1705.10819
null
null
Surface Networks
We study data-driven representations for three-dimensional triangle meshes, which are one of the prevalent objects used to represent 3D geometry. Recent works have developed models that exploit the intrinsic geometry of manifolds and graphs, namely the Graph Neural Networks (GNNs) and its spectral variants, which learn...
We study data-driven representations for three-dimensional triangle meshes, which are one of the prevalent objects used to represent 3D geometry.
http://arxiv.org/abs/1705.10819v2
http://arxiv.org/pdf/1705.10819v2.pdf
CVPR 2018 6
[ "Ilya Kostrikov", "Zhongshi Jiang", "Daniele Panozzo", "Denis Zorin", "Joan Bruna" ]
[ "3D geometry" ]
2017-05-30T00:00:00
http://openaccess.thecvf.com/content_cvpr_2018/html/Kostrikov_Surface_Networks_CVPR_2018_paper.html
http://openaccess.thecvf.com/content_cvpr_2018/papers/Kostrikov_Surface_Networks_CVPR_2018_paper.pdf
surface-networks-1
null
[ { "code_snippet_url": "", "description": "In today’s digital age, Solana has become more than just a buzzword—it’s a revolutionary way to manage and invest your money. But just like with any advanced technology, users sometimes face issues that can be frustrating or even alarming. Whether you're dealing wit...
https://paperswithcode.com/paper/extracting-automata-from-recurrent-neural
1711.09576
null
null
Extracting Automata from Recurrent Neural Networks Using Queries and Counterexamples
We present a novel algorithm that uses exact learning and abstraction to extract a deterministic finite automaton describing the state dynamics of a given trained RNN. We do this using Angluin's L* algorithm as a learner and the trained RNN as an oracle. Our technique efficiently extracts accurate automata from trained...
We do this using Angluin's L* algorithm as a learner and the trained RNN as an oracle.
https://arxiv.org/abs/1711.09576v4
https://arxiv.org/pdf/1711.09576v4.pdf
ICML 2018 7
[ "Gail Weiss", "Yoav Goldberg", "Eran Yahav" ]
[]
2017-11-27T00:00:00
https://icml.cc/Conferences/2018/Schedule?showEvent=2276
http://proceedings.mlr.press/v80/weiss18a/weiss18a.pdf
extracting-automata-from-recurrent-neural-1
null
[]
https://paperswithcode.com/paper/unsupervised-word-segmentation-from-speech
1806.06734
null
null
Unsupervised Word Segmentation from Speech with Attention
We present a first attempt to perform attentional word segmentation directly from the speech signal, with the final goal to automatically identify lexical units in a low-resource, unwritten language (UL). Our methodology assumes a pairing between recordings in the UL with translations in a well-resourced language. It u...
null
http://arxiv.org/abs/1806.06734v1
http://arxiv.org/pdf/1806.06734v1.pdf
null
[ "Pierre Godard", "Marcely Zanon-Boito", "Lucas Ondel", "Alexandre Berard", "François Yvon", "Aline Villavicencio", "Laurent Besacier" ]
[ "Acoustic Unit Discovery", "Machine Translation", "Segmentation", "Translation" ]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/semantically-selective-augmentation-for-deep
1806.04074
null
null
Semantically Selective Augmentation for Deep Compact Person Re-Identification
We present a deep person re-identification approach that combines semantically selective, deep data augmentation with clustering-based network compression to generate high performance, light and fast inference networks. In particular, we propose to augment limited training data via sampling from a deep convolutional ge...
null
http://arxiv.org/abs/1806.04074v3
http://arxiv.org/pdf/1806.04074v3.pdf
null
[ "Víctor Ponce-López", "Tilo Burghardt", "Sion Hannunna", "Dima Damen", "Alessandro Masullo", "Majid Mirmehdi" ]
[ "Clustering", "Data Augmentation", "Generative Adversarial Network", "Person Re-Identification", "Specificity" ]
2018-06-11T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/assessing-robustness-of-radiomic-features-by
1806.06719
null
null
Assessing robustness of radiomic features by image perturbation
Image features need to be robust against differences in positioning, acquisition and segmentation to ensure reproducibility. Radiomic models that only include robust features can be used to analyse new images, whereas models with non-robust features may fail to predict the outcome of interest accurately. Test-retest im...
null
http://arxiv.org/abs/1806.06719v1
http://arxiv.org/pdf/1806.06719v1.pdf
null
[ "Alex Zwanenburg", "Stefan Leger", "Linda Agolli", "Karoline Pilz", "Esther G. C. Troost", "Christian Richter", "Steffen Löck" ]
[ "Translation" ]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/reconvnet-video-object-segmentation-with
1806.05510
null
null
ReConvNet: Video Object Segmentation with Spatio-Temporal Features Modulation
We introduce ReConvNet, a recurrent convolutional architecture for semi-supervised video object segmentation that is able to fast adapt its features to focus on any specific object of interest at inference time. Generalization to new objects never observed during training is known to be a hard task for supervised appro...
null
http://arxiv.org/abs/1806.05510v2
http://arxiv.org/pdf/1806.05510v2.pdf
null
[ "Francesco Lattari", "Marco Ciccone", "Matteo Matteucci", "Jonathan Masci", "Francesco Visin" ]
[ "Object", "Position", "Semantic Segmentation", "Semi-Supervised Video Object Segmentation", "Video Object Segmentation", "Video Semantic Segmentation" ]
2018-06-14T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/tree-edit-distance-learning-via-adaptive-1
1806.05009
null
null
Tree Edit Distance Learning via Adaptive Symbol Embeddings
Metric learning has the aim to improve classification accuracy by learning a distance measure which brings data points from the same class closer together and pushes data points from different classes further apart. Recent research has demonstrated that metric learning approaches can also be applied to trees, such as m...
null
http://arxiv.org/abs/1806.05009v3
http://arxiv.org/pdf/1806.05009v3.pdf
ICML 2018 7
[ "Benjamin Paaßen", "Claudio Gallicchio", "Alessio Micheli", "Barbara Hammer" ]
[ "Metric Learning" ]
2018-06-13T00:00:00
https://icml.cc/Conferences/2018/Schedule?showEvent=2180
http://proceedings.mlr.press/v80/paassen18a/paassen18a.pdf
tree-edit-distance-learning-via-adaptive-2
null
[]
https://paperswithcode.com/paper/towards-multi-instrument-drum-transcription
1806.06676
null
null
Towards multi-instrument drum transcription
Automatic drum transcription, a subtask of the more general automatic music transcription, deals with extracting drum instrument note onsets from an audio source. Recently, progress in transcription performance has been made using non-negative matrix factorization as well as deep learning methods. However, these works ...
In this work, convolutional and convolutional recurrent neural networks are trained to transcribe a wider range of drum instruments.
http://arxiv.org/abs/1806.06676v2
http://arxiv.org/pdf/1806.06676v2.pdf
null
[ "Richard Vogl", "Gerhard Widmer", "Peter Knees" ]
[ "Drum Transcription", "Music Transcription" ]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/subword-and-crossword-units-for-ctc-acoustic
1712.06855
null
null
Subword and Crossword Units for CTC Acoustic Models
This paper proposes a novel approach to create an unit set for CTC based speech recognition systems. By using Byte Pair Encoding we learn an unit set of an arbitrary size on a given training text. In contrast to using characters or words as units this allows us to find a good trade-off between the size of our unit set ...
null
http://arxiv.org/abs/1712.06855v2
http://arxiv.org/pdf/1712.06855v2.pdf
null
[ "Thomas Zenkel", "Ramon Sanabria", "Florian Metze", "Alex Waibel" ]
[ "Language Modeling", "Language Modelling", "speech-recognition", "Speech Recognition" ]
2017-12-19T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/cardinality-leap-for-open-ended-evolution
1806.06628
null
null
Cardinality Leap for Open-Ended Evolution: Theoretical Consideration and Demonstration by "Hash Chemistry"
Open-ended evolution requires unbounded possibilities that evolving entities can explore. The cardinality of a set of those possibilities thus has a significant implication for the open-endedness of evolution. We propose that facilitating formation of higher-order entities is a generalizable, effective way to cause a "...
null
http://arxiv.org/abs/1806.06628v4
http://arxiv.org/pdf/1806.06628v4.pdf
null
[ "Hiroki Sayama" ]
[]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/warp-wavelets-with-adaptive-recursive
1711.00789
null
null
Learning Asymmetric and Local Features in Multi-Dimensional Data through Wavelets with Recursive Partitioning
Effective learning of asymmetric and local features in images and other data observed on multi-dimensional grids is a challenging objective critical for a wide range of image processing applications involving biomedical and natural images. It requires methods that are sensitive to local details while fast enough to han...
Effective learning of asymmetric and local features in images and other data observed on multi-dimensional grids is a challenging objective critical for a wide range of image processing applications involving biomedical and natural images.
https://arxiv.org/abs/1711.00789v5
https://arxiv.org/pdf/1711.00789v5.pdf
null
[ "Meng Li", "Li Ma" ]
[ "Bayesian Inference", "Image Reconstruction" ]
2017-11-02T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/on-enhancing-speech-emotion-recognition-using
1806.06626
null
null
On Enhancing Speech Emotion Recognition using Generative Adversarial Networks
Generative Adversarial Networks (GANs) have gained a lot of attention from machine learning community due to their ability to learn and mimic an input data distribution. GANs consist of a discriminator and a generator working in tandem playing a min-max game to learn a target underlying data distribution; when fed with...
null
http://arxiv.org/abs/1806.06626v1
http://arxiv.org/pdf/1806.06626v1.pdf
null
[ "Saurabh Sahu", "Rahul Gupta", "Carol Espy-Wilson" ]
[ "Cross-corpus", "Emotion Recognition", "Speech Emotion Recognition" ]
2018-06-18T00:00:00
null
null
null
null
[ { "code_snippet_url": "", "description": "A **convolution** is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the part of the input it is on, then summing the results into an output.\r\n\r\nIntuitively, a...
https://paperswithcode.com/paper/banach-wasserstein-gan
1806.06621
null
null
Banach Wasserstein GAN
Wasserstein Generative Adversarial Networks (WGANs) can be used to generate realistic samples from complicated image distributions. The Wasserstein metric used in WGANs is based on a notion of distance between individual images, which induces a notion of distance between probability distributions of images. So far the ...
Wasserstein Generative Adversarial Networks (WGANs) can be used to generate realistic samples from complicated image distributions.
http://arxiv.org/abs/1806.06621v2
http://arxiv.org/pdf/1806.06621v2.pdf
NeurIPS 2018 12
[ "Jonas Adler", "Sebastian Lunz" ]
[]
2018-06-18T00:00:00
http://papers.nips.cc/paper/7909-banach-wasserstein-gan
http://papers.nips.cc/paper/7909-banach-wasserstein-gan.pdf
banach-wasserstein-gan-1
null
[ { "code_snippet_url": "", "description": "A **convolution** is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the part of the input it is on, then summing the results into an output.\r\n\r\nIntuitively, a...
https://paperswithcode.com/paper/comparison-based-random-forests
1806.06616
null
null
Comparison-Based Random Forests
Assume we are given a set of items from a general metric space, but we neither have access to the representation of the data nor to the distances between data points. Instead, suppose that we can actively choose a triplet of items (A,B,C) and ask an oracle whether item A is closer to item B or to item C. In this paper,...
null
http://arxiv.org/abs/1806.06616v1
http://arxiv.org/pdf/1806.06616v1.pdf
ICML 2018 7
[ "Siavash Haghiri", "Damien Garreau", "Ulrike Von Luxburg" ]
[ "General Classification", "regression", "Triplet" ]
2018-06-18T00:00:00
https://icml.cc/Conferences/2018/Schedule?showEvent=1979
http://proceedings.mlr.press/v80/haghiri18a/haghiri18a.pdf
comparison-based-random-forests-1
null
[]
https://paperswithcode.com/paper/on-multi-resident-activity-recognition-in
1806.06611
null
null
On Multi-resident Activity Recognition in Ambient Smart-Homes
Increasing attention to the research on activity monitoring in smart homes has motivated the employment of ambient intelligence to reduce the deployment cost and solve the privacy issue. Several approaches have been proposed for multi-resident activity recognition, however, there still lacks a comprehensive benchmark f...
null
http://arxiv.org/abs/1806.06611v1
http://arxiv.org/pdf/1806.06611v1.pdf
null
[ "Son N. Tran", "Qing Zhang", "Mohan Karunanithi" ]
[ "Activity Recognition" ]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/evaluating-and-characterizing-incremental
1806.06610
null
null
Evaluating and Characterizing Incremental Learning from Non-Stationary Data
Incremental learning from non-stationary data poses special challenges to the field of machine learning. Although new algorithms have been developed for this, assessment of results and comparison of behaviors are still open problems, mainly because evaluation metrics, adapted from more traditional tasks, can be ineffec...
null
http://arxiv.org/abs/1806.06610v1
http://arxiv.org/pdf/1806.06610v1.pdf
null
[ "Alejandro Cervantes", "Christian Gagné", "Pedro Isasi", "Marc Parizeau" ]
[ "Incremental Learning" ]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/quantized-compressive-k-means
1804.10109
null
null
Quantized Compressive K-Means
The recent framework of compressive statistical learning aims at designing tractable learning algorithms that use only a heavily compressed representation-or sketch-of massive datasets. Compressive K-Means (CKM) is such a method: it estimates the centroids of data clusters from pooled, non-linear, random signatures of ...
null
http://arxiv.org/abs/1804.10109v2
http://arxiv.org/pdf/1804.10109v2.pdf
null
[ "Vincent Schellekens", "Laurent Jacques" ]
[ "Clustering", "Quantization" ]
2018-04-26T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/self-attentional-acoustic-models
1803.09519
null
null
Self-Attentional Acoustic Models
Self-attention is a method of encoding sequences of vectors by relating these vectors to each-other based on pairwise similarities. These models have recently shown promising results for modeling discrete sequences, but they are non-trivial to apply to acoustic modeling due to computational and modeling issues. In this...
Self-attention is a method of encoding sequences of vectors by relating these vectors to each-other based on pairwise similarities.
http://arxiv.org/abs/1803.09519v2
http://arxiv.org/pdf/1803.09519v2.pdf
null
[ "Matthias Sperber", "Jan Niehues", "Graham Neubig", "Sebastian Stüker", "Alex Waibel" ]
[]
2018-03-26T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/snap-ml-a-hierarchical-framework-for-machine
1803.06333
null
null
Snap ML: A Hierarchical Framework for Machine Learning
We describe a new software framework for fast training of generalized linear models. The framework, named Snap Machine Learning (Snap ML), combines recent advances in machine learning systems and algorithms in a nested manner to reflect the hierarchical architecture of modern computing systems. We prove theoretically t...
null
http://arxiv.org/abs/1803.06333v3
http://arxiv.org/pdf/1803.06333v3.pdf
NeurIPS 2018 12
[ "Celestine Dünner", "Thomas Parnell", "Dimitrios Sarigiannis", "Nikolas Ioannou", "Andreea Anghel", "Gummadi Ravi", "Madhusudanan Kandasamy", "Haralampos Pozidis" ]
[ "BIG-bench Machine Learning", "GPU" ]
2018-03-16T00:00:00
http://papers.nips.cc/paper/7309-snap-ml-a-hierarchical-framework-for-machine-learning
http://papers.nips.cc/paper/7309-snap-ml-a-hierarchical-framework-for-machine-learning.pdf
snap-ml-a-hierarchical-framework-for-machine-1
null
[ { "code_snippet_url": null, "description": "**Logistic Regression**, despite its name, is a linear model for classification rather than regression. Logistic regression is also known in the literature as logit regression, maximum-entropy classification (MaxEnt) or the log-linear classifier. In this model, th...
https://paperswithcode.com/paper/multilingual-bottleneck-features-for-subword
1803.08863
null
null
Multilingual bottleneck features for subword modeling in zero-resource languages
How can we effectively develop speech technology for languages where no transcribed data is available? Many existing approaches use no annotated resources at all, yet it makes sense to leverage information from large annotated corpora in other languages, for example in the form of multilingual bottleneck features (BNFs...
How can we effectively develop speech technology for languages where no transcribed data is available?
http://arxiv.org/abs/1803.08863v2
http://arxiv.org/pdf/1803.08863v2.pdf
null
[ "Enno Hermann", "Sharon Goldwater" ]
[ "speech-recognition", "Speech Recognition" ]
2018-03-23T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/learning-to-write-stylized-chinese-characters
1712.06424
null
null
Learning to Write Stylized Chinese Characters by Reading a Handful of Examples
Automatically writing stylized Chinese characters is an attractive yet challenging task due to its wide applicabilities. In this paper, we propose a novel framework named Style-Aware Variational Auto-Encoder (SA-VAE) to flexibly generate Chinese characters. Specifically, we propose to capture the different characterist...
null
http://arxiv.org/abs/1712.06424v3
http://arxiv.org/pdf/1712.06424v3.pdf
null
[ "Danyang Sun", "Tongzheng Ren", "Chongxun Li", "Hang Su", "Jun Zhu" ]
[]
2017-12-06T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/ipose-instance-aware-6d-pose-estimation-of
1712.01924
null
null
iPose: Instance-Aware 6D Pose Estimation of Partly Occluded Objects
We address the task of 6D pose estimation of known rigid objects from single input images in scenarios where the objects are partly occluded. Recent RGB-D-based methods are robust to moderate degrees of occlusion. For RGB inputs, no previous method works well for partly occluded objects. Our main contribution is to pre...
null
http://arxiv.org/abs/1712.01924v3
http://arxiv.org/pdf/1712.01924v3.pdf
null
[ "Omid Hosseini Jafari", "Siva Karthik Mustikovela", "Karl Pertsch", "Eric Brachmann", "Carsten Rother" ]
[ "6D Pose Estimation", "6D Pose Estimation using RGB", "Decoder", "Instance Segmentation", "Object", "Pose Estimation", "Semantic Segmentation" ]
2017-12-05T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/uncertainty-in-multitask-learning-joint
1806.06595
null
null
Uncertainty in multitask learning: joint representations for probabilistic MR-only radiotherapy planning
Multi-task neural network architectures provide a mechanism that jointly integrates information from distinct sources. It is ideal in the context of MR-only radiotherapy planning as it can jointly regress a synthetic CT (synCT) scan and segment organs-at-risk (OAR) from MRI. We propose a probabilistic multi-task networ...
null
http://arxiv.org/abs/1806.06595v1
http://arxiv.org/pdf/1806.06595v1.pdf
null
[ "Felix J. S. Bragman", "Ryutaro Tanno", "Zach Eaton-Rosen", "Wenqi Li", "David J. Hawkes", "Sebastien Ourselin", "Daniel C. Alexander", "Jamie R. McClelland", "M. Jorge Cardoso" ]
[ "Bayesian Inference" ]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/deep-recurrent-neural-network-for-multi
1806.06594
null
null
Deep Recurrent Neural Network for Multi-target Filtering
This paper addresses the problem of fixed motion and measurement models for multi-target filtering using an adaptive learning framework. This is performed by defining target tuples with random finite set terminology and utilisation of recurrent neural networks with a long short-term memory architecture. A novel data as...
null
http://arxiv.org/abs/1806.06594v2
http://arxiv.org/pdf/1806.06594v2.pdf
null
[ "Mehryar Emambakhsh", "Alessandro Bay", "Eduard Vazquez" ]
[]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/low-resource-speech-to-text-translation
1803.09164
null
null
Low-Resource Speech-to-Text Translation
Speech-to-text translation has many potential applications for low-resource languages, but the typical approach of cascading speech recognition with machine translation is often impossible, since the transcripts needed to train a speech recognizer are usually not available for low-resource languages. Recent work has fo...
null
http://arxiv.org/abs/1803.09164v2
http://arxiv.org/pdf/1803.09164v2.pdf
null
[ "Sameer Bansal", "Herman Kamper", "Karen Livescu", "Adam Lopez", "Sharon Goldwater" ]
[ "Decoder", "Machine Translation", "speech-recognition", "Speech Recognition", "Speech-to-Text", "Speech-to-Text Translation", "Translation" ]
2018-03-24T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/computational-theories-of-curiosity-driven
1802.10546
null
null
Computational Theories of Curiosity-Driven Learning
What are the functions of curiosity? What are the mechanisms of curiosity-driven learning? We approach these questions about the living using concepts and tools from machine learning and developmental robotics. We argue that curiosity-driven learning enables organisms to make discoveries to solve complex problems with ...
null
http://arxiv.org/abs/1802.10546v2
http://arxiv.org/pdf/1802.10546v2.pdf
null
[ "Pierre-Yves Oudeyer" ]
[ "BIG-bench Machine Learning", "Lifelong learning" ]
2018-02-28T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/nonparametric-topic-modeling-with-neural
1806.06583
null
null
Nonparametric Topic Modeling with Neural Inference
This work focuses on combining nonparametric topic models with Auto-Encoding Variational Bayes (AEVB). Specifically, we first propose iTM-VAE, where the topics are treated as trainable parameters and the document-specific topic proportions are obtained by a stick-breaking construction. The inference of iTM-VAE is model...
null
http://arxiv.org/abs/1806.06583v1
http://arxiv.org/pdf/1806.06583v1.pdf
null
[ "Xuefei Ning", "Yin Zheng", "Zhuxi Jiang", "Yu Wang", "Huazhong Yang", "Junzhou Huang" ]
[ "Topic Models" ]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/wsd-algorithm-based-on-a-new-method-of-vector
1805.09559
null
null
WSD algorithm based on a new method of vector-word contexts proximity calculation via epsilon-filtration
The problem of word sense disambiguation (WSD) is considered in the article. Given a set of synonyms (synsets) and sentences with these synonyms. It is necessary to select the meaning of the word in the sentence automatically. 1285 sentences were tagged by experts, namely, one of the dictionary meanings was selected by...
It is necessary to select the meaning of the word in the sentence automatically.
http://arxiv.org/abs/1805.09559v2
http://arxiv.org/pdf/1805.09559v2.pdf
null
[ "Alexander Kirillov", "Natalia Krizhanovsky", "Andrew Krizhanovsky" ]
[ "Sentence", "Word Sense Disambiguation" ]
2018-05-24T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/the-kanerva-machine-a-generative-distributed
1804.01756
null
S1HlA-ZAZ
The Kanerva Machine: A Generative Distributed Memory
We present an end-to-end trained memory system that quickly adapts to new data and generates samples like them. Inspired by Kanerva's sparse distributed memory, it has a robust distributed reading and writing mechanism. The memory is analytically tractable, which enables optimal on-line compression via a Bayesian updat...
null
http://arxiv.org/abs/1804.01756v3
http://arxiv.org/pdf/1804.01756v3.pdf
ICLR 2018 1
[ "Yan Wu", "Greg Wayne", "Alex Graves", "Timothy Lillicrap" ]
[]
2018-04-05T00:00:00
https://openreview.net/forum?id=S1HlA-ZAZ
https://openreview.net/pdf?id=S1HlA-ZAZ
the-kanerva-machine-a-generative-distributed-1
null
[]
https://paperswithcode.com/paper/rendernet-a-deep-convolutional-network-for
1806.06575
null
null
RenderNet: A deep convolutional network for differentiable rendering from 3D shapes
Traditional computer graphics rendering pipeline is designed for procedurally generating 2D quality images from 3D shapes with high performance. The non-differentiability due to discrete operations such as visibility computation makes it hard to explicitly correlate rendering parameters and the resulting image, posing ...
We present RenderNet, a differentiable rendering convolutional network with a novel projection unit that can render 2D images from 3D shapes.
http://arxiv.org/abs/1806.06575v3
http://arxiv.org/pdf/1806.06575v3.pdf
NeurIPS 2018 12
[ "Thu Nguyen-Phuoc", "Chuan Li", "Stephen Balaban", "Yong-Liang Yang" ]
[ "Inverse Rendering" ]
2018-06-18T00:00:00
http://papers.nips.cc/paper/8014-rendernet-a-deep-convolutional-network-for-differentiable-rendering-from-3d-shapes
http://papers.nips.cc/paper/8014-rendernet-a-deep-convolutional-network-for-differentiable-rendering-from-3d-shapes.pdf
rendernet-a-deep-convolutional-network-for-1
null
[]
https://paperswithcode.com/paper/distributed-learning-with-compressed
1806.06573
null
null
Distributed learning with compressed gradients
Asynchronous computation and gradient compression have emerged as two key techniques for achieving scalability in distributed optimization for large-scale machine learning. This paper presents a unified analysis framework for distributed gradient methods operating with staled and compressed gradients. Non-asymptotic bo...
null
http://arxiv.org/abs/1806.06573v2
http://arxiv.org/pdf/1806.06573v2.pdf
null
[ "Sarit Khirirat", "Hamid Reza Feyzmahdavian", "Mikael Johansson" ]
[ "BIG-bench Machine Learning", "Distributed Optimization" ]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/subgram-extending-skip-gram-word
1806.06571
null
null
SubGram: Extending Skip-gram Word Representation with Substrings
Skip-gram (word2vec) is a recent method for creating vector representations of words ("distributed word representations") using a neural network. The representation gained popularity in various areas of natural language processing, because it seems to capture syntactic and semantic information about words without any e...
Skip-gram (word2vec) is a recent method for creating vector representations of words ("distributed word representations") using a neural network.
http://arxiv.org/abs/1806.06571v1
http://arxiv.org/pdf/1806.06571v1.pdf
null
[ "Tom Kocmi", "Ondřej Bojar" ]
[]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/learning-from-outside-the-viability-kernel
1806.06569
null
null
Learning from Outside the Viability Kernel: Why we Should Build Robots that can Fall with Grace
Despite impressive results using reinforcement learning to solve complex problems from scratch, in robotics this has still been largely limited to model-based learning with very informative reward functions. One of the major challenges is that the reward landscape often has large patches with no gradient, making it dif...
null
http://arxiv.org/abs/1806.06569v1
http://arxiv.org/pdf/1806.06569v1.pdf
null
[ "Steve Heim", "Alexander Spröwitz" ]
[ "reinforcement-learning", "Reinforcement Learning", "Reinforcement Learning (RL)" ]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/ista-net-interpretable-optimization-inspired
1706.07929
null
null
ISTA-Net: Interpretable Optimization-Inspired Deep Network for Image Compressive Sensing
With the aim of developing a fast yet accurate algorithm for compressive sensing (CS) reconstruction of natural images, we combine in this paper the merits of two existing categories of CS methods: the structure insights of traditional optimization-based methods and the speed of recent network-based ones. Specifically,...
With the aim of developing a fast yet accurate algorithm for compressive sensing (CS) reconstruction of natural images, we combine in this paper the merits of two existing categories of CS methods: the structure insights of traditional optimization-based methods and the speed of recent network-based ones.
http://arxiv.org/abs/1706.07929v2
http://arxiv.org/pdf/1706.07929v2.pdf
CVPR 2018 6
[ "Jian Zhang", "Bernard Ghanem" ]
[ "Compressive Sensing" ]
2017-06-24T00:00:00
http://openaccess.thecvf.com/content_cvpr_2018/html/Zhang_ISTA-Net_Interpretable_Optimization-Inspired_CVPR_2018_paper.html
http://openaccess.thecvf.com/content_cvpr_2018/papers/Zhang_ISTA-Net_Interpretable_Optimization-Inspired_CVPR_2018_paper.pdf
ista-net-interpretable-optimization-inspired-1
null
[ { "code_snippet_url": "https://github.com/lorenzopapa5/SPEED", "description": "The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene understanding and visual odometry, which are key com...
https://paperswithcode.com/paper/state-gradients-for-rnn-memory-analysis
1805.04264
null
null
State Gradients for RNN Memory Analysis
We present a framework for analyzing what the state in RNNs remembers from its input embeddings. Our approach is inspired by backpropagation, in the sense that we compute the gradients of the states with respect to the input embeddings. The gradient matrix is decomposed with Singular Value Decomposition to analyze whic...
null
http://arxiv.org/abs/1805.04264v2
http://arxiv.org/pdf/1805.04264v2.pdf
WS 2018 11
[ "Lyan Verwimp", "Hugo Van hamme", "Vincent Renkens", "Patrick Wambacq" ]
[]
2018-05-11T00:00:00
https://aclanthology.org/W18-5443
https://aclanthology.org/W18-5443.pdf
state-gradients-for-rnn-memory-analysis-1
null
[ { "code_snippet_url": "https://github.com/pytorch/pytorch/blob/96aaa311c0251d24decb9dc5da4957b7c590af6f/torch/nn/modules/activation.py#L277", "description": "**Sigmoid Activations** are a type of activation function for neural networks:\r\n\r\n$$f\\left(x\\right) = \\frac{1}{\\left(1+\\exp\\left(-x\\right)\...
https://paperswithcode.com/paper/convex-optimization-with-unbounded-nonconvex
1711.02621
null
null
Convex Optimization with Unbounded Nonconvex Oracles using Simulated Annealing
We consider the problem of minimizing a convex objective function $F$ when one can only evaluate its noisy approximation $\hat{F}$. Unless one assumes some structure on the noise, $\hat{F}$ may be an arbitrary nonconvex function, making the task of minimizing $F$ intractable. To overcome this, prior work has often focu...
null
http://arxiv.org/abs/1711.02621v2
http://arxiv.org/pdf/1711.02621v2.pdf
null
[ "Oren Mangoubi", "Nisheeth K. Vishnoi" ]
[]
2017-11-07T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/incremental-sparse-bayesian-ordinal
1806.06553
null
null
Incremental Sparse Bayesian Ordinal Regression
Ordinal Regression (OR) aims to model the ordering information between different data categories, which is a crucial topic in multi-label learning. An important class of approaches to OR models the problem as a linear combination of basis functions that map features to a high dimensional non-linear space. However, most...
Ordinal Regression (OR) aims to model the ordering information between different data categories, which is a crucial topic in multi-label learning.
http://arxiv.org/abs/1806.06553v1
http://arxiv.org/pdf/1806.06553v1.pdf
null
[ "Chang Li", "Maarten de Rijke" ]
[ "Multi-Label Learning", "regression" ]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/sniper-efficient-multi-scale-training
1805.09300
null
null
SNIPER: Efficient Multi-Scale Training
We present SNIPER, an algorithm for performing efficient multi-scale training in instance level visual recognition tasks. Instead of processing every pixel in an image pyramid, SNIPER processes context regions around ground-truth instances (referred to as chips) at the appropriate scale. For background sampling, these ...
Our implementation based on Faster-RCNN with a ResNet-101 backbone obtains an mAP of 47. 6% on the COCO dataset for bounding box detection and can process 5 images per second during inference with a single GPU.
http://arxiv.org/abs/1805.09300v3
http://arxiv.org/pdf/1805.09300v3.pdf
NeurIPS 2018 12
[ "Bharat Singh", "Mahyar Najibi", "Larry S. Davis" ]
[ "GPU", "image-classification", "object-detection", "Object Detection", "Region Proposal" ]
2018-05-23T00:00:00
http://papers.nips.cc/paper/8143-sniper-efficient-multi-scale-training
http://papers.nips.cc/paper/8143-sniper-efficient-multi-scale-training.pdf
sniper-efficient-multi-scale-training-1
null
[ { "code_snippet_url": "", "description": "**Average Pooling** is a pooling operation that calculates the average value for patches of a feature map, and uses it to create a downsampled (pooled) feature map. It is usually used after a convolutional layer. It adds a small amount of translation invariance - me...
https://paperswithcode.com/paper/constraining-the-dynamics-of-deep
1802.05680
null
null
Constraining the Dynamics of Deep Probabilistic Models
We introduce a novel generative formulation of deep probabilistic models implementing "soft" constraints on their function dynamics. In particular, we develop a flexible methodological framework where the modeled functions and derivatives of a given order are subject to inequality or equality constraints. We then chara...
null
http://arxiv.org/abs/1802.05680v2
http://arxiv.org/pdf/1802.05680v2.pdf
ICML 2018 7
[ "Marco Lorenzi", "Maurizio Filippone" ]
[ "Uncertainty Quantification", "Variational Inference" ]
2018-02-15T00:00:00
https://icml.cc/Conferences/2018/Schedule?showEvent=2209
http://proceedings.mlr.press/v80/lorenzi18a/lorenzi18a.pdf
constraining-the-dynamics-of-deep-1
null
[]
https://paperswithcode.com/paper/a-simple-reservoir-model-of-working-memory
1806.06545
null
null
A Simple Reservoir Model of Working Memory with Real Values
The prefrontal cortex is known to be involved in many high-level cognitive functions, in particular, working memory. Here, we study to what extent a group of randomly connected units (namely an Echo State Network, ESN) can store and maintain (as output) an arbitrary real value from a streamed input, i.e. can act as a s...
The prefrontal cortex is known to be involved in many high-level cognitive functions, in particular, working memory.
http://arxiv.org/abs/1806.06545v1
http://arxiv.org/pdf/1806.06545v1.pdf
null
[ "Anthony Strock", "Nicolas Rougier", "Xavier Hinaut" ]
[]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/segmentation-of-photovoltaic-module-cells-in
1806.06530
null
null
Segmentation of Photovoltaic Module Cells in Uncalibrated Electroluminescence Images
High resolution electroluminescence (EL) images captured in the infrared spectrum allow to visually and non-destructively inspect the quality of photovoltaic (PV) modules. Currently, however, such a visual inspection requires trained experts to discern different kinds of defects, which is time-consuming and expensive. ...
Automated segmentation of cells is therefore a key step in automating the visual inspection workflow.
https://arxiv.org/abs/1806.06530v4
https://arxiv.org/pdf/1806.06530v4.pdf
null
[ "Sergiu Deitsch", "Claudia Buerhop-Lutz", "Evgenii Sovetkin", "Ansgar Steland", "Andreas Maier", "Florian Gallwitz", "Christian Riess" ]
[ "Segmentation", "Solar Cell Segmentation" ]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/dual-recovery-network-with-online
1701.05652
null
null
Dual Recovery Network with Online Compensation for Image Super-Resolution
Image super-resolution (SR) methods essentially lead to a loss of some high-frequency (HF) information when predicting high-resolution (HR) images from low-resolution (LR) images without using external references. To address this issue, we additionally utilize online retrieved data to facilitate image SR in a unified d...
null
http://arxiv.org/abs/1701.05652v3
http://arxiv.org/pdf/1701.05652v3.pdf
null
[ "Sifeng Xia", "Wenhan Yang", "Jiaying Liu", "Zongming Guo" ]
[ "Image Super-Resolution", "Super-Resolution" ]
2017-01-20T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/hitnet-a-neural-network-with-capsules
1806.06519
null
null
HitNet: a neural network with capsules embedded in a Hit-or-Miss layer, extended with hybrid data augmentation and ghost capsules
Neural networks designed for the task of classification have become a commodity in recent years. Many works target the development of better networks, which results in a complexification of their architectures with more layers, multiple sub-networks, or even the combination of multiple classifiers. In this paper, we sh...
In this paper, we show how to redesign a simple network to reach excellent performances, which are better than the results reproduced with CapsNet on several datasets, by replacing a layer with a Hit-or-Miss layer.
http://arxiv.org/abs/1806.06519v1
http://arxiv.org/pdf/1806.06519v1.pdf
null
[ "Adrien Deliège", "Anthony Cioppa", "Marc Van Droogenbroeck" ]
[ "Data Augmentation" ]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/the-information-autoencoding-family-a
1806.06514
null
null
The Information Autoencoding Family: A Lagrangian Perspective on Latent Variable Generative Models
A large number of objectives have been proposed to train latent variable generative models. We show that many of them are Lagrangian dual functions of the same primal optimization problem. The primal problem optimizes the mutual information between latent and visible variables, subject to the constraints of accurately ...
A large number of objectives have been proposed to train latent variable generative models.
http://arxiv.org/abs/1806.06514v2
http://arxiv.org/pdf/1806.06514v2.pdf
null
[ "Shengjia Zhao", "Jiaming Song", "Stefano Ermon" ]
[]
2018-06-18T00:00:00
null
null
null
null
[ { "code_snippet_url": "https://github.com/google/jax/blob/36f91261099b00194922bd93ed1286fe1c199724/jax/experimental/stax.py#L116", "description": "**Batch Normalization** aims to reduce internal covariate shift, and in doing so aims to accelerate the training of deep neural nets. It accomplishes this via a ...
https://paperswithcode.com/paper/semi-tied-units-for-efficient-gating-in-lstm
1806.06513
null
null
Semi-tied Units for Efficient Gating in LSTM and Highway Networks
Gating is a key technique used for integrating information from multiple sources by long short-term memory (LSTM) models and has recently also been applied to other models such as the highway network. Although gating is powerful, it is rather expensive in terms of both computation and storage as each gating unit uses a...
null
http://arxiv.org/abs/1806.06513v1
http://arxiv.org/pdf/1806.06513v1.pdf
null
[ "Chao Zhang", "Philip Woodland" ]
[ "speech-recognition", "Speech Recognition" ]
2018-06-18T00:00:00
null
null
null
null
[ { "code_snippet_url": "", "description": "There is plenty of theoretical and empirical evidence that depth of neural networks is a crucial ingredient for their success. However, network training becomes more difficult with increasing depth and training of very deep networks remains an open problem. In this ...
https://paperswithcode.com/paper/predicting-citation-counts-with-a-neural
1806.04641
null
null
Predicting Citation Counts with a Neural Network
We here describe and present results of a simple neural network that predicts individual researchers' future citation counts based on a variety of data from the researchers' past. For publications available on the open access-server arXiv.org we find a higher predictability than previous studies.
We here describe and present results of a simple neural network that predicts individual researchers' future citation counts based on a variety of data from the researchers' past.
http://arxiv.org/abs/1806.04641v2
http://arxiv.org/pdf/1806.04641v2.pdf
null
[ "Tobias Mistele", "Tom Price", "Sabine Hossenfelder" ]
[]
2018-06-12T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/an-ensemble-of-transfer-semi-supervised-and
1806.06506
null
null
An Ensemble of Transfer, Semi-supervised and Supervised Learning Methods for Pathological Heart Sound Classification
In this work, we propose an ensemble of classifiers to distinguish between various degrees of abnormalities of the heart using Phonocardiogram (PCG) signals acquired using digital stethoscopes in a clinical setting, for the INTERSPEECH 2018 Computational Paralinguistics (ComParE) Heart Beats SubChallenge. Our primary c...
In this work, we propose an ensemble of classifiers to distinguish between various degrees of abnormalities of the heart using Phonocardiogram (PCG) signals acquired using digital stethoscopes in a clinical setting, for the INTERSPEECH 2018 Computational Paralinguistics (ComParE) Heart Beats SubChallenge.
http://arxiv.org/abs/1806.06506v2
http://arxiv.org/pdf/1806.06506v2.pdf
null
[ "Ahmed Imtiaz Humayun", "Md. Tauhiduzzaman Khan", "Shabnam Ghaffarzadegan", "Zhe Feng", "Taufiq Hasan" ]
[ "General Classification", "Representation Learning", "Sound Classification" ]
2018-06-18T00:00:00
null
null
null
null
[ { "code_snippet_url": "", "description": "A **Support Vector Machine**, or **SVM**, is a non-parametric supervised learning model. For non-linear classification and regression, they utilise the kernel trick to map inputs to high-dimensional feature spaces. SVMs construct a hyper-plane or set of hyper-planes...
https://paperswithcode.com/paper/a-unified-strategy-for-implementing-curiosity
1806.06505
null
null
A unified strategy for implementing curiosity and empowerment driven reinforcement learning
Although there are many approaches to implement intrinsically motivated artificial agents, the combined usage of multiple intrinsic drives remains still a relatively unexplored research area. Specifically, we hypothesize that a mechanism capable of quantifying and controlling the evolution of the information flow betwe...
null
http://arxiv.org/abs/1806.06505v1
http://arxiv.org/pdf/1806.06505v1.pdf
null
[ "Ildefons Magrans de Abril", "Ryota Kanai" ]
[ "reinforcement-learning", "Reinforcement Learning", "Reinforcement Learning (RL)" ]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/multi-modal-data-augmentation-for-end-to-end
1803.10299
null
null
Multi-Modal Data Augmentation for End-to-End ASR
We present a new end-to-end architecture for automatic speech recognition (ASR) that can be trained using \emph{symbolic} input in addition to the traditional acoustic input. This architecture utilizes two separate encoders: one for acoustic input and another for symbolic input, both sharing the attention and decoder p...
null
http://arxiv.org/abs/1803.10299v3
http://arxiv.org/pdf/1803.10299v3.pdf
null
[ "Adithya Renduchintala", "Shuoyang Ding", "Matthew Wiesner", "Shinji Watanabe" ]
[ "Automatic Speech Recognition", "Automatic Speech Recognition (ASR)", "Data Augmentation", "Decoder", "Language Modeling", "Language Modelling", "speech-recognition", "Speech Recognition" ]
2018-03-27T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/deforming-autoencoders-unsupervised
1806.06503
null
null
Deforming Autoencoders: Unsupervised Disentangling of Shape and Appearance
In this work we introduce Deforming Autoencoders, a generative model for images that disentangles shape from appearance in an unsupervised manner. As in the deformable template paradigm, shape is represented as a deformation between a canonical coordinate system (`template') and an observed image, while appearance is m...
In this work we introduce Deforming Autoencoders, a generative model for images that disentangles shape from appearance in an unsupervised manner.
http://arxiv.org/abs/1806.06503v1
http://arxiv.org/pdf/1806.06503v1.pdf
ECCV 2018 9
[ "Zhixin Shu", "Mihir Sahasrabudhe", "Alp Guler", "Dimitris Samaras", "Nikos Paragios", "Iasonas Kokkinos" ]
[ "Unsupervised Facial Landmark Detection" ]
2018-06-18T00:00:00
http://openaccess.thecvf.com/content_ECCV_2018/html/Zhixin_Shu_Deforming_Autoencoders_Unsupervised_ECCV_2018_paper.html
http://openaccess.thecvf.com/content_ECCV_2018/papers/Zhixin_Shu_Deforming_Autoencoders_Unsupervised_ECCV_2018_paper.pdf
deforming-autoencoders-unsupervised-1
null
[]
https://paperswithcode.com/paper/conditional-affordance-learning-for-driving
1806.06498
null
null
Conditional Affordance Learning for Driving in Urban Environments
Most existing approaches to autonomous driving fall into one of two categories: modular pipelines, that build an extensive model of the environment, and imitation learning approaches, that map images directly to control outputs. A recently proposed third paradigm, direct perception, aims to combine the advantages of bo...
Most existing approaches to autonomous driving fall into one of two categories: modular pipelines, that build an extensive model of the environment, and imitation learning approaches, that map images directly to control outputs.
http://arxiv.org/abs/1806.06498v3
http://arxiv.org/pdf/1806.06498v3.pdf
null
[ "Axel Sauer", "Nikolay Savinov", "Andreas Geiger" ]
[ "Autonomous Driving", "Autonomous Navigation", "Imitation Learning", "Navigate" ]
2018-06-18T00:00:00
null
null
null
null
[ { "code_snippet_url": "https://github.com/ikostrikov/pytorch-a3c/blob/48d95844755e2c3e2c7e48bbd1a7141f7212b63f/train.py#L100", "description": "**Entropy Regularization** is a type of regularization used in [reinforcement learning](https://paperswithcode.com/methods/area/reinforcement-learning). For on-polic...
https://paperswithcode.com/paper/detecting-zero-day-controller-hijacking
1806.06496
null
null
Power-Grid Controller Anomaly Detection with Enhanced Temporal Deep Learning
Controllers of security-critical cyber-physical systems, like the power grid, are a very important class of computer systems. Attacks against the control code of a power-grid system, especially zero-day attacks, can be catastrophic. Earlier detection of the anomalies can prevent further damage. However, detecting zero-...
null
https://arxiv.org/abs/1806.06496v3
https://arxiv.org/pdf/1806.06496v3.pdf
null
[ "Zecheng He", "Aswin Raghavan", "Guangyuan Hu", "Sek Chai", "Ruby Lee" ]
[ "Anomaly Detection", "Deep Learning" ]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/women-also-snowboard-overcoming-bias-in-1
1803.09797
null
null
Women also Snowboard: Overcoming Bias in Captioning Models
Most machine learning methods are known to capture and exploit biases of the training data. While some biases are beneficial for learning, others are harmful. Specifically, image captioning models tend to exaggerate biases present in training data (e.g., if a word is present in 60% of training sentences, it might be pr...
We introduce a new Equalizer model that ensures equal gender probability when gender evidence is occluded in a scene and confident predictions when gender evidence is present.
http://arxiv.org/abs/1803.09797v4
http://arxiv.org/pdf/1803.09797v4.pdf
ECCV 2018 9
[ "Kaylee Burns", "Lisa Anne Hendricks", "Kate Saenko", "Trevor Darrell", "Anna Rohrbach" ]
[ "Image Captioning" ]
2018-03-26T00:00:00
http://openaccess.thecvf.com/content_ECCV_2018/html/Lisa_Anne_Hendricks_Women_also_Snowboard_ECCV_2018_paper.html
http://openaccess.thecvf.com/content_ECCV_2018/papers/Lisa_Anne_Hendricks_Women_also_Snowboard_ECCV_2018_paper.pdf
women-also-snowboard-overcoming-bias-in-2
null
[]
https://paperswithcode.com/paper/boosted-density-estimation-remastered
1803.08178
null
null
Boosted Density Estimation Remastered
There has recently been a steady increase in the number iterative approaches to density estimation. However, an accompanying burst of formal convergence guarantees has not followed; all results pay the price of heavy assumptions which are often unrealistic or hard to check. The Generative Adversarial Network (GAN) lite...
null
http://arxiv.org/abs/1803.08178v3
http://arxiv.org/pdf/1803.08178v3.pdf
null
[ "Zac Cranko", "Richard Nock" ]
[ "Density Estimation", "Generative Adversarial Network" ]
2018-03-22T00:00:00
null
null
null
null
[ { "code_snippet_url": "", "description": "A **convolution** is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the part of the input it is on, then summing the results into an output.\r\n\r\nIntuitively, a...
https://paperswithcode.com/paper/disturbance-grassmann-kernels-for-subspace
1802.03517
null
null
Disturbance Grassmann Kernels for Subspace-Based Learning
In this paper, we focus on subspace-based learning problems, where data elements are linear subspaces instead of vectors. To handle this kind of data, Grassmann kernels were proposed to measure the space structure and used with classifiers, e.g., Support Vector Machines (SVMs). However, the existing discriminative algo...
null
http://arxiv.org/abs/1802.03517v2
http://arxiv.org/pdf/1802.03517v2.pdf
null
[ "Junyuan Hong", "Huanhuan Chen", "Feng Lin" ]
[]
2018-02-10T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/entity-aware-language-model-as-an
1803.04291
null
null
Entity-Aware Language Model as an Unsupervised Reranker
In language modeling, it is difficult to incorporate entity relationships from a knowledge-base. One solution is to use a reranker trained with global features, in which global features are derived from n-best lists. However, training such a reranker requires manually annotated n-best lists, which is expensive to obtai...
null
http://arxiv.org/abs/1803.04291v2
http://arxiv.org/pdf/1803.04291v2.pdf
null
[ "Mohammad Sadegh Rasooli", "Sarangarajan Parthasarathy" ]
[ "Language Modeling", "Language Modelling" ]
2018-03-12T00:00:00
null
null
null
null
[ { "code_snippet_url": "https://github.com/pytorch/pytorch/blob/96aaa311c0251d24decb9dc5da4957b7c590af6f/torch/nn/modules/activation.py#L277", "description": "**Sigmoid Activations** are a type of activation function for neural networks:\r\n\r\n$$f\\left(x\\right) = \\frac{1}{\\left(1+\\exp\\left(-x\\right)\...
https://paperswithcode.com/paper/co-training-embeddings-of-knowledge-graphs
1806.06478
null
null
Co-training Embeddings of Knowledge Graphs and Entity Descriptions for Cross-lingual Entity Alignment
Multilingual knowledge graph (KG) embeddings provide latent semantic representations of entities and structured knowledge with cross-lingual inferences, which benefit various knowledge-driven cross-lingual NLP tasks. However, precisely learning such cross-lingual inferences is usually hindered by the low coverage of en...
null
http://arxiv.org/abs/1806.06478v1
http://arxiv.org/pdf/1806.06478v1.pdf
null
[ "Muhao Chen", "Yingtao Tian", "Kai-Wei Chang", "Steven Skiena", "Carlo Zaniolo" ]
[ "Entity Alignment", "Knowledge Graphs" ]
2018-06-18T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/video-salient-object-detection-using
1708.01447
null
null
Video Salient Object Detection Using Spatiotemporal Deep Features
This paper presents a method for detecting salient objects in videos where temporal information in addition to spatial information is fully taken into account. Following recent reports on the advantage of deep features over conventional hand-crafted features, we propose a new set of SpatioTemporal Deep (STD) features t...
null
http://arxiv.org/abs/1708.01447v3
http://arxiv.org/pdf/1708.01447v3.pdf
null
[ "Trung-Nghia Le", "Akihiro Sugimoto" ]
[ "Object", "object-detection", "Object Detection", "RGB Salient Object Detection", "Salient Object Detection", "Semantic Segmentation", "Video Object Segmentation", "Video Salient Object Detection", "Video Semantic Segmentation" ]
2017-08-04T00:00:00
null
null
null
null
[ { "code_snippet_url": null, "description": "**Conditional Random Fields** or **CRFs** are a type of probabilistic graph model that take neighboring sample context into account for tasks like classification. Prediction is modeled as a graphical model, which implements dependencies between the predictions. Gr...
https://paperswithcode.com/paper/reinforcement-learning-in-rich-observation
1611.03907
null
null
Reinforcement Learning in Rich-Observation MDPs using Spectral Methods
Reinforcement learning (RL) in Markov decision processes (MDPs) with large state spaces is a challenging problem. The performance of standard RL algorithms degrades drastically with the dimensionality of state space. However, in practice, these large MDPs typically incorporate a latent or hidden low-dimensional structu...
null
http://arxiv.org/abs/1611.03907v4
http://arxiv.org/pdf/1611.03907v4.pdf
null
[ "Kamyar Azizzadenesheli", "Alessandro Lazaric", "Animashree Anandkumar" ]
[ "reinforcement-learning", "Reinforcement Learning", "Reinforcement Learning (RL)" ]
2016-11-11T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/breaking-transferability-of-adversarial
1805.04613
null
null
Breaking Transferability of Adversarial Samples with Randomness
We investigate the role of transferability of adversarial attacks in the observed vulnerabilities of Deep Neural Networks (DNNs). We demonstrate that introducing randomness to the DNN models is sufficient to defeat adversarial attacks, given that the adversary does not have an unlimited attack budget. Instead of making...
null
http://arxiv.org/abs/1805.04613v2
http://arxiv.org/pdf/1805.04613v2.pdf
null
[ "Yan Zhou", "Murat Kantarcioglu", "Bowei Xi" ]
[]
2018-05-11T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/the-rbo-dataset-of-articulated-objects-and
1806.06465
null
null
The RBO Dataset of Articulated Objects and Interactions
We present a dataset with models of 14 articulated objects commonly found in human environments and with RGB-D video sequences and wrenches recorded of human interactions with them. The 358 interaction sequences total 67 minutes of human manipulation under varying experimental conditions (type of interaction, lighting,...
null
http://arxiv.org/abs/1806.06465v1
http://arxiv.org/pdf/1806.06465v1.pdf
null
[ "Roberto Martín-Martín", "Clemens Eppner", "Oliver Brock" ]
[]
2018-06-17T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/learning-policy-representations-in-multiagent
1806.06464
null
null
Learning Policy Representations in Multiagent Systems
Modeling agent behavior is central to understanding the emergence of complex phenomena in multiagent systems. Prior work in agent modeling has largely been task-specific and driven by hand-engineering domain-specific prior knowledge. We propose a general learning framework for modeling agent behavior in any multiagent ...
null
http://arxiv.org/abs/1806.06464v2
http://arxiv.org/pdf/1806.06464v2.pdf
ICML 2018 7
[ "Aditya Grover", "Maruan Al-Shedivat", "Jayesh K. Gupta", "Yura Burda", "Harrison Edwards" ]
[ "Clustering", "continuous-control", "Continuous Control", "Deep Reinforcement Learning", "Imitation Learning", "reinforcement-learning", "Reinforcement Learning", "Reinforcement Learning (RL)", "Representation Learning" ]
2018-06-17T00:00:00
https://icml.cc/Conferences/2018/Schedule?showEvent=2435
http://proceedings.mlr.press/v80/grover18a/grover18a.pdf
learning-policy-representations-in-multiagent-1
null
[]
https://paperswithcode.com/paper/sub-gaussian-estimators-of-the-mean-of-a-1
1605.07129
null
null
Sub-Gaussian estimators of the mean of a random matrix with heavy-tailed entries
Estimation of the covariance matrix has attracted a lot of attention of the statistical research community over the years, partially due to important applications such as Principal Component Analysis. However, frequently used empirical covariance estimator (and its modifications) is very sensitive to outliers in the da...
null
http://arxiv.org/abs/1605.07129v5
http://arxiv.org/pdf/1605.07129v5.pdf
null
[ "Stanislav Minsker" ]
[ "Matrix Completion" ]
2016-05-23T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/fast-convex-pruning-of-deep-neural-networks
1806.06457
null
null
Fast Convex Pruning of Deep Neural Networks
We develop a fast, tractable technique called Net-Trim for simplifying a trained neural network. The method is a convex post-processing module, which prunes (sparsifies) a trained network layer by layer, while preserving the internal responses. We present a comprehensive analysis of Net-Trim from both the algorithmic a...
We develop a fast, tractable technique called Net-Trim for simplifying a trained neural network.
http://arxiv.org/abs/1806.06457v2
http://arxiv.org/pdf/1806.06457v2.pdf
null
[ "Alireza Aghasi", "Afshin Abdi", "Justin Romberg" ]
[ "Network Pruning" ]
2018-06-17T00:00:00
null
null
null
null
[ { "code_snippet_url": null, "description": "", "full_name": "Pruning", "introduced_year": 2000, "main_collection": { "area": "General", "description": "", "name": "Model Compression", "parent": null }, "name": "Pruning", "source_title": "Pruning Filters for Ef...
https://paperswithcode.com/paper/cross-modality-image-synthesis-from-unpaired
1803.06629
null
null
Cross-modality image synthesis from unpaired data using CycleGAN: Effects of gradient consistency loss and training data size
CT is commonly used in orthopedic procedures. MRI is used along with CT to identify muscle structures and diagnose osteonecrosis due to its superior soft tissue contrast. However, MRI has poor contrast for bone structures. Clearly, it would be helpful if a corresponding CT were available, as bone boundaries are more cl...
null
http://arxiv.org/abs/1803.06629v3
http://arxiv.org/pdf/1803.06629v3.pdf
null
[ "Yuta Hiasa", "Yoshito Otake", "Masaki Takao", "Takumi Matsuoka", "Kazuma Takashima", "Jerry L. Prince", "Nobuhiko Sugano", "Yoshinobu Sato" ]
[ "Image Generation" ]
2018-03-18T00:00:00
null
null
null
null
[ { "code_snippet_url": "https://github.com/google/jax/blob/36f91261099b00194922bd93ed1286fe1c199724/jax/experimental/stax.py#L116", "description": "**Batch Normalization** aims to reduce internal covariate shift, and in doing so aims to accelerate the training of deep neural nets. It accomplishes this via a ...
https://paperswithcode.com/paper/self-attentive-neural-collaborative-filtering
1806.06446
null
null
Self-Attentive Neural Collaborative Filtering
This paper has been withdrawn as we discovered a bug in our tensorflow implementation that involved accidental mixing of vectors across batches. This lead to different inference results given different batch sizes which is completely strange. The performance scores still remain the same but we concluded that it was not...
null
http://arxiv.org/abs/1806.06446v2
http://arxiv.org/pdf/1806.06446v2.pdf
null
[ "Yi Tay", "Shuai Zhang", "Luu Anh Tuan", "Siu Cheung Hui" ]
[ "Collaborative Filtering" ]
2018-06-17T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/ncrf-an-open-source-neural-sequence-labeling
1806.05626
null
null
NCRF++: An Open-source Neural Sequence Labeling Toolkit
This paper describes NCRF++, a toolkit for neural sequence labeling. NCRF++ is designed for quick implementation of different neural sequence labeling models with a CRF inference layer. It provides users with an inference for building the custom model structure through configuration file with flexible neural feature de...
This paper describes NCRF++, a toolkit for neural sequence labeling.
http://arxiv.org/abs/1806.05626v2
http://arxiv.org/pdf/1806.05626v2.pdf
ACL 2018 7
[ "Jie Yang", "Yue Zhang" ]
[ "Chunking", "GPU", "Named Entity Recognition (NER)", "Part-Of-Speech Tagging" ]
2018-06-14T00:00:00
https://aclanthology.org/P18-4013
https://aclanthology.org/P18-4013.pdf
ncrf-an-open-source-neural-sequence-labeling-1
null
[ { "code_snippet_url": null, "description": "**Conditional Random Fields** or **CRFs** are a type of probabilistic graph model that take neighboring sample context into account for tasks like classification. Prediction is modeled as a graphical model, which implements dependencies between the predictions. Gr...
https://paperswithcode.com/paper/predicting-switching-graph-labelings-with
1806.06439
null
null
Online Prediction of Switching Graph Labelings with Cluster Specialists
We address the problem of predicting the labeling of a graph in an online setting when the labeling is changing over time. We present an algorithm based on a specialist approach; we develop the machinery of cluster specialists which probabilistically exploits the cluster structure in the graph. Our algorithm has two va...
We address the problem of predicting the labeling of a graph in an online setting when the labeling is changing over time.
https://arxiv.org/abs/1806.06439v3
https://arxiv.org/pdf/1806.06439v3.pdf
NeurIPS 2019 12
[ "Mark Herbster", "James Robinson" ]
[]
2018-06-17T00:00:00
http://papers.nips.cc/paper/8923-online-prediction-of-switching-graph-labelings-with-cluster-specialists
http://papers.nips.cc/paper/8923-online-prediction-of-switching-graph-labelings-with-cluster-specialists.pdf
online-prediction-of-switching-graph
null
[ { "code_snippet_url": "https://github.com/lorenzopapa5/SPEED", "description": "The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene understanding and visual odometry, which are key com...
https://paperswithcode.com/paper/compressed-sensing-with-deep-image-prior-and
1806.06438
null
Hkl_sAVtwr
Compressed Sensing with Deep Image Prior and Learned Regularization
We propose a novel method for compressed sensing recovery using untrained deep generative models. Our method is based on the recently proposed Deep Image Prior (DIP), wherein the convolutional weights of the network are optimized to match the observed measurements. We show that this approach can be applied to solve any...
We propose a novel method for compressed sensing recovery using untrained deep generative models.
https://arxiv.org/abs/1806.06438v4
https://arxiv.org/pdf/1806.06438v4.pdf
null
[ "Dave Van Veen", "Ajil Jalal", "Mahdi Soltanolkotabi", "Eric Price", "Sriram Vishwanath", "Alexandros G. Dimakis" ]
[ "compressed sensing" ]
2018-06-17T00:00:00
https://openreview.net/forum?id=Hkl_sAVtwr
https://openreview.net/pdf?id=Hkl_sAVtwr
null
null
[]
https://paperswithcode.com/paper/subspace-embedding-and-linear-regression-with
1806.06430
null
null
Subspace Embedding and Linear Regression with Orlicz Norm
We consider a generalization of the classic linear regression problem to the case when the loss is an Orlicz norm. An Orlicz norm is parameterized by a non-negative convex function $G:\mathbb{R}_+\rightarrow\mathbb{R}_+$ with $G(0)=0$: the Orlicz norm of a vector $x\in\mathbb{R}^n$ is defined as $ \|x\|_G=\inf\left\{\a...
null
http://arxiv.org/abs/1806.06430v1
http://arxiv.org/pdf/1806.06430v1.pdf
ICML 2018 7
[ "Alexandr Andoni", "Chengyu Lin", "Ying Sheng", "Peilin Zhong", "Ruiqi Zhong" ]
[ "regression" ]
2018-06-17T00:00:00
https://icml.cc/Conferences/2018/Schedule?showEvent=2451
http://proceedings.mlr.press/v80/andoni18a/andoni18a.pdf
subspace-embedding-and-linear-regression-with-1
null
[ { "code_snippet_url": null, "description": "**Linear Regression** is a method for modelling a relationship between a dependent variable and independent variables. These models can be fit with numerous approaches. The most common is *least squares*, where we minimize the mean square error between the predict...
https://paperswithcode.com/paper/scalable-methods-for-8-bit-training-of-neural
1805.11046
null
null
Scalable Methods for 8-bit Training of Neural Networks
Quantized Neural Networks (QNNs) are often used to improve network efficiency during the inference phase, i.e. after the network has been trained. Extensive research in the field suggests many different quantization schemes. Still, the number of bits required, as well as the best quantization scheme, are yet unknown. O...
Armed with this knowledge, we quantize the model parameters, activations and layer gradients to 8-bit, leaving at a higher precision only the final step in the computation of the weight gradients.
http://arxiv.org/abs/1805.11046v3
http://arxiv.org/pdf/1805.11046v3.pdf
NeurIPS 2018 12
[ "Ron Banner", "Itay Hubara", "Elad Hoffer", "Daniel Soudry" ]
[ "Quantization" ]
2018-05-25T00:00:00
http://papers.nips.cc/paper/7761-scalable-methods-for-8-bit-training-of-neural-networks
http://papers.nips.cc/paper/7761-scalable-methods-for-8-bit-training-of-neural-networks.pdf
scalable-methods-for-8-bit-training-of-neural-1
null
[]
https://paperswithcode.com/paper/a-novel-hybrid-machine-learning-model-for
1806.06423
null
null
A Novel Hybrid Machine Learning Model for Auto-Classification of Retinal Diseases
Automatic clinical diagnosis of retinal diseases has emerged as a promising approach to facilitate discovery in areas with limited access to specialists. We propose a novel visual-assisted diagnosis hybrid model based on the support vector machine (SVM) and deep neural networks (DNNs). The model incorporates complement...
Automatic clinical diagnosis of retinal diseases has emerged as a promising approach to facilitate discovery in areas with limited access to specialists.
http://arxiv.org/abs/1806.06423v1
http://arxiv.org/pdf/1806.06423v1.pdf
null
[ "C. -H. Huck Yang", "Jia-Hong Huang", "Fangyu Liu", "Fang-Yi Chiu", "Mengya Gao", "Weifeng Lyu", "I-Hung Lin M. D.", "Jesper Tegner" ]
[ "BIG-bench Machine Learning", "General Classification", "Hybrid Machine Learning" ]
2018-06-17T00:00:00
null
null
null
null
[ { "code_snippet_url": "", "description": "A **Support Vector Machine**, or **SVM**, is a non-parametric supervised learning model. For non-linear classification and regression, they utilise the kernel trick to map inputs to high-dimensional feature spaces. SVMs construct a hyper-plane or set of hyper-planes...
https://paperswithcode.com/paper/learning-to-evaluate-image-captioning
1806.06422
null
null
Learning to Evaluate Image Captioning
Evaluation metrics for image captioning face two challenges. Firstly, commonly used metrics such as CIDEr, METEOR, ROUGE and BLEU often do not correlate well with human judgments. Secondly, each metric has well known blind spots to pathological caption constructions, and rule-based metrics lack provisions to repair suc...
To address these two challenges, we propose a novel learning based discriminative evaluation metric that is directly trained to distinguish between human and machine-generated captions.
http://arxiv.org/abs/1806.06422v1
http://arxiv.org/pdf/1806.06422v1.pdf
CVPR 2018 6
[ "Yin Cui", "Guandao Yang", "Andreas Veit", "Xun Huang", "Serge Belongie" ]
[ "8k", "Data Augmentation", "Image Captioning", "Sentence" ]
2018-06-17T00:00:00
http://openaccess.thecvf.com/content_cvpr_2018/html/Cui_Learning_to_Evaluate_CVPR_2018_paper.html
http://openaccess.thecvf.com/content_cvpr_2018/papers/Cui_Learning_to_Evaluate_CVPR_2018_paper.pdf
learning-to-evaluate-image-captioning-1
null
[]
https://paperswithcode.com/paper/high-speed-tracking-with-multi-kernel
1806.06418
null
null
High-speed Tracking with Multi-kernel Correlation Filters
Correlation filter (CF) based trackers are currently ranked top in terms of their performances. Nevertheless, only some of them, such as KCF~\cite{henriques15} and MKCF~\cite{tangm15}, are able to exploit the powerful discriminability of non-linear kernels. Although MKCF achieves more powerful discriminability than KCF...
In this paper, we will introduce the MKL into KCF in a different way than MKCF.
http://arxiv.org/abs/1806.06418v1
http://arxiv.org/pdf/1806.06418v1.pdf
CVPR 2018 6
[ "Ming Tang", "Bin Yu", "Fan Zhang", "Jinqiao Wang" ]
[ "Video Object Tracking", "Vocal Bursts Intensity Prediction" ]
2018-06-17T00:00:00
http://openaccess.thecvf.com/content_cvpr_2018/html/Tang_High-Speed_Tracking_With_CVPR_2018_paper.html
http://openaccess.thecvf.com/content_cvpr_2018/papers/Tang_High-Speed_Tracking_With_CVPR_2018_paper.pdf
high-speed-tracking-with-multi-kernel-1
null
[]
https://paperswithcode.com/paper/feature-learning-and-classification-in
1806.06415
null
null
Feature Learning and Classification in Neuroimaging: Predicting Cognitive Impairment from Magnetic Resonance Imaging
Due to the rapid innovation of technology and the desire to find and employ biomarkers for neurodegenerative disease, high-dimensional data classification problems are routinely encountered in neuroimaging studies. To avoid over-fitting and to explore relationships between disease and potential biomarkers, feature lear...
null
http://arxiv.org/abs/1806.06415v1
http://arxiv.org/pdf/1806.06415v1.pdf
null
[ "Shan Shi", "Farouk Nathoo" ]
[ "BIG-bench Machine Learning", "General Classification" ]
2018-06-17T00:00:00
null
null
null
null
[ { "code_snippet_url": null, "description": "**Principle Components Analysis (PCA)** is an unsupervised method primary used for dimensionality reduction within machine learning. PCA is calculated via a singular value decomposition (SVD) of the design matrix, or alternatively, by calculating the covariance m...
https://paperswithcode.com/paper/one-to-one-mapping-between-stimulus-and
1805.09001
null
null
One-to-one Mapping between Stimulus and Neural State: Memory and Classification
Synaptic strength can be seen as probability to propagate impulse, and according to synaptic plasticity, function could exist from propagation activity to synaptic strength. If the function satisfies constraints such as continuity and monotonicity, neural network under external stimulus will always go to fixed point, a...
Synaptic strength can be seen as probability to propagate impulse, and according to synaptic plasticity, function could exist from propagation activity to synaptic strength.
http://arxiv.org/abs/1805.09001v6
http://arxiv.org/pdf/1805.09001v6.pdf
null
[ "Sizhong Lan" ]
[ "General Classification" ]
2018-05-23T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/negative-learning-rates-and-p-learning
1603.08253
null
null
Negative Learning Rates and P-Learning
We present a method of training a differentiable function approximator for a regression task using negative examples. We effect this training using negative learning rates. We also show how this method can be used to perform direct policy learning in a reinforcement learning setting.
null
http://arxiv.org/abs/1603.08253v3
http://arxiv.org/pdf/1603.08253v3.pdf
null
[ "Devon Merrill" ]
[ "regression", "reinforcement-learning", "Reinforcement Learning", "Reinforcement Learning (RL)" ]
2016-03-27T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/measuring-semantic-coherence-of-a
1806.06411
null
null
Measuring Semantic Coherence of a Conversation
Conversational systems have become increasingly popular as a way for humans to interact with computers. To be able to provide intelligent responses, conversational systems must correctly model the structure and semantics of a conversation. We introduce the task of measuring semantic (in)coherence in a conversation with...
Conversational systems have become increasingly popular as a way for humans to interact with computers.
http://arxiv.org/abs/1806.06411v1
http://arxiv.org/pdf/1806.06411v1.pdf
null
[ "Svitlana Vakulenko", "Maarten de Rijke", "Michael Cochez", "Vadim Savenkov", "Axel Polleres" ]
[ "Knowledge Graphs" ]
2018-06-17T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/learning-a-prior-over-intent-via-meta-inverse
1805.12573
null
null
Learning a Prior over Intent via Meta-Inverse Reinforcement Learning
A significant challenge for the practical application of reinforcement learning in the real world is the need to specify an oracle reward function that correctly defines a task. Inverse reinforcement learning (IRL) seeks to avoid this challenge by instead inferring a reward function from expert behavior. While appealin...
null
https://arxiv.org/abs/1805.12573v5
https://arxiv.org/pdf/1805.12573v5.pdf
null
[ "Kelvin Xu", "Ellis Ratner", "Anca Dragan", "Sergey Levine", "Chelsea Finn" ]
[ "reinforcement-learning", "Reinforcement Learning", "Reinforcement Learning (RL)" ]
2018-05-31T00:00:00
null
null
null
null
[]
https://paperswithcode.com/paper/gated-path-planning-networks
1806.06408
null
null
Gated Path Planning Networks
Value Iteration Networks (VINs) are effective differentiable path planning modules that can be used by agents to perform navigation while still maintaining end-to-end differentiability of the entire architecture. Despite their effectiveness, they suffer from several disadvantages including training instability, random ...
Value Iteration Networks (VINs) are effective differentiable path planning modules that can be used by agents to perform navigation while still maintaining end-to-end differentiability of the entire architecture.
http://arxiv.org/abs/1806.06408v1
http://arxiv.org/pdf/1806.06408v1.pdf
ICML 2018 7
[ "Lisa Lee", "Emilio Parisotto", "Devendra Singh Chaplot", "Eric Xing", "Ruslan Salakhutdinov" ]
[ "Sensitivity" ]
2018-06-17T00:00:00
https://icml.cc/Conferences/2018/Schedule?showEvent=2488
http://proceedings.mlr.press/v80/lee18c/lee18c.pdf
gated-path-planning-networks-1
null
[]
https://paperswithcode.com/paper/an-improved-text-sentiment-classification
1806.06407
null
null
An Improved Text Sentiment Classification Model Using TF-IDF and Next Word Negation
With the rapid growth of Text sentiment analysis, the demand for automatic classification of electronic documents has increased by leaps and bound. The paradigm of text classification or text mining has been the subject of many research works in recent time. In this paper we propose a technique for text sentiment class...
null
http://arxiv.org/abs/1806.06407v1
http://arxiv.org/pdf/1806.06407v1.pdf
null
[ "Bijoyan Das", "Sarit Chakraborty" ]
[ "Classification", "General Classification", "Negation", "Sentiment Analysis", "Sentiment Classification", "text-classification", "Text Classification" ]
2018-06-17T00:00:00
null
null
null
null
[]