Dataset Viewer
Auto-converted to Parquet Duplicate
title
string
paper_url
string
authors
list
type
string
primary_area
string
abstract
large_string
keywords
list
TL;DR
large_string
submission_number
int64
arxiv_id
string
arxiv_id_source
string
embedding
list
Eliciting Categorical Data for Optimal Aggregation
https://proceedings.neurips.cc/paper_files/paper/2016/hash/018b59ce1fd616d874afad0f44ba338d-Abstract.html
[ "Chien-Ju Ho", "Rafael Frongillo", "Yiling Chen" ]
null
null
Models for collecting and aggregating categorical data on crowdsourcing platforms typically fall into two broad categories: those assuming agents honest and consistent but with heterogeneous error rates, and those assuming agents strategic and seek to maximize their expected reward. The former often leads to tractable ...
[]
null
1
null
null
[ 0.003288737963885069, -0.01521654985845089, -0.003941972274333239, 0.044006653130054474, 0.011570478789508343, 0.01822206750512123, -0.0008407520945183933, -0.014818175695836544, -0.041590478271245956, -0.034401729702949524, -0.03068331629037857, 0.0025966931134462357, -0.07644540816545486, ...
A Locally Adaptive Normal Distribution
https://proceedings.neurips.cc/paper_files/paper/2016/hash/01931a6925d3de09e5f87419d9d55055-Abstract.html
[ "Georgios Arvanitidis", "Lars K. Hansen", "Søren Hauberg" ]
null
null
The multivariate normal density is a monotonic function of the distance to the mean, and its ellipsoidal shape is due to the underlying Euclidean metric. We suggest to replace this metric with a locally adaptive, smoothly changing (Riemannian) metric that favors regions of high local density. The resulting locally adap...
[]
null
2
1606.02518
title_snapshot
[ -0.03411359712481499, 0.007619321811944246, 0.016668997704982758, 0.0035947312135249376, 0.045217365026474, 0.0474088191986084, 0.04828452691435814, -0.002985619241371751, -0.02884666435420513, -0.07561472058296204, -0.020739644765853882, 0.007919855415821075, -0.07498017698526382, -0.0034...
Tagger: Deep Unsupervised Perceptual Grouping
https://proceedings.neurips.cc/paper_files/paper/2016/hash/01eee509ee2f68dc6014898c309e86bf-Abstract.html
[ "Klaus Greff", "Antti Rasmus", "Mathias Berglund", "Tele Hao", "Harri Valpola", "Jürgen Schmidhuber" ]
null
null
We present a framework for efficient perceptual inference that explicitly reasons about the segmentation of its inputs and features. Rather than being trained for any specific segmentation, our framework learns the grouping process in an unsupervised manner or alongside any supervised task. We enable a neural network t...
[]
null
3
1606.06724
title_snapshot
[ 0.010465380735695362, -0.020489705726504326, 0.02902865782380104, 0.0241817906498909, 0.010716806165874004, 0.00019936291209887713, -0.0019184593111276627, 0.014218431897461414, -0.04382101073861122, -0.04550490155816078, -0.0415135882794857, 0.004485852550715208, -0.06000813469290733, -0....
Online Bayesian Moment Matching for Topic Modeling with Unknown Number of Topics
https://proceedings.neurips.cc/paper_files/paper/2016/hash/0233f3bb964cf325a30f8b1c2ed2da93-Abstract.html
[ "Wei-Shou Hsu", "Pascal Poupart" ]
null
null
Latent Dirichlet Allocation (LDA) is a very popular model for topic modeling as well as many other problems with latent groups. It is both simple and effective. When the number of topics (or latent groups) is unknown, the Hierarchical Dirichlet Process (HDP) provides an elegant non-parametric extension; however, it is ...
[]
null
4
null
null
[ 0.007662163116037846, 0.0030148637015372515, -0.0026367458049207926, 0.05608312785625458, 0.014489691704511642, 0.02640700712800026, -0.0023617236874997616, 0.00601980509236455, 0.011193731799721718, -0.018172306939959526, -0.03335801884531975, -0.008816789835691452, -0.05882538482546806, ...
Conditional Generative Moment-Matching Networks
https://proceedings.neurips.cc/paper_files/paper/2016/hash/0245952ecff55018e2a459517fdb40e3-Abstract.html
[ "Yong Ren", "Jun Zhu", "Jialian Li", "Yucen Luo" ]
null
null
Maximum mean discrepancy (MMD) has been successfully applied to learn deep generative models for characterizing a joint distribution of variables via kernel mean embedding. In this paper, we present conditional generative moment-matching networks (CGMMN), which learn a conditional distribution given some input variable...
[]
null
5
1606.04218
title_snapshot
[ -0.015050863847136497, 0.005397442728281021, -0.009222413413226604, 0.07338492572307587, 0.04592115804553032, 0.03285854682326317, 0.016249939799308777, -0.009357515722513199, -0.019006624817848206, -0.04323669523000717, 0.00007004566577961668, -0.0021152158733457327, -0.05403487756848335, ...
Collaborative Recurrent Autoencoder: Recommend while Learning to Fill in the Blanks
https://proceedings.neurips.cc/paper_files/paper/2016/hash/0266e33d3f546cb5436a10798e657d97-Abstract.html
[ "Hao Wang", "Xingjian SHI", "Dit-Yan Yeung" ]
null
null
Hybrid methods that utilize both content and rating information are commonly used in many recommender systems. However, most of them use either handcrafted features or the bag-of-words representation as a surrogate for the content information but they are neither effective nor natural enough. To address this problem, w...
[]
null
6
1611.00454
title_snapshot
[ 0.045688923448324203, -0.018198462203145027, -0.00041246722685173154, 0.05161470174789429, 0.036476120352745056, 0.02336171828210354, 0.047570399940013885, 0.009278109297156334, 0.001819167984649539, -0.034456368535757065, -0.04017474129796028, 0.019777098670601845, -0.04239826276898384, 0...
Bayesian Intermittent Demand Forecasting for Large Inventories
https://proceedings.neurips.cc/paper_files/paper/2016/hash/03255088ed63354a54e0e5ed957e9008-Abstract.html
[ "Matthias W Seeger", "David Salinas", "Valentin Flunkert" ]
null
null
We present a scalable and robust Bayesian method for demand forecasting in the context of a large e-commerce platform, paying special attention to intermittent and bursty target statistics. Inference is approximated by the Newton-Raphson algorithm, reduced to linear-time Kalman smoothing, which allows us to operate on ...
[]
null
7
1709.07638
title_judge
[ -0.01689819246530533, -0.012583442963659763, 0.0021624285727739334, 0.01831081323325634, 0.05138162896037102, 0.03914111107587814, 0.03207836300134659, 0.0245780348777771, -0.03240017592906952, -0.01405309233814478, -0.04553045332431793, 0.013962462544441223, -0.0520516075193882, -0.007460...
Visual Dynamics: Probabilistic Future Frame Synthesis via Cross Convolutional Networks
https://proceedings.neurips.cc/paper_files/paper/2016/hash/03afdbd66e7929b125f8597834fa83a4-Abstract.html
[ "Tianfan Xue", "Jiajun Wu", "Katherine Bouman", "Bill Freeman" ]
null
null
We study the problem of synthesizing a number of likely future frames from a single input image. In contrast to traditional methods, which have tackled this problem in a deterministic or non-parametric way, we propose a novel approach which models future frames in a probabilistic manner. Our proposed method is therefor...
[]
null
8
1607.02586
title_snapshot
[ 0.031800277531147, -0.009905679151415825, 0.018320390954613686, 0.047398295253515244, 0.03335774689912796, 0.033284757286310196, 0.004036032594740391, 0.04062424600124359, -0.041464656591415405, -0.06473749130964279, -0.014712712727487087, -0.028972074389457703, -0.03652786463499069, -0.00...
Achieving budget-optimality with adaptive schemes in crowdsourcing
https://proceedings.neurips.cc/paper_files/paper/2016/hash/03e7ef47cee6fa4ae7567394b99912b7-Abstract.html
[ "Ashish Khetan", "Sewoong Oh" ]
null
null
Adaptive schemes, where tasks are assigned based on the data collected thus far, are widely used in practical crowdsourcing systems to efficiently allocate the budget. However, existing theoretical analyses of crowdsourcing systems suggest that the gain of adaptive task assignments is minimal. To bridge this gap, we in...
[]
null
9
1602.03481
title_snapshot
[ 0.0023137927055358887, -0.025822265073657036, -0.007846111431717873, 0.025280125439167023, 0.04060627892613411, 0.022748827934265137, 0.007551164366304874, 0.009774885140359402, -0.0383157953619957, -0.06220942363142967, -0.02031155675649643, 0.003811658825725317, -0.06666874885559082, -0....
Stochastic Gradient Richardson-Romberg Markov Chain Monte Carlo
https://proceedings.neurips.cc/paper_files/paper/2016/hash/03f544613917945245041ea1581df0c2-Abstract.html
[ "Alain Durmus", "Umut Simsekli", "Eric Moulines", "Roland Badeau", "Gaël RICHARD" ]
null
null
Stochastic Gradient Markov Chain Monte Carlo (SG-MCMC) algorithms have become increasingly popular for Bayesian inference in large-scale applications. Even though these methods have proved useful in several scenarios, their performance is often limited by their bias. In this study, we propose a novel sampling algorithm...
[]
null
10
null
null
[ -0.020083656534552574, 0.008281040005385876, 0.009694975800812244, 0.05083094909787178, 0.05120057612657547, 0.007286817766726017, 0.046332091093063354, 0.025738542899489403, -0.04544604569673538, -0.03652345389127731, 0.032546304166316986, -0.004401782993227243, -0.051532041281461716, -0....
Generating Videos with Scene Dynamics
https://proceedings.neurips.cc/paper_files/paper/2016/hash/04025959b191f8f9de3f924f0940515f-Abstract.html
[ "Carl Vondrick", "Hamed Pirsiavash", "Antonio Torralba" ]
null
null
We capitalize on large amounts of unlabeled video in order to learn a model of scene dynamics for both video recognition tasks (e.g. action classification) and video generation tasks (e.g. future prediction). We propose a generative adversarial network for video with a spatio-temporal convolutional architecture that un...
[]
null
11
1609.02612
title_snapshot
[ 0.023932132869958878, -0.02055242657661438, -0.0037268754094839096, 0.06544975191354752, 0.02142447978258133, 0.010679512284696102, 0.01717306673526764, 0.026302477344870567, -0.048944707959890366, -0.038837578147649765, -0.013423634693026543, -0.013038466684520245, -0.06117352098226547, 0...
End of preview. Expand in Data Studio
README.md exists but content is empty.
Downloads last month
28

Collection including ai-conferences/NeurIPS2016